fs/btrfs/disk-io.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
  19 #include <linux/fs.h>
  20 #include <linux/blkdev.h>
  21 #include <linux/scatterlist.h>
  22 #include <linux/swap.h>
  23 #include <linux/radix-tree.h>
  24 #include <linux/writeback.h>
  25 #include <linux/buffer_head.h>
  26 #include <linux/workqueue.h>
  27 #include <linux/kthread.h>
  28 #include <linux/freezer.h>
  29 #include <linux/crc32c.h>
  30 #include <linux/slab.h>
  31 #include <linux/migrate.h>
  32 #include <asm/unaligned.h>
  33 #include "compat.h"
  34 #include "ctree.h"
  35 #include "disk-io.h"
  36 #include "transaction.h"
  37 #include "btrfs_inode.h"
  38 #include "volumes.h"
  39 #include "print-tree.h"
  40 #include "async-thread.h"
  41 #include "locking.h"
  42 #include "tree-log.h"
  43 #include "free-space-cache.h"
  44
  45 static struct extent_io_ops btree_extent_io_ops;
  46 static void end_workqueue_fn(struct btrfs_work *work);
  47 static void free_fs_root(struct btrfs_root *root);
  48 static void btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
  49                                     int read_only);
  50 static int btrfs_destroy_ordered_operations(struct btrfs_root *root);
  51 static int btrfs_destroy_ordered_extents(struct btrfs_root *root);
  52 static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
  53                                       struct btrfs_root *root);
  54 static int btrfs_destroy_pending_snapshots(struct btrfs_transaction *t);
  55 static int btrfs_destroy_delalloc_inodes(struct btrfs_root *root);
  56 static int btrfs_destroy_marked_extents(struct btrfs_root *root,
  57                                         struct extent_io_tree *dirty_pages,
  58                                         int mark);
  59 static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
  60                                        struct extent_io_tree *pinned_extents);
  61 static int btrfs_cleanup_transaction(struct btrfs_root *root);
  62
  63 /*
  64  * end_io_wq structs are used to do processing in task context when an IO is
  65  * complete.  This is used during reads to verify checksums, and it is used
  66  * by writes to insert metadata for new file extents after IO is complete.
  67  */
  68 struct end_io_wq {
  69         struct bio *bio;
  70         bio_end_io_t *end_io;
  71         void *private;
  72         struct btrfs_fs_info *info;
  73         int error;
  74         int metadata;
  75         struct list_head list;
  76         struct btrfs_work work;
  77 };
  78
  79 /*
  80  * async submit bios are used to offload expensive checksumming
  81  * onto the worker threads.  They checksum file and metadata bios
  82  * just before they are sent down the IO stack.
  83  */
  84 struct async_submit_bio {
  85         struct inode *inode;
  86         struct bio *bio;
  87         struct list_head list;
  88         extent_submit_bio_hook_t *submit_bio_start;
  89         extent_submit_bio_hook_t *submit_bio_done;
  90         int rw;
  91         int mirror_num;
  92         unsigned long bio_flags;
  93         /*
  94          * bio_offset is optional, can be used if the pages in the bio
  95          * can't tell us where in the file the bio should go
  96          */
  97         u64 bio_offset;
  98         struct btrfs_work work;
  99 };
 100
 101 /* These are used to set the lockdep class on the extent buffer locks.
 102  * The class is set by the readpage_end_io_hook after the buffer has
 103  * passed csum validation but before the pages are unlocked.
 104  *
 105  * The lockdep class is also set by btrfs_init_new_buffer on freshly
 106  * allocated blocks.
 107  *
 108  * The class is based on the level in the tree block, which allows lockdep
 109  * to know that lower nodes nest inside the locks of higher nodes.
 110  *
 111  * We also add a check to make sure the highest level of the tree is
 112  * the same as our lockdep setup here.  If BTRFS_MAX_LEVEL changes, this
 113  * code needs update as well.
 114  */
 115 #ifdef CONFIG_DEBUG_LOCK_ALLOC
 116 # if BTRFS_MAX_LEVEL != 8
 117 #  error
 118 # endif
 119 static struct lock_class_key btrfs_eb_class[BTRFS_MAX_LEVEL + 1];
 120 static const char *btrfs_eb_name[BTRFS_MAX_LEVEL + 1] = {
 121         /* leaf */
 122         "btrfs-extent-00",
 123         "btrfs-extent-01",
 124         "btrfs-extent-02",
 125         "btrfs-extent-03",
 126         "btrfs-extent-04",
 127         "btrfs-extent-05",
 128         "btrfs-extent-06",
 129         "btrfs-extent-07",
 130         /* highest possible level */
 131         "btrfs-extent-08",
 132 };
 133 #endif
 134
 135 /*
 136  * extents on the btree inode are pretty simple, there's one extent
 137  * that covers the entire device
 138  */
 139 static struct extent_map *btree_get_extent(struct inode *inode,
 140                 struct page *page, size_t page_offset, u64 start, u64 len,
 141                 int create)
 142 {
 143         struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
 144         struct extent_map *em;
 145         int ret;
 146
 147         read_lock(&em_tree->lock);
 148         em = lookup_extent_mapping(em_tree, start, len);
 149         if (em) {
 150                 em->bdev =
 151                         BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
 152                 read_unlock(&em_tree->lock);
 153                 goto out;
 154         }
 155         read_unlock(&em_tree->lock);
 156
 157         em = alloc_extent_map(GFP_NOFS);
 158         if (!em) {
 159                 em = ERR_PTR(-ENOMEM);
 160                 goto out;
 161         }
 162         em->start = 0;
 163         em->len = (u64)-1;
 164         em->block_len = (u64)-1;
 165         em->block_start = 0;
 166         em->bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
 167
 168         write_lock(&em_tree->lock);
 169         ret = add_extent_mapping(em_tree, em);
 170         if (ret == -EEXIST) {
 171                 u64 failed_start = em->start;
 172                 u64 failed_len = em->len;
 173
 174                 free_extent_map(em);
 175                 em = lookup_extent_mapping(em_tree, start, len);
 176                 if (em) {
 177                         ret = 0;
 178                 } else {
 179                         em = lookup_extent_mapping(em_tree, failed_start,
 180                                                    failed_len);
 181                         ret = -EIO;
 182                 }
 183         } else if (ret) {
 184                 free_extent_map(em);
 185                 em = NULL;
 186         }
 187         write_unlock(&em_tree->lock);
 188
 189         if (ret)
 190                 em = ERR_PTR(ret);
 191 out:
 192         return em;
 193 }
 194
 195 u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len)
 196 {
 197         return crc32c(seed, data, len);
 198 }
 199
 200 void btrfs_csum_final(u32 crc, char *result)
 201 {
 202         put_unaligned_le32(~crc, result);
 203 }
 204
 205 /*
 206  * compute the csum for a btree block, and either verify it or write it
 207  * into the csum field of the block.
 208  */
 209 static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
 210                            int verify)
 211 {
 212         u16 csum_size =
 213                 btrfs_super_csum_size(&root->fs_info->super_copy);
 214         char *result = NULL;
 215         unsigned long len;
 216         unsigned long cur_len;
 217         unsigned long offset = BTRFS_CSUM_SIZE;
 218         char *map_token = NULL;
 219         char *kaddr;
 220         unsigned long map_start;
 221         unsigned long map_len;
 222         int err;
 223         u32 crc = ~(u32)0;
 224         unsigned long inline_result;
 225
 226         len = buf->len - offset;
 227         while (len > 0) {
 228                 err = map_private_extent_buffer(buf, offset, 32,
 229                                         &map_token, &kaddr,
 230                                         &map_start, &map_len, KM_USER0);
 231                 if (err)
 232                         return 1;
 233                 cur_len = min(len, map_len - (offset - map_start));
 234                 crc = btrfs_csum_data(root, kaddr + offset - map_start,
 235                                       crc, cur_len);
 236                 len -= cur_len;
 237                 offset += cur_len;
 238                 unmap_extent_buffer(buf, map_token, KM_USER0);
 239         }
 240         if (csum_size > sizeof(inline_result)) {
 241                 result = kzalloc(csum_size * sizeof(char), GFP_NOFS);
 242                 if (!result)
 243                         return 1;
 244         } else {
 245                 result = (char *)&inline_result;
 246         }
 247
 248         btrfs_csum_final(crc, result);
 249
 250         if (verify) {
 251                 if (memcmp_extent_buffer(buf, result, 0, csum_size)) {
 252                         u32 val;
 253                         u32 found = 0;
 254                         memcpy(&found, result, csum_size);
 255
 256                         read_extent_buffer(buf, &val, 0, csum_size);
 257                         if (printk_ratelimit()) {
 258                                 printk(KERN_INFO "btrfs: %s checksum verify "
 259                                        "failed on %llu wanted %X found %X "
 260                                        "level %d\n",
 261                                        root->fs_info->sb->s_id,
 262                                        (unsigned long long)buf->start, val, found,
 263                                        btrfs_header_level(buf));
 264                         }
 265                         if (result != (char *)&inline_result)
 266                                 kfree(result);
 267                         return 1;
 268                 }
 269         } else {
 270                 write_extent_buffer(buf, result, 0, csum_size);
 271         }
 272         if (result != (char *)&inline_result)
 273                 kfree(result);
 274         return 0;
 275 }
 276
 277 /*
 278  * we can't consider a given block up to date unless the transid of the
 279  * block matches the transid in the parent node's pointer.  This is how we
 280  * detect blocks that either didn't get written at all or got written
 281  * in the wrong place.
 282  */
 283 static int verify_parent_transid(struct extent_io_tree *io_tree,
 284                                  struct extent_buffer *eb, u64 parent_transid)
 285 {
 286         struct extent_state *cached_state = NULL;
 287         int ret;
 288
 289         if (!parent_transid || btrfs_header_generation(eb) == parent_transid)
 290                 return 0;
 291
 292         lock_extent_bits(io_tree, eb->start, eb->start + eb->len - 1,
 293                          0, &cached_state, GFP_NOFS);
 294         if (extent_buffer_uptodate(io_tree, eb, cached_state) &&
 295             btrfs_header_generation(eb) == parent_transid) {
 296                 ret = 0;
 297                 goto out;
 298         }
 299         if (printk_ratelimit()) {
 300                 printk("parent transid verify failed on %llu wanted %llu "
 301                        "found %llu\n",
 302                        (unsigned long long)eb->start,
 303                        (unsigned long long)parent_transid,
 304                        (unsigned long long)btrfs_header_generation(eb));
 305         }
 306         ret = 1;
 307         clear_extent_buffer_uptodate(io_tree, eb, &cached_state);
 308 out:
 309         unlock_extent_cached(io_tree, eb->start, eb->start + eb->len - 1,
 310                              &cached_state, GFP_NOFS);
 311         return ret;
 312 }
 313
 314 /*
 315  * helper to read a given tree block, doing retries as required when
 316  * the checksums don't match and we have alternate mirrors to try.
 317  */
 318 static int btree_read_extent_buffer_pages(struct btrfs_root *root,
 319                                           struct extent_buffer *eb,
 320                                           u64 start, u64 parent_transid)
 321 {
 322         struct extent_io_tree *io_tree;
 323         int ret;
 324         int num_copies = 0;
 325         int mirror_num = 0;
 326
 327         clear_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
 328         io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree;
 329         while (1) {
 330                 ret = read_extent_buffer_pages(io_tree, eb, start, 1,
 331                                                btree_get_extent, mirror_num);
 332                 if (!ret &&
 333                     !verify_parent_transid(io_tree, eb, parent_transid))
 334                         return ret;
 335
 336                 /*
 337                  * This buffer's crc is fine, but its contents are corrupted, so
 338                  * there is no reason to read the other copies, they won't be
 339                  * any less wrong.
 340                  */
 341                 if (test_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags))
 342                         return ret;
 343
 344                 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
 345                                               eb->start, eb->len);
 346                 if (num_copies == 1)
 347                         return ret;
 348
 349                 mirror_num++;
 350                 if (mirror_num > num_copies)
 351                         return ret;
 352         }
 353         return -EIO;
 354 }
 355
 356 /*
 357  * checksum a dirty tree block before IO.  This has extra checks to make sure
 358  * we only fill in the checksum field in the first page of a multi-page block
 359  */
 360
 361 static int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
 362 {
 363         struct extent_io_tree *tree;
 364         u64 start = (u64)page->index << PAGE_CACHE_SHIFT;
 365         u64 found_start;
 366         unsigned long len;
 367         struct extent_buffer *eb;
 368         int ret;
 369
 370         tree = &BTRFS_I(page->mapping->host)->io_tree;
 371
 372         if (page->private == EXTENT_PAGE_PRIVATE) {
 373                 WARN_ON(1);
 374                 goto out;
 375         }
 376         if (!page->private) {
 377                 WARN_ON(1);
 378                 goto out;
 379         }
 380         len = page->private >> 2;
 381         WARN_ON(len == 0);
 382
 383         eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
 384         if (eb == NULL) {
 385                 WARN_ON(1);
 386                 goto out;
 387         }
 388         ret = btree_read_extent_buffer_pages(root, eb, start + PAGE_CACHE_SIZE,
 389                                              btrfs_header_generation(eb));
 390         BUG_ON(ret);
 391         WARN_ON(!btrfs_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN));
 392
 393         found_start = btrfs_header_bytenr(eb);
 394         if (found_start != start) {
 395                 WARN_ON(1);
 396                 goto err;
 397         }
 398         if (eb->first_page != page) {
 399                 WARN_ON(1);
 400                 goto err;
 401         }
 402         if (!PageUptodate(page)) {
 403                 WARN_ON(1);
 404                 goto err;
 405         }
 406         csum_tree_block(root, eb, 0);
 407 err:
 408         free_extent_buffer(eb);
 409 out:
 410         return 0;
 411 }
 412
 413 static int check_tree_block_fsid(struct btrfs_root *root,
 414                                  struct extent_buffer *eb)
 415 {
 416         struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
 417         u8 fsid[BTRFS_UUID_SIZE];
 418         int ret = 1;
 419
 420         read_extent_buffer(eb, fsid, (unsigned long)btrfs_header_fsid(eb),
 421                            BTRFS_FSID_SIZE);
 422         while (fs_devices) {
 423                 if (!memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE)) {
 424                         ret = 0;
 425                         break;
 426                 }
 427                 fs_devices = fs_devices->seed;
 428         }
 429         return ret;
 430 }
 431
 432 #define CORRUPT(reason, eb, root, slot)                         \
 433         printk(KERN_CRIT "btrfs: corrupt leaf, %s: block=%llu," \
 434                "root=%llu, slot=%d\n", reason,                  \
 435                (unsigned long long)btrfs_header_bytenr(eb),     \
 436                (unsigned long long)root->objectid, slot)
 437
 438 static noinline int check_leaf(struct btrfs_root *root,
 439                                struct extent_buffer *leaf)
 440 {
 441         struct btrfs_key key;
 442         struct btrfs_key leaf_key;
 443         u32 nritems = btrfs_header_nritems(leaf);
 444         int slot;
 445
 446         if (nritems == 0)
 447                 return 0;
 448
 449         /* Check the 0 item */
 450         if (btrfs_item_offset_nr(leaf, 0) + btrfs_item_size_nr(leaf, 0) !=
 451             BTRFS_LEAF_DATA_SIZE(root)) {
 452                 CORRUPT("invalid item offset size pair", leaf, root, 0);
 453                 return -EIO;
 454         }
 455
 456         /*
 457          * Check to make sure each items keys are in the correct order and their
 458          * offsets make sense.  We only have to loop through nritems-1 because
 459          * we check the current slot against the next slot, which verifies the
 460          * next slot's offset+size makes sense and that the current's slot
 461          * offset is correct.
 462          */
 463         for (slot = 0; slot < nritems - 1; slot++) {
 464                 btrfs_item_key_to_cpu(leaf, &leaf_key, slot);
 465                 btrfs_item_key_to_cpu(leaf, &key, slot + 1);
 466
 467                 /* Make sure the keys are in the right order */
 468                 if (btrfs_comp_cpu_keys(&leaf_key, &key) >= 0) {
 469                         CORRUPT("bad key order", leaf, root, slot);
 470                         return -EIO;
 471                 }
 472
 473                 /*
 474                  * Make sure the offset and ends are right, remember that the
 475                  * item data starts at the end of the leaf and grows towards the
 476                  * front.
 477                  */
 478                 if (btrfs_item_offset_nr(leaf, slot) !=
 479                         btrfs_item_end_nr(leaf, slot + 1)) {
 480                         CORRUPT("slot offset bad", leaf, root, slot);
 481                         return -EIO;
 482                 }
 483
 484                 /*
 485                  * Check to make sure that we don't point outside of the leaf,
 486                  * just incase all the items are consistent to eachother, but
 487                  * all point outside of the leaf.
 488                  */
 489                 if (btrfs_item_end_nr(leaf, slot) >
 490                     BTRFS_LEAF_DATA_SIZE(root)) {
 491                         CORRUPT("slot end outside of leaf", leaf, root, slot);
 492                         return -EIO;
 493                 }
 494         }
 495
 496         return 0;
 497 }
 498
 499 #ifdef CONFIG_DEBUG_LOCK_ALLOC
 500 void btrfs_set_buffer_lockdep_class(struct extent_buffer *eb, int level)
 501 {
 502         lockdep_set_class_and_name(&eb->lock,
 503                            &btrfs_eb_class[level],
 504                            btrfs_eb_name[level]);
 505 }
 506 #endif
 507
 508 static int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end,
 509                                struct extent_state *state)
 510 {
 511         struct extent_io_tree *tree;
 512         u64 found_start;
 513         int found_level;
 514         unsigned long len;
 515         struct extent_buffer *eb;
 516         struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
 517         int ret = 0;
 518
 519         tree = &BTRFS_I(page->mapping->host)->io_tree;
 520         if (page->private == EXTENT_PAGE_PRIVATE)
 521                 goto out;
 522         if (!page->private)
 523                 goto out;
 524
 525         len = page->private >> 2;
 526         WARN_ON(len == 0);
 527
 528         eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS);
 529         if (eb == NULL) {
 530                 ret = -EIO;
 531                 goto out;
 532         }
 533
 534         found_start = btrfs_header_bytenr(eb);
 535         if (found_start != start) {
 536                 if (printk_ratelimit()) {
 537                         printk(KERN_INFO "btrfs bad tree block start "
 538                                "%llu %llu\n",
 539                                (unsigned long long)found_start,
 540                                (unsigned long long)eb->start);
 541                 }
 542                 ret = -EIO;
 543                 goto err;
 544         }
 545         if (eb->first_page != page) {
 546                 printk(KERN_INFO "btrfs bad first page %lu %lu\n",
 547                        eb->first_page->index, page->index);
 548                 WARN_ON(1);
 549                 ret = -EIO;
 550                 goto err;
 551         }
 552         if (check_tree_block_fsid(root, eb)) {
 553                 if (printk_ratelimit()) {
 554                         printk(KERN_INFO "btrfs bad fsid on block %llu\n",
 555                                (unsigned long long)eb->start);
 556                 }
 557                 ret = -EIO;
 558                 goto err;
 559         }
 560         found_level = btrfs_header_level(eb);
 561
 562         btrfs_set_buffer_lockdep_class(eb, found_level);
 563
 564         ret = csum_tree_block(root, eb, 1);
 565         if (ret) {
 566                 ret = -EIO;
 567                 goto err;
 568         }
 569
 570         /*
 571          * If this is a leaf block and it is corrupt, set the corrupt bit so
 572          * that we don't try and read the other copies of this block, just
 573          * return -EIO.
 574          */
 575         if (found_level == 0 && check_leaf(root, eb)) {
 576                 set_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
 577                 ret = -EIO;
 578         }
 579
 580         end = min_t(u64, eb->len, PAGE_CACHE_SIZE);
 581         end = eb->start + end - 1;
 582 err:
 583         free_extent_buffer(eb);
 584 out:
 585         return ret;
 586 }
 587
 588 static void end_workqueue_bio(struct bio *bio, int err)
 589 {
 590         struct end_io_wq *end_io_wq = bio->bi_private;
 591         struct btrfs_fs_info *fs_info;
 592
 593         fs_info = end_io_wq->info;
 594         end_io_wq->error = err;
 595         end_io_wq->work.func = end_workqueue_fn;
 596         end_io_wq->work.flags = 0;
 597
 598         if (bio->bi_rw & REQ_WRITE) {
 599                 if (end_io_wq->metadata == 1)
 600                         btrfs_queue_worker(&fs_info->endio_meta_write_workers,
 601                                            &end_io_wq->work);
 602                 else if (end_io_wq->metadata == 2)
 603                         btrfs_queue_worker(&fs_info->endio_freespace_worker,
 604                                            &end_io_wq->work);
 605                 else
 606                         btrfs_queue_worker(&fs_info->endio_write_workers,
 607                                            &end_io_wq->work);
 608         } else {
 609                 if (end_io_wq->metadata)
 610                         btrfs_queue_worker(&fs_info->endio_meta_workers,
 611                                            &end_io_wq->work);
 612                 else
 613                         btrfs_queue_worker(&fs_info->endio_workers,
 614                                            &end_io_wq->work);
 615         }
 616 }
 617
 618 /*
 619  * For the metadata arg you want
 620  *
 621  * 0 - if data
 622  * 1 - if normal metadta
 623  * 2 - if writing to the free space cache area
 624  */
 625 int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio,
 626                         int metadata)
 627 {
 628         struct end_io_wq *end_io_wq;
 629         end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS);
 630         if (!end_io_wq)
 631                 return -ENOMEM;
 632
 633         end_io_wq->private = bio->bi_private;
 634         end_io_wq->end_io = bio->bi_end_io;
 635         end_io_wq->info = info;
 636         end_io_wq->error = 0;
 637         end_io_wq->bio = bio;
 638         end_io_wq->metadata = metadata;
 639
 640         bio->bi_private = end_io_wq;
 641         bio->bi_end_io = end_workqueue_bio;
 642         return 0;
 643 }
 644
 645 unsigned long btrfs_async_submit_limit(struct btrfs_fs_info *info)
 646 {
 647         unsigned long limit = min_t(unsigned long,
 648                                     info->workers.max_workers,
 649                                     info->fs_devices->open_devices);
 650         return 256 * limit;
 651 }
 652
 653 int btrfs_congested_async(struct btrfs_fs_info *info, int iodone)
 654 {
 655         return atomic_read(&info->nr_async_bios) >
 656                 btrfs_async_submit_limit(info);
 657 }
 658
 659 static void run_one_async_start(struct btrfs_work *work)
 660 {
 661         struct async_submit_bio *async;
 662
 663         async = container_of(work, struct  async_submit_bio, work);
 664         async->submit_bio_start(async->inode, async->rw, async->bio,
 665                                async->mirror_num, async->bio_flags,
 666                                async->bio_offset);
 667 }
 668
 669 static void run_one_async_done(struct btrfs_work *work)
 670 {
 671         struct btrfs_fs_info *fs_info;
 672         struct async_submit_bio *async;
 673         int limit;
 674
 675         async = container_of(work, struct  async_submit_bio, work);
 676         fs_info = BTRFS_I(async->inode)->root->fs_info;
 677
 678         limit = btrfs_async_submit_limit(fs_info);
 679         limit = limit * 2 / 3;
 680
 681         atomic_dec(&fs_info->nr_async_submits);
 682
 683         if (atomic_read(&fs_info->nr_async_submits) < limit &&
 684             waitqueue_active(&fs_info->async_submit_wait))
 685                 wake_up(&fs_info->async_submit_wait);
 686
 687         async->submit_bio_done(async->inode, async->rw, async->bio,
 688                                async->mirror_num, async->bio_flags,
 689                                async->bio_offset);
 690 }
 691
 692 static void run_one_async_free(struct btrfs_work *work)
 693 {
 694         struct async_submit_bio *async;
 695
 696         async = container_of(work, struct  async_submit_bio, work);
 697         kfree(async);
 698 }
 699
 700 int btrfs_wq_submit_bio(struct btrfs_fs_info *fs_info, struct inode *inode,
 701                         int rw, struct bio *bio, int mirror_num,
 702                         unsigned long bio_flags,
 703                         u64 bio_offset,
 704                         extent_submit_bio_hook_t *submit_bio_start,
 705                         extent_submit_bio_hook_t *submit_bio_done)
 706 {
 707         struct async_submit_bio *async;
 708
 709         async = kmalloc(sizeof(*async), GFP_NOFS);
 710         if (!async)
 711                 return -ENOMEM;
 712
 713         async->inode = inode;
 714         async->rw = rw;
 715         async->bio = bio;
 716         async->mirror_num = mirror_num;
 717         async->submit_bio_start = submit_bio_start;
 718         async->submit_bio_done = submit_bio_done;
 719
 720         async->work.func = run_one_async_start;
 721         async->work.ordered_func = run_one_async_done;
 722         async->work.ordered_free = run_one_async_free;
 723
 724         async->work.flags = 0;
 725         async->bio_flags = bio_flags;
 726         async->bio_offset = bio_offset;
 727
 728         atomic_inc(&fs_info->nr_async_submits);
 729
 730         if (rw & REQ_SYNC)
 731                 btrfs_set_work_high_prio(&async->work);
 732
 733         btrfs_queue_worker(&fs_info->workers, &async->work);
 734
 735         while (atomic_read(&fs_info->async_submit_draining) &&
 736               atomic_read(&fs_info->nr_async_submits)) {
 737                 wait_event(fs_info->async_submit_wait,
 738                            (atomic_read(&fs_info->nr_async_submits) == 0));
 739         }
 740
 741         return 0;
 742 }
 743
 744 static int btree_csum_one_bio(struct bio *bio)
 745 {
 746         struct bio_vec *bvec = bio->bi_io_vec;
 747         int bio_index = 0;
 748         struct btrfs_root *root;
 749
 750         WARN_ON(bio->bi_vcnt <= 0);
 751         while (bio_index < bio->bi_vcnt) {
 752                 root = BTRFS_I(bvec->bv_page->mapping->host)->root;
 753                 csum_dirty_buffer(root, bvec->bv_page);
 754                 bio_index++;
 755                 bvec++;
 756         }
 757         return 0;
 758 }
 759
 760 static int __btree_submit_bio_start(struct inode *inode, int rw,
 761                                     struct bio *bio, int mirror_num,
 762                                     unsigned long bio_flags,
 763                                     u64 bio_offset)
 764 {
 765         /*
 766          * when we're called for a write, we're already in the async
 767          * submission context.  Just jump into btrfs_map_bio
 768          */
 769         btree_csum_one_bio(bio);
 770         return 0;
 771 }
 772
 773 static int __btree_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
 774                                  int mirror_num, unsigned long bio_flags,
 775                                  u64 bio_offset)
 776 {
 777         /*
 778          * when we're called for a write, we're already in the async
 779          * submission context.  Just jump into btrfs_map_bio
 780          */
 781         return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num, 1);
 782 }
 783
 784 static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
 785                                  int mirror_num, unsigned long bio_flags,
 786                                  u64 bio_offset)
 787 {
 788         int ret;
 789
 790         ret = btrfs_bio_wq_end_io(BTRFS_I(inode)->root->fs_info,
 791                                           bio, 1);
 792         BUG_ON(ret);
 793
 794         if (!(rw & REQ_WRITE)) {
 795                 /*
 796                  * called for a read, do the setup so that checksum validation
 797                  * can happen in the async kernel threads
 798                  */
 799                 return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio,
 800                                      mirror_num, 0);
 801         }
 802
 803         /*
 804          * kthread helpers are used to submit writes so that checksumming
 805          * can happen in parallel across all CPUs
 806          */
 807         return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
 808                                    inode, rw, bio, mirror_num, 0,
 809                                    bio_offset,
 810                                    __btree_submit_bio_start,
 811                                    __btree_submit_bio_done);
 812 }
 813
 814 #ifdef CONFIG_MIGRATION
 815 static int btree_migratepage(struct address_space *mapping,
 816                         struct page *newpage, struct page *page)
 817 {
 818         /*
 819          * we can't safely write a btree page from here,
 820          * we haven't done the locking hook
 821          */
 822         if (PageDirty(page))
 823                 return -EAGAIN;
 824         /*
 825          * Buffers may be managed in a filesystem specific way.
 826          * We must have no buffers or drop them.
 827          */
 828         if (page_has_private(page) &&
 829             !try_to_release_page(page, GFP_KERNEL))
 830                 return -EAGAIN;
 831         return migrate_page(mapping, newpage, page);
 832 }
 833 #endif
 834
 835 static int btree_writepage(struct page *page, struct writeback_control *wbc)
 836 {
 837         struct extent_io_tree *tree;
 838         struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
 839         struct extent_buffer *eb;
 840         int was_dirty;
 841
 842         tree = &BTRFS_I(page->mapping->host)->io_tree;
 843         if (!(current->flags & PF_MEMALLOC)) {
 844                 return extent_write_full_page(tree, page,
 845                                               btree_get_extent, wbc);
 846         }
 847
 848         redirty_page_for_writepage(wbc, page);
 849         eb = btrfs_find_tree_block(root, page_offset(page), PAGE_CACHE_SIZE);
 850         WARN_ON(!eb);
 851
 852         was_dirty = test_and_set_bit(EXTENT_BUFFER_DIRTY, &eb->bflags);
 853         if (!was_dirty) {
 854                 spin_lock(&root->fs_info->delalloc_lock);
 855                 root->fs_info->dirty_metadata_bytes += PAGE_CACHE_SIZE;
 856                 spin_unlock(&root->fs_info->delalloc_lock);
 857         }
 858         free_extent_buffer(eb);
 859
 860         unlock_page(page);
 861         return 0;
 862 }
 863
 864 static int btree_writepages(struct address_space *mapping,
 865                             struct writeback_control *wbc)
 866 {
 867         struct extent_io_tree *tree;
 868         tree = &BTRFS_I(mapping->host)->io_tree;
 869         if (wbc->sync_mode == WB_SYNC_NONE) {
 870                 struct btrfs_root *root = BTRFS_I(mapping->host)->root;
 871                 u64 num_dirty;
 872                 unsigned long thresh = 32 * 1024 * 1024;
 873
 874                 if (wbc->for_kupdate)
 875                         return 0;
 876
 877                 /* this is a bit racy, but that's ok */
 878                 num_dirty = root->fs_info->dirty_metadata_bytes;
 879                 if (num_dirty < thresh)
 880                         return 0;
 881         }
 882         return extent_writepages(tree, mapping, btree_get_extent, wbc);
 883 }
 884
 885 static int btree_readpage(struct file *file, struct page *page)
 886 {
 887         struct extent_io_tree *tree;
 888         tree = &BTRFS_I(page->mapping->host)->io_tree;
 889         return extent_read_full_page(tree, page, btree_get_extent);
 890 }
 891
 892 static int btree_releasepage(struct page *page, gfp_t gfp_flags)
 893 {
 894         struct extent_io_tree *tree;
 895         struct extent_map_tree *map;
 896         int ret;
 897
 898         if (PageWriteback(page) || PageDirty(page))
 899                 return 0;
 900
 901         tree = &BTRFS_I(page->mapping->host)->io_tree;
 902         map = &BTRFS_I(page->mapping->host)->extent_tree;
 903
 904         ret = try_release_extent_state(map, tree, page, gfp_flags);
 905         if (!ret)
 906                 return 0;
 907
 908         ret = try_release_extent_buffer(tree, page);
 909         if (ret == 1) {
 910                 ClearPagePrivate(page);
 911                 set_page_private(page, 0);
 912                 page_cache_release(page);
 913         }
 914
 915         return ret;
 916 }
 917
 918 static void btree_invalidatepage(struct page *page, unsigned long offset)
 919 {
 920         struct extent_io_tree *tree;
 921         tree = &BTRFS_I(page->mapping->host)->io_tree;
 922         extent_invalidatepage(tree, page, offset);
 923         btree_releasepage(page, GFP_NOFS);
 924         if (PagePrivate(page)) {
 925                 printk(KERN_WARNING "btrfs warning page private not zero "
 926                        "on page %llu\n", (unsigned long long)page_offset(page));
 927                 ClearPagePrivate(page);
 928                 set_page_private(page, 0);
 929                 page_cache_release(page);
 930         }
 931 }
 932
 933 static const struct address_space_operations btree_aops = {
 934         .readpage       = btree_readpage,
 935         .writepage      = btree_writepage,
 936         .writepages     = btree_writepages,
 937         .releasepage    = btree_releasepage,
 938         .invalidatepage = btree_invalidatepage,
 939 #ifdef CONFIG_MIGRATION
 940         .migratepage    = btree_migratepage,
 941 #endif
 942 };
 943
 944 int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,
 945                          u64 parent_transid)
 946 {
 947         struct extent_buffer *buf = NULL;
 948         struct inode *btree_inode = root->fs_info->btree_inode;
 949         int ret = 0;
 950
 951         buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
 952         if (!buf)
 953                 return 0;
 954         read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
 955                                  buf, 0, 0, btree_get_extent, 0);
 956         free_extent_buffer(buf);
 957         return ret;
 958 }
 959
 960 struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
 961                                             u64 bytenr, u32 blocksize)
 962 {
 963         struct inode *btree_inode = root->fs_info->btree_inode;
 964         struct extent_buffer *eb;
 965         eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
 966                                 bytenr, blocksize, GFP_NOFS);
 967         return eb;
 968 }
 969
 970 struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
 971                                                  u64 bytenr, u32 blocksize)
 972 {
 973         struct inode *btree_inode = root->fs_info->btree_inode;
 974         struct extent_buffer *eb;
 975
 976         eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree,
 977                                  bytenr, blocksize, NULL, GFP_NOFS);
 978         return eb;
 979 }
 980
 981
 982 int btrfs_write_tree_block(struct extent_buffer *buf)
 983 {
 984         return filemap_fdatawrite_range(buf->first_page->mapping, buf->start,
 985                                         buf->start + buf->len - 1);
 986 }
 987
 988 int btrfs_wait_tree_block_writeback(struct extent_buffer *buf)
 989 {
 990         return filemap_fdatawait_range(buf->first_page->mapping,
 991                                        buf->start, buf->start + buf->len - 1);
 992 }
 993
 994 struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
 995                                       u32 blocksize, u64 parent_transid)
 996 {
 997         struct extent_buffer *buf = NULL;
 998         int ret;
 999
1000         buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1001         if (!buf)
1002                 return NULL;
1003
1004         ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
1005
1006         if (ret == 0)
1007                 set_bit(EXTENT_BUFFER_UPTODATE, &buf->bflags);
1008         return buf;
1009
1010 }
1011
1012 int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1013                      struct extent_buffer *buf)
1014 {
1015         struct inode *btree_inode = root->fs_info->btree_inode;
1016         if (btrfs_header_generation(buf) ==
1017             root->fs_info->running_transaction->transid) {
1018                 btrfs_assert_tree_locked(buf);
1019
1020                 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)) {
1021                         spin_lock(&root->fs_info->delalloc_lock);
1022                         if (root->fs_info->dirty_metadata_bytes >= buf->len)
1023                                 root->fs_info->dirty_metadata_bytes -= buf->len;
1024                         else
1025                                 WARN_ON(1);
1026                         spin_unlock(&root->fs_info->delalloc_lock);
1027                 }
1028
1029                 /* ugh, clear_extent_buffer_dirty needs to lock the page */
1030                 btrfs_set_lock_blocking(buf);
1031                 clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree,
1032                                           buf);
1033         }
1034         return 0;
1035 }
1036
1037 static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
1038                         u32 stripesize, struct btrfs_root *root,
1039                         struct btrfs_fs_info *fs_info,
1040                         u64 objectid)
1041 {
1042         root->node = NULL;
1043         root->commit_root = NULL;
1044         root->sectorsize = sectorsize;
1045         root->nodesize = nodesize;
1046         root->leafsize = leafsize;
1047         root->stripesize = stripesize;
1048         root->ref_cows = 0;
1049         root->track_dirty = 0;
1050         root->in_radix = 0;
1051         root->orphan_item_inserted = 0;
1052         root->orphan_cleanup_state = 0;
1053
1054         root->fs_info = fs_info;
1055         root->objectid = objectid;
1056         root->last_trans = 0;
1057         root->highest_objectid = 0;
1058         root->name = NULL;
1059         root->in_sysfs = 0;
1060         root->inode_tree = RB_ROOT;
1061         root->block_rsv = NULL;
1062         root->orphan_block_rsv = NULL;
1063
1064         INIT_LIST_HEAD(&root->dirty_list);
1065         INIT_LIST_HEAD(&root->orphan_list);
1066         INIT_LIST_HEAD(&root->root_list);
1067         spin_lock_init(&root->node_lock);
1068         spin_lock_init(&root->orphan_lock);
1069         spin_lock_init(&root->inode_lock);
1070         spin_lock_init(&root->accounting_lock);
1071         mutex_init(&root->objectid_mutex);
1072         mutex_init(&root->log_mutex);
1073         init_waitqueue_head(&root->log_writer_wait);
1074         init_waitqueue_head(&root->log_commit_wait[0]);
1075         init_waitqueue_head(&root->log_commit_wait[1]);
1076         atomic_set(&root->log_commit[0], 0);
1077         atomic_set(&root->log_commit[1], 0);
1078         atomic_set(&root->log_writers, 0);
1079         root->log_batch = 0;
1080         root->log_transid = 0;
1081         root->last_log_commit = 0;
1082         extent_io_tree_init(&root->dirty_log_pages,
1083                              fs_info->btree_inode->i_mapping, GFP_NOFS);
1084
1085         memset(&root->root_key, 0, sizeof(root->root_key));
1086         memset(&root->root_item, 0, sizeof(root->root_item));
1087         memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
1088         memset(&root->root_kobj, 0, sizeof(root->root_kobj));
1089         root->defrag_trans_start = fs_info->generation;
1090         init_completion(&root->kobj_unregister);
1091         root->defrag_running = 0;
1092         root->root_key.objectid = objectid;
1093         root->anon_super.s_root = NULL;
1094         root->anon_super.s_dev = 0;
1095         INIT_LIST_HEAD(&root->anon_super.s_list);
1096         INIT_LIST_HEAD(&root->anon_super.s_instances);
1097         init_rwsem(&root->anon_super.s_umount);
1098
1099         return 0;
1100 }
1101
1102 static int find_and_setup_root(struct btrfs_root *tree_root,
1103                                struct btrfs_fs_info *fs_info,
1104                                u64 objectid,
1105                                struct btrfs_root *root)
1106 {
1107         int ret;
1108         u32 blocksize;
1109         u64 generation;
1110
1111         __setup_root(tree_root->nodesize, tree_root->leafsize,
1112                      tree_root->sectorsize, tree_root->stripesize,
1113                      root, fs_info, objectid);
1114         ret = btrfs_find_last_root(tree_root, objectid,
1115                                    &root->root_item, &root->root_key);
1116         if (ret > 0)
1117                 return -ENOENT;
1118         BUG_ON(ret);
1119
1120         generation = btrfs_root_generation(&root->root_item);
1121         blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
1122         root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
1123                                      blocksize, generation);
1124         if (!root->node || !btrfs_buffer_uptodate(root->node, generation)) {
1125                 free_extent_buffer(root->node);
1126                 return -EIO;
1127         }
1128         root->commit_root = btrfs_root_node(root);
1129         return 0;
1130 }
1131
1132 static struct btrfs_root *alloc_log_tree(struct btrfs_trans_handle *trans,
1133                                          struct btrfs_fs_info *fs_info)
1134 {
1135         struct btrfs_root *root;
1136         struct btrfs_root *tree_root = fs_info->tree_root;
1137         struct extent_buffer *leaf;
1138
1139         root = kzalloc(sizeof(*root), GFP_NOFS);
1140         if (!root)
1141                 return ERR_PTR(-ENOMEM);
1142
1143         __setup_root(tree_root->nodesize, tree_root->leafsize,
1144                      tree_root->sectorsize, tree_root->stripesize,
1145                      root, fs_info, BTRFS_TREE_LOG_OBJECTID);
1146
1147         root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID;
1148         root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1149         root->root_key.offset = BTRFS_TREE_LOG_OBJECTID;
1150         /*
1151          * log trees do not get reference counted because they go away
1152          * before a real commit is actually done.  They do store pointers
1153          * to file data extents, and those reference counts still get
1154          * updated (along with back refs to the log tree).
1155          */
1156         root->ref_cows = 0;
1157
1158         leaf = btrfs_alloc_free_block(trans, root, root->leafsize, 0,
1159                                       BTRFS_TREE_LOG_OBJECTID, NULL, 0, 0, 0);
1160         if (IS_ERR(leaf)) {
1161                 kfree(root);
1162                 return ERR_CAST(leaf);
1163         }
1164
1165         memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1166         btrfs_set_header_bytenr(leaf, leaf->start);
1167         btrfs_set_header_generation(leaf, trans->transid);
1168         btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1169         btrfs_set_header_owner(leaf, BTRFS_TREE_LOG_OBJECTID);
1170         root->node = leaf;
1171
1172         write_extent_buffer(root->node, root->fs_info->fsid,
1173                             (unsigned long)btrfs_header_fsid(root->node),
1174                             BTRFS_FSID_SIZE);
1175         btrfs_mark_buffer_dirty(root->node);
1176         btrfs_tree_unlock(root->node);
1177         return root;
1178 }
1179
1180 int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans,
1181                              struct btrfs_fs_info *fs_info)
1182 {
1183         struct btrfs_root *log_root;
1184
1185         log_root = alloc_log_tree(trans, fs_info);
1186         if (IS_ERR(log_root))
1187                 return PTR_ERR(log_root);
1188         WARN_ON(fs_info->log_root_tree);
1189         fs_info->log_root_tree = log_root;
1190         return 0;
1191 }
1192
1193 int btrfs_add_log_tree(struct btrfs_trans_handle *trans,
1194                        struct btrfs_root *root)
1195 {
1196         struct btrfs_root *log_root;
1197         struct btrfs_inode_item *inode_item;
1198
1199         log_root = alloc_log_tree(trans, root->fs_info);
1200         if (IS_ERR(log_root))
1201                 return PTR_ERR(log_root);
1202
1203         log_root->last_trans = trans->transid;
1204         log_root->root_key.offset = root->root_key.objectid;
1205
1206         inode_item = &log_root->root_item.inode;
1207         inode_item->generation = cpu_to_le64(1);
1208         inode_item->size = cpu_to_le64(3);
1209         inode_item->nlink = cpu_to_le32(1);
1210         inode_item->nbytes = cpu_to_le64(root->leafsize);
1211         inode_item->mode = cpu_to_le32(S_IFDIR | 0755);
1212
1213         btrfs_set_root_node(&log_root->root_item, log_root->node);
1214
1215         WARN_ON(root->log_root);
1216         root->log_root = log_root;
1217         root->log_transid = 0;
1218         root->last_log_commit = 0;
1219         return 0;
1220 }
1221
1222 struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_root *tree_root,
1223                                                struct btrfs_key *location)
1224 {
1225         struct btrfs_root *root;
1226         struct btrfs_fs_info *fs_info = tree_root->fs_info;
1227         struct btrfs_path *path;
1228         struct extent_buffer *l;
1229         u64 generation;
1230         u32 blocksize;
1231         int ret = 0;
1232
1233         root = kzalloc(sizeof(*root), GFP_NOFS);
1234         if (!root)
1235                 return ERR_PTR(-ENOMEM);
1236         if (location->offset == (u64)-1) {
1237                 ret = find_and_setup_root(tree_root, fs_info,
1238                                           location->objectid, root);
1239                 if (ret) {
1240                         kfree(root);
1241                         return ERR_PTR(ret);
1242                 }
1243                 goto out;
1244         }
1245
1246         __setup_root(tree_root->nodesize, tree_root->leafsize,
1247                      tree_root->sectorsize, tree_root->stripesize,
1248                      root, fs_info, location->objectid);
1249
1250         path = btrfs_alloc_path();
1251         if (!path) {
1252                 kfree(root);
1253                 return ERR_PTR(-ENOMEM);
1254         }
1255         ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0);
1256         if (ret == 0) {
1257                 l = path->nodes[0];
1258                 read_extent_buffer(l, &root->root_item,
1259                                 btrfs_item_ptr_offset(l, path->slots[0]),
1260                                 sizeof(root->root_item));
1261                 memcpy(&root->root_key, location, sizeof(*location));
1262         }
1263         btrfs_free_path(path);
1264         if (ret) {
1265                 kfree(root);
1266                 if (ret > 0)
1267                         ret = -ENOENT;
1268                 return ERR_PTR(ret);
1269         }
1270
1271         generation = btrfs_root_generation(&root->root_item);
1272         blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
1273         root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
1274                                      blocksize, generation);
1275         root->commit_root = btrfs_root_node(root);
1276         BUG_ON(!root->node);
1277 out:
1278         if (location->objectid != BTRFS_TREE_LOG_OBJECTID)
1279                 root->ref_cows = 1;
1280
1281         return root;
1282 }
1283
1284 struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
1285                                         u64 root_objectid)
1286 {
1287         struct btrfs_root *root;
1288
1289         if (root_objectid == BTRFS_ROOT_TREE_OBJECTID)
1290                 return fs_info->tree_root;
1291         if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID)
1292                 return fs_info->extent_root;
1293
1294         root = radix_tree_lookup(&fs_info->fs_roots_radix,
1295                                  (unsigned long)root_objectid);
1296         return root;
1297 }
1298
1299 struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info,
1300                                               struct btrfs_key *location)
1301 {
1302         struct btrfs_root *root;
1303         int ret;
1304
1305         if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
1306                 return fs_info->tree_root;
1307         if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
1308                 return fs_info->extent_root;
1309         if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID)
1310                 return fs_info->chunk_root;
1311         if (location->objectid == BTRFS_DEV_TREE_OBJECTID)
1312                 return fs_info->dev_root;
1313         if (location->objectid == BTRFS_CSUM_TREE_OBJECTID)
1314                 return fs_info->csum_root;
1315 again:
1316         spin_lock(&fs_info->fs_roots_radix_lock);
1317         root = radix_tree_lookup(&fs_info->fs_roots_radix,
1318                                  (unsigned long)location->objectid);
1319         spin_unlock(&fs_info->fs_roots_radix_lock);
1320         if (root)
1321                 return root;
1322
1323         root = btrfs_read_fs_root_no_radix(fs_info->tree_root, location);
1324         if (IS_ERR(root))
1325                 return root;
1326
1327         set_anon_super(&root->anon_super, NULL);
1328
1329         if (btrfs_root_refs(&root->root_item) == 0) {
1330                 ret = -ENOENT;
1331                 goto fail;
1332         }
1333
1334         ret = btrfs_find_orphan_item(fs_info->tree_root, location->objectid);
1335         if (ret < 0)
1336                 goto fail;
1337         if (ret == 0)
1338                 root->orphan_item_inserted = 1;
1339
1340         ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM);
1341         if (ret)
1342                 goto fail;
1343
1344         spin_lock(&fs_info->fs_roots_radix_lock);
1345         ret = radix_tree_insert(&fs_info->fs_roots_radix,
1346                                 (unsigned long)root->root_key.objectid,
1347                                 root);
1348         if (ret == 0)
1349                 root->in_radix = 1;
1350
1351         spin_unlock(&fs_info->fs_roots_radix_lock);
1352         radix_tree_preload_end();
1353         if (ret) {
1354                 if (ret == -EEXIST) {
1355                         free_fs_root(root);
1356                         goto again;
1357                 }
1358                 goto fail;
1359         }
1360
1361         ret = btrfs_find_dead_roots(fs_info->tree_root,
1362                                     root->root_key.objectid);
1363         WARN_ON(ret);
1364         return root;
1365 fail:
1366         free_fs_root(root);
1367         return ERR_PTR(ret);
1368 }
1369
1370 struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info,
1371                                       struct btrfs_key *location,
1372                                       const char *name, int namelen)
1373 {
1374         return btrfs_read_fs_root_no_name(fs_info, location);
1375 #if 0
1376         struct btrfs_root *root;
1377         int ret;
1378
1379         root = btrfs_read_fs_root_no_name(fs_info, location);
1380         if (!root)
1381                 return NULL;
1382
1383         if (root->in_sysfs)
1384                 return root;
1385
1386         ret = btrfs_set_root_name(root, name, namelen);
1387         if (ret) {
1388                 free_extent_buffer(root->node);
1389                 kfree(root);
1390                 return ERR_PTR(ret);
1391         }
1392
1393         ret = btrfs_sysfs_add_root(root);
1394         if (ret) {
1395                 free_extent_buffer(root->node);
1396                 kfree(root->name);
1397                 kfree(root);
1398                 return ERR_PTR(ret);
1399         }
1400         root->in_sysfs = 1;
1401         return root;
1402 #endif
1403 }
1404
1405 static int btrfs_congested_fn(void *congested_data, int bdi_bits)
1406 {
1407         struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data;
1408         int ret = 0;
1409         struct btrfs_device *device;
1410         struct backing_dev_info *bdi;
1411
1412         list_for_each_entry(device, &info->fs_devices->devices, dev_list) {
1413                 if (!device->bdev)
1414                         continue;
1415                 bdi = blk_get_backing_dev_info(device->bdev);
1416                 if (bdi && bdi_congested(bdi, bdi_bits)) {
1417                         ret = 1;
1418                         break;
1419                 }
1420         }
1421         return ret;
1422 }
1423
1424 /*
1425  * If this fails, caller must call bdi_destroy() to get rid of the
1426  * bdi again.
1427  */
1428 static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi)
1429 {
1430         int err;
1431
1432         bdi->capabilities = BDI_CAP_MAP_COPY;
1433         err = bdi_setup_and_register(bdi, "btrfs", BDI_CAP_MAP_COPY);
1434         if (err)
1435                 return err;
1436
1437         bdi->ra_pages   = default_backing_dev_info.ra_pages;
1438         bdi->congested_fn       = btrfs_congested_fn;
1439         bdi->congested_data     = info;
1440         return 0;
1441 }
1442
1443 static int bio_ready_for_csum(struct bio *bio)
1444 {
1445         u64 length = 0;
1446         u64 buf_len = 0;
1447         u64 start = 0;
1448         struct page *page;
1449         struct extent_io_tree *io_tree = NULL;
1450         struct bio_vec *bvec;
1451         int i;
1452         int ret;
1453
1454         bio_for_each_segment(bvec, bio, i) {
1455                 page = bvec->bv_page;
1456                 if (page->private == EXTENT_PAGE_PRIVATE) {
1457                         length += bvec->bv_len;
1458                         continue;
1459                 }
1460                 if (!page->private) {
1461                         length += bvec->bv_len;
1462                         continue;
1463                 }
1464                 length = bvec->bv_len;
1465                 buf_len = page->private >> 2;
1466                 start = page_offset(page) + bvec->bv_offset;
1467                 io_tree = &BTRFS_I(page->mapping->host)->io_tree;
1468         }
1469         /* are we fully contained in this bio? */
1470         if (buf_len <= length)
1471                 return 1;
1472
1473         ret = extent_range_uptodate(io_tree, start + length,
1474                                     start + buf_len - 1);
1475         return ret;
1476 }
1477
1478 /*
1479  * called by the kthread helper functions to finally call the bio end_io
1480  * functions.  This is where read checksum verification actually happens
1481  */
1482 static void end_workqueue_fn(struct btrfs_work *work)
1483 {
1484         struct bio *bio;
1485         struct end_io_wq *end_io_wq;
1486         struct btrfs_fs_info *fs_info;
1487         int error;
1488
1489         end_io_wq = container_of(work, struct end_io_wq, work);
1490         bio = end_io_wq->bio;
1491         fs_info = end_io_wq->info;
1492
1493         /* metadata bio reads are special because the whole tree block must
1494          * be checksummed at once.  This makes sure the entire block is in
1495          * ram and up to date before trying to verify things.  For
1496          * blocksize <= pagesize, it is basically a noop
1497          */
1498         if (!(bio->bi_rw & REQ_WRITE) && end_io_wq->metadata &&
1499             !bio_ready_for_csum(bio)) {
1500                 btrfs_queue_worker(&fs_info->endio_meta_workers,
1501                                    &end_io_wq->work);
1502                 return;
1503         }
1504         error = end_io_wq->error;
1505         bio->bi_private = end_io_wq->private;
1506         bio->bi_end_io = end_io_wq->end_io;
1507         kfree(end_io_wq);
1508         bio_endio(bio, error);
1509 }
1510
1511 static int cleaner_kthread(void *arg)
1512 {
1513         struct btrfs_root *root = arg;
1514
1515         do {
1516                 vfs_check_frozen(root->fs_info->sb, SB_FREEZE_WRITE);
1517
1518                 if (!(root->fs_info->sb->s_flags & MS_RDONLY) &&
1519                     mutex_trylock(&root->fs_info->cleaner_mutex)) {
1520                         btrfs_run_delayed_iputs(root);
1521                         btrfs_clean_old_snapshots(root);
1522                         mutex_unlock(&root->fs_info->cleaner_mutex);
1523                 }
1524
1525                 if (freezing(current)) {
1526                         refrigerator();
1527                 } else {
1528                         set_current_state(TASK_INTERRUPTIBLE);
1529                         if (!kthread_should_stop())
1530                                 schedule();
1531                         __set_current_state(TASK_RUNNING);
1532                 }
1533         } while (!kthread_should_stop());
1534         return 0;
1535 }
1536
1537 static int transaction_kthread(void *arg)
1538 {
1539         struct btrfs_root *root = arg;
1540         struct btrfs_trans_handle *trans;
1541         struct btrfs_transaction *cur;
1542         u64 transid;
1543         unsigned long now;
1544         unsigned long delay;
1545         int ret;
1546
1547         do {
1548                 delay = HZ * 30;
1549                 vfs_check_frozen(root->fs_info->sb, SB_FREEZE_WRITE);
1550                 mutex_lock(&root->fs_info->transaction_kthread_mutex);
1551
1552                 spin_lock(&root->fs_info->new_trans_lock);
1553                 cur = root->fs_info->running_transaction;
1554                 if (!cur) {
1555                         spin_unlock(&root->fs_info->new_trans_lock);
1556                         goto sleep;
1557                 }
1558
1559                 now = get_seconds();
1560                 if (!cur->blocked &&
1561                     (now < cur->start_time || now - cur->start_time < 30)) {
1562                         spin_unlock(&root->fs_info->new_trans_lock);
1563                         delay = HZ * 5;
1564                         goto sleep;
1565                 }
1566                 transid = cur->transid;
1567                 spin_unlock(&root->fs_info->new_trans_lock);
1568
1569                 trans = btrfs_join_transaction(root, 1);
1570                 BUG_ON(IS_ERR(trans));
1571                 if (transid == trans->transid) {
1572                         ret = btrfs_commit_transaction(trans, root);
1573                         BUG_ON(ret);
1574                 } else {
1575                         btrfs_end_transaction(trans, root);
1576                 }
1577 sleep:
1578                 wake_up_process(root->fs_info->cleaner_kthread);
1579                 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
1580
1581                 if (freezing(current)) {
1582                         refrigerator();
1583                 } else {
1584                         set_current_state(TASK_INTERRUPTIBLE);
1585                         if (!kthread_should_stop() &&
1586                             !btrfs_transaction_blocked(root->fs_info))
1587                                 schedule_timeout(delay);
1588                         __set_current_state(TASK_RUNNING);
1589                 }
1590         } while (!kthread_should_stop());
1591         return 0;
1592 }
1593
1594 struct btrfs_root *open_ctree(struct super_block *sb,
1595                               struct btrfs_fs_devices *fs_devices,
1596                               char *options)
1597 {
1598         u32 sectorsize;
1599         u32 nodesize;
1600         u32 leafsize;
1601         u32 blocksize;
1602         u32 stripesize;
1603         u64 generation;
1604         u64 features;
1605         struct btrfs_key location;
1606         struct buffer_head *bh;
1607         struct btrfs_root *extent_root = kzalloc(sizeof(struct btrfs_root),
1608                                                  GFP_NOFS);
1609         struct btrfs_root *csum_root = kzalloc(sizeof(struct btrfs_root),
1610                                                  GFP_NOFS);
1611         struct btrfs_root *tree_root = btrfs_sb(sb);
1612         struct btrfs_fs_info *fs_info = tree_root->fs_info;
1613         struct btrfs_root *chunk_root = kzalloc(sizeof(struct btrfs_root),
1614                                                 GFP_NOFS);
1615         struct btrfs_root *dev_root = kzalloc(sizeof(struct btrfs_root),
1616                                               GFP_NOFS);
1617         struct btrfs_root *log_tree_root;
1618
1619         int ret;
1620         int err = -EINVAL;
1621
1622         struct btrfs_super_block *disk_super;
1623
1624         if (!extent_root || !tree_root || !fs_info ||
1625             !chunk_root || !dev_root || !csum_root) {
1626                 err = -ENOMEM;
1627                 goto fail;
1628         }
1629
1630         ret = init_srcu_struct(&fs_info->subvol_srcu);
1631         if (ret) {
1632                 err = ret;
1633                 goto fail;
1634         }
1635
1636         ret = setup_bdi(fs_info, &fs_info->bdi);
1637         if (ret) {
1638                 err = ret;
1639                 goto fail_srcu;
1640         }
1641
1642         fs_info->btree_inode = new_inode(sb);
1643         if (!fs_info->btree_inode) {
1644                 err = -ENOMEM;
1645                 goto fail_bdi;
1646         }
1647
1648         fs_info->btree_inode->i_mapping->flags &= ~__GFP_FS;
1649
1650         INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC);
1651         INIT_LIST_HEAD(&fs_info->trans_list);
1652         INIT_LIST_HEAD(&fs_info->dead_roots);
1653         INIT_LIST_HEAD(&fs_info->delayed_iputs);
1654         INIT_LIST_HEAD(&fs_info->hashers);
1655         INIT_LIST_HEAD(&fs_info->delalloc_inodes);
1656         INIT_LIST_HEAD(&fs_info->ordered_operations);
1657         INIT_LIST_HEAD(&fs_info->caching_block_groups);
1658         spin_lock_init(&fs_info->delalloc_lock);
1659         spin_lock_init(&fs_info->new_trans_lock);
1660         spin_lock_init(&fs_info->ref_cache_lock);
1661         spin_lock_init(&fs_info->fs_roots_radix_lock);
1662         spin_lock_init(&fs_info->delayed_iput_lock);
1663
1664         init_completion(&fs_info->kobj_unregister);
1665         fs_info->tree_root = tree_root;
1666         fs_info->extent_root = extent_root;
1667         fs_info->csum_root = csum_root;
1668         fs_info->chunk_root = chunk_root;
1669         fs_info->dev_root = dev_root;
1670         fs_info->fs_devices = fs_devices;
1671         INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
1672         INIT_LIST_HEAD(&fs_info->space_info);
1673         btrfs_mapping_init(&fs_info->mapping_tree);
1674         btrfs_init_block_rsv(&fs_info->global_block_rsv);
1675         btrfs_init_block_rsv(&fs_info->delalloc_block_rsv);
1676         btrfs_init_block_rsv(&fs_info->trans_block_rsv);
1677         btrfs_init_block_rsv(&fs_info->chunk_block_rsv);
1678         btrfs_init_block_rsv(&fs_info->empty_block_rsv);
1679         INIT_LIST_HEAD(&fs_info->durable_block_rsv_list);
1680         mutex_init(&fs_info->durable_block_rsv_mutex);
1681         atomic_set(&fs_info->nr_async_submits, 0);
1682         atomic_set(&fs_info->async_delalloc_pages, 0);
1683         atomic_set(&fs_info->async_submit_draining, 0);
1684         atomic_set(&fs_info->nr_async_bios, 0);
1685         fs_info->sb = sb;
1686         fs_info->max_inline = 8192 * 1024;
1687         fs_info->metadata_ratio = 0;
1688
1689         fs_info->thread_pool_size = min_t(unsigned long,
1690                                           num_online_cpus() + 2, 8);
1691
1692         INIT_LIST_HEAD(&fs_info->ordered_extents);
1693         spin_lock_init(&fs_info->ordered_extent_lock);
1694
1695         sb->s_blocksize = 4096;
1696         sb->s_blocksize_bits = blksize_bits(4096);
1697         sb->s_bdi = &fs_info->bdi;
1698
1699         fs_info->btree_inode->i_ino = BTRFS_BTREE_INODE_OBJECTID;
1700         fs_info->btree_inode->i_nlink = 1;
1701         /*
1702          * we set the i_size on the btree inode to the max possible int.
1703          * the real end of the address space is determined by all of
1704          * the devices in the system
1705          */
1706         fs_info->btree_inode->i_size = OFFSET_MAX;
1707         fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
1708         fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi;
1709
1710         RB_CLEAR_NODE(&BTRFS_I(fs_info->btree_inode)->rb_node);
1711         extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
1712                              fs_info->btree_inode->i_mapping,
1713                              GFP_NOFS);
1714         extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree,
1715                              GFP_NOFS);
1716
1717         BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops;
1718
1719         BTRFS_I(fs_info->btree_inode)->root = tree_root;
1720         memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
1721                sizeof(struct btrfs_key));
1722         BTRFS_I(fs_info->btree_inode)->dummy_inode = 1;
1723         insert_inode_hash(fs_info->btree_inode);
1724
1725         spin_lock_init(&fs_info->block_group_cache_lock);
1726         fs_info->block_group_cache_tree = RB_ROOT;
1727
1728         extent_io_tree_init(&fs_info->freed_extents[0],
1729                              fs_info->btree_inode->i_mapping, GFP_NOFS);
1730         extent_io_tree_init(&fs_info->freed_extents[1],
1731                              fs_info->btree_inode->i_mapping, GFP_NOFS);
1732         fs_info->pinned_extents = &fs_info->freed_extents[0];
1733         fs_info->do_barriers = 1;
1734
1735
1736         mutex_init(&fs_info->trans_mutex);
1737         mutex_init(&fs_info->ordered_operations_mutex);
1738         mutex_init(&fs_info->tree_log_mutex);
1739         mutex_init(&fs_info->chunk_mutex);
1740         mutex_init(&fs_info->transaction_kthread_mutex);
1741         mutex_init(&fs_info->cleaner_mutex);
1742         mutex_init(&fs_info->volume_mutex);
1743         init_rwsem(&fs_info->extent_commit_sem);
1744         init_rwsem(&fs_info->cleanup_work_sem);
1745         init_rwsem(&fs_info->subvol_sem);
1746
1747         btrfs_init_free_cluster(&fs_info->meta_alloc_cluster);
1748         btrfs_init_free_cluster(&fs_info->data_alloc_cluster);
1749
1750         init_waitqueue_head(&fs_info->transaction_throttle);
1751         init_waitqueue_head(&fs_info->transaction_wait);
1752         init_waitqueue_head(&fs_info->transaction_blocked_wait);
1753         init_waitqueue_head(&fs_info->async_submit_wait);
1754
1755         __setup_root(4096, 4096, 4096, 4096, tree_root,
1756                      fs_info, BTRFS_ROOT_TREE_OBJECTID);
1757
1758         bh = btrfs_read_dev_super(fs_devices->latest_bdev);
1759         if (!bh) {
1760                 err = -EINVAL;
1761                 goto fail_iput;
1762         }
1763
1764         memcpy(&fs_info->super_copy, bh->b_data, sizeof(fs_info->super_copy));
1765         memcpy(&fs_info->super_for_commit, &fs_info->super_copy,
1766                sizeof(fs_info->super_for_commit));
1767         brelse(bh);
1768
1769         memcpy(fs_info->fsid, fs_info->super_copy.fsid, BTRFS_FSID_SIZE);
1770
1771         disk_super = &fs_info->super_copy;
1772         if (!btrfs_super_root(disk_super))
1773                 goto fail_iput;
1774
1775         /* check FS state, whether FS is broken. */
1776         fs_info->fs_state |= btrfs_super_flags(disk_super);
1777
1778         btrfs_check_super_valid(fs_info, sb->s_flags & MS_RDONLY);
1779
1780         /*
1781          * In the long term, we'll store the compression type in the super
1782          * block, and it'll be used for per file compression control.
1783          */
1784         fs_info->compress_type = BTRFS_COMPRESS_ZLIB;
1785
1786         ret = btrfs_parse_options(tree_root, options);
1787         if (ret) {
1788                 err = ret;
1789                 goto fail_iput;
1790         }
1791
1792         features = btrfs_super_incompat_flags(disk_super) &
1793                 ~BTRFS_FEATURE_INCOMPAT_SUPP;
1794         if (features) {
1795                 printk(KERN_ERR "BTRFS: couldn't mount because of "
1796                        "unsupported optional features (%Lx).\n",
1797                        (unsigned long long)features);
1798                 err = -EINVAL;
1799                 goto fail_iput;
1800         }
1801
1802         features = btrfs_super_incompat_flags(disk_super);
1803         features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
1804         if (tree_root->fs_info->compress_type & BTRFS_COMPRESS_LZO)
1805                 features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
1806         btrfs_set_super_incompat_flags(disk_super, features);
1807
1808         features = btrfs_super_compat_ro_flags(disk_super) &
1809                 ~BTRFS_FEATURE_COMPAT_RO_SUPP;
1810         if (!(sb->s_flags & MS_RDONLY) && features) {
1811                 printk(KERN_ERR "BTRFS: couldn't mount RDWR because of "
1812                        "unsupported option features (%Lx).\n",
1813                        (unsigned long long)features);
1814                 err = -EINVAL;
1815                 goto fail_iput;
1816         }
1817
1818         btrfs_init_workers(&fs_info->generic_worker,
1819                            "genwork", 1, NULL);
1820
1821         btrfs_init_workers(&fs_info->workers, "worker",
1822                            fs_info->thread_pool_size,
1823                            &fs_info->generic_worker);
1824
1825         btrfs_init_workers(&fs_info->delalloc_workers, "delalloc",
1826                            fs_info->thread_pool_size,
1827                            &fs_info->generic_worker);
1828
1829         btrfs_init_workers(&fs_info->submit_workers, "submit",
1830                            min_t(u64, fs_devices->num_devices,
1831                            fs_info->thread_pool_size),
1832                            &fs_info->generic_worker);
1833
1834         /* a higher idle thresh on the submit workers makes it much more
1835          * likely that bios will be send down in a sane order to the
1836          * devices
1837          */
1838         fs_info->submit_workers.idle_thresh = 64;
1839
1840         fs_info->workers.idle_thresh = 16;
1841         fs_info->workers.ordered = 1;
1842
1843         fs_info->delalloc_workers.idle_thresh = 2;
1844         fs_info->delalloc_workers.ordered = 1;
1845
1846         btrfs_init_workers(&fs_info->fixup_workers, "fixup", 1,
1847                            &fs_info->generic_worker);
1848         btrfs_init_workers(&fs_info->endio_workers, "endio",
1849                            fs_info->thread_pool_size,
1850                            &fs_info->generic_worker);
1851         btrfs_init_workers(&fs_info->endio_meta_workers, "endio-meta",
1852                            fs_info->thread_pool_size,
1853                            &fs_info->generic_worker);
1854         btrfs_init_workers(&fs_info->endio_meta_write_workers,
1855                            "endio-meta-write", fs_info->thread_pool_size,
1856                            &fs_info->generic_worker);
1857         btrfs_init_workers(&fs_info->endio_write_workers, "endio-write",
1858                            fs_info->thread_pool_size,
1859                            &fs_info->generic_worker);
1860         btrfs_init_workers(&fs_info->endio_freespace_worker, "freespace-write",
1861                            1, &fs_info->generic_worker);
1862
1863         /*
1864          * endios are largely parallel and should have a very
1865          * low idle thresh
1866          */
1867         fs_info->endio_workers.idle_thresh = 4;
1868         fs_info->endio_meta_workers.idle_thresh = 4;
1869
1870         fs_info->endio_write_workers.idle_thresh = 2;
1871         fs_info->endio_meta_write_workers.idle_thresh = 2;
1872
1873         btrfs_start_workers(&fs_info->workers, 1);
1874         btrfs_start_workers(&fs_info->generic_worker, 1);
1875         btrfs_start_workers(&fs_info->submit_workers, 1);
1876         btrfs_start_workers(&fs_info->delalloc_workers, 1);
1877         btrfs_start_workers(&fs_info->fixup_workers, 1);
1878         btrfs_start_workers(&fs_info->endio_workers, 1);
1879         btrfs_start_workers(&fs_info->endio_meta_workers, 1);
1880         btrfs_start_workers(&fs_info->endio_meta_write_workers, 1);
1881         btrfs_start_workers(&fs_info->endio_write_workers, 1);
1882         btrfs_start_workers(&fs_info->endio_freespace_worker, 1);
1883
1884         fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super);
1885         fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages,
1886                                     4 * 1024 * 1024 / PAGE_CACHE_SIZE);
1887
1888         nodesize = btrfs_super_nodesize(disk_super);
1889         leafsize = btrfs_super_leafsize(disk_super);
1890         sectorsize = btrfs_super_sectorsize(disk_super);
1891         stripesize = btrfs_super_stripesize(disk_super);
1892         tree_root->nodesize = nodesize;
1893         tree_root->leafsize = leafsize;
1894         tree_root->sectorsize = sectorsize;
1895         tree_root->stripesize = stripesize;
1896
1897         sb->s_blocksize = sectorsize;
1898         sb->s_blocksize_bits = blksize_bits(sectorsize);
1899
1900         if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC,
1901                     sizeof(disk_super->magic))) {
1902                 printk(KERN_INFO "btrfs: valid FS not found on %s\n", sb->s_id);
1903                 goto fail_sb_buffer;
1904         }
1905
1906         mutex_lock(&fs_info->chunk_mutex);
1907         ret = btrfs_read_sys_array(tree_root);
1908         mutex_unlock(&fs_info->chunk_mutex);
1909         if (ret) {
1910                 printk(KERN_WARNING "btrfs: failed to read the system "
1911                        "array on %s\n", sb->s_id);
1912                 goto fail_sb_buffer;
1913         }
1914
1915         blocksize = btrfs_level_size(tree_root,
1916                                      btrfs_super_chunk_root_level(disk_super));
1917         generation = btrfs_super_chunk_root_generation(disk_super);
1918
1919         __setup_root(nodesize, leafsize, sectorsize, stripesize,
1920                      chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID);
1921
1922         chunk_root->node = read_tree_block(chunk_root,
1923                                            btrfs_super_chunk_root(disk_super),
1924                                            blocksize, generation);
1925         BUG_ON(!chunk_root->node);
1926         if (!test_bit(EXTENT_BUFFER_UPTODATE, &chunk_root->node->bflags)) {
1927                 printk(KERN_WARNING "btrfs: failed to read chunk root on %s\n",
1928                        sb->s_id);
1929                 goto fail_chunk_root;
1930         }
1931         btrfs_set_root_node(&chunk_root->root_item, chunk_root->node);
1932         chunk_root->commit_root = btrfs_root_node(chunk_root);
1933
1934         read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid,
1935            (unsigned long)btrfs_header_chunk_tree_uuid(chunk_root->node),
1936            BTRFS_UUID_SIZE);
1937
1938         mutex_lock(&fs_info->chunk_mutex);
1939         ret = btrfs_read_chunk_tree(chunk_root);
1940         mutex_unlock(&fs_info->chunk_mutex);
1941         if (ret) {
1942                 printk(KERN_WARNING "btrfs: failed to read chunk tree on %s\n",
1943                        sb->s_id);
1944                 goto fail_chunk_root;
1945         }
1946
1947         btrfs_close_extra_devices(fs_devices);
1948
1949         blocksize = btrfs_level_size(tree_root,
1950                                      btrfs_super_root_level(disk_super));
1951         generation = btrfs_super_generation(disk_super);
1952
1953         tree_root->node = read_tree_block(tree_root,
1954                                           btrfs_super_root(disk_super),
1955                                           blocksize, generation);
1956         if (!tree_root->node)
1957                 goto fail_chunk_root;
1958         if (!test_bit(EXTENT_BUFFER_UPTODATE, &tree_root->node->bflags)) {
1959                 printk(KERN_WARNING "btrfs: failed to read tree root on %s\n",
1960                        sb->s_id);
1961                 goto fail_tree_root;
1962         }
1963         btrfs_set_root_node(&tree_root->root_item, tree_root->node);
1964         tree_root->commit_root = btrfs_root_node(tree_root);
1965
1966         ret = find_and_setup_root(tree_root, fs_info,
1967                                   BTRFS_EXTENT_TREE_OBJECTID, extent_root);
1968         if (ret)
1969                 goto fail_tree_root;
1970         extent_root->track_dirty = 1;
1971
1972         ret = find_and_setup_root(tree_root, fs_info,
1973                                   BTRFS_DEV_TREE_OBJECTID, dev_root);
1974         if (ret)
1975                 goto fail_extent_root;
1976         dev_root->track_dirty = 1;
1977
1978         ret = find_and_setup_root(tree_root, fs_info,
1979                                   BTRFS_CSUM_TREE_OBJECTID, csum_root);
1980         if (ret)
1981                 goto fail_dev_root;
1982
1983         csum_root->track_dirty = 1;
1984
1985         fs_info->generation = generation;
1986         fs_info->last_trans_committed = generation;
1987         fs_info->data_alloc_profile = (u64)-1;
1988         fs_info->metadata_alloc_profile = (u64)-1;
1989         fs_info->system_alloc_profile = fs_info->metadata_alloc_profile;
1990
1991         ret = btrfs_init_space_info(fs_info);
1992         if (ret) {
1993                 printk(KERN_ERR "Failed to initial space info: %d\n", ret);
1994                 goto fail_block_groups;
1995         }
1996
1997         ret = btrfs_read_block_groups(extent_root);
1998         if (ret) {
1999                 printk(KERN_ERR "Failed to read block groups: %d\n", ret);
2000                 goto fail_block_groups;
2001         }
2002
2003         fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root,
2004                                                "btrfs-cleaner");
2005         if (IS_ERR(fs_info->cleaner_kthread))
2006                 goto fail_block_groups;
2007
2008         fs_info->transaction_kthread = kthread_run(transaction_kthread,
2009                                                    tree_root,
2010                                                    "btrfs-transaction");
2011         if (IS_ERR(fs_info->transaction_kthread))
2012                 goto fail_cleaner;
2013
2014         if (!btrfs_test_opt(tree_root, SSD) &&
2015             !btrfs_test_opt(tree_root, NOSSD) &&
2016             !fs_info->fs_devices->rotating) {
2017                 printk(KERN_INFO "Btrfs detected SSD devices, enabling SSD "
2018                        "mode\n");
2019                 btrfs_set_opt(fs_info->mount_opt, SSD);
2020         }
2021
2022         /* do not make disk changes in broken FS */
2023         if (btrfs_super_log_root(disk_super) != 0 &&
2024             !(fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR)) {
2025                 u64 bytenr = btrfs_super_log_root(disk_super);
2026
2027                 if (fs_devices->rw_devices == 0) {
2028                         printk(KERN_WARNING "Btrfs log replay required "
2029                                "on RO media\n");
2030                         err = -EIO;
2031                         goto fail_trans_kthread;
2032                 }
2033                 blocksize =
2034                      btrfs_level_size(tree_root,
2035                                       btrfs_super_log_root_level(disk_super));
2036
2037                 log_tree_root = kzalloc(sizeof(struct btrfs_root), GFP_NOFS);
2038                 if (!log_tree_root) {
2039                         err = -ENOMEM;
2040                         goto fail_trans_kthread;
2041                 }
2042
2043                 __setup_root(nodesize, leafsize, sectorsize, stripesize,
2044                              log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID);
2045
2046                 log_tree_root->node = read_tree_block(tree_root, bytenr,
2047                                                       blocksize,
2048                                                       generation + 1);
2049                 ret = btrfs_recover_log_trees(log_tree_root);
2050                 BUG_ON(ret);
2051
2052                 if (sb->s_flags & MS_RDONLY) {
2053                         ret =  btrfs_commit_super(tree_root);
2054                         BUG_ON(ret);
2055                 }
2056         }
2057
2058         ret = btrfs_find_orphan_roots(tree_root);
2059         BUG_ON(ret);
2060
2061         if (!(sb->s_flags & MS_RDONLY)) {
2062                 ret = btrfs_cleanup_fs_roots(fs_info);
2063                 BUG_ON(ret);
2064
2065                 ret = btrfs_recover_relocation(tree_root);
2066                 if (ret < 0) {
2067                         printk(KERN_WARNING
2068                                "btrfs: failed to recover relocation\n");
2069                         err = -EINVAL;
2070                         goto fail_trans_kthread;
2071                 }
2072         }
2073
2074         location.objectid = BTRFS_FS_TREE_OBJECTID;
2075         location.type = BTRFS_ROOT_ITEM_KEY;
2076         location.offset = (u64)-1;
2077
2078         fs_info->fs_root = btrfs_read_fs_root_no_name(fs_info, &location);
2079         if (!fs_info->fs_root)
2080                 goto fail_trans_kthread;
2081         if (IS_ERR(fs_info->fs_root)) {
2082                 err = PTR_ERR(fs_info->fs_root);
2083                 goto fail_trans_kthread;
2084         }
2085
2086         if (!(sb->s_flags & MS_RDONLY)) {
2087                 down_read(&fs_info->cleanup_work_sem);
2088                 err = btrfs_orphan_cleanup(fs_info->fs_root);
2089                 if (!err)
2090                         err = btrfs_orphan_cleanup(fs_info->tree_root);
2091                 up_read(&fs_info->cleanup_work_sem);
2092                 if (err) {
2093                         close_ctree(tree_root);
2094                         return ERR_PTR(err);
2095                 }
2096         }
2097
2098         return tree_root;
2099
2100 fail_trans_kthread:
2101         kthread_stop(fs_info->transaction_kthread);
2102 fail_cleaner:
2103         kthread_stop(fs_info->cleaner_kthread);
2104
2105         /*
2106          * make sure we're done with the btree inode before we stop our
2107          * kthreads
2108          */
2109         filemap_write_and_wait(fs_info->btree_inode->i_mapping);
2110         invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
2111
2112 fail_block_groups:
2113         btrfs_free_block_groups(fs_info);
2114         free_extent_buffer(csum_root->node);
2115         free_extent_buffer(csum_root->commit_root);
2116 fail_dev_root:
2117         free_extent_buffer(dev_root->node);
2118         free_extent_buffer(dev_root->commit_root);
2119 fail_extent_root:
2120         free_extent_buffer(extent_root->node);
2121         free_extent_buffer(extent_root->commit_root);
2122 fail_tree_root:
2123         free_extent_buffer(tree_root->node);
2124         free_extent_buffer(tree_root->commit_root);
2125 fail_chunk_root:
2126         free_extent_buffer(chunk_root->node);
2127         free_extent_buffer(chunk_root->commit_root);
2128 fail_sb_buffer:
2129         btrfs_stop_workers(&fs_info->generic_worker);
2130         btrfs_stop_workers(&fs_info->fixup_workers);
2131         btrfs_stop_workers(&fs_info->delalloc_workers);
2132         btrfs_stop_workers(&fs_info->workers);
2133         btrfs_stop_workers(&fs_info->endio_workers);
2134         btrfs_stop_workers(&fs_info->endio_meta_workers);
2135         btrfs_stop_workers(&fs_info->endio_meta_write_workers);
2136         btrfs_stop_workers(&fs_info->endio_write_workers);
2137         btrfs_stop_workers(&fs_info->endio_freespace_worker);
2138         btrfs_stop_workers(&fs_info->submit_workers);
2139 fail_iput:
2140         invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
2141         iput(fs_info->btree_inode);
2142
2143         btrfs_close_devices(fs_info->fs_devices);
2144         btrfs_mapping_tree_free(&fs_info->mapping_tree);
2145 fail_bdi:
2146         bdi_destroy(&fs_info->bdi);
2147 fail_srcu:
2148         cleanup_srcu_struct(&fs_info->subvol_srcu);
2149 fail:
2150         kfree(extent_root);
2151         kfree(tree_root);
2152         kfree(fs_info);
2153         kfree(chunk_root);
2154         kfree(dev_root);
2155         kfree(csum_root);
2156         return ERR_PTR(err);
2157 }
2158
2159 static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate)
2160 {
2161         char b[BDEVNAME_SIZE];
2162
2163         if (uptodate) {
2164                 set_buffer_uptodate(bh);
2165         } else {
2166                 if (printk_ratelimit()) {
2167                         printk(KERN_WARNING "lost page write due to "
2168                                         "I/O error on %s\n",
2169                                        bdevname(bh->b_bdev, b));
2170                 }
2171                 /* note, we dont' set_buffer_write_io_error because we have
2172                  * our own ways of dealing with the IO errors
2173                  */
2174                 clear_buffer_uptodate(bh);
2175         }
2176         unlock_buffer(bh);
2177         put_bh(bh);
2178 }
2179
2180 struct buffer_head *btrfs_read_dev_super(struct block_device *bdev)
2181 {
2182         struct buffer_head *bh;
2183         struct buffer_head *latest = NULL;
2184         struct btrfs_super_block *super;
2185         int i;
2186         u64 transid = 0;
2187         u64 bytenr;
2188
2189         /* we would like to check all the supers, but that would make
2190          * a btrfs mount succeed after a mkfs from a different FS.
2191          * So, we need to add a special mount option to scan for
2192          * later supers, using BTRFS_SUPER_MIRROR_MAX instead
2193          */
2194         for (i = 0; i < 1; i++) {
2195                 bytenr = btrfs_sb_offset(i);
2196                 if (bytenr + 4096 >= i_size_read(bdev->bd_inode))
2197                         break;
2198                 bh = __bread(bdev, bytenr / 4096, 4096);
2199                 if (!bh)
2200                         continue;
2201
2202                 super = (struct btrfs_super_block *)bh->b_data;
2203                 if (btrfs_super_bytenr(super) != bytenr ||
2204                     strncmp((char *)(&super->magic), BTRFS_MAGIC,
2205                             sizeof(super->magic))) {
2206                         brelse(bh);
2207                         continue;
2208                 }
2209
2210                 if (!latest || btrfs_super_generation(super) > transid) {
2211                         brelse(latest);
2212                         latest = bh;
2213                         transid = btrfs_super_generation(super);
2214                 } else {
2215                         brelse(bh);
2216                 }
2217         }
2218         return latest;
2219 }
2220
2221 /*
2222  * this should be called twice, once with wait == 0 and
2223  * once with wait == 1.  When wait == 0 is done, all the buffer heads
2224  * we write are pinned.
2225  *
2226  * They are released when wait == 1 is done.
2227  * max_mirrors must be the same for both runs, and it indicates how
2228  * many supers on this one device should be written.
2229  *
2230  * max_mirrors == 0 means to write them all.
2231  */
2232 static int write_dev_supers(struct btrfs_device *device,
2233                             struct btrfs_super_block *sb,
2234                             int do_barriers, int wait, int max_mirrors)
2235 {
2236         struct buffer_head *bh;
2237         int i;
2238         int ret;
2239         int errors = 0;
2240         u32 crc;
2241         u64 bytenr;
2242         int last_barrier = 0;
2243
2244         if (max_mirrors == 0)
2245                 max_mirrors = BTRFS_SUPER_MIRROR_MAX;
2246
2247         /* make sure only the last submit_bh does a barrier */
2248         if (do_barriers) {
2249                 for (i = 0; i < max_mirrors; i++) {
2250                         bytenr = btrfs_sb_offset(i);
2251                         if (bytenr + BTRFS_SUPER_INFO_SIZE >=
2252                             device->total_bytes)
2253                                 break;
2254                         last_barrier = i;
2255                 }
2256         }
2257
2258         for (i = 0; i < max_mirrors; i++) {
2259                 bytenr = btrfs_sb_offset(i);
2260                 if (bytenr + BTRFS_SUPER_INFO_SIZE >= device->total_bytes)
2261                         break;
2262
2263                 if (wait) {
2264                         bh = __find_get_block(device->bdev, bytenr / 4096,
2265                                               BTRFS_SUPER_INFO_SIZE);
2266                         BUG_ON(!bh);
2267                         wait_on_buffer(bh);
2268                         if (!buffer_uptodate(bh))
2269                                 errors++;
2270
2271                         /* drop our reference */
2272                         brelse(bh);
2273
2274                         /* drop the reference from the wait == 0 run */
2275                         brelse(bh);
2276                         continue;
2277                 } else {
2278                         btrfs_set_super_bytenr(sb, bytenr);
2279
2280                         crc = ~(u32)0;
2281                         crc = btrfs_csum_data(NULL, (char *)sb +
2282                                               BTRFS_CSUM_SIZE, crc,
2283                                               BTRFS_SUPER_INFO_SIZE -
2284                                               BTRFS_CSUM_SIZE);
2285                         btrfs_csum_final(crc, sb->csum);
2286
2287                         /*
2288                          * one reference for us, and we leave it for the
2289                          * caller
2290                          */
2291                         bh = __getblk(device->bdev, bytenr / 4096,
2292                                       BTRFS_SUPER_INFO_SIZE);
2293                         memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE);
2294
2295                         /* one reference for submit_bh */
2296                         get_bh(bh);
2297
2298                         set_buffer_uptodate(bh);
2299                         lock_buffer(bh);
2300                         bh->b_end_io = btrfs_end_buffer_write_sync;
2301                 }
2302
2303                 if (i == last_barrier && do_barriers)
2304                         ret = submit_bh(WRITE_FLUSH_FUA, bh);
2305                 else
2306                         ret = submit_bh(WRITE_SYNC, bh);
2307
2308                 if (ret)
2309                         errors++;
2310         }
2311         return errors < i ? 0 : -1;
2312 }
2313
2314 int write_all_supers(struct btrfs_root *root, int max_mirrors)
2315 {
2316         struct list_head *head;
2317         struct btrfs_device *dev;
2318         struct btrfs_super_block *sb;
2319         struct btrfs_dev_item *dev_item;
2320         int ret;
2321         int do_barriers;
2322         int max_errors;
2323         int total_errors = 0;
2324         u64 flags;
2325
2326         max_errors = btrfs_super_num_devices(&root->fs_info->super_copy) - 1;
2327         do_barriers = !btrfs_test_opt(root, NOBARRIER);
2328
2329         sb = &root->fs_info->super_for_commit;
2330         dev_item = &sb->dev_item;
2331
2332         mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
2333         head = &root->fs_info->fs_devices->devices;
2334         list_for_each_entry(dev, head, dev_list) {
2335                 if (!dev->bdev) {
2336                         total_errors++;
2337                         continue;
2338                 }
2339                 if (!dev->in_fs_metadata || !dev->writeable)
2340                         continue;
2341
2342                 btrfs_set_stack_device_generation(dev_item, 0);
2343                 btrfs_set_stack_device_type(dev_item, dev->type);
2344                 btrfs_set_stack_device_id(dev_item, dev->devid);
2345                 btrfs_set_stack_device_total_bytes(dev_item, dev->total_bytes);
2346                 btrfs_set_stack_device_bytes_used(dev_item, dev->bytes_used);
2347                 btrfs_set_stack_device_io_align(dev_item, dev->io_align);
2348                 btrfs_set_stack_device_io_width(dev_item, dev->io_width);
2349                 btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
2350                 memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
2351                 memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE);
2352
2353                 flags = btrfs_super_flags(sb);
2354                 btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN);
2355
2356                 ret = write_dev_supers(dev, sb, do_barriers, 0, max_mirrors);
2357                 if (ret)
2358                         total_errors++;
2359         }
2360         if (total_errors > max_errors) {
2361                 printk(KERN_ERR "btrfs: %d errors while writing supers\n",
2362                        total_errors);
2363                 BUG();
2364         }
2365
2366         total_errors = 0;
2367         list_for_each_entry(dev, head, dev_list) {
2368                 if (!dev->bdev)
2369                         continue;
2370                 if (!dev->in_fs_metadata || !dev->writeable)
2371                         continue;
2372
2373                 ret = write_dev_supers(dev, sb, do_barriers, 1, max_mirrors);
2374                 if (ret)
2375                         total_errors++;
2376         }
2377         mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
2378         if (total_errors > max_errors) {
2379                 printk(KERN_ERR "btrfs: %d errors while writing supers\n",
2380                        total_errors);
2381                 BUG();
2382         }
2383         return 0;
2384 }
2385
2386 int write_ctree_super(struct btrfs_trans_handle *trans,
2387                       struct btrfs_root *root, int max_mirrors)
2388 {
2389         int ret;
2390
2391         ret = write_all_supers(root, max_mirrors);
2392         return ret;
2393 }
2394
2395 int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root)
2396 {
2397         spin_lock(&fs_info->fs_roots_radix_lock);
2398         radix_tree_delete(&fs_info->fs_roots_radix,
2399                           (unsigned long)root->root_key.objectid);
2400         spin_unlock(&fs_info->fs_roots_radix_lock);
2401
2402         if (btrfs_root_refs(&root->root_item) == 0)
2403                 synchronize_srcu(&fs_info->subvol_srcu);
2404
2405         free_fs_root(root);
2406         return 0;
2407 }
2408
2409 static void free_fs_root(struct btrfs_root *root)
2410 {
2411         WARN_ON(!RB_EMPTY_ROOT(&root->inode_tree));
2412         if (root->anon_super.s_dev) {
2413                 down_write(&root->anon_super.s_umount);
2414                 kill_anon_super(&root->anon_super);
2415         }
2416         free_extent_buffer(root->node);
2417         free_extent_buffer(root->commit_root);
2418         kfree(root->name);
2419         kfree(root);
2420 }
2421
2422 static int del_fs_roots(struct btrfs_fs_info *fs_info)
2423 {
2424         int ret;
2425         struct btrfs_root *gang[8];
2426         int i;
2427
2428         while (!list_empty(&fs_info->dead_roots)) {
2429                 gang[0] = list_entry(fs_info->dead_roots.next,
2430                                      struct btrfs_root, root_list);
2431                 list_del(&gang[0]->root_list);
2432
2433                 if (gang[0]->in_radix) {
2434                         btrfs_free_fs_root(fs_info, gang[0]);
2435                 } else {
2436                         free_extent_buffer(gang[0]->node);
2437                         free_extent_buffer(gang[0]->commit_root);
2438                         kfree(gang[0]);
2439                 }
2440         }
2441
2442         while (1) {
2443                 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
2444                                              (void **)gang, 0,
2445                                              ARRAY_SIZE(gang));
2446                 if (!ret)
2447                         break;
2448                 for (i = 0; i < ret; i++)
2449                         btrfs_free_fs_root(fs_info, gang[i]);
2450         }
2451         return 0;
2452 }
2453
2454 int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info)
2455 {
2456         u64 root_objectid = 0;
2457         struct btrfs_root *gang[8];
2458         int i;
2459         int ret;
2460
2461         while (1) {
2462                 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
2463                                              (void **)gang, root_objectid,
2464                                              ARRAY_SIZE(gang));
2465                 if (!ret)
2466                         break;
2467
2468                 root_objectid = gang[ret - 1]->root_key.objectid + 1;
2469                 for (i = 0; i < ret; i++) {
2470                         int err;
2471
2472                         root_objectid = gang[i]->root_key.objectid;
2473                         err = btrfs_orphan_cleanup(gang[i]);
2474                         if (err)
2475                                 return err;
2476                 }
2477                 root_objectid++;
2478         }
2479         return 0;
2480 }
2481
2482 int btrfs_commit_super(struct btrfs_root *root)
2483 {
2484         struct btrfs_trans_handle *trans;
2485         int ret;
2486
2487         mutex_lock(&root->fs_info->cleaner_mutex);
2488         btrfs_run_delayed_iputs(root);
2489         btrfs_clean_old_snapshots(root);
2490         mutex_unlock(&root->fs_info->cleaner_mutex);
2491
2492         /* wait until ongoing cleanup work done */
2493         down_write(&root->fs_info->cleanup_work_sem);
2494         up_write(&root->fs_info->cleanup_work_sem);
2495
2496         trans = btrfs_join_transaction(root, 1);
2497         if (IS_ERR(trans))
2498                 return PTR_ERR(trans);
2499         ret = btrfs_commit_transaction(trans, root);
2500         BUG_ON(ret);
2501         /* run commit again to drop the original snapshot */
2502         trans = btrfs_join_transaction(root, 1);
2503         if (IS_ERR(trans))
2504                 return PTR_ERR(trans);
2505         btrfs_commit_transaction(trans, root);
2506         ret = btrfs_write_and_wait_transaction(NULL, root);
2507         BUG_ON(ret);
2508
2509         ret = write_ctree_super(NULL, root, 0);
2510         return ret;
2511 }
2512
2513 int close_ctree(struct btrfs_root *root)
2514 {
2515         struct btrfs_fs_info *fs_info = root->fs_info;
2516         int ret;
2517
2518         fs_info->closing = 1;
2519         smp_mb();
2520
2521         btrfs_put_block_group_cache(fs_info);
2522
2523         /*
2524          * Here come 2 situations when btrfs is broken to flip readonly:
2525          *
2526          * 1. when btrfs flips readonly somewhere else before
2527          * btrfs_commit_super, sb->s_flags has MS_RDONLY flag,
2528          * and btrfs will skip to write sb directly to keep
2529          * ERROR state on disk.
2530          *
2531          * 2. when btrfs flips readonly just in btrfs_commit_super,
2532          * and in such case, btrfs cannot write sb via btrfs_commit_super,
2533          * and since fs_state has been set BTRFS_SUPER_FLAG_ERROR flag,
2534          * btrfs will cleanup all FS resources first and write sb then.
2535          */
2536         if (!(fs_info->sb->s_flags & MS_RDONLY)) {
2537                 ret = btrfs_commit_super(root);
2538                 if (ret)
2539                         printk(KERN_ERR "btrfs: commit super ret %d\n", ret);
2540         }
2541
2542         if (fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) {
2543                 ret = btrfs_error_commit_super(root);
2544                 if (ret)
2545                         printk(KERN_ERR "btrfs: commit super ret %d\n", ret);
2546         }
2547
2548         kthread_stop(root->fs_info->transaction_kthread);
2549         kthread_stop(root->fs_info->cleaner_kthread);
2550
2551         fs_info->closing = 2;
2552         smp_mb();
2553
2554         if (fs_info->delalloc_bytes) {
2555                 printk(KERN_INFO "btrfs: at unmount delalloc count %llu\n",
2556                        (unsigned long long)fs_info->delalloc_bytes);
2557         }
2558         if (fs_info->total_ref_cache_size) {
2559                 printk(KERN_INFO "btrfs: at umount reference cache size %llu\n",
2560                        (unsigned long long)fs_info->total_ref_cache_size);
2561         }
2562
2563         free_extent_buffer(fs_info->extent_root->node);
2564         free_extent_buffer(fs_info->extent_root->commit_root);
2565         free_extent_buffer(fs_info->tree_root->node);
2566         free_extent_buffer(fs_info->tree_root->commit_root);
2567         free_extent_buffer(root->fs_info->chunk_root->node);
2568         free_extent_buffer(root->fs_info->chunk_root->commit_root);
2569         free_extent_buffer(root->fs_info->dev_root->node);
2570         free_extent_buffer(root->fs_info->dev_root->commit_root);
2571         free_extent_buffer(root->fs_info->csum_root->node);
2572         free_extent_buffer(root->fs_info->csum_root->commit_root);
2573
2574         btrfs_free_block_groups(root->fs_info);
2575
2576         del_fs_roots(fs_info);
2577
2578         iput(fs_info->btree_inode);
2579
2580         btrfs_stop_workers(&fs_info->generic_worker);
2581         btrfs_stop_workers(&fs_info->fixup_workers);
2582         btrfs_stop_workers(&fs_info->delalloc_workers);
2583         btrfs_stop_workers(&fs_info->workers);
2584         btrfs_stop_workers(&fs_info->endio_workers);
2585         btrfs_stop_workers(&fs_info->endio_meta_workers);
2586         btrfs_stop_workers(&fs_info->endio_meta_write_workers);
2587         btrfs_stop_workers(&fs_info->endio_write_workers);
2588         btrfs_stop_workers(&fs_info->endio_freespace_worker);
2589         btrfs_stop_workers(&fs_info->submit_workers);
2590
2591         btrfs_close_devices(fs_info->fs_devices);
2592         btrfs_mapping_tree_free(&fs_info->mapping_tree);
2593
2594         bdi_destroy(&fs_info->bdi);
2595         cleanup_srcu_struct(&fs_info->subvol_srcu);
2596
2597         kfree(fs_info->extent_root);
2598         kfree(fs_info->tree_root);
2599         kfree(fs_info->chunk_root);
2600         kfree(fs_info->dev_root);
2601         kfree(fs_info->csum_root);
2602         kfree(fs_info);
2603
2604         return 0;
2605 }
2606
2607 int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid)
2608 {
2609         int ret;
2610         struct inode *btree_inode = buf->first_page->mapping->host;
2611
2612         ret = extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf,
2613                                      NULL);
2614         if (!ret)
2615                 return ret;
2616
2617         ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf,
2618                                     parent_transid);
2619         return !ret;
2620 }
2621
2622 int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
2623 {
2624         struct inode *btree_inode = buf->first_page->mapping->host;
2625         return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree,
2626                                           buf);
2627 }
2628
2629 void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
2630 {
2631         struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
2632         u64 transid = btrfs_header_generation(buf);
2633         struct inode *btree_inode = root->fs_info->btree_inode;
2634         int was_dirty;
2635
2636         btrfs_assert_tree_locked(buf);
2637         if (transid != root->fs_info->generation) {
2638                 printk(KERN_CRIT "btrfs transid mismatch buffer %llu, "
2639                        "found %llu running %llu\n",
2640                         (unsigned long long)buf->start,
2641                         (unsigned long long)transid,
2642                         (unsigned long long)root->fs_info->generation);
2643                 WARN_ON(1);
2644         }
2645         was_dirty = set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree,
2646                                             buf);
2647         if (!was_dirty) {
2648                 spin_lock(&root->fs_info->delalloc_lock);
2649                 root->fs_info->dirty_metadata_bytes += buf->len;
2650                 spin_unlock(&root->fs_info->delalloc_lock);
2651         }
2652 }
2653
2654 void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr)
2655 {
2656         /*
2657          * looks as though older kernels can get into trouble with
2658          * this code, they end up stuck in balance_dirty_pages forever
2659          */
2660         u64 num_dirty;
2661         unsigned long thresh = 32 * 1024 * 1024;
2662
2663         if (current->flags & PF_MEMALLOC)
2664                 return;
2665
2666         num_dirty = root->fs_info->dirty_metadata_bytes;
2667
2668         if (num_dirty > thresh) {
2669                 balance_dirty_pages_ratelimited_nr(
2670                                    root->fs_info->btree_inode->i_mapping, 1);
2671         }
2672         return;
2673 }
2674
2675 int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid)
2676 {
2677         struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root;
2678         int ret;
2679         ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
2680         if (ret == 0)
2681                 set_bit(EXTENT_BUFFER_UPTODATE, &buf->bflags);
2682         return ret;
2683 }
2684
2685 int btree_lock_page_hook(struct page *page)
2686 {
2687         struct inode *inode = page->mapping->host;
2688         struct btrfs_root *root = BTRFS_I(inode)->root;
2689         struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
2690         struct extent_buffer *eb;
2691         unsigned long len;
2692         u64 bytenr = page_offset(page);
2693
2694         if (page->private == EXTENT_PAGE_PRIVATE)
2695                 goto out;
2696
2697         len = page->private >> 2;
2698         eb = find_extent_buffer(io_tree, bytenr, len, GFP_NOFS);
2699         if (!eb)
2700                 goto out;
2701
2702         btrfs_tree_lock(eb);
2703         btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN);
2704
2705         if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)) {
2706                 spin_lock(&root->fs_info->delalloc_lock);
2707                 if (root->fs_info->dirty_metadata_bytes >= eb->len)
2708                         root->fs_info->dirty_metadata_bytes -= eb->len;
2709                 else
2710                         WARN_ON(1);
2711                 spin_unlock(&root->fs_info->delalloc_lock);
2712         }
2713
2714         btrfs_tree_unlock(eb);
2715         free_extent_buffer(eb);
2716 out:
2717         lock_page(page);
2718         return 0;
2719 }
2720
2721 static void btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
2722                               int read_only)
2723 {
2724         if (read_only)
2725                 return;
2726
2727         if (fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR)
2728                 printk(KERN_WARNING "warning: mount fs with errors, "
2729                        "running btrfsck is recommended\n");
2730 }
2731
2732 int btrfs_error_commit_super(struct btrfs_root *root)
2733 {
2734         int ret;
2735
2736         mutex_lock(&root->fs_info->cleaner_mutex);
2737         btrfs_run_delayed_iputs(root);
2738         mutex_unlock(&root->fs_info->cleaner_mutex);
2739
2740         down_write(&root->fs_info->cleanup_work_sem);
2741         up_write(&root->fs_info->cleanup_work_sem);
2742
2743         /* cleanup FS via transaction */
2744         btrfs_cleanup_transaction(root);
2745
2746         ret = write_ctree_super(NULL, root, 0);
2747
2748         return ret;
2749 }
2750
2751 static int btrfs_destroy_ordered_operations(struct btrfs_root *root)
2752 {
2753         struct btrfs_inode *btrfs_inode;
2754         struct list_head splice;
2755
2756         INIT_LIST_HEAD(&splice);
2757
2758         mutex_lock(&root->fs_info->ordered_operations_mutex);
2759         spin_lock(&root->fs_info->ordered_extent_lock);
2760
2761         list_splice_init(&root->fs_info->ordered_operations, &splice);
2762         while (!list_empty(&splice)) {
2763                 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
2764                                          ordered_operations);
2765
2766                 list_del_init(&btrfs_inode->ordered_operations);
2767
2768                 btrfs_invalidate_inodes(btrfs_inode->root);
2769         }
2770
2771         spin_unlock(&root->fs_info->ordered_extent_lock);
2772         mutex_unlock(&root->fs_info->ordered_operations_mutex);
2773
2774         return 0;
2775 }
2776
2777 static int btrfs_destroy_ordered_extents(struct btrfs_root *root)
2778 {
2779         struct list_head splice;
2780         struct btrfs_ordered_extent *ordered;
2781         struct inode *inode;
2782
2783         INIT_LIST_HEAD(&splice);
2784
2785         spin_lock(&root->fs_info->ordered_extent_lock);
2786
2787         list_splice_init(&root->fs_info->ordered_extents, &splice);
2788         while (!list_empty(&splice)) {
2789                 ordered = list_entry(splice.next, struct btrfs_ordered_extent,
2790                                      root_extent_list);
2791
2792                 list_del_init(&ordered->root_extent_list);
2793                 atomic_inc(&ordered->refs);
2794
2795                 /* the inode may be getting freed (in sys_unlink path). */
2796                 inode = igrab(ordered->inode);
2797
2798                 spin_unlock(&root->fs_info->ordered_extent_lock);
2799                 if (inode)
2800                         iput(inode);
2801
2802                 atomic_set(&ordered->refs, 1);
2803                 btrfs_put_ordered_extent(ordered);
2804
2805                 spin_lock(&root->fs_info->ordered_extent_lock);
2806         }
2807
2808         spin_unlock(&root->fs_info->ordered_extent_lock);
2809
2810         return 0;
2811 }
2812
2813 static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
2814                                       struct btrfs_root *root)
2815 {
2816         struct rb_node *node;
2817         struct btrfs_delayed_ref_root *delayed_refs;
2818         struct btrfs_delayed_ref_node *ref;
2819         int ret = 0;
2820
2821         delayed_refs = &trans->delayed_refs;
2822
2823         spin_lock(&delayed_refs->lock);
2824         if (delayed_refs->num_entries == 0) {
2825                 printk(KERN_INFO "delayed_refs has NO entry\n");
2826                 return ret;
2827         }
2828
2829         node = rb_first(&delayed_refs->root);
2830         while (node) {
2831                 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2832                 node = rb_next(node);
2833
2834                 ref->in_tree = 0;
2835                 rb_erase(&ref->rb_node, &delayed_refs->root);
2836                 delayed_refs->num_entries--;
2837
2838                 atomic_set(&ref->refs, 1);
2839                 if (btrfs_delayed_ref_is_head(ref)) {
2840                         struct btrfs_delayed_ref_head *head;
2841
2842                         head = btrfs_delayed_node_to_head(ref);
2843                         mutex_lock(&head->mutex);
2844                         kfree(head->extent_op);
2845                         delayed_refs->num_heads--;
2846                         if (list_empty(&head->cluster))
2847                                 delayed_refs->num_heads_ready--;
2848                         list_del_init(&head->cluster);
2849                         mutex_unlock(&head->mutex);
2850                 }
2851
2852                 spin_unlock(&delayed_refs->lock);
2853                 btrfs_put_delayed_ref(ref);
2854
2855                 cond_resched();
2856                 spin_lock(&delayed_refs->lock);
2857         }
2858
2859         spin_unlock(&delayed_refs->lock);
2860
2861         return ret;
2862 }
2863
2864 static int btrfs_destroy_pending_snapshots(struct btrfs_transaction *t)
2865 {
2866         struct btrfs_pending_snapshot *snapshot;
2867         struct list_head splice;
2868
2869         INIT_LIST_HEAD(&splice);
2870
2871         list_splice_init(&t->pending_snapshots, &splice);
2872
2873         while (!list_empty(&splice)) {
2874                 snapshot = list_entry(splice.next,
2875                                       struct btrfs_pending_snapshot,
2876                                       list);
2877
2878                 list_del_init(&snapshot->list);
2879
2880                 kfree(snapshot);
2881         }
2882
2883         return 0;
2884 }
2885
2886 static int btrfs_destroy_delalloc_inodes(struct btrfs_root *root)
2887 {
2888         struct btrfs_inode *btrfs_inode;
2889         struct list_head splice;
2890
2891         INIT_LIST_HEAD(&splice);
2892
2893         list_splice_init(&root->fs_info->delalloc_inodes, &splice);
2894
2895         spin_lock(&root->fs_info->delalloc_lock);
2896
2897         while (!list_empty(&splice)) {
2898                 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
2899                                     delalloc_inodes);
2900
2901                 list_del_init(&btrfs_inode->delalloc_inodes);
2902
2903                 btrfs_invalidate_inodes(btrfs_inode->root);
2904         }
2905
2906         spin_unlock(&root->fs_info->delalloc_lock);
2907
2908         return 0;
2909 }
2910
2911 static int btrfs_destroy_marked_extents(struct btrfs_root *root,
2912                                         struct extent_io_tree *dirty_pages,
2913                                         int mark)
2914 {
2915         int ret;
2916         struct page *page;
2917         struct inode *btree_inode = root->fs_info->btree_inode;
2918         struct extent_buffer *eb;
2919         u64 start = 0;
2920         u64 end;
2921         u64 offset;
2922         unsigned long index;
2923
2924         while (1) {
2925                 ret = find_first_extent_bit(dirty_pages, start, &start, &end,
2926                                             mark);
2927                 if (ret)
2928                         break;
2929
2930                 clear_extent_bits(dirty_pages, start, end, mark, GFP_NOFS);
2931                 while (start <= end) {
2932                         index = start >> PAGE_CACHE_SHIFT;
2933                         start = (u64)(index + 1) << PAGE_CACHE_SHIFT;
2934                         page = find_get_page(btree_inode->i_mapping, index);
2935                         if (!page)
2936                                 continue;
2937                         offset = page_offset(page);
2938
2939                         spin_lock(&dirty_pages->buffer_lock);
2940                         eb = radix_tree_lookup(
2941                              &(&BTRFS_I(page->mapping->host)->io_tree)->buffer,
2942                                                offset >> PAGE_CACHE_SHIFT);
2943                         spin_unlock(&dirty_pages->buffer_lock);
2944                         if (eb) {
2945                                 ret = test_and_clear_bit(EXTENT_BUFFER_DIRTY,
2946                                                          &eb->bflags);
2947                                 atomic_set(&eb->refs, 1);
2948                         }
2949                         if (PageWriteback(page))
2950                                 end_page_writeback(page);
2951
2952                         lock_page(page);
2953                         if (PageDirty(page)) {
2954                                 clear_page_dirty_for_io(page);
2955                                 spin_lock_irq(&page->mapping->tree_lock);
2956                                 radix_tree_tag_clear(&page->mapping->page_tree,
2957                                                         page_index(page),
2958                                                         PAGECACHE_TAG_DIRTY);
2959                                 spin_unlock_irq(&page->mapping->tree_lock);
2960                         }
2961
2962                         page->mapping->a_ops->invalidatepage(page, 0);
2963                         unlock_page(page);
2964                 }
2965         }
2966
2967         return ret;
2968 }
2969
2970 static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
2971                                        struct extent_io_tree *pinned_extents)
2972 {
2973         struct extent_io_tree *unpin;
2974         u64 start;
2975         u64 end;
2976         int ret;
2977
2978         unpin = pinned_extents;
2979         while (1) {
2980                 ret = find_first_extent_bit(unpin, 0, &start, &end,
2981                                             EXTENT_DIRTY);
2982                 if (ret)
2983                         break;
2984
2985                 /* opt_discard */
2986                 if (btrfs_test_opt(root, DISCARD))
2987                         ret = btrfs_error_discard_extent(root, start,
2988                                                          end + 1 - start,
2989                                                          NULL);
2990
2991                 clear_extent_dirty(unpin, start, end, GFP_NOFS);
2992                 btrfs_error_unpin_extent_range(root, start, end);
2993                 cond_resched();
2994         }
2995
2996         return 0;
2997 }
2998
2999 static int btrfs_cleanup_transaction(struct btrfs_root *root)
3000 {
3001         struct btrfs_transaction *t;
3002         LIST_HEAD(list);
3003
3004         WARN_ON(1);
3005
3006         mutex_lock(&root->fs_info->trans_mutex);
3007         mutex_lock(&root->fs_info->transaction_kthread_mutex);
3008
3009         list_splice_init(&root->fs_info->trans_list, &list);
3010         while (!list_empty(&list)) {
3011                 t = list_entry(list.next, struct btrfs_transaction, list);
3012                 if (!t)
3013                         break;
3014
3015                 btrfs_destroy_ordered_operations(root);
3016
3017                 btrfs_destroy_ordered_extents(root);
3018
3019                 btrfs_destroy_delayed_refs(t, root);
3020
3021                 btrfs_block_rsv_release(root,
3022                                         &root->fs_info->trans_block_rsv,
3023                                         t->dirty_pages.dirty_bytes);
3024
3025                 /* FIXME: cleanup wait for commit */
3026                 t->in_commit = 1;
3027                 t->blocked = 1;
3028                 if (waitqueue_active(&root->fs_info->transaction_blocked_wait))
3029                         wake_up(&root->fs_info->transaction_blocked_wait);
3030
3031                 t->blocked = 0;
3032                 if (waitqueue_active(&root->fs_info->transaction_wait))
3033                         wake_up(&root->fs_info->transaction_wait);
3034                 mutex_unlock(&root->fs_info->trans_mutex);
3035
3036                 mutex_lock(&root->fs_info->trans_mutex);
3037                 t->commit_done = 1;
3038                 if (waitqueue_active(&t->commit_wait))
3039                         wake_up(&t->commit_wait);
3040                 mutex_unlock(&root->fs_info->trans_mutex);
3041
3042                 mutex_lock(&root->fs_info->trans_mutex);
3043
3044                 btrfs_destroy_pending_snapshots(t);
3045
3046                 btrfs_destroy_delalloc_inodes(root);
3047
3048                 spin_lock(&root->fs_info->new_trans_lock);
3049                 root->fs_info->running_transaction = NULL;
3050                 spin_unlock(&root->fs_info->new_trans_lock);
3051
3052                 btrfs_destroy_marked_extents(root, &t->dirty_pages,
3053                                              EXTENT_DIRTY);
3054
3055                 btrfs_destroy_pinned_extent(root,
3056                                             root->fs_info->pinned_extents);
3057
3058                 t->use_count = 0;
3059                 list_del_init(&t->list);
3060                 memset(t, 0, sizeof(*t));
3061                 kmem_cache_free(btrfs_transaction_cachep, t);
3062         }
3063
3064         mutex_unlock(&root->fs_info->transaction_kthread_mutex);
3065         mutex_unlock(&root->fs_info->trans_mutex);
3066
3067         return 0;
3068 }
3069
3070 static struct extent_io_ops btree_extent_io_ops = {
3071         .write_cache_pages_lock_hook = btree_lock_page_hook,
3072         .readpage_end_io_hook = btree_readpage_end_io_hook,
3073         .submit_bio_hook = btree_submit_bio_hook,
3074         /* note we're sharing with inode.c for the merge bio hook */
3075         .merge_bio_hook = btrfs_merge_bio_hook,
3076 };