fs/btrfs/volumes.c

   1 /*
   2  * Copyright (C) 2007 Oracle.  All rights reserved.
   3  *
   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.
   7  *
   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.
  12  *
  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.
  17  */
  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 <asm/div64.h>
  27 #include "compat.h"
  28 #include "ctree.h"
  29 #include "extent_map.h"
  30 #include "disk-io.h"
  31 #include "transaction.h"
  32 #include "print-tree.h"
  33 #include "volumes.h"
  34 #include "async-thread.h"
  35
  36 static int init_first_rw_device(struct btrfs_trans_handle *trans,
  37                                 struct btrfs_root *root,
  38                                 struct btrfs_device *device);
  39 static int btrfs_relocate_sys_chunks(struct btrfs_root *root);
  40
  41 static DEFINE_MUTEX(uuid_mutex);
  42 static LIST_HEAD(fs_uuids);
  43
  44 static void lock_chunks(struct btrfs_root *root)
  45 {
  46         mutex_lock(&root->fs_info->chunk_mutex);
  47 }
  48
  49 static void unlock_chunks(struct btrfs_root *root)
  50 {
  51         mutex_unlock(&root->fs_info->chunk_mutex);
  52 }
  53
  54 static void free_fs_devices(struct btrfs_fs_devices *fs_devices)
  55 {
  56         struct btrfs_device *device;
  57         WARN_ON(fs_devices->opened);
  58         while (!list_empty(&fs_devices->devices)) {
  59                 device = list_entry(fs_devices->devices.next,
  60                                     struct btrfs_device, dev_list);
  61                 list_del(&device->dev_list);
  62                 kfree(device->name);
  63                 kfree(device);
  64         }
  65         kfree(fs_devices);
  66 }
  67
  68 int btrfs_cleanup_fs_uuids(void)
  69 {
  70         struct btrfs_fs_devices *fs_devices;
  71
  72         while (!list_empty(&fs_uuids)) {
  73                 fs_devices = list_entry(fs_uuids.next,
  74                                         struct btrfs_fs_devices, list);
  75                 list_del(&fs_devices->list);
  76                 free_fs_devices(fs_devices);
  77         }
  78         return 0;
  79 }
  80
  81 static noinline struct btrfs_device *__find_device(struct list_head *head,
  82                                                    u64 devid, u8 *uuid)
  83 {
  84         struct btrfs_device *dev;
  85
  86         list_for_each_entry(dev, head, dev_list) {
  87                 if (dev->devid == devid &&
  88                     (!uuid || !memcmp(dev->uuid, uuid, BTRFS_UUID_SIZE))) {
  89                         return dev;
  90                 }
  91         }
  92         return NULL;
  93 }
  94
  95 static noinline struct btrfs_fs_devices *find_fsid(u8 *fsid)
  96 {
  97         struct btrfs_fs_devices *fs_devices;
  98
  99         list_for_each_entry(fs_devices, &fs_uuids, list) {
 100                 if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0)
 101                         return fs_devices;
 102         }
 103         return NULL;
 104 }
 105
 106 static void requeue_list(struct btrfs_pending_bios *pending_bios,
 107                         struct bio *head, struct bio *tail)
 108 {
 109
 110         struct bio *old_head;
 111
 112         old_head = pending_bios->head;
 113         pending_bios->head = head;
 114         if (pending_bios->tail)
 115                 tail->bi_next = old_head;
 116         else
 117                 pending_bios->tail = tail;
 118 }
 119
 120 /*
 121  * we try to collect pending bios for a device so we don't get a large
 122  * number of procs sending bios down to the same device.  This greatly
 123  * improves the schedulers ability to collect and merge the bios.
 124  *
 125  * But, it also turns into a long list of bios to process and that is sure
 126  * to eventually make the worker thread block.  The solution here is to
 127  * make some progress and then put this work struct back at the end of
 128  * the list if the block device is congested.  This way, multiple devices
 129  * can make progress from a single worker thread.
 130  */
 131 static noinline int run_scheduled_bios(struct btrfs_device *device)
 132 {
 133         struct bio *pending;
 134         struct backing_dev_info *bdi;
 135         struct btrfs_fs_info *fs_info;
 136         struct btrfs_pending_bios *pending_bios;
 137         struct bio *tail;
 138         struct bio *cur;
 139         int again = 0;
 140         unsigned long num_run;
 141         unsigned long batch_run = 0;
 142         unsigned long limit;
 143         unsigned long last_waited = 0;
 144         int force_reg = 0;
 145         int sync_pending = 0;
 146         struct blk_plug plug;
 147
 148         /*
 149          * this function runs all the bios we've collected for
 150          * a particular device.  We don't want to wander off to
 151          * another device without first sending all of these down.
 152          * So, setup a plug here and finish it off before we return
 153          */
 154         blk_start_plug(&plug);
 155
 156         bdi = blk_get_backing_dev_info(device->bdev);
 157         fs_info = device->dev_root->fs_info;
 158         limit = btrfs_async_submit_limit(fs_info);
 159         limit = limit * 2 / 3;
 160
 161 loop:
 162         spin_lock(&device->io_lock);
 163
 164 loop_lock:
 165         num_run = 0;
 166
 167         /* take all the bios off the list at once and process them
 168          * later on (without the lock held).  But, remember the
 169          * tail and other pointers so the bios can be properly reinserted
 170          * into the list if we hit congestion
 171          */
 172         if (!force_reg && device->pending_sync_bios.head) {
 173                 pending_bios = &device->pending_sync_bios;
 174                 force_reg = 1;
 175         } else {
 176                 pending_bios = &device->pending_bios;
 177                 force_reg = 0;
 178         }
 179
 180         pending = pending_bios->head;
 181         tail = pending_bios->tail;
 182         WARN_ON(pending && !tail);
 183
 184         /*
 185          * if pending was null this time around, no bios need processing
 186          * at all and we can stop.  Otherwise it'll loop back up again
 187          * and do an additional check so no bios are missed.
 188          *
 189          * device->running_pending is used to synchronize with the
 190          * schedule_bio code.
 191          */
 192         if (device->pending_sync_bios.head == NULL &&
 193             device->pending_bios.head == NULL) {
 194                 again = 0;
 195                 device->running_pending = 0;
 196         } else {
 197                 again = 1;
 198                 device->running_pending = 1;
 199         }
 200
 201         pending_bios->head = NULL;
 202         pending_bios->tail = NULL;
 203
 204         spin_unlock(&device->io_lock);
 205
 206         while (pending) {
 207
 208                 rmb();
 209                 /* we want to work on both lists, but do more bios on the
 210                  * sync list than the regular list
 211                  */
 212                 if ((num_run > 32 &&
 213                     pending_bios != &device->pending_sync_bios &&
 214                     device->pending_sync_bios.head) ||
 215                    (num_run > 64 && pending_bios == &device->pending_sync_bios &&
 216                     device->pending_bios.head)) {
 217                         spin_lock(&device->io_lock);
 218                         requeue_list(pending_bios, pending, tail);
 219                         goto loop_lock;
 220                 }
 221
 222                 cur = pending;
 223                 pending = pending->bi_next;
 224                 cur->bi_next = NULL;
 225                 atomic_dec(&fs_info->nr_async_bios);
 226
 227                 if (atomic_read(&fs_info->nr_async_bios) < limit &&
 228                     waitqueue_active(&fs_info->async_submit_wait))
 229                         wake_up(&fs_info->async_submit_wait);
 230
 231                 BUG_ON(atomic_read(&cur->bi_cnt) == 0);
 232
 233                 /*
 234                  * if we're doing the sync list, record that our
 235                  * plug has some sync requests on it
 236                  *
 237                  * If we're doing the regular list and there are
 238                  * sync requests sitting around, unplug before
 239                  * we add more
 240                  */
 241                 if (pending_bios == &device->pending_sync_bios) {
 242                         sync_pending = 1;
 243                 } else if (sync_pending) {
 244                         blk_finish_plug(&plug);
 245                         blk_start_plug(&plug);
 246                         sync_pending = 0;
 247                 }
 248
 249                 submit_bio(cur->bi_rw, cur);
 250                 num_run++;
 251                 batch_run++;
 252                 if (need_resched())
 253                         cond_resched();
 254
 255                 /*
 256                  * we made progress, there is more work to do and the bdi
 257                  * is now congested.  Back off and let other work structs
 258                  * run instead
 259                  */
 260                 if (pending && bdi_write_congested(bdi) && batch_run > 8 &&
 261                     fs_info->fs_devices->open_devices > 1) {
 262                         struct io_context *ioc;
 263
 264                         ioc = current->io_context;
 265
 266                         /*
 267                          * the main goal here is that we don't want to
 268                          * block if we're going to be able to submit
 269                          * more requests without blocking.
 270                          *
 271                          * This code does two great things, it pokes into
 272                          * the elevator code from a filesystem _and_
 273                          * it makes assumptions about how batching works.
 274                          */
 275                         if (ioc && ioc->nr_batch_requests > 0 &&
 276                             time_before(jiffies, ioc->last_waited + HZ/50UL) &&
 277                             (last_waited == 0 ||
 278                              ioc->last_waited == last_waited)) {
 279                                 /*
 280                                  * we want to go through our batch of
 281                                  * requests and stop.  So, we copy out
 282                                  * the ioc->last_waited time and test
 283                                  * against it before looping
 284                                  */
 285                                 last_waited = ioc->last_waited;
 286                                 if (need_resched())
 287                                         cond_resched();
 288                                 continue;
 289                         }
 290                         spin_lock(&device->io_lock);
 291                         requeue_list(pending_bios, pending, tail);
 292                         device->running_pending = 1;
 293
 294                         spin_unlock(&device->io_lock);
 295                         btrfs_requeue_work(&device->work);
 296                         goto done;
 297                 }
 298                 /* unplug every 64 requests just for good measure */
 299                 if (batch_run % 64 == 0) {
 300                         blk_finish_plug(&plug);
 301                         blk_start_plug(&plug);
 302                         sync_pending = 0;
 303                 }
 304         }
 305
 306         cond_resched();
 307         if (again)
 308                 goto loop;
 309
 310         spin_lock(&device->io_lock);
 311         if (device->pending_bios.head || device->pending_sync_bios.head)
 312                 goto loop_lock;
 313         spin_unlock(&device->io_lock);
 314
 315 done:
 316         blk_finish_plug(&plug);
 317         return 0;
 318 }
 319
 320 static void pending_bios_fn(struct btrfs_work *work)
 321 {
 322         struct btrfs_device *device;
 323
 324         device = container_of(work, struct btrfs_device, work);
 325         run_scheduled_bios(device);
 326 }
 327
 328 static noinline int device_list_add(const char *path,
 329                            struct btrfs_super_block *disk_super,
 330                            u64 devid, struct btrfs_fs_devices **fs_devices_ret)
 331 {
 332         struct btrfs_device *device;
 333         struct btrfs_fs_devices *fs_devices;
 334         u64 found_transid = btrfs_super_generation(disk_super);
 335         char *name;
 336
 337         fs_devices = find_fsid(disk_super->fsid);
 338         if (!fs_devices) {
 339                 fs_devices = kzalloc(sizeof(*fs_devices), GFP_NOFS);
 340                 if (!fs_devices)
 341                         return -ENOMEM;
 342                 INIT_LIST_HEAD(&fs_devices->devices);
 343                 INIT_LIST_HEAD(&fs_devices->alloc_list);
 344                 list_add(&fs_devices->list, &fs_uuids);
 345                 memcpy(fs_devices->fsid, disk_super->fsid, BTRFS_FSID_SIZE);
 346                 fs_devices->latest_devid = devid;
 347                 fs_devices->latest_trans = found_transid;
 348                 mutex_init(&fs_devices->device_list_mutex);
 349                 device = NULL;
 350         } else {
 351                 device = __find_device(&fs_devices->devices, devid,
 352                                        disk_super->dev_item.uuid);
 353         }
 354         if (!device) {
 355                 if (fs_devices->opened)
 356                         return -EBUSY;
 357
 358                 device = kzalloc(sizeof(*device), GFP_NOFS);
 359                 if (!device) {
 360                         /* we can safely leave the fs_devices entry around */
 361                         return -ENOMEM;
 362                 }
 363                 device->devid = devid;
 364                 device->work.func = pending_bios_fn;
 365                 memcpy(device->uuid, disk_super->dev_item.uuid,
 366                        BTRFS_UUID_SIZE);
 367                 spin_lock_init(&device->io_lock);
 368                 device->name = kstrdup(path, GFP_NOFS);
 369                 if (!device->name) {
 370                         kfree(device);
 371                         return -ENOMEM;
 372                 }
 373                 INIT_LIST_HEAD(&device->dev_alloc_list);
 374
 375                 /* init readahead state */
 376                 spin_lock_init(&device->reada_lock);
 377                 device->reada_curr_zone = NULL;
 378                 atomic_set(&device->reada_in_flight, 0);
 379                 device->reada_next = 0;
 380                 INIT_RADIX_TREE(&device->reada_zones, GFP_NOFS & ~__GFP_WAIT);
 381                 INIT_RADIX_TREE(&device->reada_extents, GFP_NOFS & ~__GFP_WAIT);
 382
 383                 mutex_lock(&fs_devices->device_list_mutex);
 384                 list_add_rcu(&device->dev_list, &fs_devices->devices);
 385                 mutex_unlock(&fs_devices->device_list_mutex);
 386
 387                 device->fs_devices = fs_devices;
 388                 fs_devices->num_devices++;
 389         } else if (!device->name || strcmp(device->name, path)) {
 390                 name = kstrdup(path, GFP_NOFS);
 391                 if (!name)
 392                         return -ENOMEM;
 393                 kfree(device->name);
 394                 device->name = name;
 395                 if (device->missing) {
 396                         fs_devices->missing_devices--;
 397                         device->missing = 0;
 398                 }
 399         }
 400
 401         if (found_transid > fs_devices->latest_trans) {
 402                 fs_devices->latest_devid = devid;
 403                 fs_devices->latest_trans = found_transid;
 404         }
 405         *fs_devices_ret = fs_devices;
 406         return 0;
 407 }
 408
 409 static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig)
 410 {
 411         struct btrfs_fs_devices *fs_devices;
 412         struct btrfs_device *device;
 413         struct btrfs_device *orig_dev;
 414
 415         fs_devices = kzalloc(sizeof(*fs_devices), GFP_NOFS);
 416         if (!fs_devices)
 417                 return ERR_PTR(-ENOMEM);
 418
 419         INIT_LIST_HEAD(&fs_devices->devices);
 420         INIT_LIST_HEAD(&fs_devices->alloc_list);
 421         INIT_LIST_HEAD(&fs_devices->list);
 422         mutex_init(&fs_devices->device_list_mutex);
 423         fs_devices->latest_devid = orig->latest_devid;
 424         fs_devices->latest_trans = orig->latest_trans;
 425         memcpy(fs_devices->fsid, orig->fsid, sizeof(fs_devices->fsid));
 426
 427         /* We have held the volume lock, it is safe to get the devices. */
 428         list_for_each_entry(orig_dev, &orig->devices, dev_list) {
 429                 device = kzalloc(sizeof(*device), GFP_NOFS);
 430                 if (!device)
 431                         goto error;
 432
 433                 device->name = kstrdup(orig_dev->name, GFP_NOFS);
 434                 if (!device->name) {
 435                         kfree(device);
 436                         goto error;
 437                 }
 438
 439                 device->devid = orig_dev->devid;
 440                 device->work.func = pending_bios_fn;
 441                 memcpy(device->uuid, orig_dev->uuid, sizeof(device->uuid));
 442                 spin_lock_init(&device->io_lock);
 443                 INIT_LIST_HEAD(&device->dev_list);
 444                 INIT_LIST_HEAD(&device->dev_alloc_list);
 445
 446                 list_add(&device->dev_list, &fs_devices->devices);
 447                 device->fs_devices = fs_devices;
 448                 fs_devices->num_devices++;
 449         }
 450         return fs_devices;
 451 error:
 452         free_fs_devices(fs_devices);
 453         return ERR_PTR(-ENOMEM);
 454 }
 455
 456 int btrfs_close_extra_devices(struct btrfs_fs_devices *fs_devices)
 457 {
 458         struct btrfs_device *device, *next;
 459
 460         mutex_lock(&uuid_mutex);
 461 again:
 462         /* This is the initialized path, it is safe to release the devices. */
 463         list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) {
 464                 if (device->in_fs_metadata)
 465                         continue;
 466
 467                 if (device->bdev) {
 468                         blkdev_put(device->bdev, device->mode);
 469                         device->bdev = NULL;
 470                         fs_devices->open_devices--;
 471                 }
 472                 if (device->writeable) {
 473                         list_del_init(&device->dev_alloc_list);
 474                         device->writeable = 0;
 475                         fs_devices->rw_devices--;
 476                 }
 477                 list_del_init(&device->dev_list);
 478                 fs_devices->num_devices--;
 479                 kfree(device->name);
 480                 kfree(device);
 481         }
 482
 483         if (fs_devices->seed) {
 484                 fs_devices = fs_devices->seed;
 485                 goto again;
 486         }
 487
 488         mutex_unlock(&uuid_mutex);
 489         return 0;
 490 }
 491
 492 static void __free_device(struct work_struct *work)
 493 {
 494         struct btrfs_device *device;
 495
 496         device = container_of(work, struct btrfs_device, rcu_work);
 497
 498         if (device->bdev)
 499                 blkdev_put(device->bdev, device->mode);
 500
 501         kfree(device->name);
 502         kfree(device);
 503 }
 504
 505 static void free_device(struct rcu_head *head)
 506 {
 507         struct btrfs_device *device;
 508
 509         device = container_of(head, struct btrfs_device, rcu);
 510
 511         INIT_WORK(&device->rcu_work, __free_device);
 512         schedule_work(&device->rcu_work);
 513 }
 514
 515 static int __btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
 516 {
 517         struct btrfs_device *device;
 518
 519         if (--fs_devices->opened > 0)
 520                 return 0;
 521
 522         mutex_lock(&fs_devices->device_list_mutex);
 523         list_for_each_entry(device, &fs_devices->devices, dev_list) {
 524                 struct btrfs_device *new_device;
 525
 526                 if (device->bdev)
 527                         fs_devices->open_devices--;
 528
 529                 if (device->writeable) {
 530                         list_del_init(&device->dev_alloc_list);
 531                         fs_devices->rw_devices--;
 532                 }
 533
 534                 if (device->can_discard)
 535                         fs_devices->num_can_discard--;
 536
 537                 new_device = kmalloc(sizeof(*new_device), GFP_NOFS);
 538                 BUG_ON(!new_device);
 539                 memcpy(new_device, device, sizeof(*new_device));
 540                 new_device->name = kstrdup(device->name, GFP_NOFS);
 541                 BUG_ON(device->name && !new_device->name);
 542                 new_device->bdev = NULL;
 543                 new_device->writeable = 0;
 544                 new_device->in_fs_metadata = 0;
 545                 new_device->can_discard = 0;
 546                 list_replace_rcu(&device->dev_list, &new_device->dev_list);
 547
 548                 call_rcu(&device->rcu, free_device);
 549         }
 550         mutex_unlock(&fs_devices->device_list_mutex);
 551
 552         WARN_ON(fs_devices->open_devices);
 553         WARN_ON(fs_devices->rw_devices);
 554         fs_devices->opened = 0;
 555         fs_devices->seeding = 0;
 556
 557         return 0;
 558 }
 559
 560 int btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
 561 {
 562         struct btrfs_fs_devices *seed_devices = NULL;
 563         int ret;
 564
 565         mutex_lock(&uuid_mutex);
 566         ret = __btrfs_close_devices(fs_devices);
 567         if (!fs_devices->opened) {
 568                 seed_devices = fs_devices->seed;
 569                 fs_devices->seed = NULL;
 570         }
 571         mutex_unlock(&uuid_mutex);
 572
 573         while (seed_devices) {
 574                 fs_devices = seed_devices;
 575                 seed_devices = fs_devices->seed;
 576                 __btrfs_close_devices(fs_devices);
 577                 free_fs_devices(fs_devices);
 578         }
 579         return ret;
 580 }
 581
 582 static int __btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
 583                                 fmode_t flags, void *holder)
 584 {
 585         struct request_queue *q;
 586         struct block_device *bdev;
 587         struct list_head *head = &fs_devices->devices;
 588         struct btrfs_device *device;
 589         struct block_device *latest_bdev = NULL;
 590         struct buffer_head *bh;
 591         struct btrfs_super_block *disk_super;
 592         u64 latest_devid = 0;
 593         u64 latest_transid = 0;
 594         u64 devid;
 595         int seeding = 1;
 596         int ret = 0;
 597
 598         flags |= FMODE_EXCL;
 599
 600         list_for_each_entry(device, head, dev_list) {
 601                 if (device->bdev)
 602                         continue;
 603                 if (!device->name)
 604                         continue;
 605
 606                 bdev = blkdev_get_by_path(device->name, flags, holder);
 607                 if (IS_ERR(bdev)) {
 608                         printk(KERN_INFO "open %s failed\n", device->name);
 609                         goto error;
 610                 }
 611                 set_blocksize(bdev, 4096);
 612
 613                 bh = btrfs_read_dev_super(bdev);
 614                 if (!bh)
 615                         goto error_close;
 616
 617                 disk_super = (struct btrfs_super_block *)bh->b_data;
 618                 devid = btrfs_stack_device_id(&disk_super->dev_item);
 619                 if (devid != device->devid)
 620                         goto error_brelse;
 621
 622                 if (memcmp(device->uuid, disk_super->dev_item.uuid,
 623                            BTRFS_UUID_SIZE))
 624                         goto error_brelse;
 625
 626                 device->generation = btrfs_super_generation(disk_super);
 627                 if (!latest_transid || device->generation > latest_transid) {
 628                         latest_devid = devid;
 629                         latest_transid = device->generation;
 630                         latest_bdev = bdev;
 631                 }
 632
 633                 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) {
 634                         device->writeable = 0;
 635                 } else {
 636                         device->writeable = !bdev_read_only(bdev);
 637                         seeding = 0;
 638                 }
 639
 640                 q = bdev_get_queue(bdev);
 641                 if (blk_queue_discard(q)) {
 642                         device->can_discard = 1;
 643                         fs_devices->num_can_discard++;
 644                 }
 645
 646                 device->bdev = bdev;
 647                 device->in_fs_metadata = 0;
 648                 device->mode = flags;
 649
 650                 if (!blk_queue_nonrot(bdev_get_queue(bdev)))
 651                         fs_devices->rotating = 1;
 652
 653                 fs_devices->open_devices++;
 654                 if (device->writeable) {
 655                         fs_devices->rw_devices++;
 656                         list_add(&device->dev_alloc_list,
 657                                  &fs_devices->alloc_list);
 658                 }
 659                 brelse(bh);
 660                 continue;
 661
 662 error_brelse:
 663                 brelse(bh);
 664 error_close:
 665                 blkdev_put(bdev, flags);
 666 error:
 667                 continue;
 668         }
 669         if (fs_devices->open_devices == 0) {
 670                 ret = -EINVAL;
 671                 goto out;
 672         }
 673         fs_devices->seeding = seeding;
 674         fs_devices->opened = 1;
 675         fs_devices->latest_bdev = latest_bdev;
 676         fs_devices->latest_devid = latest_devid;
 677         fs_devices->latest_trans = latest_transid;
 678         fs_devices->total_rw_bytes = 0;
 679 out:
 680         return ret;
 681 }
 682
 683 int btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
 684                        fmode_t flags, void *holder)
 685 {
 686         int ret;
 687
 688         mutex_lock(&uuid_mutex);
 689         if (fs_devices->opened) {
 690                 fs_devices->opened++;
 691                 ret = 0;
 692         } else {
 693                 ret = __btrfs_open_devices(fs_devices, flags, holder);
 694         }
 695         mutex_unlock(&uuid_mutex);
 696         return ret;
 697 }
 698
 699 int btrfs_scan_one_device(const char *path, fmode_t flags, void *holder,
 700                           struct btrfs_fs_devices **fs_devices_ret)
 701 {
 702         struct btrfs_super_block *disk_super;
 703         struct block_device *bdev;
 704         struct buffer_head *bh;
 705         int ret;
 706         u64 devid;
 707         u64 transid;
 708
 709         mutex_lock(&uuid_mutex);
 710
 711         flags |= FMODE_EXCL;
 712         bdev = blkdev_get_by_path(path, flags, holder);
 713
 714         if (IS_ERR(bdev)) {
 715                 ret = PTR_ERR(bdev);
 716                 goto error;
 717         }
 718
 719         ret = set_blocksize(bdev, 4096);
 720         if (ret)
 721                 goto error_close;
 722         bh = btrfs_read_dev_super(bdev);
 723         if (!bh) {
 724                 ret = -EINVAL;
 725                 goto error_close;
 726         }
 727         disk_super = (struct btrfs_super_block *)bh->b_data;
 728         devid = btrfs_stack_device_id(&disk_super->dev_item);
 729         transid = btrfs_super_generation(disk_super);
 730         if (disk_super->label[0])
 731                 printk(KERN_INFO "device label %s ", disk_super->label);
 732         else
 733                 printk(KERN_INFO "device fsid %pU ", disk_super->fsid);
 734         printk(KERN_CONT "devid %llu transid %llu %s\n",
 735                (unsigned long long)devid, (unsigned long long)transid, path);
 736         ret = device_list_add(path, disk_super, devid, fs_devices_ret);
 737
 738         brelse(bh);
 739 error_close:
 740         blkdev_put(bdev, flags);
 741 error:
 742         mutex_unlock(&uuid_mutex);
 743         return ret;
 744 }
 745
 746 /* helper to account the used device space in the range */
 747 int btrfs_account_dev_extents_size(struct btrfs_device *device, u64 start,
 748                                    u64 end, u64 *length)
 749 {
 750         struct btrfs_key key;
 751         struct btrfs_root *root = device->dev_root;
 752         struct btrfs_dev_extent *dev_extent;
 753         struct btrfs_path *path;
 754         u64 extent_end;
 755         int ret;
 756         int slot;
 757         struct extent_buffer *l;
 758
 759         *length = 0;
 760
 761         if (start >= device->total_bytes)
 762                 return 0;
 763
 764         path = btrfs_alloc_path();
 765         if (!path)
 766                 return -ENOMEM;
 767         path->reada = 2;
 768
 769         key.objectid = device->devid;
 770         key.offset = start;
 771         key.type = BTRFS_DEV_EXTENT_KEY;
 772
 773         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
 774         if (ret < 0)
 775                 goto out;
 776         if (ret > 0) {
 777                 ret = btrfs_previous_item(root, path, key.objectid, key.type);
 778                 if (ret < 0)
 779                         goto out;
 780         }
 781
 782         while (1) {
 783                 l = path->nodes[0];
 784                 slot = path->slots[0];
 785                 if (slot >= btrfs_header_nritems(l)) {
 786                         ret = btrfs_next_leaf(root, path);
 787                         if (ret == 0)
 788                                 continue;
 789                         if (ret < 0)
 790                                 goto out;
 791
 792                         break;
 793                 }
 794                 btrfs_item_key_to_cpu(l, &key, slot);
 795
 796                 if (key.objectid < device->devid)
 797                         goto next;
 798
 799                 if (key.objectid > device->devid)
 800                         break;
 801
 802                 if (btrfs_key_type(&key) != BTRFS_DEV_EXTENT_KEY)
 803                         goto next;
 804
 805                 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
 806                 extent_end = key.offset + btrfs_dev_extent_length(l,
 807                                                                   dev_extent);
 808                 if (key.offset <= start && extent_end > end) {
 809                         *length = end - start + 1;
 810                         break;
 811                 } else if (key.offset <= start && extent_end > start)
 812                         *length += extent_end - start;
 813                 else if (key.offset > start && extent_end <= end)
 814                         *length += extent_end - key.offset;
 815                 else if (key.offset > start && key.offset <= end) {
 816                         *length += end - key.offset + 1;
 817                         break;
 818                 } else if (key.offset > end)
 819                         break;
 820
 821 next:
 822                 path->slots[0]++;
 823         }
 824         ret = 0;
 825 out:
 826         btrfs_free_path(path);
 827         return ret;
 828 }
 829
 830 /*
 831  * find_free_dev_extent - find free space in the specified device
 832  * @trans:      transaction handler
 833  * @device:     the device which we search the free space in
 834  * @num_bytes:  the size of the free space that we need
 835  * @start:      store the start of the free space.
 836  * @len:        the size of the free space. that we find, or the size of the max
 837  *              free space if we don't find suitable free space
 838  *
 839  * this uses a pretty simple search, the expectation is that it is
 840  * called very infrequently and that a given device has a small number
 841  * of extents
 842  *
 843  * @start is used to store the start of the free space if we find. But if we
 844  * don't find suitable free space, it will be used to store the start position
 845  * of the max free space.
 846  *
 847  * @len is used to store the size of the free space that we find.
 848  * But if we don't find suitable free space, it is used to store the size of
 849  * the max free space.
 850  */
 851 int find_free_dev_extent(struct btrfs_trans_handle *trans,
 852                          struct btrfs_device *device, u64 num_bytes,
 853                          u64 *start, u64 *len)
 854 {
 855         struct btrfs_key key;
 856         struct btrfs_root *root = device->dev_root;
 857         struct btrfs_dev_extent *dev_extent;
 858         struct btrfs_path *path;
 859         u64 hole_size;
 860         u64 max_hole_start;
 861         u64 max_hole_size;
 862         u64 extent_end;
 863         u64 search_start;
 864         u64 search_end = device->total_bytes;
 865         int ret;
 866         int slot;
 867         struct extent_buffer *l;
 868
 869         /* FIXME use last free of some kind */
 870
 871         /* we don't want to overwrite the superblock on the drive,
 872          * so we make sure to start at an offset of at least 1MB
 873          */
 874         search_start = max(root->fs_info->alloc_start, 1024ull * 1024);
 875
 876         max_hole_start = search_start;
 877         max_hole_size = 0;
 878         hole_size = 0;
 879
 880         if (search_start >= search_end) {
 881                 ret = -ENOSPC;
 882                 goto error;
 883         }
 884
 885         path = btrfs_alloc_path();
 886         if (!path) {
 887                 ret = -ENOMEM;
 888                 goto error;
 889         }
 890         path->reada = 2;
 891
 892         key.objectid = device->devid;
 893         key.offset = search_start;
 894         key.type = BTRFS_DEV_EXTENT_KEY;
 895
 896         ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
 897         if (ret < 0)
 898                 goto out;
 899         if (ret > 0) {
 900                 ret = btrfs_previous_item(root, path, key.objectid, key.type);
 901                 if (ret < 0)
 902                         goto out;
 903         }
 904
 905         while (1) {
 906                 l = path->nodes[0];
 907                 slot = path->slots[0];
 908                 if (slot >= btrfs_header_nritems(l)) {
 909                         ret = btrfs_next_leaf(root, path);
 910                         if (ret == 0)
 911                                 continue;
 912                         if (ret < 0)
 913                                 goto out;
 914
 915                         break;
 916                 }
 917                 btrfs_item_key_to_cpu(l, &key, slot);
 918
 919                 if (key.objectid < device->devid)
 920                         goto next;
 921
 922                 if (key.objectid > device->devid)
 923                         break;
 924
 925                 if (btrfs_key_type(&key) != BTRFS_DEV_EXTENT_KEY)
 926                         goto next;
 927
 928                 if (key.offset > search_start) {
 929                         hole_size = key.offset - search_start;
 930
 931                         if (hole_size > max_hole_size) {
 932                                 max_hole_start = search_start;
 933                                 max_hole_size = hole_size;
 934                         }
 935
 936                         /*
 937                          * If this free space is greater than which we need,
 938                          * it must be the max free space that we have found
 939                          * until now, so max_hole_start must point to the start
 940                          * of this free space and the length of this free space
 941                          * is stored in max_hole_size. Thus, we return
 942                          * max_hole_start and max_hole_size and go back to the
 943                          * caller.
 944                          */
 945                         if (hole_size >= num_bytes) {
 946                                 ret = 0;
 947                                 goto out;
 948                         }
 949                 }
 950
 951                 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
 952                 extent_end = key.offset + btrfs_dev_extent_length(l,
 953                                                                   dev_extent);
 954                 if (extent_end > search_start)
 955                         search_start = extent_end;
 956 next:
 957                 path->slots[0]++;
 958                 cond_resched();
 959         }
 960
 961         /*
 962          * At this point, search_start should be the end of
 963          * allocated dev extents, and when shrinking the device,
 964          * search_end may be smaller than search_start.
 965          */
 966         if (search_end > search_start)
 967                 hole_size = search_end - search_start;
 968
 969         if (hole_size > max_hole_size) {
 970                 max_hole_start = search_start;
 971                 max_hole_size = hole_size;
 972         }
 973
 974         /* See above. */
 975         if (hole_size < num_bytes)
 976                 ret = -ENOSPC;
 977         else
 978                 ret = 0;
 979
 980 out:
 981         btrfs_free_path(path);
 982 error:
 983         *start = max_hole_start;
 984         if (len)
 985                 *len = max_hole_size;
 986         return ret;
 987 }
 988
 989 static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans,
 990                           struct btrfs_device *device,
 991                           u64 start)
 992 {
 993         int ret;
 994         struct btrfs_path *path;
 995         struct btrfs_root *root = device->dev_root;
 996         struct btrfs_key key;
 997         struct btrfs_key found_key;
 998         struct extent_buffer *leaf = NULL;
 999         struct btrfs_dev_extent *extent = NULL;
1000
1001         path = btrfs_alloc_path();
1002         if (!path)
1003                 return -ENOMEM;
1004
1005         key.objectid = device->devid;
1006         key.offset = start;
1007         key.type = BTRFS_DEV_EXTENT_KEY;
1008 again:
1009         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1010         if (ret > 0) {
1011                 ret = btrfs_previous_item(root, path, key.objectid,
1012                                           BTRFS_DEV_EXTENT_KEY);
1013                 if (ret)
1014                         goto out;
1015                 leaf = path->nodes[0];
1016                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1017                 extent = btrfs_item_ptr(leaf, path->slots[0],
1018                                         struct btrfs_dev_extent);
1019                 BUG_ON(found_key.offset > start || found_key.offset +
1020                        btrfs_dev_extent_length(leaf, extent) < start);
1021                 key = found_key;
1022                 btrfs_release_path(path);
1023                 goto again;
1024         } else if (ret == 0) {
1025                 leaf = path->nodes[0];
1026                 extent = btrfs_item_ptr(leaf, path->slots[0],
1027                                         struct btrfs_dev_extent);
1028         }
1029         BUG_ON(ret);
1030
1031         if (device->bytes_used > 0) {
1032                 u64 len = btrfs_dev_extent_length(leaf, extent);
1033                 device->bytes_used -= len;
1034                 spin_lock(&root->fs_info->free_chunk_lock);
1035                 root->fs_info->free_chunk_space += len;
1036                 spin_unlock(&root->fs_info->free_chunk_lock);
1037         }
1038         ret = btrfs_del_item(trans, root, path);
1039
1040 out:
1041         btrfs_free_path(path);
1042         return ret;
1043 }
1044
1045 int btrfs_alloc_dev_extent(struct btrfs_trans_handle *trans,
1046                            struct btrfs_device *device,
1047                            u64 chunk_tree, u64 chunk_objectid,
1048                            u64 chunk_offset, u64 start, u64 num_bytes)
1049 {
1050         int ret;
1051         struct btrfs_path *path;
1052         struct btrfs_root *root = device->dev_root;
1053         struct btrfs_dev_extent *extent;
1054         struct extent_buffer *leaf;
1055         struct btrfs_key key;
1056
1057         WARN_ON(!device->in_fs_metadata);
1058         path = btrfs_alloc_path();
1059         if (!path)
1060                 return -ENOMEM;
1061
1062         key.objectid = device->devid;
1063         key.offset = start;
1064         key.type = BTRFS_DEV_EXTENT_KEY;
1065         ret = btrfs_insert_empty_item(trans, root, path, &key,
1066                                       sizeof(*extent));
1067         BUG_ON(ret);
1068
1069         leaf = path->nodes[0];
1070         extent = btrfs_item_ptr(leaf, path->slots[0],
1071                                 struct btrfs_dev_extent);
1072         btrfs_set_dev_extent_chunk_tree(leaf, extent, chunk_tree);
1073         btrfs_set_dev_extent_chunk_objectid(leaf, extent, chunk_objectid);
1074         btrfs_set_dev_extent_chunk_offset(leaf, extent, chunk_offset);
1075
1076         write_extent_buffer(leaf, root->fs_info->chunk_tree_uuid,
1077                     (unsigned long)btrfs_dev_extent_chunk_tree_uuid(extent),
1078                     BTRFS_UUID_SIZE);
1079
1080         btrfs_set_dev_extent_length(leaf, extent, num_bytes);
1081         btrfs_mark_buffer_dirty(leaf);
1082         btrfs_free_path(path);
1083         return ret;
1084 }
1085
1086 static noinline int find_next_chunk(struct btrfs_root *root,
1087                                     u64 objectid, u64 *offset)
1088 {
1089         struct btrfs_path *path;
1090         int ret;
1091         struct btrfs_key key;
1092         struct btrfs_chunk *chunk;
1093         struct btrfs_key found_key;
1094
1095         path = btrfs_alloc_path();
1096         if (!path)
1097                 return -ENOMEM;
1098
1099         key.objectid = objectid;
1100         key.offset = (u64)-1;
1101         key.type = BTRFS_CHUNK_ITEM_KEY;
1102
1103         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1104         if (ret < 0)
1105                 goto error;
1106
1107         BUG_ON(ret == 0);
1108
1109         ret = btrfs_previous_item(root, path, 0, BTRFS_CHUNK_ITEM_KEY);
1110         if (ret) {
1111                 *offset = 0;
1112         } else {
1113                 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1114                                       path->slots[0]);
1115                 if (found_key.objectid != objectid)
1116                         *offset = 0;
1117                 else {
1118                         chunk = btrfs_item_ptr(path->nodes[0], path->slots[0],
1119                                                struct btrfs_chunk);
1120                         *offset = found_key.offset +
1121                                 btrfs_chunk_length(path->nodes[0], chunk);
1122                 }
1123         }
1124         ret = 0;
1125 error:
1126         btrfs_free_path(path);
1127         return ret;
1128 }
1129
1130 static noinline int find_next_devid(struct btrfs_root *root, u64 *objectid)
1131 {
1132         int ret;
1133         struct btrfs_key key;
1134         struct btrfs_key found_key;
1135         struct btrfs_path *path;
1136
1137         root = root->fs_info->chunk_root;
1138
1139         path = btrfs_alloc_path();
1140         if (!path)
1141                 return -ENOMEM;
1142
1143         key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1144         key.type = BTRFS_DEV_ITEM_KEY;
1145         key.offset = (u64)-1;
1146
1147         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1148         if (ret < 0)
1149                 goto error;
1150
1151         BUG_ON(ret == 0);
1152
1153         ret = btrfs_previous_item(root, path, BTRFS_DEV_ITEMS_OBJECTID,
1154                                   BTRFS_DEV_ITEM_KEY);
1155         if (ret) {
1156                 *objectid = 1;
1157         } else {
1158                 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1159                                       path->slots[0]);
1160                 *objectid = found_key.offset + 1;
1161         }
1162         ret = 0;
1163 error:
1164         btrfs_free_path(path);
1165         return ret;
1166 }
1167
1168 /*
1169  * the device information is stored in the chunk root
1170  * the btrfs_device struct should be fully filled in
1171  */
1172 int btrfs_add_device(struct btrfs_trans_handle *trans,
1173                      struct btrfs_root *root,
1174                      struct btrfs_device *device)
1175 {
1176         int ret;
1177         struct btrfs_path *path;
1178         struct btrfs_dev_item *dev_item;
1179         struct extent_buffer *leaf;
1180         struct btrfs_key key;
1181         unsigned long ptr;
1182
1183         root = root->fs_info->chunk_root;
1184
1185         path = btrfs_alloc_path();
1186         if (!path)
1187                 return -ENOMEM;
1188
1189         key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1190         key.type = BTRFS_DEV_ITEM_KEY;
1191         key.offset = device->devid;
1192
1193         ret = btrfs_insert_empty_item(trans, root, path, &key,
1194                                       sizeof(*dev_item));
1195         if (ret)
1196                 goto out;
1197
1198         leaf = path->nodes[0];
1199         dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
1200
1201         btrfs_set_device_id(leaf, dev_item, device->devid);
1202         btrfs_set_device_generation(leaf, dev_item, 0);
1203         btrfs_set_device_type(leaf, dev_item, device->type);
1204         btrfs_set_device_io_align(leaf, dev_item, device->io_align);
1205         btrfs_set_device_io_width(leaf, dev_item, device->io_width);
1206         btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
1207         btrfs_set_device_total_bytes(leaf, dev_item, device->total_bytes);
1208         btrfs_set_device_bytes_used(leaf, dev_item, device->bytes_used);
1209         btrfs_set_device_group(leaf, dev_item, 0);
1210         btrfs_set_device_seek_speed(leaf, dev_item, 0);
1211         btrfs_set_device_bandwidth(leaf, dev_item, 0);
1212         btrfs_set_device_start_offset(leaf, dev_item, 0);
1213
1214         ptr = (unsigned long)btrfs_device_uuid(dev_item);
1215         write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
1216         ptr = (unsigned long)btrfs_device_fsid(dev_item);
1217         write_extent_buffer(leaf, root->fs_info->fsid, ptr, BTRFS_UUID_SIZE);
1218         btrfs_mark_buffer_dirty(leaf);
1219
1220         ret = 0;
1221 out:
1222         btrfs_free_path(path);
1223         return ret;
1224 }
1225
1226 static int btrfs_rm_dev_item(struct btrfs_root *root,
1227                              struct btrfs_device *device)
1228 {
1229         int ret;
1230         struct btrfs_path *path;
1231         struct btrfs_key key;
1232         struct btrfs_trans_handle *trans;
1233
1234         root = root->fs_info->chunk_root;
1235
1236         path = btrfs_alloc_path();
1237         if (!path)
1238                 return -ENOMEM;
1239
1240         trans = btrfs_start_transaction(root, 0);
1241         if (IS_ERR(trans)) {
1242                 btrfs_free_path(path);
1243                 return PTR_ERR(trans);
1244         }
1245         key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1246         key.type = BTRFS_DEV_ITEM_KEY;
1247         key.offset = device->devid;
1248         lock_chunks(root);
1249
1250         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1251         if (ret < 0)
1252                 goto out;
1253
1254         if (ret > 0) {
1255                 ret = -ENOENT;
1256                 goto out;
1257         }
1258
1259         ret = btrfs_del_item(trans, root, path);
1260         if (ret)
1261                 goto out;
1262 out:
1263         btrfs_free_path(path);
1264         unlock_chunks(root);
1265         btrfs_commit_transaction(trans, root);
1266         return ret;
1267 }
1268
1269 int btrfs_rm_device(struct btrfs_root *root, char *device_path)
1270 {
1271         struct btrfs_device *device;
1272         struct btrfs_device *next_device;
1273         struct block_device *bdev;
1274         struct buffer_head *bh = NULL;
1275         struct btrfs_super_block *disk_super;
1276         struct btrfs_fs_devices *cur_devices;
1277         u64 all_avail;
1278         u64 devid;
1279         u64 num_devices;
1280         u8 *dev_uuid;
1281         int ret = 0;
1282         bool clear_super = false;
1283
1284         mutex_lock(&uuid_mutex);
1285
1286         all_avail = root->fs_info->avail_data_alloc_bits |
1287                 root->fs_info->avail_system_alloc_bits |
1288                 root->fs_info->avail_metadata_alloc_bits;
1289
1290         if ((all_avail & BTRFS_BLOCK_GROUP_RAID10) &&
1291             root->fs_info->fs_devices->num_devices <= 4) {
1292                 printk(KERN_ERR "btrfs: unable to go below four devices "
1293                        "on raid10\n");
1294                 ret = -EINVAL;
1295                 goto out;
1296         }
1297
1298         if ((all_avail & BTRFS_BLOCK_GROUP_RAID1) &&
1299             root->fs_info->fs_devices->num_devices <= 2) {
1300                 printk(KERN_ERR "btrfs: unable to go below two "
1301                        "devices on raid1\n");
1302                 ret = -EINVAL;
1303                 goto out;
1304         }
1305
1306         if (strcmp(device_path, "missing") == 0) {
1307                 struct list_head *devices;
1308                 struct btrfs_device *tmp;
1309
1310                 device = NULL;
1311                 devices = &root->fs_info->fs_devices->devices;
1312                 /*
1313                  * It is safe to read the devices since the volume_mutex
1314                  * is held.
1315                  */
1316                 list_for_each_entry(tmp, devices, dev_list) {
1317                         if (tmp->in_fs_metadata && !tmp->bdev) {
1318                                 device = tmp;
1319                                 break;
1320                         }
1321                 }
1322                 bdev = NULL;
1323                 bh = NULL;
1324                 disk_super = NULL;
1325                 if (!device) {
1326                         printk(KERN_ERR "btrfs: no missing devices found to "
1327                                "remove\n");
1328                         goto out;
1329                 }
1330         } else {
1331                 bdev = blkdev_get_by_path(device_path, FMODE_READ | FMODE_EXCL,
1332                                           root->fs_info->bdev_holder);
1333                 if (IS_ERR(bdev)) {
1334                         ret = PTR_ERR(bdev);
1335                         goto out;
1336                 }
1337
1338                 set_blocksize(bdev, 4096);
1339                 bh = btrfs_read_dev_super(bdev);
1340                 if (!bh) {
1341                         ret = -EINVAL;
1342                         goto error_close;
1343                 }
1344                 disk_super = (struct btrfs_super_block *)bh->b_data;
1345                 devid = btrfs_stack_device_id(&disk_super->dev_item);
1346                 dev_uuid = disk_super->dev_item.uuid;
1347                 device = btrfs_find_device(root, devid, dev_uuid,
1348                                            disk_super->fsid);
1349                 if (!device) {
1350                         ret = -ENOENT;
1351                         goto error_brelse;
1352                 }
1353         }
1354
1355         if (device->writeable && root->fs_info->fs_devices->rw_devices == 1) {
1356                 printk(KERN_ERR "btrfs: unable to remove the only writeable "
1357                        "device\n");
1358                 ret = -EINVAL;
1359                 goto error_brelse;
1360         }
1361
1362         if (device->writeable) {
1363                 lock_chunks(root);
1364                 list_del_init(&device->dev_alloc_list);
1365                 unlock_chunks(root);
1366                 root->fs_info->fs_devices->rw_devices--;
1367                 clear_super = true;
1368         }
1369
1370         ret = btrfs_shrink_device(device, 0);
1371         if (ret)
1372                 goto error_undo;
1373
1374         ret = btrfs_rm_dev_item(root->fs_info->chunk_root, device);
1375         if (ret)
1376                 goto error_undo;
1377
1378         spin_lock(&root->fs_info->free_chunk_lock);
1379         root->fs_info->free_chunk_space = device->total_bytes -
1380                 device->bytes_used;
1381         spin_unlock(&root->fs_info->free_chunk_lock);
1382
1383         device->in_fs_metadata = 0;
1384         btrfs_scrub_cancel_dev(root, device);
1385
1386         /*
1387          * the device list mutex makes sure that we don't change
1388          * the device list while someone else is writing out all
1389          * the device supers.
1390          */
1391
1392         cur_devices = device->fs_devices;
1393         mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
1394         list_del_rcu(&device->dev_list);
1395
1396         device->fs_devices->num_devices--;
1397
1398         if (device->missing)
1399                 root->fs_info->fs_devices->missing_devices--;
1400
1401         next_device = list_entry(root->fs_info->fs_devices->devices.next,
1402                                  struct btrfs_device, dev_list);
1403         if (device->bdev == root->fs_info->sb->s_bdev)
1404                 root->fs_info->sb->s_bdev = next_device->bdev;
1405         if (device->bdev == root->fs_info->fs_devices->latest_bdev)
1406                 root->fs_info->fs_devices->latest_bdev = next_device->bdev;
1407
1408         if (device->bdev)
1409                 device->fs_devices->open_devices--;
1410
1411         call_rcu(&device->rcu, free_device);
1412         mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
1413
1414         num_devices = btrfs_super_num_devices(root->fs_info->super_copy) - 1;
1415         btrfs_set_super_num_devices(root->fs_info->super_copy, num_devices);
1416
1417         if (cur_devices->open_devices == 0) {
1418                 struct btrfs_fs_devices *fs_devices;
1419                 fs_devices = root->fs_info->fs_devices;
1420                 while (fs_devices) {
1421                         if (fs_devices->seed == cur_devices)
1422                                 break;
1423                         fs_devices = fs_devices->seed;
1424                 }
1425                 fs_devices->seed = cur_devices->seed;
1426                 cur_devices->seed = NULL;
1427                 lock_chunks(root);
1428                 __btrfs_close_devices(cur_devices);
1429                 unlock_chunks(root);
1430                 free_fs_devices(cur_devices);
1431         }
1432
1433         /*
1434          * at this point, the device is zero sized.  We want to
1435          * remove it from the devices list and zero out the old super
1436          */
1437         if (clear_super) {
1438                 /* make sure this device isn't detected as part of
1439                  * the FS anymore
1440                  */
1441                 memset(&disk_super->magic, 0, sizeof(disk_super->magic));
1442                 set_buffer_dirty(bh);
1443                 sync_dirty_buffer(bh);
1444         }
1445
1446         ret = 0;
1447
1448 error_brelse:
1449         brelse(bh);
1450 error_close:
1451         if (bdev)
1452                 blkdev_put(bdev, FMODE_READ | FMODE_EXCL);
1453 out:
1454         mutex_unlock(&uuid_mutex);
1455         return ret;
1456 error_undo:
1457         if (device->writeable) {
1458                 lock_chunks(root);
1459                 list_add(&device->dev_alloc_list,
1460                          &root->fs_info->fs_devices->alloc_list);
1461                 unlock_chunks(root);
1462                 root->fs_info->fs_devices->rw_devices++;
1463         }
1464         goto error_brelse;
1465 }
1466
1467 /*
1468  * does all the dirty work required for changing file system's UUID.
1469  */
1470 static int btrfs_prepare_sprout(struct btrfs_trans_handle *trans,
1471                                 struct btrfs_root *root)
1472 {
1473         struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
1474         struct btrfs_fs_devices *old_devices;
1475         struct btrfs_fs_devices *seed_devices;
1476         struct btrfs_super_block *disk_super = root->fs_info->super_copy;
1477         struct btrfs_device *device;
1478         u64 super_flags;
1479
1480         BUG_ON(!mutex_is_locked(&uuid_mutex));
1481         if (!fs_devices->seeding)
1482                 return -EINVAL;
1483
1484         seed_devices = kzalloc(sizeof(*fs_devices), GFP_NOFS);
1485         if (!seed_devices)
1486                 return -ENOMEM;
1487
1488         old_devices = clone_fs_devices(fs_devices);
1489         if (IS_ERR(old_devices)) {
1490                 kfree(seed_devices);
1491                 return PTR_ERR(old_devices);
1492         }
1493
1494         list_add(&old_devices->list, &fs_uuids);
1495
1496         memcpy(seed_devices, fs_devices, sizeof(*seed_devices));
1497         seed_devices->opened = 1;
1498         INIT_LIST_HEAD(&seed_devices->devices);
1499         INIT_LIST_HEAD(&seed_devices->alloc_list);
1500         mutex_init(&seed_devices->device_list_mutex);
1501
1502         mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
1503         list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices,
1504                               synchronize_rcu);
1505         mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
1506
1507         list_splice_init(&fs_devices->alloc_list, &seed_devices->alloc_list);
1508         list_for_each_entry(device, &seed_devices->devices, dev_list) {
1509                 device->fs_devices = seed_devices;
1510         }
1511
1512         fs_devices->seeding = 0;
1513         fs_devices->num_devices = 0;
1514         fs_devices->open_devices = 0;
1515         fs_devices->seed = seed_devices;
1516
1517         generate_random_uuid(fs_devices->fsid);
1518         memcpy(root->fs_info->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
1519         memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
1520         super_flags = btrfs_super_flags(disk_super) &
1521                       ~BTRFS_SUPER_FLAG_SEEDING;
1522         btrfs_set_super_flags(disk_super, super_flags);
1523
1524         return 0;
1525 }
1526
1527 /*
1528  * strore the expected generation for seed devices in device items.
1529  */
1530 static int btrfs_finish_sprout(struct btrfs_trans_handle *trans,
1531                                struct btrfs_root *root)
1532 {
1533         struct btrfs_path *path;
1534         struct extent_buffer *leaf;
1535         struct btrfs_dev_item *dev_item;
1536         struct btrfs_device *device;
1537         struct btrfs_key key;
1538         u8 fs_uuid[BTRFS_UUID_SIZE];
1539         u8 dev_uuid[BTRFS_UUID_SIZE];
1540         u64 devid;
1541         int ret;
1542
1543         path = btrfs_alloc_path();
1544         if (!path)
1545                 return -ENOMEM;
1546
1547         root = root->fs_info->chunk_root;
1548         key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1549         key.offset = 0;
1550         key.type = BTRFS_DEV_ITEM_KEY;
1551
1552         while (1) {
1553                 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1554                 if (ret < 0)
1555                         goto error;
1556
1557                 leaf = path->nodes[0];
1558 next_slot:
1559                 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
1560                         ret = btrfs_next_leaf(root, path);
1561                         if (ret > 0)
1562                                 break;
1563                         if (ret < 0)
1564                                 goto error;
1565                         leaf = path->nodes[0];
1566                         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1567                         btrfs_release_path(path);
1568                         continue;
1569                 }
1570
1571                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1572                 if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID ||
1573                     key.type != BTRFS_DEV_ITEM_KEY)
1574                         break;
1575
1576                 dev_item = btrfs_item_ptr(leaf, path->slots[0],
1577                                           struct btrfs_dev_item);
1578                 devid = btrfs_device_id(leaf, dev_item);
1579                 read_extent_buffer(leaf, dev_uuid,
1580                                    (unsigned long)btrfs_device_uuid(dev_item),
1581                                    BTRFS_UUID_SIZE);
1582                 read_extent_buffer(leaf, fs_uuid,
1583                                    (unsigned long)btrfs_device_fsid(dev_item),
1584                                    BTRFS_UUID_SIZE);
1585                 device = btrfs_find_device(root, devid, dev_uuid, fs_uuid);
1586                 BUG_ON(!device);
1587
1588                 if (device->fs_devices->seeding) {
1589                         btrfs_set_device_generation(leaf, dev_item,
1590                                                     device->generation);
1591                         btrfs_mark_buffer_dirty(leaf);
1592                 }
1593
1594                 path->slots[0]++;
1595                 goto next_slot;
1596         }
1597         ret = 0;
1598 error:
1599         btrfs_free_path(path);
1600         return ret;
1601 }
1602
1603 int btrfs_init_new_device(struct btrfs_root *root, char *device_path)
1604 {
1605         struct request_queue *q;
1606         struct btrfs_trans_handle *trans;
1607         struct btrfs_device *device;
1608         struct block_device *bdev;
1609         struct list_head *devices;
1610         struct super_block *sb = root->fs_info->sb;
1611         u64 total_bytes;
1612         int seeding_dev = 0;
1613         int ret = 0;
1614
1615         if ((sb->s_flags & MS_RDONLY) && !root->fs_info->fs_devices->seeding)
1616                 return -EINVAL;
1617
1618         bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL,
1619                                   root->fs_info->bdev_holder);
1620         if (IS_ERR(bdev))
1621                 return PTR_ERR(bdev);
1622
1623         if (root->fs_info->fs_devices->seeding) {
1624                 seeding_dev = 1;
1625                 down_write(&sb->s_umount);
1626                 mutex_lock(&uuid_mutex);
1627         }
1628
1629         filemap_write_and_wait(bdev->bd_inode->i_mapping);
1630
1631         devices = &root->fs_info->fs_devices->devices;
1632         /*
1633          * we have the volume lock, so we don't need the extra
1634          * device list mutex while reading the list here.
1635          */
1636         list_for_each_entry(device, devices, dev_list) {
1637                 if (device->bdev == bdev) {
1638                         ret = -EEXIST;
1639                         goto error;
1640                 }
1641         }
1642
1643         device = kzalloc(sizeof(*device), GFP_NOFS);
1644         if (!device) {
1645                 /* we can safely leave the fs_devices entry around */
1646                 ret = -ENOMEM;
1647                 goto error;
1648         }
1649
1650         device->name = kstrdup(device_path, GFP_NOFS);
1651         if (!device->name) {
1652                 kfree(device);
1653                 ret = -ENOMEM;
1654                 goto error;
1655         }
1656
1657         ret = find_next_devid(root, &device->devid);
1658         if (ret) {
1659                 kfree(device->name);
1660                 kfree(device);
1661                 goto error;
1662         }
1663
1664         trans = btrfs_start_transaction(root, 0);
1665         if (IS_ERR(trans)) {
1666                 kfree(device->name);
1667                 kfree(device);
1668                 ret = PTR_ERR(trans);
1669                 goto error;
1670         }
1671
1672         lock_chunks(root);
1673
1674         q = bdev_get_queue(bdev);
1675         if (blk_queue_discard(q))
1676                 device->can_discard = 1;
1677         device->writeable = 1;
1678         device->work.func = pending_bios_fn;
1679         generate_random_uuid(device->uuid);
1680         spin_lock_init(&device->io_lock);
1681         device->generation = trans->transid;
1682         device->io_width = root->sectorsize;
1683         device->io_align = root->sectorsize;
1684         device->sector_size = root->sectorsize;
1685         device->total_bytes = i_size_read(bdev->bd_inode);
1686         device->disk_total_bytes = device->total_bytes;
1687         device->dev_root = root->fs_info->dev_root;
1688         device->bdev = bdev;
1689         device->in_fs_metadata = 1;
1690         device->mode = FMODE_EXCL;
1691         set_blocksize(device->bdev, 4096);
1692
1693         if (seeding_dev) {
1694                 sb->s_flags &= ~MS_RDONLY;
1695                 ret = btrfs_prepare_sprout(trans, root);
1696                 BUG_ON(ret);
1697         }
1698
1699         device->fs_devices = root->fs_info->fs_devices;
1700
1701         /*
1702          * we don't want write_supers to jump in here with our device
1703          * half setup
1704          */
1705         mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
1706         list_add_rcu(&device->dev_list, &root->fs_info->fs_devices->devices);
1707         list_add(&device->dev_alloc_list,
1708                  &root->fs_info->fs_devices->alloc_list);
1709         root->fs_info->fs_devices->num_devices++;
1710         root->fs_info->fs_devices->open_devices++;
1711         root->fs_info->fs_devices->rw_devices++;
1712         if (device->can_discard)
1713                 root->fs_info->fs_devices->num_can_discard++;
1714         root->fs_info->fs_devices->total_rw_bytes += device->total_bytes;
1715
1716         spin_lock(&root->fs_info->free_chunk_lock);
1717         root->fs_info->free_chunk_space += device->total_bytes;
1718         spin_unlock(&root->fs_info->free_chunk_lock);
1719
1720         if (!blk_queue_nonrot(bdev_get_queue(bdev)))
1721                 root->fs_info->fs_devices->rotating = 1;
1722
1723         total_bytes = btrfs_super_total_bytes(root->fs_info->super_copy);
1724         btrfs_set_super_total_bytes(root->fs_info->super_copy,
1725                                     total_bytes + device->total_bytes);
1726
1727         total_bytes = btrfs_super_num_devices(root->fs_info->super_copy);
1728         btrfs_set_super_num_devices(root->fs_info->super_copy,
1729                                     total_bytes + 1);
1730         mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
1731
1732         if (seeding_dev) {
1733                 ret = init_first_rw_device(trans, root, device);
1734                 BUG_ON(ret);
1735                 ret = btrfs_finish_sprout(trans, root);
1736                 BUG_ON(ret);
1737         } else {
1738                 ret = btrfs_add_device(trans, root, device);
1739         }
1740
1741         /*
1742          * we've got more storage, clear any full flags on the space
1743          * infos
1744          */
1745         btrfs_clear_space_info_full(root->fs_info);
1746
1747         unlock_chunks(root);
1748         btrfs_commit_transaction(trans, root);
1749
1750         if (seeding_dev) {
1751                 mutex_unlock(&uuid_mutex);
1752                 up_write(&sb->s_umount);
1753
1754                 ret = btrfs_relocate_sys_chunks(root);
1755                 BUG_ON(ret);
1756         }
1757
1758         return ret;
1759 error:
1760         blkdev_put(bdev, FMODE_EXCL);
1761         if (seeding_dev) {
1762                 mutex_unlock(&uuid_mutex);
1763                 up_write(&sb->s_umount);
1764         }
1765         return ret;
1766 }
1767
1768 static noinline int btrfs_update_device(struct btrfs_trans_handle *trans,
1769                                         struct btrfs_device *device)
1770 {
1771         int ret;
1772         struct btrfs_path *path;
1773         struct btrfs_root *root;
1774         struct btrfs_dev_item *dev_item;
1775         struct extent_buffer *leaf;
1776         struct btrfs_key key;
1777
1778         root = device->dev_root->fs_info->chunk_root;
1779
1780         path = btrfs_alloc_path();
1781         if (!path)
1782                 return -ENOMEM;
1783
1784         key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1785         key.type = BTRFS_DEV_ITEM_KEY;
1786         key.offset = device->devid;
1787
1788         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
1789         if (ret < 0)
1790                 goto out;
1791
1792         if (ret > 0) {
1793                 ret = -ENOENT;
1794                 goto out;
1795         }
1796
1797         leaf = path->nodes[0];
1798         dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
1799
1800         btrfs_set_device_id(leaf, dev_item, device->devid);
1801         btrfs_set_device_type(leaf, dev_item, device->type);
1802         btrfs_set_device_io_align(leaf, dev_item, device->io_align);
1803         btrfs_set_device_io_width(leaf, dev_item, device->io_width);
1804         btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
1805         btrfs_set_device_total_bytes(leaf, dev_item, device->disk_total_bytes);
1806         btrfs_set_device_bytes_used(leaf, dev_item, device->bytes_used);
1807         btrfs_mark_buffer_dirty(leaf);
1808
1809 out:
1810         btrfs_free_path(path);
1811         return ret;
1812 }
1813
1814 static int __btrfs_grow_device(struct btrfs_trans_handle *trans,
1815                       struct btrfs_device *device, u64 new_size)
1816 {
1817         struct btrfs_super_block *super_copy =
1818                 device->dev_root->fs_info->super_copy;
1819         u64 old_total = btrfs_super_total_bytes(super_copy);
1820         u64 diff = new_size - device->total_bytes;
1821
1822         if (!device->writeable)
1823                 return -EACCES;
1824         if (new_size <= device->total_bytes)
1825                 return -EINVAL;
1826
1827         btrfs_set_super_total_bytes(super_copy, old_total + diff);
1828         device->fs_devices->total_rw_bytes += diff;
1829
1830         device->total_bytes = new_size;
1831         device->disk_total_bytes = new_size;
1832         btrfs_clear_space_info_full(device->dev_root->fs_info);
1833
1834         return btrfs_update_device(trans, device);
1835 }
1836
1837 int btrfs_grow_device(struct btrfs_trans_handle *trans,
1838                       struct btrfs_device *device, u64 new_size)
1839 {
1840         int ret;
1841         lock_chunks(device->dev_root);
1842         ret = __btrfs_grow_device(trans, device, new_size);
1843         unlock_chunks(device->dev_root);
1844         return ret;
1845 }
1846
1847 static int btrfs_free_chunk(struct btrfs_trans_handle *trans,
1848                             struct btrfs_root *root,
1849                             u64 chunk_tree, u64 chunk_objectid,
1850                             u64 chunk_offset)
1851 {
1852         int ret;
1853         struct btrfs_path *path;
1854         struct btrfs_key key;
1855
1856         root = root->fs_info->chunk_root;
1857         path = btrfs_alloc_path();
1858         if (!path)
1859                 return -ENOMEM;
1860
1861         key.objectid = chunk_objectid;
1862         key.offset = chunk_offset;
1863         key.type = BTRFS_CHUNK_ITEM_KEY;
1864
1865         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1866         BUG_ON(ret);
1867
1868         ret = btrfs_del_item(trans, root, path);
1869
1870         btrfs_free_path(path);
1871         return ret;
1872 }
1873
1874 static int btrfs_del_sys_chunk(struct btrfs_root *root, u64 chunk_objectid, u64
1875                         chunk_offset)
1876 {
1877         struct btrfs_super_block *super_copy = root->fs_info->super_copy;
1878         struct btrfs_disk_key *disk_key;
1879         struct btrfs_chunk *chunk;
1880         u8 *ptr;
1881         int ret = 0;
1882         u32 num_stripes;
1883         u32 array_size;
1884         u32 len = 0;
1885         u32 cur;
1886         struct btrfs_key key;
1887
1888         array_size = btrfs_super_sys_array_size(super_copy);
1889
1890         ptr = super_copy->sys_chunk_array;
1891         cur = 0;
1892
1893         while (cur < array_size) {
1894                 disk_key = (struct btrfs_disk_key *)ptr;
1895                 btrfs_disk_key_to_cpu(&key, disk_key);
1896
1897                 len = sizeof(*disk_key);
1898
1899                 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
1900                         chunk = (struct btrfs_chunk *)(ptr + len);
1901                         num_stripes = btrfs_stack_chunk_num_stripes(chunk);
1902                         len += btrfs_chunk_item_size(num_stripes);
1903                 } else {
1904                         ret = -EIO;
1905                         break;
1906                 }
1907                 if (key.objectid == chunk_objectid &&
1908                     key.offset == chunk_offset) {
1909                         memmove(ptr, ptr + len, array_size - (cur + len));
1910                         array_size -= len;
1911                         btrfs_set_super_sys_array_size(super_copy, array_size);
1912                 } else {
1913                         ptr += len;
1914                         cur += len;
1915                 }
1916         }
1917         return ret;
1918 }
1919
1920 static int btrfs_relocate_chunk(struct btrfs_root *root,
1921                          u64 chunk_tree, u64 chunk_objectid,
1922                          u64 chunk_offset)
1923 {
1924         struct extent_map_tree *em_tree;
1925         struct btrfs_root *extent_root;
1926         struct btrfs_trans_handle *trans;
1927         struct extent_map *em;
1928         struct map_lookup *map;
1929         int ret;
1930         int i;
1931
1932         root = root->fs_info->chunk_root;
1933         extent_root = root->fs_info->extent_root;
1934         em_tree = &root->fs_info->mapping_tree.map_tree;
1935
1936         ret = btrfs_can_relocate(extent_root, chunk_offset);
1937         if (ret)
1938                 return -ENOSPC;
1939
1940         /* step one, relocate all the extents inside this chunk */
1941         ret = btrfs_relocate_block_group(extent_root, chunk_offset);
1942         if (ret)
1943                 return ret;
1944
1945         trans = btrfs_start_transaction(root, 0);
1946         BUG_ON(IS_ERR(trans));
1947
1948         lock_chunks(root);
1949
1950         /*
1951          * step two, delete the device extents and the
1952          * chunk tree entries
1953          */
1954         read_lock(&em_tree->lock);
1955         em = lookup_extent_mapping(em_tree, chunk_offset, 1);
1956         read_unlock(&em_tree->lock);
1957
1958         BUG_ON(em->start > chunk_offset ||
1959                em->start + em->len < chunk_offset);
1960         map = (struct map_lookup *)em->bdev;
1961
1962         for (i = 0; i < map->num_stripes; i++) {
1963                 ret = btrfs_free_dev_extent(trans, map->stripes[i].dev,
1964                                             map->stripes[i].physical);
1965                 BUG_ON(ret);
1966
1967                 if (map->stripes[i].dev) {
1968                         ret = btrfs_update_device(trans, map->stripes[i].dev);
1969                         BUG_ON(ret);
1970                 }
1971         }
1972         ret = btrfs_free_chunk(trans, root, chunk_tree, chunk_objectid,
1973                                chunk_offset);
1974
1975         BUG_ON(ret);
1976
1977         trace_btrfs_chunk_free(root, map, chunk_offset, em->len);
1978
1979         if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
1980                 ret = btrfs_del_sys_chunk(root, chunk_objectid, chunk_offset);
1981                 BUG_ON(ret);
1982         }
1983
1984         ret = btrfs_remove_block_group(trans, extent_root, chunk_offset);
1985         BUG_ON(ret);
1986
1987         write_lock(&em_tree->lock);
1988         remove_extent_mapping(em_tree, em);
1989         write_unlock(&em_tree->lock);
1990
1991         kfree(map);
1992         em->bdev = NULL;
1993
1994         /* once for the tree */
1995         free_extent_map(em);
1996         /* once for us */
1997         free_extent_map(em);
1998
1999         unlock_chunks(root);
2000         btrfs_end_transaction(trans, root);
2001         return 0;
2002 }
2003
2004 static int btrfs_relocate_sys_chunks(struct btrfs_root *root)
2005 {
2006         struct btrfs_root *chunk_root = root->fs_info->chunk_root;
2007         struct btrfs_path *path;
2008         struct extent_buffer *leaf;
2009         struct btrfs_chunk *chunk;
2010         struct btrfs_key key;
2011         struct btrfs_key found_key;
2012         u64 chunk_tree = chunk_root->root_key.objectid;
2013         u64 chunk_type;
2014         bool retried = false;
2015         int failed = 0;
2016         int ret;
2017
2018         path = btrfs_alloc_path();
2019         if (!path)
2020                 return -ENOMEM;
2021
2022 again:
2023         key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2024         key.offset = (u64)-1;
2025         key.type = BTRFS_CHUNK_ITEM_KEY;
2026
2027         while (1) {
2028                 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
2029                 if (ret < 0)
2030                         goto error;
2031                 BUG_ON(ret == 0);
2032
2033                 ret = btrfs_previous_item(chunk_root, path, key.objectid,
2034                                           key.type);
2035                 if (ret < 0)
2036                         goto error;
2037                 if (ret > 0)
2038                         break;
2039
2040                 leaf = path->nodes[0];
2041                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
2042
2043                 chunk = btrfs_item_ptr(leaf, path->slots[0],
2044                                        struct btrfs_chunk);
2045                 chunk_type = btrfs_chunk_type(leaf, chunk);
2046                 btrfs_release_path(path);
2047
2048                 if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) {
2049                         ret = btrfs_relocate_chunk(chunk_root, chunk_tree,
2050                                                    found_key.objectid,
2051                                                    found_key.offset);
2052                         if (ret == -ENOSPC)
2053                                 failed++;
2054                         else if (ret)
2055                                 BUG();
2056                 }
2057
2058                 if (found_key.offset == 0)
2059                         break;
2060                 key.offset = found_key.offset - 1;
2061         }
2062         ret = 0;
2063         if (failed && !retried) {
2064                 failed = 0;
2065                 retried = true;
2066                 goto again;
2067         } else if (failed && retried) {
2068                 WARN_ON(1);
2069                 ret = -ENOSPC;
2070         }
2071 error:
2072         btrfs_free_path(path);
2073         return ret;
2074 }
2075
2076 /*
2077  * Should be called with both balance and volume mutexes held to
2078  * serialize other volume operations (add_dev/rm_dev/resize) with
2079  * restriper.  Same goes for unset_balance_control.
2080  */
2081 static void set_balance_control(struct btrfs_balance_control *bctl)
2082 {
2083         struct btrfs_fs_info *fs_info = bctl->fs_info;
2084
2085         BUG_ON(fs_info->balance_ctl);
2086
2087         spin_lock(&fs_info->balance_lock);
2088         fs_info->balance_ctl = bctl;
2089         spin_unlock(&fs_info->balance_lock);
2090 }
2091
2092 static void unset_balance_control(struct btrfs_fs_info *fs_info)
2093 {
2094         struct btrfs_balance_control *bctl = fs_info->balance_ctl;
2095
2096         BUG_ON(!fs_info->balance_ctl);
2097
2098         spin_lock(&fs_info->balance_lock);
2099         fs_info->balance_ctl = NULL;
2100         spin_unlock(&fs_info->balance_lock);
2101
2102         kfree(bctl);
2103 }
2104
2105 /*
2106  * Balance filters.  Return 1 if chunk should be filtered out
2107  * (should not be balanced).
2108  */
2109 static int chunk_profiles_filter(u64 chunk_profile,
2110                                  struct btrfs_balance_args *bargs)
2111 {
2112         chunk_profile &= BTRFS_BLOCK_GROUP_PROFILE_MASK;
2113
2114         if (chunk_profile == 0)
2115                 chunk_profile = BTRFS_AVAIL_ALLOC_BIT_SINGLE;
2116
2117         if (bargs->profiles & chunk_profile)
2118                 return 0;
2119
2120         return 1;
2121 }
2122
2123 static u64 div_factor_fine(u64 num, int factor)
2124 {
2125         if (factor <= 0)
2126                 return 0;
2127         if (factor >= 100)
2128                 return num;
2129
2130         num *= factor;
2131         do_div(num, 100);
2132         return num;
2133 }
2134
2135 static int chunk_usage_filter(struct btrfs_fs_info *fs_info, u64 chunk_offset,
2136                               struct btrfs_balance_args *bargs)
2137 {
2138         struct btrfs_block_group_cache *cache;
2139         u64 chunk_used, user_thresh;
2140         int ret = 1;
2141
2142         cache = btrfs_lookup_block_group(fs_info, chunk_offset);
2143         chunk_used = btrfs_block_group_used(&cache->item);
2144
2145         user_thresh = div_factor_fine(cache->key.offset, bargs->usage);
2146         if (chunk_used < user_thresh)
2147                 ret = 0;
2148
2149         btrfs_put_block_group(cache);
2150         return ret;
2151 }
2152
2153 static int chunk_devid_filter(struct extent_buffer *leaf,
2154                               struct btrfs_chunk *chunk,
2155                               struct btrfs_balance_args *bargs)
2156 {
2157         struct btrfs_stripe *stripe;
2158         int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
2159         int i;
2160
2161         for (i = 0; i < num_stripes; i++) {
2162                 stripe = btrfs_stripe_nr(chunk, i);
2163                 if (btrfs_stripe_devid(leaf, stripe) == bargs->devid)
2164                         return 0;
2165         }
2166
2167         return 1;
2168 }
2169
2170 /* [pstart, pend) */
2171 static int chunk_drange_filter(struct extent_buffer *leaf,
2172                                struct btrfs_chunk *chunk,
2173                                u64 chunk_offset,
2174                                struct btrfs_balance_args *bargs)
2175 {
2176         struct btrfs_stripe *stripe;
2177         int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
2178         u64 stripe_offset;
2179         u64 stripe_length;
2180         int factor;
2181         int i;
2182
2183         if (!(bargs->flags & BTRFS_BALANCE_ARGS_DEVID))
2184                 return 0;
2185
2186         if (btrfs_chunk_type(leaf, chunk) & (BTRFS_BLOCK_GROUP_DUP |
2187              BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10))
2188                 factor = 2;
2189         else
2190                 factor = 1;
2191         factor = num_stripes / factor;
2192
2193         for (i = 0; i < num_stripes; i++) {
2194                 stripe = btrfs_stripe_nr(chunk, i);
2195                 if (btrfs_stripe_devid(leaf, stripe) != bargs->devid)
2196                         continue;
2197
2198                 stripe_offset = btrfs_stripe_offset(leaf, stripe);
2199                 stripe_length = btrfs_chunk_length(leaf, chunk);
2200                 do_div(stripe_length, factor);
2201
2202                 if (stripe_offset < bargs->pend &&
2203                     stripe_offset + stripe_length > bargs->pstart)
2204                         return 0;
2205         }
2206
2207         return 1;
2208 }
2209
2210 /* [vstart, vend) */
2211 static int chunk_vrange_filter(struct extent_buffer *leaf,
2212                                struct btrfs_chunk *chunk,
2213                                u64 chunk_offset,
2214                                struct btrfs_balance_args *bargs)
2215 {
2216         if (chunk_offset < bargs->vend &&
2217             chunk_offset + btrfs_chunk_length(leaf, chunk) > bargs->vstart)
2218                 /* at least part of the chunk is inside this vrange */
2219                 return 0;
2220
2221         return 1;
2222 }
2223
2224 static int should_balance_chunk(struct btrfs_root *root,
2225                                 struct extent_buffer *leaf,
2226                                 struct btrfs_chunk *chunk, u64 chunk_offset)
2227 {
2228         struct btrfs_balance_control *bctl = root->fs_info->balance_ctl;
2229         struct btrfs_balance_args *bargs = NULL;
2230         u64 chunk_type = btrfs_chunk_type(leaf, chunk);
2231
2232         /* type filter */
2233         if (!((chunk_type & BTRFS_BLOCK_GROUP_TYPE_MASK) &
2234               (bctl->flags & BTRFS_BALANCE_TYPE_MASK))) {
2235                 return 0;
2236         }
2237
2238         if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
2239                 bargs = &bctl->data;
2240         else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
2241                 bargs = &bctl->sys;
2242         else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
2243                 bargs = &bctl->meta;
2244
2245         /* profiles filter */
2246         if ((bargs->flags & BTRFS_BALANCE_ARGS_PROFILES) &&
2247             chunk_profiles_filter(chunk_type, bargs)) {
2248                 return 0;
2249         }
2250
2251         /* usage filter */
2252         if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE) &&
2253             chunk_usage_filter(bctl->fs_info, chunk_offset, bargs)) {
2254                 return 0;
2255         }
2256
2257         /* devid filter */
2258         if ((bargs->flags & BTRFS_BALANCE_ARGS_DEVID) &&
2259             chunk_devid_filter(leaf, chunk, bargs)) {
2260                 return 0;
2261         }
2262
2263         /* drange filter, makes sense only with devid filter */
2264         if ((bargs->flags & BTRFS_BALANCE_ARGS_DRANGE) &&
2265             chunk_drange_filter(leaf, chunk, chunk_offset, bargs)) {
2266                 return 0;
2267         }
2268
2269         /* vrange filter */
2270         if ((bargs->flags & BTRFS_BALANCE_ARGS_VRANGE) &&
2271             chunk_vrange_filter(leaf, chunk, chunk_offset, bargs)) {
2272                 return 0;
2273         }
2274
2275         return 1;
2276 }
2277
2278 static u64 div_factor(u64 num, int factor)
2279 {
2280         if (factor == 10)
2281                 return num;
2282         num *= factor;
2283         do_div(num, 10);
2284         return num;
2285 }
2286
2287 static int __btrfs_balance(struct btrfs_fs_info *fs_info)
2288 {
2289         struct btrfs_root *chunk_root = fs_info->chunk_root;
2290         struct btrfs_root *dev_root = fs_info->dev_root;
2291         struct list_head *devices;
2292         struct btrfs_device *device;
2293         u64 old_size;
2294         u64 size_to_free;
2295         struct btrfs_chunk *chunk;
2296         struct btrfs_path *path;
2297         struct btrfs_key key;
2298         struct btrfs_key found_key;
2299         struct btrfs_trans_handle *trans;
2300         struct extent_buffer *leaf;
2301         int slot;
2302         int ret;
2303         int enospc_errors = 0;
2304
2305         /* step one make some room on all the devices */
2306         devices = &fs_info->fs_devices->devices;
2307         list_for_each_entry(device, devices, dev_list) {
2308                 old_size = device->total_bytes;
2309                 size_to_free = div_factor(old_size, 1);
2310                 size_to_free = min(size_to_free, (u64)1 * 1024 * 1024);
2311                 if (!device->writeable ||
2312                     device->total_bytes - device->bytes_used > size_to_free)
2313                         continue;
2314
2315                 ret = btrfs_shrink_device(device, old_size - size_to_free);
2316                 if (ret == -ENOSPC)
2317                         break;
2318                 BUG_ON(ret);
2319
2320                 trans = btrfs_start_transaction(dev_root, 0);
2321                 BUG_ON(IS_ERR(trans));
2322
2323                 ret = btrfs_grow_device(trans, device, old_size);
2324                 BUG_ON(ret);
2325
2326                 btrfs_end_transaction(trans, dev_root);
2327         }
2328
2329         /* step two, relocate all the chunks */
2330         path = btrfs_alloc_path();
2331         if (!path) {
2332                 ret = -ENOMEM;
2333                 goto error;
2334         }
2335         key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2336         key.offset = (u64)-1;
2337         key.type = BTRFS_CHUNK_ITEM_KEY;
2338
2339         while (1) {
2340                 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
2341                 if (ret < 0)
2342                         goto error;
2343
2344                 /*
2345                  * this shouldn't happen, it means the last relocate
2346                  * failed
2347                  */
2348                 if (ret == 0)
2349                         BUG(); /* FIXME break ? */
2350
2351                 ret = btrfs_previous_item(chunk_root, path, 0,
2352                                           BTRFS_CHUNK_ITEM_KEY);
2353                 if (ret) {
2354                         ret = 0;
2355                         break;
2356                 }
2357
2358                 leaf = path->nodes[0];
2359                 slot = path->slots[0];
2360                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
2361
2362                 if (found_key.objectid != key.objectid)
2363                         break;
2364
2365                 /* chunk zero is special */
2366                 if (found_key.offset == 0)
2367                         break;
2368
2369                 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
2370
2371                 ret = should_balance_chunk(chunk_root, leaf, chunk,
2372                                            found_key.offset);
2373                 btrfs_release_path(path);
2374                 if (!ret)
2375                         goto loop;
2376
2377                 ret = btrfs_relocate_chunk(chunk_root,
2378                                            chunk_root->root_key.objectid,
2379                                            found_key.objectid,
2380                                            found_key.offset);
2381                 if (ret && ret != -ENOSPC)
2382                         goto error;
2383                 if (ret == -ENOSPC)
2384                         enospc_errors++;
2385 loop:
2386                 key.offset = found_key.offset - 1;
2387         }
2388
2389 error:
2390         btrfs_free_path(path);
2391         if (enospc_errors) {
2392                 printk(KERN_INFO "btrfs: %d enospc errors during balance\n",
2393                        enospc_errors);
2394                 if (!ret)
2395                         ret = -ENOSPC;
2396         }
2397
2398         return ret;
2399 }
2400
2401 static void __cancel_balance(struct btrfs_fs_info *fs_info)
2402 {
2403         unset_balance_control(fs_info);
2404 }
2405
2406 void update_ioctl_balance_args(struct btrfs_fs_info *fs_info,
2407                                struct btrfs_ioctl_balance_args *bargs);
2408
2409 /*
2410  * Should be called with both balance and volume mutexes held
2411  */
2412 int btrfs_balance(struct btrfs_balance_control *bctl,
2413                   struct btrfs_ioctl_balance_args *bargs)
2414 {
2415         struct btrfs_fs_info *fs_info = bctl->fs_info;
2416         u64 allowed;
2417         int ret;
2418
2419         if (btrfs_fs_closing(fs_info)) {
2420                 ret = -EINVAL;
2421                 goto out;
2422         }
2423
2424         /*
2425          * In case of mixed groups both data and meta should be picked,
2426          * and identical options should be given for both of them.
2427          */
2428         allowed = btrfs_super_incompat_flags(fs_info->super_copy);
2429         if ((allowed & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) &&
2430             (bctl->flags & (BTRFS_BALANCE_DATA | BTRFS_BALANCE_METADATA))) {
2431                 if (!(bctl->flags & BTRFS_BALANCE_DATA) ||
2432                     !(bctl->flags & BTRFS_BALANCE_METADATA) ||
2433                     memcmp(&bctl->data, &bctl->meta, sizeof(bctl->data))) {
2434                         printk(KERN_ERR "btrfs: with mixed groups data and "
2435                                "metadata balance options must be the same\n");
2436                         ret = -EINVAL;
2437                         goto out;
2438                 }
2439         }
2440
2441         set_balance_control(bctl);
2442
2443         mutex_unlock(&fs_info->balance_mutex);
2444
2445         ret = __btrfs_balance(fs_info);
2446
2447         mutex_lock(&fs_info->balance_mutex);
2448
2449         if (bargs) {
2450                 memset(bargs, 0, sizeof(*bargs));
2451                 update_ioctl_balance_args(fs_info, bargs);
2452         }
2453
2454         __cancel_balance(fs_info);
2455
2456         return ret;
2457 out:
2458         kfree(bctl);
2459         return ret;
2460 }
2461
2462 /*
2463  * shrinking a device means finding all of the device extents past
2464  * the new size, and then following the back refs to the chunks.
2465  * The chunk relocation code actually frees the device extent
2466  */
2467 int btrfs_shrink_device(struct btrfs_device *device, u64 new_size)
2468 {
2469         struct btrfs_trans_handle *trans;
2470         struct btrfs_root *root = device->dev_root;
2471         struct btrfs_dev_extent *dev_extent = NULL;
2472         struct btrfs_path *path;
2473         u64 length;
2474         u64 chunk_tree;
2475         u64 chunk_objectid;
2476         u64 chunk_offset;
2477         int ret;
2478         int slot;
2479         int failed = 0;
2480         bool retried = false;
2481         struct extent_buffer *l;
2482         struct btrfs_key key;
2483         struct btrfs_super_block *super_copy = root->fs_info->super_copy;
2484         u64 old_total = btrfs_super_total_bytes(super_copy);
2485         u64 old_size = device->total_bytes;
2486         u64 diff = device->total_bytes - new_size;
2487
2488         if (new_size >= device->total_bytes)
2489                 return -EINVAL;
2490
2491         path = btrfs_alloc_path();
2492         if (!path)
2493                 return -ENOMEM;
2494
2495         path->reada = 2;
2496
2497         lock_chunks(root);
2498
2499         device->total_bytes = new_size;
2500         if (device->writeable) {
2501                 device->fs_devices->total_rw_bytes -= diff;
2502                 spin_lock(&root->fs_info->free_chunk_lock);
2503                 root->fs_info->free_chunk_space -= diff;
2504                 spin_unlock(&root->fs_info->free_chunk_lock);
2505         }
2506         unlock_chunks(root);
2507
2508 again:
2509         key.objectid = device->devid;
2510         key.offset = (u64)-1;
2511         key.type = BTRFS_DEV_EXTENT_KEY;
2512
2513         while (1) {
2514                 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
2515                 if (ret < 0)
2516                         goto done;
2517
2518                 ret = btrfs_previous_item(root, path, 0, key.type);
2519                 if (ret < 0)
2520                         goto done;
2521                 if (ret) {
2522                         ret = 0;
2523                         btrfs_release_path(path);
2524                         break;
2525                 }
2526
2527                 l = path->nodes[0];
2528                 slot = path->slots[0];
2529                 btrfs_item_key_to_cpu(l, &key, path->slots[0]);
2530
2531                 if (key.objectid != device->devid) {
2532                         btrfs_release_path(path);
2533                         break;
2534                 }
2535
2536                 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
2537                 length = btrfs_dev_extent_length(l, dev_extent);
2538
2539                 if (key.offset + length <= new_size) {
2540                         btrfs_release_path(path);
2541                         break;
2542                 }
2543
2544                 chunk_tree = btrfs_dev_extent_chunk_tree(l, dev_extent);
2545                 chunk_objectid = btrfs_dev_extent_chunk_objectid(l, dev_extent);
2546                 chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);
2547                 btrfs_release_path(path);
2548
2549                 ret = btrfs_relocate_chunk(root, chunk_tree, chunk_objectid,
2550                                            chunk_offset);
2551                 if (ret && ret != -ENOSPC)
2552                         goto done;
2553                 if (ret == -ENOSPC)
2554                         failed++;
2555                 key.offset -= 1;
2556         }
2557
2558         if (failed && !retried) {
2559                 failed = 0;
2560                 retried = true;
2561                 goto again;
2562         } else if (failed && retried) {
2563                 ret = -ENOSPC;
2564                 lock_chunks(root);
2565
2566                 device->total_bytes = old_size;
2567                 if (device->writeable)
2568                         device->fs_devices->total_rw_bytes += diff;
2569                 spin_lock(&root->fs_info->free_chunk_lock);
2570                 root->fs_info->free_chunk_space += diff;
2571                 spin_unlock(&root->fs_info->free_chunk_lock);
2572                 unlock_chunks(root);
2573                 goto done;
2574         }
2575
2576         /* Shrinking succeeded, else we would be at "done". */
2577         trans = btrfs_start_transaction(root, 0);
2578         if (IS_ERR(trans)) {
2579                 ret = PTR_ERR(trans);
2580                 goto done;
2581         }
2582
2583         lock_chunks(root);
2584
2585         device->disk_total_bytes = new_size;
2586         /* Now btrfs_update_device() will change the on-disk size. */
2587         ret = btrfs_update_device(trans, device);
2588         if (ret) {
2589                 unlock_chunks(root);
2590                 btrfs_end_transaction(trans, root);
2591                 goto done;
2592         }
2593         WARN_ON(diff > old_total);
2594         btrfs_set_super_total_bytes(super_copy, old_total - diff);
2595         unlock_chunks(root);
2596         btrfs_end_transaction(trans, root);
2597 done:
2598         btrfs_free_path(path);
2599         return ret;
2600 }
2601
2602 static int btrfs_add_system_chunk(struct btrfs_trans_handle *trans,
2603                            struct btrfs_root *root,
2604                            struct btrfs_key *key,
2605                            struct btrfs_chunk *chunk, int item_size)
2606 {
2607         struct btrfs_super_block *super_copy = root->fs_info->super_copy;
2608         struct btrfs_disk_key disk_key;
2609         u32 array_size;
2610         u8 *ptr;
2611
2612         array_size = btrfs_super_sys_array_size(super_copy);
2613         if (array_size + item_size > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE)
2614                 return -EFBIG;
2615
2616         ptr = super_copy->sys_chunk_array + array_size;
2617         btrfs_cpu_key_to_disk(&disk_key, key);
2618         memcpy(ptr, &disk_key, sizeof(disk_key));
2619         ptr += sizeof(disk_key);
2620         memcpy(ptr, chunk, item_size);
2621         item_size += sizeof(disk_key);
2622         btrfs_set_super_sys_array_size(super_copy, array_size + item_size);
2623         return 0;
2624 }
2625
2626 /*
2627  * sort the devices in descending order by max_avail, total_avail
2628  */
2629 static int btrfs_cmp_device_info(const void *a, const void *b)
2630 {
2631         const struct btrfs_device_info *di_a = a;
2632         const struct btrfs_device_info *di_b = b;
2633
2634         if (di_a->max_avail > di_b->max_avail)
2635                 return -1;
2636         if (di_a->max_avail < di_b->max_avail)
2637                 return 1;
2638         if (di_a->total_avail > di_b->total_avail)
2639                 return -1;
2640         if (di_a->total_avail < di_b->total_avail)
2641                 return 1;
2642         return 0;
2643 }
2644
2645 static int __btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
2646                                struct btrfs_root *extent_root,
2647                                struct map_lookup **map_ret,
2648                                u64 *num_bytes_out, u64 *stripe_size_out,
2649                                u64 start, u64 type)
2650 {
2651         struct btrfs_fs_info *info = extent_root->fs_info;
2652         struct btrfs_fs_devices *fs_devices = info->fs_devices;
2653         struct list_head *cur;
2654         struct map_lookup *map = NULL;
2655         struct extent_map_tree *em_tree;
2656         struct extent_map *em;
2657         struct btrfs_device_info *devices_info = NULL;
2658         u64 total_avail;
2659         int num_stripes;        /* total number of stripes to allocate */
2660         int sub_stripes;        /* sub_stripes info for map */
2661         int dev_stripes;        /* stripes per dev */
2662         int devs_max;           /* max devs to use */
2663         int devs_min;           /* min devs needed */
2664         int devs_increment;     /* ndevs has to be a multiple of this */
2665         int ncopies;            /* how many copies to data has */
2666         int ret;
2667         u64 max_stripe_size;
2668         u64 max_chunk_size;
2669         u64 stripe_size;
2670         u64 num_bytes;
2671         int ndevs;
2672         int i;
2673         int j;
2674
2675         if ((type & BTRFS_BLOCK_GROUP_RAID1) &&
2676             (type & BTRFS_BLOCK_GROUP_DUP)) {
2677                 WARN_ON(1);
2678                 type &= ~BTRFS_BLOCK_GROUP_DUP;
2679         }
2680
2681         if (list_empty(&fs_devices->alloc_list))
2682                 return -ENOSPC;
2683
2684         sub_stripes = 1;
2685         dev_stripes = 1;
2686         devs_increment = 1;
2687         ncopies = 1;
2688         devs_max = 0;   /* 0 == as many as possible */
2689         devs_min = 1;
2690
2691         /*
2692          * define the properties of each RAID type.
2693          * FIXME: move this to a global table and use it in all RAID
2694          * calculation code
2695          */
2696         if (type & (BTRFS_BLOCK_GROUP_DUP)) {
2697                 dev_stripes = 2;
2698                 ncopies = 2;
2699                 devs_max = 1;
2700         } else if (type & (BTRFS_BLOCK_GROUP_RAID0)) {
2701                 devs_min = 2;
2702         } else if (type & (BTRFS_BLOCK_GROUP_RAID1)) {
2703                 devs_increment = 2;
2704                 ncopies = 2;
2705                 devs_max = 2;
2706                 devs_min = 2;
2707         } else if (type & (BTRFS_BLOCK_GROUP_RAID10)) {
2708                 sub_stripes = 2;
2709                 devs_increment = 2;
2710                 ncopies = 2;
2711                 devs_min = 4;
2712         } else {
2713                 devs_max = 1;
2714         }
2715
2716         if (type & BTRFS_BLOCK_GROUP_DATA) {
2717                 max_stripe_size = 1024 * 1024 * 1024;
2718                 max_chunk_size = 10 * max_stripe_size;
2719         } else if (type & BTRFS_BLOCK_GROUP_METADATA) {
2720                 max_stripe_size = 256 * 1024 * 1024;
2721                 max_chunk_size = max_stripe_size;
2722         } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) {
2723                 max_stripe_size = 8 * 1024 * 1024;
2724                 max_chunk_size = 2 * max_stripe_size;
2725         } else {
2726                 printk(KERN_ERR "btrfs: invalid chunk type 0x%llx requested\n",
2727                        type);
2728                 BUG_ON(1);
2729         }
2730
2731         /* we don't want a chunk larger than 10% of writeable space */
2732         max_chunk_size = min(div_factor(fs_devices->total_rw_bytes, 1),
2733                              max_chunk_size);
2734
2735         devices_info = kzalloc(sizeof(*devices_info) * fs_devices->rw_devices,
2736                                GFP_NOFS);
2737         if (!devices_info)
2738                 return -ENOMEM;
2739
2740         cur = fs_devices->alloc_list.next;
2741
2742         /*
2743          * in the first pass through the devices list, we gather information
2744          * about the available holes on each device.
2745          */
2746         ndevs = 0;
2747         while (cur != &fs_devices->alloc_list) {
2748                 struct btrfs_device *device;
2749                 u64 max_avail;
2750                 u64 dev_offset;
2751
2752                 device = list_entry(cur, struct btrfs_device, dev_alloc_list);
2753
2754                 cur = cur->next;
2755
2756                 if (!device->writeable) {
2757                         printk(KERN_ERR
2758                                "btrfs: read-only device in alloc_list\n");
2759                         WARN_ON(1);
2760                         continue;
2761                 }
2762
2763                 if (!device->in_fs_metadata)
2764                         continue;
2765
2766                 if (device->total_bytes > device->bytes_used)
2767                         total_avail = device->total_bytes - device->bytes_used;
2768                 else
2769                         total_avail = 0;
2770
2771                 /* If there is no space on this device, skip it. */
2772                 if (total_avail == 0)
2773                         continue;
2774
2775                 ret = find_free_dev_extent(trans, device,
2776                                            max_stripe_size * dev_stripes,
2777                                            &dev_offset, &max_avail);
2778                 if (ret && ret != -ENOSPC)
2779                         goto error;
2780
2781                 if (ret == 0)
2782                         max_avail = max_stripe_size * dev_stripes;
2783
2784                 if (max_avail < BTRFS_STRIPE_LEN * dev_stripes)
2785                         continue;
2786
2787                 devices_info[ndevs].dev_offset = dev_offset;
2788                 devices_info[ndevs].max_avail = max_avail;
2789                 devices_info[ndevs].total_avail = total_avail;
2790                 devices_info[ndevs].dev = device;
2791                 ++ndevs;
2792         }
2793
2794         /*
2795          * now sort the devices by hole size / available space
2796          */
2797         sort(devices_info, ndevs, sizeof(struct btrfs_device_info),
2798              btrfs_cmp_device_info, NULL);
2799
2800         /* round down to number of usable stripes */
2801         ndevs -= ndevs % devs_increment;
2802
2803         if (ndevs < devs_increment * sub_stripes || ndevs < devs_min) {
2804                 ret = -ENOSPC;
2805                 goto error;
2806         }
2807
2808         if (devs_max && ndevs > devs_max)
2809                 ndevs = devs_max;
2810         /*
2811          * the primary goal is to maximize the number of stripes, so use as many
2812          * devices as possible, even if the stripes are not maximum sized.
2813          */
2814         stripe_size = devices_info[ndevs-1].max_avail;
2815         num_stripes = ndevs * dev_stripes;
2816
2817         if (stripe_size * num_stripes > max_chunk_size * ncopies) {
2818                 stripe_size = max_chunk_size * ncopies;
2819                 do_div(stripe_size, num_stripes);
2820         }
2821
2822         do_div(stripe_size, dev_stripes);
2823         do_div(stripe_size, BTRFS_STRIPE_LEN);
2824         stripe_size *= BTRFS_STRIPE_LEN;
2825
2826         map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
2827         if (!map) {
2828                 ret = -ENOMEM;
2829                 goto error;
2830         }
2831         map->num_stripes = num_stripes;
2832
2833         for (i = 0; i < ndevs; ++i) {
2834                 for (j = 0; j < dev_stripes; ++j) {
2835                         int s = i * dev_stripes + j;
2836                         map->stripes[s].dev = devices_info[i].dev;
2837                         map->stripes[s].physical = devices_info[i].dev_offset +
2838                                                    j * stripe_size;
2839                 }
2840         }
2841         map->sector_size = extent_root->sectorsize;
2842         map->stripe_len = BTRFS_STRIPE_LEN;
2843         map->io_align = BTRFS_STRIPE_LEN;
2844         map->io_width = BTRFS_STRIPE_LEN;
2845         map->type = type;
2846         map->sub_stripes = sub_stripes;
2847
2848         *map_ret = map;
2849         num_bytes = stripe_size * (num_stripes / ncopies);
2850
2851         *stripe_size_out = stripe_size;
2852         *num_bytes_out = num_bytes;
2853
2854         trace_btrfs_chunk_alloc(info->chunk_root, map, start, num_bytes);
2855
2856         em = alloc_extent_map();
2857         if (!em) {
2858                 ret = -ENOMEM;
2859                 goto error;
2860         }
2861         em->bdev = (struct block_device *)map;
2862         em->start = start;
2863         em->len = num_bytes;
2864         em->block_start = 0;
2865         em->block_len = em->len;
2866
2867         em_tree = &extent_root->fs_info->mapping_tree.map_tree;
2868         write_lock(&em_tree->lock);
2869         ret = add_extent_mapping(em_tree, em);
2870         write_unlock(&em_tree->lock);
2871         BUG_ON(ret);
2872         free_extent_map(em);
2873
2874         ret = btrfs_make_block_group(trans, extent_root, 0, type,
2875                                      BTRFS_FIRST_CHUNK_TREE_OBJECTID,
2876                                      start, num_bytes);
2877         BUG_ON(ret);
2878
2879         for (i = 0; i < map->num_stripes; ++i) {
2880                 struct btrfs_device *device;
2881                 u64 dev_offset;
2882
2883                 device = map->stripes[i].dev;
2884                 dev_offset = map->stripes[i].physical;
2885
2886                 ret = btrfs_alloc_dev_extent(trans, device,
2887                                 info->chunk_root->root_key.objectid,
2888                                 BTRFS_FIRST_CHUNK_TREE_OBJECTID,
2889                                 start, dev_offset, stripe_size);
2890                 BUG_ON(ret);
2891         }
2892
2893         kfree(devices_info);
2894         return 0;
2895
2896 error:
2897         kfree(map);
2898         kfree(devices_info);
2899         return ret;
2900 }
2901
2902 static int __finish_chunk_alloc(struct btrfs_trans_handle *trans,
2903                                 struct btrfs_root *extent_root,
2904                                 struct map_lookup *map, u64 chunk_offset,
2905                                 u64 chunk_size, u64 stripe_size)
2906 {
2907         u64 dev_offset;
2908         struct btrfs_key key;
2909         struct btrfs_root *chunk_root = extent_root->fs_info->chunk_root;
2910         struct btrfs_device *device;
2911         struct btrfs_chunk *chunk;
2912         struct btrfs_stripe *stripe;
2913         size_t item_size = btrfs_chunk_item_size(map->num_stripes);
2914         int index = 0;
2915         int ret;
2916
2917         chunk = kzalloc(item_size, GFP_NOFS);
2918         if (!chunk)
2919                 return -ENOMEM;
2920
2921         index = 0;
2922         while (index < map->num_stripes) {
2923                 device = map->stripes[index].dev;
2924                 device->bytes_used += stripe_size;
2925                 ret = btrfs_update_device(trans, device);
2926                 BUG_ON(ret);
2927                 index++;
2928         }
2929
2930         spin_lock(&extent_root->fs_info->free_chunk_lock);
2931         extent_root->fs_info->free_chunk_space -= (stripe_size *
2932                                                    map->num_stripes);
2933         spin_unlock(&extent_root->fs_info->free_chunk_lock);
2934
2935         index = 0;
2936         stripe = &chunk->stripe;
2937         while (index < map->num_stripes) {
2938                 device = map->stripes[index].dev;
2939                 dev_offset = map->stripes[index].physical;
2940
2941                 btrfs_set_stack_stripe_devid(stripe, device->devid);
2942                 btrfs_set_stack_stripe_offset(stripe, dev_offset);
2943                 memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE);
2944                 stripe++;
2945                 index++;
2946         }
2947
2948         btrfs_set_stack_chunk_length(chunk, chunk_size);
2949         btrfs_set_stack_chunk_owner(chunk, extent_root->root_key.objectid);
2950         btrfs_set_stack_chunk_stripe_len(chunk, map->stripe_len);
2951         btrfs_set_stack_chunk_type(chunk, map->type);
2952         btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes);
2953         btrfs_set_stack_chunk_io_align(chunk, map->stripe_len);
2954         btrfs_set_stack_chunk_io_width(chunk, map->stripe_len);
2955         btrfs_set_stack_chunk_sector_size(chunk, extent_root->sectorsize);
2956         btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes);
2957
2958         key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2959         key.type = BTRFS_CHUNK_ITEM_KEY;
2960         key.offset = chunk_offset;
2961
2962         ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size);
2963         BUG_ON(ret);
2964
2965         if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
2966                 ret = btrfs_add_system_chunk(trans, chunk_root, &key, chunk,
2967                                              item_size);
2968                 BUG_ON(ret);
2969         }
2970
2971         kfree(chunk);
2972         return 0;
2973 }
2974
2975 /*
2976  * Chunk allocation falls into two parts. The first part does works
2977  * that make the new allocated chunk useable, but not do any operation
2978  * that modifies the chunk tree. The second part does the works that
2979  * require modifying the chunk tree. This division is important for the
2980  * bootstrap process of adding storage to a seed btrfs.
2981  */
2982 int btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
2983                       struct btrfs_root *extent_root, u64 type)
2984 {
2985         u64 chunk_offset;
2986         u64 chunk_size;
2987         u64 stripe_size;
2988         struct map_lookup *map;
2989         struct btrfs_root *chunk_root = extent_root->fs_info->chunk_root;
2990         int ret;
2991
2992         ret = find_next_chunk(chunk_root, BTRFS_FIRST_CHUNK_TREE_OBJECTID,
2993                               &chunk_offset);
2994         if (ret)
2995                 return ret;
2996
2997         ret = __btrfs_alloc_chunk(trans, extent_root, &map, &chunk_size,
2998                                   &stripe_size, chunk_offset, type);
2999         if (ret)
3000                 return ret;
3001
3002         ret = __finish_chunk_alloc(trans, extent_root, map, chunk_offset,
3003                                    chunk_size, stripe_size);
3004         BUG_ON(ret);
3005         return 0;
3006 }
3007
3008 static noinline int init_first_rw_device(struct btrfs_trans_handle *trans,
3009                                          struct btrfs_root *root,
3010                                          struct btrfs_device *device)
3011 {
3012         u64 chunk_offset;
3013         u64 sys_chunk_offset;
3014         u64 chunk_size;
3015         u64 sys_chunk_size;
3016         u64 stripe_size;
3017         u64 sys_stripe_size;
3018         u64 alloc_profile;
3019         struct map_lookup *map;
3020         struct map_lookup *sys_map;
3021         struct btrfs_fs_info *fs_info = root->fs_info;
3022         struct btrfs_root *extent_root = fs_info->extent_root;
3023         int ret;
3024
3025         ret = find_next_chunk(fs_info->chunk_root,
3026                               BTRFS_FIRST_CHUNK_TREE_OBJECTID, &chunk_offset);
3027         if (ret)
3028                 return ret;
3029
3030         alloc_profile = BTRFS_BLOCK_GROUP_METADATA |
3031                                 fs_info->avail_metadata_alloc_bits;
3032         alloc_profile = btrfs_reduce_alloc_profile(root, alloc_profile);
3033
3034         ret = __btrfs_alloc_chunk(trans, extent_root, &map, &chunk_size,
3035                                   &stripe_size, chunk_offset, alloc_profile);
3036         BUG_ON(ret);
3037
3038         sys_chunk_offset = chunk_offset + chunk_size;
3039
3040         alloc_profile = BTRFS_BLOCK_GROUP_SYSTEM |
3041                                 fs_info->avail_system_alloc_bits;
3042         alloc_profile = btrfs_reduce_alloc_profile(root, alloc_profile);
3043
3044         ret = __btrfs_alloc_chunk(trans, extent_root, &sys_map,
3045                                   &sys_chunk_size, &sys_stripe_size,
3046                                   sys_chunk_offset, alloc_profile);
3047         BUG_ON(ret);
3048
3049         ret = btrfs_add_device(trans, fs_info->chunk_root, device);
3050         BUG_ON(ret);
3051
3052         /*
3053          * Modifying chunk tree needs allocating new blocks from both
3054          * system block group and metadata block group. So we only can
3055          * do operations require modifying the chunk tree after both
3056          * block groups were created.
3057          */
3058         ret = __finish_chunk_alloc(trans, extent_root, map, chunk_offset,
3059                                    chunk_size, stripe_size);
3060         BUG_ON(ret);
3061
3062         ret = __finish_chunk_alloc(trans, extent_root, sys_map,
3063                                    sys_chunk_offset, sys_chunk_size,
3064                                    sys_stripe_size);
3065         BUG_ON(ret);
3066         return 0;
3067 }
3068
3069 int btrfs_chunk_readonly(struct btrfs_root *root, u64 chunk_offset)
3070 {
3071         struct extent_map *em;
3072         struct map_lookup *map;
3073         struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree;
3074         int readonly = 0;
3075         int i;
3076
3077         read_lock(&map_tree->map_tree.lock);
3078         em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1);
3079         read_unlock(&map_tree->map_tree.lock);
3080         if (!em)
3081                 return 1;
3082
3083         if (btrfs_test_opt(root, DEGRADED)) {
3084                 free_extent_map(em);
3085                 return 0;
3086         }
3087
3088         map = (struct map_lookup *)em->bdev;
3089         for (i = 0; i < map->num_stripes; i++) {
3090                 if (!map->stripes[i].dev->writeable) {
3091                         readonly = 1;
3092                         break;
3093                 }
3094         }
3095         free_extent_map(em);
3096         return readonly;
3097 }
3098
3099 void btrfs_mapping_init(struct btrfs_mapping_tree *tree)
3100 {
3101         extent_map_tree_init(&tree->map_tree);
3102 }
3103
3104 void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree)
3105 {
3106         struct extent_map *em;
3107
3108         while (1) {
3109                 write_lock(&tree->map_tree.lock);
3110                 em = lookup_extent_mapping(&tree->map_tree, 0, (u64)-1);
3111                 if (em)
3112                         remove_extent_mapping(&tree->map_tree, em);
3113                 write_unlock(&tree->map_tree.lock);
3114                 if (!em)
3115                         break;
3116                 kfree(em->bdev);
3117                 /* once for us */
3118                 free_extent_map(em);
3119                 /* once for the tree */
3120                 free_extent_map(em);
3121         }
3122 }
3123
3124 int btrfs_num_copies(struct btrfs_mapping_tree *map_tree, u64 logical, u64 len)
3125 {
3126         struct extent_map *em;
3127         struct map_lookup *map;
3128         struct extent_map_tree *em_tree = &map_tree->map_tree;
3129         int ret;
3130
3131         read_lock(&em_tree->lock);
3132         em = lookup_extent_mapping(em_tree, logical, len);
3133         read_unlock(&em_tree->lock);
3134         BUG_ON(!em);
3135
3136         BUG_ON(em->start > logical || em->start + em->len < logical);
3137         map = (struct map_lookup *)em->bdev;
3138         if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1))
3139                 ret = map->num_stripes;
3140         else if (map->type & BTRFS_BLOCK_GROUP_RAID10)
3141                 ret = map->sub_stripes;
3142         else
3143                 ret = 1;
3144         free_extent_map(em);
3145         return ret;
3146 }
3147
3148 static int find_live_mirror(struct map_lookup *map, int first, int num,
3149                             int optimal)
3150 {
3151         int i;
3152         if (map->stripes[optimal].dev->bdev)
3153                 return optimal;
3154         for (i = first; i < first + num; i++) {
3155                 if (map->stripes[i].dev->bdev)
3156                         return i;
3157         }
3158         /* we couldn't find one that doesn't fail.  Just return something
3159          * and the io error handling code will clean up eventually
3160          */
3161         return optimal;
3162 }
3163
3164 static int __btrfs_map_block(struct btrfs_mapping_tree *map_tree, int rw,
3165                              u64 logical, u64 *length,
3166                              struct btrfs_bio **bbio_ret,
3167                              int mirror_num)
3168 {
3169         struct extent_map *em;
3170         struct map_lookup *map;
3171         struct extent_map_tree *em_tree = &map_tree->map_tree;
3172         u64 offset;
3173         u64 stripe_offset;
3174         u64 stripe_end_offset;
3175         u64 stripe_nr;
3176         u64 stripe_nr_orig;
3177         u64 stripe_nr_end;
3178         int stripes_allocated = 8;
3179         int stripes_required = 1;
3180         int stripe_index;
3181         int i;
3182         int num_stripes;
3183         int max_errors = 0;
3184         struct btrfs_bio *bbio = NULL;
3185
3186         if (bbio_ret && !(rw & (REQ_WRITE | REQ_DISCARD)))
3187                 stripes_allocated = 1;
3188 again:
3189         if (bbio_ret) {
3190                 bbio = kzalloc(btrfs_bio_size(stripes_allocated),
3191                                 GFP_NOFS);
3192                 if (!bbio)
3193                         return -ENOMEM;
3194
3195                 atomic_set(&bbio->error, 0);
3196         }
3197
3198         read_lock(&em_tree->lock);
3199         em = lookup_extent_mapping(em_tree, logical, *length);
3200         read_unlock(&em_tree->lock);
3201
3202         if (!em) {
3203                 printk(KERN_CRIT "unable to find logical %llu len %llu\n",
3204                        (unsigned long long)logical,
3205                        (unsigned long long)*length);
3206                 BUG();
3207         }
3208
3209         BUG_ON(em->start > logical || em->start + em->len < logical);
3210         map = (struct map_lookup *)em->bdev;
3211         offset = logical - em->start;
3212
3213         if (mirror_num > map->num_stripes)
3214                 mirror_num = 0;
3215
3216         /* if our btrfs_bio struct is too small, back off and try again */
3217         if (rw & REQ_WRITE) {
3218                 if (map->type & (BTRFS_BLOCK_GROUP_RAID1 |
3219                                  BTRFS_BLOCK_GROUP_DUP)) {
3220                         stripes_required = map->num_stripes;
3221                         max_errors = 1;
3222                 } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
3223                         stripes_required = map->sub_stripes;
3224                         max_errors = 1;
3225                 }
3226         }
3227         if (rw & REQ_DISCARD) {
3228                 if (map->type & BTRFS_BLOCK_GROUP_PROFILE_MASK)
3229                         stripes_required = map->num_stripes;
3230         }
3231         if (bbio_ret && (rw & (REQ_WRITE | REQ_DISCARD)) &&
3232             stripes_allocated < stripes_required) {
3233                 stripes_allocated = map->num_stripes;
3234                 free_extent_map(em);
3235                 kfree(bbio);
3236                 goto again;
3237         }
3238         stripe_nr = offset;
3239         /*
3240          * stripe_nr counts the total number of stripes we have to stride
3241          * to get to this block
3242          */
3243         do_div(stripe_nr, map->stripe_len);
3244
3245         stripe_offset = stripe_nr * map->stripe_len;
3246         BUG_ON(offset < stripe_offset);
3247
3248         /* stripe_offset is the offset of this block in its stripe*/
3249         stripe_offset = offset - stripe_offset;
3250
3251         if (rw & REQ_DISCARD)
3252                 *length = min_t(u64, em->len - offset, *length);
3253         else if (map->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
3254                 /* we limit the length of each bio to what fits in a stripe */
3255                 *length = min_t(u64, em->len - offset,
3256                                 map->stripe_len - stripe_offset);
3257         } else {
3258                 *length = em->len - offset;
3259         }
3260
3261         if (!bbio_ret)
3262                 goto out;
3263
3264         num_stripes = 1;
3265         stripe_index = 0;
3266         stripe_nr_orig = stripe_nr;
3267         stripe_nr_end = (offset + *length + map->stripe_len - 1) &
3268                         (~(map->stripe_len - 1));
3269         do_div(stripe_nr_end, map->stripe_len);
3270         stripe_end_offset = stripe_nr_end * map->stripe_len -
3271                             (offset + *length);
3272         if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
3273                 if (rw & REQ_DISCARD)
3274                         num_stripes = min_t(u64, map->num_stripes,
3275                                             stripe_nr_end - stripe_nr_orig);
3276                 stripe_index = do_div(stripe_nr, map->num_stripes);
3277         } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) {
3278                 if (rw & (REQ_WRITE | REQ_DISCARD))
3279                         num_stripes = map->num_stripes;
3280                 else if (mirror_num)
3281                         stripe_index = mirror_num - 1;
3282                 else {
3283                         stripe_index = find_live_mirror(map, 0,
3284                                             map->num_stripes,
3285                                             current->pid % map->num_stripes);
3286                         mirror_num = stripe_index + 1;
3287                 }
3288
3289         } else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
3290                 if (rw & (REQ_WRITE | REQ_DISCARD)) {
3291                         num_stripes = map->num_stripes;
3292                 } else if (mirror_num) {
3293                         stripe_index = mirror_num - 1;
3294                 } else {
3295                         mirror_num = 1;
3296                 }
3297
3298         } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
3299                 int factor = map->num_stripes / map->sub_stripes;
3300
3301                 stripe_index = do_div(stripe_nr, factor);
3302                 stripe_index *= map->sub_stripes;
3303
3304                 if (rw & REQ_WRITE)
3305                         num_stripes = map->sub_stripes;
3306                 else if (rw & REQ_DISCARD)
3307                         num_stripes = min_t(u64, map->sub_stripes *
3308                                             (stripe_nr_end - stripe_nr_orig),
3309                                             map->num_stripes);
3310                 else if (mirror_num)
3311                         stripe_index += mirror_num - 1;
3312                 else {
3313                         stripe_index = find_live_mirror(map, stripe_index,
3314                                               map->sub_stripes, stripe_index +
3315                                               current->pid % map->sub_stripes);
3316                         mirror_num = stripe_index + 1;
3317                 }
3318         } else {
3319                 /*
3320                  * after this do_div call, stripe_nr is the number of stripes
3321                  * on this device we have to walk to find the data, and
3322                  * stripe_index is the number of our device in the stripe array
3323                  */
3324                 stripe_index = do_div(stripe_nr, map->num_stripes);
3325                 mirror_num = stripe_index + 1;
3326         }
3327         BUG_ON(stripe_index >= map->num_stripes);
3328
3329         if (rw & REQ_DISCARD) {
3330                 for (i = 0; i < num_stripes; i++) {
3331                         bbio->stripes[i].physical =
3332                                 map->stripes[stripe_index].physical +
3333                                 stripe_offset + stripe_nr * map->stripe_len;
3334                         bbio->stripes[i].dev = map->stripes[stripe_index].dev;
3335
3336                         if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
3337                                 u64 stripes;
3338                                 u32 last_stripe = 0;
3339                                 int j;
3340
3341                                 div_u64_rem(stripe_nr_end - 1,
3342                                             map->num_stripes,
3343                                             &last_stripe);
3344
3345                                 for (j = 0; j < map->num_stripes; j++) {
3346                                         u32 test;
3347
3348                                         div_u64_rem(stripe_nr_end - 1 - j,
3349                                                     map->num_stripes, &test);
3350                                         if (test == stripe_index)
3351                                                 break;
3352                                 }
3353                                 stripes = stripe_nr_end - 1 - j;
3354                                 do_div(stripes, map->num_stripes);
3355                                 bbio->stripes[i].length = map->stripe_len *
3356                                         (stripes - stripe_nr + 1);
3357
3358                                 if (i == 0) {
3359                                         bbio->stripes[i].length -=
3360                                                 stripe_offset;
3361                                         stripe_offset = 0;
3362                                 }
3363                                 if (stripe_index == last_stripe)
3364                                         bbio->stripes[i].length -=
3365                                                 stripe_end_offset;
3366                         } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
3367                                 u64 stripes;
3368                                 int j;
3369                                 int factor = map->num_stripes /
3370                                              map->sub_stripes;
3371                                 u32 last_stripe = 0;
3372
3373                                 div_u64_rem(stripe_nr_end - 1,
3374                                             factor, &last_stripe);
3375                                 last_stripe *= map->sub_stripes;
3376
3377                                 for (j = 0; j < factor; j++) {
3378                                         u32 test;
3379
3380                                         div_u64_rem(stripe_nr_end - 1 - j,
3381                                                     factor, &test);
3382
3383                                         if (test ==
3384                                             stripe_index / map->sub_stripes)
3385                                                 break;
3386                                 }
3387                                 stripes = stripe_nr_end - 1 - j;
3388                                 do_div(stripes, factor);
3389                                 bbio->stripes[i].length = map->stripe_len *
3390                                         (stripes - stripe_nr + 1);
3391
3392                                 if (i < map->sub_stripes) {
3393                                         bbio->stripes[i].length -=
3394                                                 stripe_offset;
3395                                         if (i == map->sub_stripes - 1)
3396                                                 stripe_offset = 0;
3397                                 }
3398                                 if (stripe_index >= last_stripe &&
3399                                     stripe_index <= (last_stripe +
3400                                                      map->sub_stripes - 1)) {
3401                                         bbio->stripes[i].length -=
3402                                                 stripe_end_offset;
3403                                 }
3404                         } else
3405                                 bbio->stripes[i].length = *length;
3406
3407                         stripe_index++;
3408                         if (stripe_index == map->num_stripes) {
3409                                 /* This could only happen for RAID0/10 */
3410                                 stripe_index = 0;
3411                                 stripe_nr++;
3412                         }
3413                 }
3414         } else {
3415                 for (i = 0; i < num_stripes; i++) {
3416                         bbio->stripes[i].physical =
3417                                 map->stripes[stripe_index].physical +
3418                                 stripe_offset +
3419                                 stripe_nr * map->stripe_len;
3420                         bbio->stripes[i].dev =
3421                                 map->stripes[stripe_index].dev;
3422                         stripe_index++;
3423                 }
3424         }
3425         if (bbio_ret) {
3426                 *bbio_ret = bbio;
3427                 bbio->num_stripes = num_stripes;
3428                 bbio->max_errors = max_errors;
3429                 bbio->mirror_num = mirror_num;
3430         }
3431 out:
3432         free_extent_map(em);
3433         return 0;
3434 }
3435
3436 int btrfs_map_block(struct btrfs_mapping_tree *map_tree, int rw,
3437                       u64 logical, u64 *length,
3438                       struct btrfs_bio **bbio_ret, int mirror_num)
3439 {
3440         return __btrfs_map_block(map_tree, rw, logical, length, bbio_ret,
3441                                  mirror_num);
3442 }
3443
3444 int btrfs_rmap_block(struct btrfs_mapping_tree *map_tree,
3445                      u64 chunk_start, u64 physical, u64 devid,
3446                      u64 **logical, int *naddrs, int *stripe_len)
3447 {
3448         struct extent_map_tree *em_tree = &map_tree->map_tree;
3449         struct extent_map *em;
3450         struct map_lookup *map;
3451         u64 *buf;
3452         u64 bytenr;
3453         u64 length;
3454         u64 stripe_nr;
3455         int i, j, nr = 0;
3456
3457         read_lock(&em_tree->lock);
3458         em = lookup_extent_mapping(em_tree, chunk_start, 1);
3459         read_unlock(&em_tree->lock);
3460
3461         BUG_ON(!em || em->start != chunk_start);
3462         map = (struct map_lookup *)em->bdev;
3463
3464         length = em->len;
3465         if (map->type & BTRFS_BLOCK_GROUP_RAID10)
3466                 do_div(length, map->num_stripes / map->sub_stripes);
3467         else if (map->type & BTRFS_BLOCK_GROUP_RAID0)
3468                 do_div(length, map->num_stripes);
3469
3470         buf = kzalloc(sizeof(u64) * map->num_stripes, GFP_NOFS);
3471         BUG_ON(!buf);
3472
3473         for (i = 0; i < map->num_stripes; i++) {
3474                 if (devid && map->stripes[i].dev->devid != devid)
3475                         continue;
3476                 if (map->stripes[i].physical > physical ||
3477                     map->stripes[i].physical + length <= physical)
3478                         continue;
3479
3480                 stripe_nr = physical - map->stripes[i].physical;
3481                 do_div(stripe_nr, map->stripe_len);
3482
3483                 if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
3484                         stripe_nr = stripe_nr * map->num_stripes + i;
3485                         do_div(stripe_nr, map->sub_stripes);
3486                 } else if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
3487                         stripe_nr = stripe_nr * map->num_stripes + i;
3488                 }
3489                 bytenr = chunk_start + stripe_nr * map->stripe_len;
3490                 WARN_ON(nr >= map->num_stripes);
3491                 for (j = 0; j < nr; j++) {
3492                         if (buf[j] == bytenr)
3493                                 break;
3494                 }
3495                 if (j == nr) {
3496                         WARN_ON(nr >= map->num_stripes);
3497                         buf[nr++] = bytenr;
3498                 }
3499         }
3500
3501         *logical = buf;
3502         *naddrs = nr;
3503         *stripe_len = map->stripe_len;
3504
3505         free_extent_map(em);
3506         return 0;
3507 }
3508
3509 static void btrfs_end_bio(struct bio *bio, int err)
3510 {
3511         struct btrfs_bio *bbio = bio->bi_private;
3512         int is_orig_bio = 0;
3513
3514         if (err)
3515                 atomic_inc(&bbio->error);
3516
3517         if (bio == bbio->orig_bio)
3518                 is_orig_bio = 1;
3519
3520         if (atomic_dec_and_test(&bbio->stripes_pending)) {
3521                 if (!is_orig_bio) {
3522                         bio_put(bio);
3523                         bio = bbio->orig_bio;
3524                 }
3525                 bio->bi_private = bbio->private;
3526                 bio->bi_end_io = bbio->end_io;
3527                 bio->bi_bdev = (struct block_device *)
3528                                         (unsigned long)bbio->mirror_num;
3529                 /* only send an error to the higher layers if it is
3530                  * beyond the tolerance of the multi-bio
3531                  */
3532                 if (atomic_read(&bbio->error) > bbio->max_errors) {
3533                         err = -EIO;
3534                 } else {
3535                         /*
3536                          * this bio is actually up to date, we didn't
3537                          * go over the max number of errors
3538                          */
3539                         set_bit(BIO_UPTODATE, &bio->bi_flags);
3540                         err = 0;
3541                 }
3542                 kfree(bbio);
3543
3544                 bio_endio(bio, err);
3545         } else if (!is_orig_bio) {
3546                 bio_put(bio);
3547         }
3548 }
3549
3550 struct async_sched {
3551         struct bio *bio;
3552         int rw;
3553         struct btrfs_fs_info *info;
3554         struct btrfs_work work;
3555 };
3556
3557 /*
3558  * see run_scheduled_bios for a description of why bios are collected for
3559  * async submit.
3560  *
3561  * This will add one bio to the pending list for a device and make sure
3562  * the work struct is scheduled.
3563  */
3564 static noinline int schedule_bio(struct btrfs_root *root,
3565                                  struct btrfs_device *device,
3566                                  int rw, struct bio *bio)
3567 {
3568         int should_queue = 1;
3569         struct btrfs_pending_bios *pending_bios;
3570
3571         /* don't bother with additional async steps for reads, right now */
3572         if (!(rw & REQ_WRITE)) {
3573                 bio_get(bio);
3574                 submit_bio(rw, bio);
3575                 bio_put(bio);
3576                 return 0;
3577         }
3578
3579         /*
3580          * nr_async_bios allows us to reliably return congestion to the
3581          * higher layers.  Otherwise, the async bio makes it appear we have
3582          * made progress against dirty pages when we've really just put it
3583          * on a queue for later
3584          */
3585         atomic_inc(&root->fs_info->nr_async_bios);
3586         WARN_ON(bio->bi_next);
3587         bio->bi_next = NULL;
3588         bio->bi_rw |= rw;
3589
3590         spin_lock(&device->io_lock);
3591         if (bio->bi_rw & REQ_SYNC)
3592                 pending_bios = &device->pending_sync_bios;
3593         else
3594                 pending_bios = &device->pending_bios;
3595
3596         if (pending_bios->tail)
3597                 pending_bios->tail->bi_next = bio;
3598
3599         pending_bios->tail = bio;
3600         if (!pending_bios->head)
3601                 pending_bios->head = bio;
3602         if (device->running_pending)
3603                 should_queue = 0;
3604
3605         spin_unlock(&device->io_lock);
3606
3607         if (should_queue)
3608                 btrfs_queue_worker(&root->fs_info->submit_workers,
3609                                    &device->work);
3610         return 0;
3611 }
3612
3613 int btrfs_map_bio(struct btrfs_root *root, int rw, struct bio *bio,
3614                   int mirror_num, int async_submit)
3615 {
3616         struct btrfs_mapping_tree *map_tree;
3617         struct btrfs_device *dev;
3618         struct bio *first_bio = bio;
3619         u64 logical = (u64)bio->bi_sector << 9;
3620         u64 length = 0;
3621         u64 map_length;
3622         int ret;
3623         int dev_nr = 0;
3624         int total_devs = 1;
3625         struct btrfs_bio *bbio = NULL;
3626
3627         length = bio->bi_size;
3628         map_tree = &root->fs_info->mapping_tree;
3629         map_length = length;
3630
3631         ret = btrfs_map_block(map_tree, rw, logical, &map_length, &bbio,
3632                               mirror_num);
3633         BUG_ON(ret);
3634
3635         total_devs = bbio->num_stripes;
3636         if (map_length < length) {
3637                 printk(KERN_CRIT "mapping failed logical %llu bio len %llu "
3638                        "len %llu\n", (unsigned long long)logical,
3639                        (unsigned long long)length,
3640                        (unsigned long long)map_length);
3641                 BUG();
3642         }
3643
3644         bbio->orig_bio = first_bio;
3645         bbio->private = first_bio->bi_private;
3646         bbio->end_io = first_bio->bi_end_io;
3647         atomic_set(&bbio->stripes_pending, bbio->num_stripes);
3648
3649         while (dev_nr < total_devs) {
3650                 if (dev_nr < total_devs - 1) {
3651                         bio = bio_clone(first_bio, GFP_NOFS);
3652                         BUG_ON(!bio);
3653                 } else {
3654                         bio = first_bio;
3655                 }
3656                 bio->bi_private = bbio;
3657                 bio->bi_end_io = btrfs_end_bio;
3658                 bio->bi_sector = bbio->stripes[dev_nr].physical >> 9;
3659                 dev = bbio->stripes[dev_nr].dev;
3660                 if (dev && dev->bdev && (rw != WRITE || dev->writeable)) {
3661                         pr_debug("btrfs_map_bio: rw %d, secor=%llu, dev=%lu "
3662                                  "(%s id %llu), size=%u\n", rw,
3663                                  (u64)bio->bi_sector, (u_long)dev->bdev->bd_dev,
3664                                  dev->name, dev->devid, bio->bi_size);
3665                         bio->bi_bdev = dev->bdev;
3666                         if (async_submit)
3667                                 schedule_bio(root, dev, rw, bio);
3668                         else
3669                                 submit_bio(rw, bio);
3670                 } else {
3671                         bio->bi_bdev = root->fs_info->fs_devices->latest_bdev;
3672                         bio->bi_sector = logical >> 9;
3673                         bio_endio(bio, -EIO);
3674                 }
3675                 dev_nr++;
3676         }
3677         return 0;
3678 }
3679
3680 struct btrfs_device *btrfs_find_device(struct btrfs_root *root, u64 devid,
3681                                        u8 *uuid, u8 *fsid)
3682 {
3683         struct btrfs_device *device;
3684         struct btrfs_fs_devices *cur_devices;
3685
3686         cur_devices = root->fs_info->fs_devices;
3687         while (cur_devices) {
3688                 if (!fsid ||
3689                     !memcmp(cur_devices->fsid, fsid, BTRFS_UUID_SIZE)) {
3690                         device = __find_device(&cur_devices->devices,
3691                                                devid, uuid);
3692                         if (device)
3693                                 return device;
3694                 }
3695                 cur_devices = cur_devices->seed;
3696         }
3697         return NULL;
3698 }
3699
3700 static struct btrfs_device *add_missing_dev(struct btrfs_root *root,
3701                                             u64 devid, u8 *dev_uuid)
3702 {
3703         struct btrfs_device *device;
3704         struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
3705
3706         device = kzalloc(sizeof(*device), GFP_NOFS);
3707         if (!device)
3708                 return NULL;
3709         list_add(&device->dev_list,
3710                  &fs_devices->devices);
3711         device->dev_root = root->fs_info->dev_root;
3712         device->devid = devid;
3713         device->work.func = pending_bios_fn;
3714         device->fs_devices = fs_devices;
3715         device->missing = 1;
3716         fs_devices->num_devices++;
3717         fs_devices->missing_devices++;
3718         spin_lock_init(&device->io_lock);
3719         INIT_LIST_HEAD(&device->dev_alloc_list);
3720         memcpy(device->uuid, dev_uuid, BTRFS_UUID_SIZE);
3721         return device;
3722 }
3723
3724 static int read_one_chunk(struct btrfs_root *root, struct btrfs_key *key,
3725                           struct extent_buffer *leaf,
3726                           struct btrfs_chunk *chunk)
3727 {
3728         struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree;
3729         struct map_lookup *map;
3730         struct extent_map *em;
3731         u64 logical;
3732         u64 length;
3733         u64 devid;
3734         u8 uuid[BTRFS_UUID_SIZE];
3735         int num_stripes;
3736         int ret;
3737         int i;
3738
3739         logical = key->offset;
3740         length = btrfs_chunk_length(leaf, chunk);
3741
3742         read_lock(&map_tree->map_tree.lock);
3743         em = lookup_extent_mapping(&map_tree->map_tree, logical, 1);
3744         read_unlock(&map_tree->map_tree.lock);
3745
3746         /* already mapped? */
3747         if (em && em->start <= logical && em->start + em->len > logical) {
3748                 free_extent_map(em);
3749                 return 0;
3750         } else if (em) {
3751                 free_extent_map(em);
3752         }
3753
3754         em = alloc_extent_map();
3755         if (!em)
3756                 return -ENOMEM;
3757         num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3758         map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
3759         if (!map) {
3760                 free_extent_map(em);
3761                 return -ENOMEM;
3762         }
3763
3764         em->bdev = (struct block_device *)map;
3765         em->start = logical;
3766         em->len = length;
3767         em->block_start = 0;
3768         em->block_len = em->len;
3769
3770         map->num_stripes = num_stripes;
3771         map->io_width = btrfs_chunk_io_width(leaf, chunk);
3772         map->io_align = btrfs_chunk_io_align(leaf, chunk);
3773         map->sector_size = btrfs_chunk_sector_size(leaf, chunk);
3774         map->stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
3775         map->type = btrfs_chunk_type(leaf, chunk);
3776         map->sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
3777         for (i = 0; i < num_stripes; i++) {
3778                 map->stripes[i].physical =
3779                         btrfs_stripe_offset_nr(leaf, chunk, i);
3780                 devid = btrfs_stripe_devid_nr(leaf, chunk, i);
3781                 read_extent_buffer(leaf, uuid, (unsigned long)
3782                                    btrfs_stripe_dev_uuid_nr(chunk, i),
3783                                    BTRFS_UUID_SIZE);
3784                 map->stripes[i].dev = btrfs_find_device(root, devid, uuid,
3785                                                         NULL);
3786                 if (!map->stripes[i].dev && !btrfs_test_opt(root, DEGRADED)) {
3787                         kfree(map);
3788                         free_extent_map(em);
3789                         return -EIO;
3790                 }
3791                 if (!map->stripes[i].dev) {
3792                         map->stripes[i].dev =
3793                                 add_missing_dev(root, devid, uuid);
3794                         if (!map->stripes[i].dev) {
3795                                 kfree(map);
3796                                 free_extent_map(em);
3797                                 return -EIO;
3798                         }
3799                 }
3800                 map->stripes[i].dev->in_fs_metadata = 1;
3801         }
3802
3803         write_lock(&map_tree->map_tree.lock);
3804         ret = add_extent_mapping(&map_tree->map_tree, em);
3805         write_unlock(&map_tree->map_tree.lock);
3806         BUG_ON(ret);
3807         free_extent_map(em);
3808
3809         return 0;
3810 }
3811
3812 static int fill_device_from_item(struct extent_buffer *leaf,
3813                                  struct btrfs_dev_item *dev_item,
3814                                  struct btrfs_device *device)
3815 {
3816         unsigned long ptr;
3817
3818         device->devid = btrfs_device_id(leaf, dev_item);
3819         device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item);
3820         device->total_bytes = device->disk_total_bytes;
3821         device->bytes_used = btrfs_device_bytes_used(leaf, dev_item);
3822         device->type = btrfs_device_type(leaf, dev_item);
3823         device->io_align = btrfs_device_io_align(leaf, dev_item);
3824         device->io_width = btrfs_device_io_width(leaf, dev_item);
3825         device->sector_size = btrfs_device_sector_size(leaf, dev_item);
3826
3827         ptr = (unsigned long)btrfs_device_uuid(dev_item);
3828         read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
3829
3830         return 0;
3831 }
3832
3833 static int open_seed_devices(struct btrfs_root *root, u8 *fsid)
3834 {
3835         struct btrfs_fs_devices *fs_devices;
3836         int ret;
3837
3838         mutex_lock(&uuid_mutex);
3839
3840         fs_devices = root->fs_info->fs_devices->seed;
3841         while (fs_devices) {
3842                 if (!memcmp(fs_devices->fsid, fsid, BTRFS_UUID_SIZE)) {
3843                         ret = 0;
3844                         goto out;
3845                 }
3846                 fs_devices = fs_devices->seed;
3847         }
3848
3849         fs_devices = find_fsid(fsid);
3850         if (!fs_devices) {
3851                 ret = -ENOENT;
3852                 goto out;
3853         }
3854
3855         fs_devices = clone_fs_devices(fs_devices);
3856         if (IS_ERR(fs_devices)) {
3857                 ret = PTR_ERR(fs_devices);
3858                 goto out;
3859         }
3860
3861         ret = __btrfs_open_devices(fs_devices, FMODE_READ,
3862                                    root->fs_info->bdev_holder);
3863         if (ret)
3864                 goto out;
3865
3866         if (!fs_devices->seeding) {
3867                 __btrfs_close_devices(fs_devices);
3868                 free_fs_devices(fs_devices);
3869                 ret = -EINVAL;
3870                 goto out;
3871         }
3872
3873         fs_devices->seed = root->fs_info->fs_devices->seed;
3874         root->fs_info->fs_devices->seed = fs_devices;
3875 out:
3876         mutex_unlock(&uuid_mutex);
3877         return ret;
3878 }
3879
3880 static int read_one_dev(struct btrfs_root *root,
3881                         struct extent_buffer *leaf,
3882                         struct btrfs_dev_item *dev_item)
3883 {
3884         struct btrfs_device *device;
3885         u64 devid;
3886         int ret;
3887         u8 fs_uuid[BTRFS_UUID_SIZE];
3888         u8 dev_uuid[BTRFS_UUID_SIZE];
3889
3890         devid = btrfs_device_id(leaf, dev_item);
3891         read_extent_buffer(leaf, dev_uuid,
3892                            (unsigned long)btrfs_device_uuid(dev_item),
3893                            BTRFS_UUID_SIZE);
3894         read_extent_buffer(leaf, fs_uuid,
3895                            (unsigned long)btrfs_device_fsid(dev_item),
3896                            BTRFS_UUID_SIZE);
3897
3898         if (memcmp(fs_uuid, root->fs_info->fsid, BTRFS_UUID_SIZE)) {
3899                 ret = open_seed_devices(root, fs_uuid);
3900                 if (ret && !btrfs_test_opt(root, DEGRADED))
3901                         return ret;
3902         }
3903
3904         device = btrfs_find_device(root, devid, dev_uuid, fs_uuid);
3905         if (!device || !device->bdev) {
3906                 if (!btrfs_test_opt(root, DEGRADED))
3907                         return -EIO;
3908
3909                 if (!device) {
3910                         printk(KERN_WARNING "warning devid %llu missing\n",
3911                                (unsigned long long)devid);
3912                         device = add_missing_dev(root, devid, dev_uuid);
3913                         if (!device)
3914                                 return -ENOMEM;
3915                 } else if (!device->missing) {
3916                         /*
3917                          * this happens when a device that was properly setup
3918                          * in the device info lists suddenly goes bad.
3919                          * device->bdev is NULL, and so we have to set
3920                          * device->missing to one here
3921                          */
3922                         root->fs_info->fs_devices->missing_devices++;
3923                         device->missing = 1;
3924                 }
3925         }
3926
3927         if (device->fs_devices != root->fs_info->fs_devices) {
3928                 BUG_ON(device->writeable);
3929                 if (device->generation !=
3930                     btrfs_device_generation(leaf, dev_item))
3931                         return -EINVAL;
3932         }
3933
3934         fill_device_from_item(leaf, dev_item, device);
3935         device->dev_root = root->fs_info->dev_root;
3936         device->in_fs_metadata = 1;
3937         if (device->writeable) {
3938                 device->fs_devices->total_rw_bytes += device->total_bytes;
3939                 spin_lock(&root->fs_info->free_chunk_lock);
3940                 root->fs_info->free_chunk_space += device->total_bytes -
3941                         device->bytes_used;
3942                 spin_unlock(&root->fs_info->free_chunk_lock);
3943         }
3944         ret = 0;
3945         return ret;
3946 }
3947
3948 int btrfs_read_sys_array(struct btrfs_root *root)
3949 {
3950         struct btrfs_super_block *super_copy = root->fs_info->super_copy;
3951         struct extent_buffer *sb;
3952         struct btrfs_disk_key *disk_key;
3953         struct btrfs_chunk *chunk;
3954         u8 *ptr;
3955         unsigned long sb_ptr;
3956         int ret = 0;
3957         u32 num_stripes;
3958         u32 array_size;
3959         u32 len = 0;
3960         u32 cur;
3961         struct btrfs_key key;
3962
3963         sb = btrfs_find_create_tree_block(root, BTRFS_SUPER_INFO_OFFSET,
3964                                           BTRFS_SUPER_INFO_SIZE);
3965         if (!sb)
3966                 return -ENOMEM;
3967         btrfs_set_buffer_uptodate(sb);
3968         btrfs_set_buffer_lockdep_class(root->root_key.objectid, sb, 0);
3969
3970         write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE);
3971         array_size = btrfs_super_sys_array_size(super_copy);
3972
3973         ptr = super_copy->sys_chunk_array;
3974         sb_ptr = offsetof(struct btrfs_super_block, sys_chunk_array);
3975         cur = 0;
3976
3977         while (cur < array_size) {
3978                 disk_key = (struct btrfs_disk_key *)ptr;
3979                 btrfs_disk_key_to_cpu(&key, disk_key);
3980
3981                 len = sizeof(*disk_key); ptr += len;
3982                 sb_ptr += len;
3983                 cur += len;
3984
3985                 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
3986                         chunk = (struct btrfs_chunk *)sb_ptr;
3987                         ret = read_one_chunk(root, &key, sb, chunk);
3988                         if (ret)
3989                                 break;
3990                         num_stripes = btrfs_chunk_num_stripes(sb, chunk);
3991                         len = btrfs_chunk_item_size(num_stripes);
3992                 } else {
3993                         ret = -EIO;
3994                         break;
3995                 }
3996                 ptr += len;
3997                 sb_ptr += len;
3998                 cur += len;
3999         }
4000         free_extent_buffer(sb);
4001         return ret;
4002 }
4003
4004 int btrfs_read_chunk_tree(struct btrfs_root *root)
4005 {
4006         struct btrfs_path *path;
4007         struct extent_buffer *leaf;
4008         struct btrfs_key key;
4009         struct btrfs_key found_key;
4010         int ret;
4011         int slot;
4012
4013         root = root->fs_info->chunk_root;
4014
4015         path = btrfs_alloc_path();
4016         if (!path)
4017                 return -ENOMEM;
4018
4019         /* first we search for all of the device items, and then we
4020          * read in all of the chunk items.  This way we can create chunk
4021          * mappings that reference all of the devices that are afound
4022          */
4023         key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
4024         key.offset = 0;
4025         key.type = 0;
4026 again:
4027         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4028         if (ret < 0)
4029                 goto error;
4030         while (1) {
4031                 leaf = path->nodes[0];
4032                 slot = path->slots[0];
4033                 if (slot >= btrfs_header_nritems(leaf)) {
4034                         ret = btrfs_next_leaf(root, path);
4035                         if (ret == 0)
4036                                 continue;
4037                         if (ret < 0)
4038                                 goto error;
4039                         break;
4040                 }
4041                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
4042                 if (key.objectid == BTRFS_DEV_ITEMS_OBJECTID) {
4043                         if (found_key.objectid != BTRFS_DEV_ITEMS_OBJECTID)
4044                                 break;
4045                         if (found_key.type == BTRFS_DEV_ITEM_KEY) {
4046                                 struct btrfs_dev_item *dev_item;
4047                                 dev_item = btrfs_item_ptr(leaf, slot,
4048                                                   struct btrfs_dev_item);
4049                                 ret = read_one_dev(root, leaf, dev_item);
4050                                 if (ret)
4051                                         goto error;
4052                         }
4053                 } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) {
4054                         struct btrfs_chunk *chunk;
4055                         chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
4056                         ret = read_one_chunk(root, &found_key, leaf, chunk);
4057                         if (ret)
4058                                 goto error;
4059                 }
4060                 path->slots[0]++;
4061         }
4062         if (key.objectid == BTRFS_DEV_ITEMS_OBJECTID) {
4063                 key.objectid = 0;
4064                 btrfs_release_path(path);
4065                 goto again;
4066         }
4067         ret = 0;
4068 error:
4069         btrfs_free_path(path);
4070         return ret;
4071 }