fs/btrfs/extent-tree.c

   1 /*
   2  * Copyright (C) 2007 Oracle.  All rights reserved.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public
   6  * License v2 as published by the Free Software Foundation.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11  * General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public
  14  * License along with this program; if not, write to the
  15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16  * Boston, MA 021110-1307, USA.
  17  */
  18 #include <linux/sched.h>
  19 #include <linux/pagemap.h>
  20 #include <linux/writeback.h>
  21 #include <linux/blkdev.h>
  22 #include <linux/sort.h>
  23 #include <linux/rcupdate.h>
  24 #include <linux/kthread.h>
  25 #include <linux/slab.h>
  26 #include <linux/ratelimit.h>
  27 #include "compat.h"
  28 #include "hash.h"
  29 #include "ctree.h"
  30 #include "disk-io.h"
  31 #include "print-tree.h"
  32 #include "transaction.h"
  33 #include "volumes.h"
  34 #include "locking.h"
  35 #include "free-space-cache.h"
  36
  37 /*
  38  * control flags for do_chunk_alloc's force field
  39  * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk
  40  * if we really need one.
  41  *
  42  * CHUNK_ALLOC_LIMITED means to only try and allocate one
  43  * if we have very few chunks already allocated.  This is
  44  * used as part of the clustering code to help make sure
  45  * we have a good pool of storage to cluster in, without
  46  * filling the FS with empty chunks
  47  *
  48  * CHUNK_ALLOC_FORCE means it must try to allocate one
  49  *
  50  */
  51 enum {
  52         CHUNK_ALLOC_NO_FORCE = 0,
  53         CHUNK_ALLOC_LIMITED = 1,
  54         CHUNK_ALLOC_FORCE = 2,
  55 };
  56
  57 /*
  58  * Control how reservations are dealt with.
  59  *
  60  * RESERVE_FREE - freeing a reservation.
  61  * RESERVE_ALLOC - allocating space and we need to update bytes_may_use for
  62  *   ENOSPC accounting
  63  * RESERVE_ALLOC_NO_ACCOUNT - allocating space and we should not update
  64  *   bytes_may_use as the ENOSPC accounting is done elsewhere
  65  */
  66 enum {
  67         RESERVE_FREE = 0,
  68         RESERVE_ALLOC = 1,
  69         RESERVE_ALLOC_NO_ACCOUNT = 2,
  70 };
  71
  72 static int update_block_group(struct btrfs_trans_handle *trans,
  73                               struct btrfs_root *root,
  74                               u64 bytenr, u64 num_bytes, int alloc);
  75 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
  76                                 struct btrfs_root *root,
  77                                 u64 bytenr, u64 num_bytes, u64 parent,
  78                                 u64 root_objectid, u64 owner_objectid,
  79                                 u64 owner_offset, int refs_to_drop,
  80                                 struct btrfs_delayed_extent_op *extra_op);
  81 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
  82                                     struct extent_buffer *leaf,
  83                                     struct btrfs_extent_item *ei);
  84 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
  85                                       struct btrfs_root *root,
  86                                       u64 parent, u64 root_objectid,
  87                                       u64 flags, u64 owner, u64 offset,
  88                                       struct btrfs_key *ins, int ref_mod);
  89 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
  90                                      struct btrfs_root *root,
  91                                      u64 parent, u64 root_objectid,
  92                                      u64 flags, struct btrfs_disk_key *key,
  93                                      int level, struct btrfs_key *ins);
  94 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
  95                           struct btrfs_root *extent_root, u64 alloc_bytes,
  96                           u64 flags, int force);
  97 static int find_next_key(struct btrfs_path *path, int level,
  98                          struct btrfs_key *key);
  99 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
 100                             int dump_block_groups);
 101 static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache,
 102                                        u64 num_bytes, int reserve);
 103
 104 static noinline int
 105 block_group_cache_done(struct btrfs_block_group_cache *cache)
 106 {
 107         smp_mb();
 108         return cache->cached == BTRFS_CACHE_FINISHED;
 109 }
 110
 111 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits)
 112 {
 113         return (cache->flags & bits) == bits;
 114 }
 115
 116 static void btrfs_get_block_group(struct btrfs_block_group_cache *cache)
 117 {
 118         atomic_inc(&cache->count);
 119 }
 120
 121 void btrfs_put_block_group(struct btrfs_block_group_cache *cache)
 122 {
 123         if (atomic_dec_and_test(&cache->count)) {
 124                 WARN_ON(cache->pinned > 0);
 125                 WARN_ON(cache->reserved > 0);
 126                 kfree(cache->free_space_ctl);
 127                 kfree(cache);
 128         }
 129 }
 130
 131 /*
 132  * this adds the block group to the fs_info rb tree for the block group
 133  * cache
 134  */
 135 static int btrfs_add_block_group_cache(struct btrfs_fs_info *info,
 136                                 struct btrfs_block_group_cache *block_group)
 137 {
 138         struct rb_node **p;
 139         struct rb_node *parent = NULL;
 140         struct btrfs_block_group_cache *cache;
 141
 142         spin_lock(&info->block_group_cache_lock);
 143         p = &info->block_group_cache_tree.rb_node;
 144
 145         while (*p) {
 146                 parent = *p;
 147                 cache = rb_entry(parent, struct btrfs_block_group_cache,
 148                                  cache_node);
 149                 if (block_group->key.objectid < cache->key.objectid) {
 150                         p = &(*p)->rb_left;
 151                 } else if (block_group->key.objectid > cache->key.objectid) {
 152                         p = &(*p)->rb_right;
 153                 } else {
 154                         spin_unlock(&info->block_group_cache_lock);
 155                         return -EEXIST;
 156                 }
 157         }
 158
 159         rb_link_node(&block_group->cache_node, parent, p);
 160         rb_insert_color(&block_group->cache_node,
 161                         &info->block_group_cache_tree);
 162         spin_unlock(&info->block_group_cache_lock);
 163
 164         return 0;
 165 }
 166
 167 /*
 168  * This will return the block group at or after bytenr if contains is 0, else
 169  * it will return the block group that contains the bytenr
 170  */
 171 static struct btrfs_block_group_cache *
 172 block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr,
 173                               int contains)
 174 {
 175         struct btrfs_block_group_cache *cache, *ret = NULL;
 176         struct rb_node *n;
 177         u64 end, start;
 178
 179         spin_lock(&info->block_group_cache_lock);
 180         n = info->block_group_cache_tree.rb_node;
 181
 182         while (n) {
 183                 cache = rb_entry(n, struct btrfs_block_group_cache,
 184                                  cache_node);
 185                 end = cache->key.objectid + cache->key.offset - 1;
 186                 start = cache->key.objectid;
 187
 188                 if (bytenr < start) {
 189                         if (!contains && (!ret || start < ret->key.objectid))
 190                                 ret = cache;
 191                         n = n->rb_left;
 192                 } else if (bytenr > start) {
 193                         if (contains && bytenr <= end) {
 194                                 ret = cache;
 195                                 break;
 196                         }
 197                         n = n->rb_right;
 198                 } else {
 199                         ret = cache;
 200                         break;
 201                 }
 202         }
 203         if (ret)
 204                 btrfs_get_block_group(ret);
 205         spin_unlock(&info->block_group_cache_lock);
 206
 207         return ret;
 208 }
 209
 210 static int add_excluded_extent(struct btrfs_root *root,
 211                                u64 start, u64 num_bytes)
 212 {
 213         u64 end = start + num_bytes - 1;
 214         set_extent_bits(&root->fs_info->freed_extents[0],
 215                         start, end, EXTENT_UPTODATE, GFP_NOFS);
 216         set_extent_bits(&root->fs_info->freed_extents[1],
 217                         start, end, EXTENT_UPTODATE, GFP_NOFS);
 218         return 0;
 219 }
 220
 221 static void free_excluded_extents(struct btrfs_root *root,
 222                                   struct btrfs_block_group_cache *cache)
 223 {
 224         u64 start, end;
 225
 226         start = cache->key.objectid;
 227         end = start + cache->key.offset - 1;
 228
 229         clear_extent_bits(&root->fs_info->freed_extents[0],
 230                           start, end, EXTENT_UPTODATE, GFP_NOFS);
 231         clear_extent_bits(&root->fs_info->freed_extents[1],
 232                           start, end, EXTENT_UPTODATE, GFP_NOFS);
 233 }
 234
 235 static int exclude_super_stripes(struct btrfs_root *root,
 236                                  struct btrfs_block_group_cache *cache)
 237 {
 238         u64 bytenr;
 239         u64 *logical;
 240         int stripe_len;
 241         int i, nr, ret;
 242
 243         if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) {
 244                 stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid;
 245                 cache->bytes_super += stripe_len;
 246                 ret = add_excluded_extent(root, cache->key.objectid,
 247                                           stripe_len);
 248                 BUG_ON(ret);
 249         }
 250
 251         for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
 252                 bytenr = btrfs_sb_offset(i);
 253                 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
 254                                        cache->key.objectid, bytenr,
 255                                        0, &logical, &nr, &stripe_len);
 256                 BUG_ON(ret);
 257
 258                 while (nr--) {
 259                         cache->bytes_super += stripe_len;
 260                         ret = add_excluded_extent(root, logical[nr],
 261                                                   stripe_len);
 262                         BUG_ON(ret);
 263                 }
 264
 265                 kfree(logical);
 266         }
 267         return 0;
 268 }
 269
 270 static struct btrfs_caching_control *
 271 get_caching_control(struct btrfs_block_group_cache *cache)
 272 {
 273         struct btrfs_caching_control *ctl;
 274
 275         spin_lock(&cache->lock);
 276         if (cache->cached != BTRFS_CACHE_STARTED) {
 277                 spin_unlock(&cache->lock);
 278                 return NULL;
 279         }
 280
 281         /* We're loading it the fast way, so we don't have a caching_ctl. */
 282         if (!cache->caching_ctl) {
 283                 spin_unlock(&cache->lock);
 284                 return NULL;
 285         }
 286
 287         ctl = cache->caching_ctl;
 288         atomic_inc(&ctl->count);
 289         spin_unlock(&cache->lock);
 290         return ctl;
 291 }
 292
 293 static void put_caching_control(struct btrfs_caching_control *ctl)
 294 {
 295         if (atomic_dec_and_test(&ctl->count))
 296                 kfree(ctl);
 297 }
 298
 299 /*
 300  * this is only called by cache_block_group, since we could have freed extents
 301  * we need to check the pinned_extents for any extents that can't be used yet
 302  * since their free space will be released as soon as the transaction commits.
 303  */
 304 static u64 add_new_free_space(struct btrfs_block_group_cache *block_group,
 305                               struct btrfs_fs_info *info, u64 start, u64 end)
 306 {
 307         u64 extent_start, extent_end, size, total_added = 0;
 308         int ret;
 309
 310         while (start < end) {
 311                 ret = find_first_extent_bit(info->pinned_extents, start,
 312                                             &extent_start, &extent_end,
 313                                             EXTENT_DIRTY | EXTENT_UPTODATE);
 314                 if (ret)
 315                         break;
 316
 317                 if (extent_start <= start) {
 318                         start = extent_end + 1;
 319                 } else if (extent_start > start && extent_start < end) {
 320                         size = extent_start - start;
 321                         total_added += size;
 322                         ret = btrfs_add_free_space(block_group, start,
 323                                                    size);
 324                         BUG_ON(ret);
 325                         start = extent_end + 1;
 326                 } else {
 327                         break;
 328                 }
 329         }
 330
 331         if (start < end) {
 332                 size = end - start;
 333                 total_added += size;
 334                 ret = btrfs_add_free_space(block_group, start, size);
 335                 BUG_ON(ret);
 336         }
 337
 338         return total_added;
 339 }
 340
 341 static noinline void caching_thread(struct btrfs_work *work)
 342 {
 343         struct btrfs_block_group_cache *block_group;
 344         struct btrfs_fs_info *fs_info;
 345         struct btrfs_caching_control *caching_ctl;
 346         struct btrfs_root *extent_root;
 347         struct btrfs_path *path;
 348         struct extent_buffer *leaf;
 349         struct btrfs_key key;
 350         u64 total_found = 0;
 351         u64 last = 0;
 352         u32 nritems;
 353         int ret = 0;
 354
 355         caching_ctl = container_of(work, struct btrfs_caching_control, work);
 356         block_group = caching_ctl->block_group;
 357         fs_info = block_group->fs_info;
 358         extent_root = fs_info->extent_root;
 359
 360         path = btrfs_alloc_path();
 361         if (!path)
 362                 goto out;
 363
 364         last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET);
 365
 366         /*
 367          * We don't want to deadlock with somebody trying to allocate a new
 368          * extent for the extent root while also trying to search the extent
 369          * root to add free space.  So we skip locking and search the commit
 370          * root, since its read-only
 371          */
 372         path->skip_locking = 1;
 373         path->search_commit_root = 1;
 374         path->reada = 1;
 375
 376         key.objectid = last;
 377         key.offset = 0;
 378         key.type = BTRFS_EXTENT_ITEM_KEY;
 379 again:
 380         mutex_lock(&caching_ctl->mutex);
 381         /* need to make sure the commit_root doesn't disappear */
 382         down_read(&fs_info->extent_commit_sem);
 383
 384         ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
 385         if (ret < 0)
 386                 goto err;
 387
 388         leaf = path->nodes[0];
 389         nritems = btrfs_header_nritems(leaf);
 390
 391         while (1) {
 392                 if (btrfs_fs_closing(fs_info) > 1) {
 393                         last = (u64)-1;
 394                         break;
 395                 }
 396
 397                 if (path->slots[0] < nritems) {
 398                         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 399                 } else {
 400                         ret = find_next_key(path, 0, &key);
 401                         if (ret)
 402                                 break;
 403
 404                         if (need_resched() ||
 405                             btrfs_next_leaf(extent_root, path)) {
 406                                 caching_ctl->progress = last;
 407                                 btrfs_release_path(path);
 408                                 up_read(&fs_info->extent_commit_sem);
 409                                 mutex_unlock(&caching_ctl->mutex);
 410                                 cond_resched();
 411                                 goto again;
 412                         }
 413                         leaf = path->nodes[0];
 414                         nritems = btrfs_header_nritems(leaf);
 415                         continue;
 416                 }
 417
 418                 if (key.objectid < block_group->key.objectid) {
 419                         path->slots[0]++;
 420                         continue;
 421                 }
 422
 423                 if (key.objectid >= block_group->key.objectid +
 424                     block_group->key.offset)
 425                         break;
 426
 427                 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
 428                         total_found += add_new_free_space(block_group,
 429                                                           fs_info, last,
 430                                                           key.objectid);
 431                         last = key.objectid + key.offset;
 432
 433                         if (total_found > (1024 * 1024 * 2)) {
 434                                 total_found = 0;
 435                                 wake_up(&caching_ctl->wait);
 436                         }
 437                 }
 438                 path->slots[0]++;
 439         }
 440         ret = 0;
 441
 442         total_found += add_new_free_space(block_group, fs_info, last,
 443                                           block_group->key.objectid +
 444                                           block_group->key.offset);
 445         caching_ctl->progress = (u64)-1;
 446
 447         spin_lock(&block_group->lock);
 448         block_group->caching_ctl = NULL;
 449         block_group->cached = BTRFS_CACHE_FINISHED;
 450         spin_unlock(&block_group->lock);
 451
 452 err:
 453         btrfs_free_path(path);
 454         up_read(&fs_info->extent_commit_sem);
 455
 456         free_excluded_extents(extent_root, block_group);
 457
 458         mutex_unlock(&caching_ctl->mutex);
 459 out:
 460         wake_up(&caching_ctl->wait);
 461
 462         put_caching_control(caching_ctl);
 463         btrfs_put_block_group(block_group);
 464 }
 465
 466 static int cache_block_group(struct btrfs_block_group_cache *cache,
 467                              struct btrfs_trans_handle *trans,
 468                              struct btrfs_root *root,
 469                              int load_cache_only)
 470 {
 471         DEFINE_WAIT(wait);
 472         struct btrfs_fs_info *fs_info = cache->fs_info;
 473         struct btrfs_caching_control *caching_ctl;
 474         int ret = 0;
 475
 476         caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS);
 477         BUG_ON(!caching_ctl);
 478
 479         INIT_LIST_HEAD(&caching_ctl->list);
 480         mutex_init(&caching_ctl->mutex);
 481         init_waitqueue_head(&caching_ctl->wait);
 482         caching_ctl->block_group = cache;
 483         caching_ctl->progress = cache->key.objectid;
 484         atomic_set(&caching_ctl->count, 1);
 485         caching_ctl->work.func = caching_thread;
 486
 487         spin_lock(&cache->lock);
 488         /*
 489          * This should be a rare occasion, but this could happen I think in the
 490          * case where one thread starts to load the space cache info, and then
 491          * some other thread starts a transaction commit which tries to do an
 492          * allocation while the other thread is still loading the space cache
 493          * info.  The previous loop should have kept us from choosing this block
 494          * group, but if we've moved to the state where we will wait on caching
 495          * block groups we need to first check if we're doing a fast load here,
 496          * so we can wait for it to finish, otherwise we could end up allocating
 497          * from a block group who's cache gets evicted for one reason or
 498          * another.
 499          */
 500         while (cache->cached == BTRFS_CACHE_FAST) {
 501                 struct btrfs_caching_control *ctl;
 502
 503                 ctl = cache->caching_ctl;
 504                 atomic_inc(&ctl->count);
 505                 prepare_to_wait(&ctl->wait, &wait, TASK_UNINTERRUPTIBLE);
 506                 spin_unlock(&cache->lock);
 507
 508                 schedule();
 509
 510                 finish_wait(&ctl->wait, &wait);
 511                 put_caching_control(ctl);
 512                 spin_lock(&cache->lock);
 513         }
 514
 515         if (cache->cached != BTRFS_CACHE_NO) {
 516                 spin_unlock(&cache->lock);
 517                 kfree(caching_ctl);
 518                 return 0;
 519         }
 520         WARN_ON(cache->caching_ctl);
 521         cache->caching_ctl = caching_ctl;
 522         cache->cached = BTRFS_CACHE_FAST;
 523         spin_unlock(&cache->lock);
 524
 525         /*
 526          * We can't do the read from on-disk cache during a commit since we need
 527          * to have the normal tree locking.  Also if we are currently trying to
 528          * allocate blocks for the tree root we can't do the fast caching since
 529          * we likely hold important locks.
 530          */
 531         if (trans && (!trans->transaction->in_commit) &&
 532             (root && root != root->fs_info->tree_root) &&
 533             btrfs_test_opt(root, SPACE_CACHE)) {
 534                 ret = load_free_space_cache(fs_info, cache);
 535
 536                 spin_lock(&cache->lock);
 537                 if (ret == 1) {
 538                         cache->caching_ctl = NULL;
 539                         cache->cached = BTRFS_CACHE_FINISHED;
 540                         cache->last_byte_to_unpin = (u64)-1;
 541                 } else {
 542                         if (load_cache_only) {
 543                                 cache->caching_ctl = NULL;
 544                                 cache->cached = BTRFS_CACHE_NO;
 545                         } else {
 546                                 cache->cached = BTRFS_CACHE_STARTED;
 547                         }
 548                 }
 549                 spin_unlock(&cache->lock);
 550                 wake_up(&caching_ctl->wait);
 551                 if (ret == 1) {
 552                         put_caching_control(caching_ctl);
 553                         free_excluded_extents(fs_info->extent_root, cache);
 554                         return 0;
 555                 }
 556         } else {
 557                 /*
 558                  * We are not going to do the fast caching, set cached to the
 559                  * appropriate value and wakeup any waiters.
 560                  */
 561                 spin_lock(&cache->lock);
 562                 if (load_cache_only) {
 563                         cache->caching_ctl = NULL;
 564                         cache->cached = BTRFS_CACHE_NO;
 565                 } else {
 566                         cache->cached = BTRFS_CACHE_STARTED;
 567                 }
 568                 spin_unlock(&cache->lock);
 569                 wake_up(&caching_ctl->wait);
 570         }
 571
 572         if (load_cache_only) {
 573                 put_caching_control(caching_ctl);
 574                 return 0;
 575         }
 576
 577         down_write(&fs_info->extent_commit_sem);
 578         atomic_inc(&caching_ctl->count);
 579         list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups);
 580         up_write(&fs_info->extent_commit_sem);
 581
 582         btrfs_get_block_group(cache);
 583
 584         btrfs_queue_worker(&fs_info->caching_workers, &caching_ctl->work);
 585
 586         return ret;
 587 }
 588
 589 /*
 590  * return the block group that starts at or after bytenr
 591  */
 592 static struct btrfs_block_group_cache *
 593 btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr)
 594 {
 595         struct btrfs_block_group_cache *cache;
 596
 597         cache = block_group_cache_tree_search(info, bytenr, 0);
 598
 599         return cache;
 600 }
 601
 602 /*
 603  * return the block group that contains the given bytenr
 604  */
 605 struct btrfs_block_group_cache *btrfs_lookup_block_group(
 606                                                  struct btrfs_fs_info *info,
 607                                                  u64 bytenr)
 608 {
 609         struct btrfs_block_group_cache *cache;
 610
 611         cache = block_group_cache_tree_search(info, bytenr, 1);
 612
 613         return cache;
 614 }
 615
 616 static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info,
 617                                                   u64 flags)
 618 {
 619         struct list_head *head = &info->space_info;
 620         struct btrfs_space_info *found;
 621
 622         flags &= BTRFS_BLOCK_GROUP_TYPE_MASK;
 623
 624         rcu_read_lock();
 625         list_for_each_entry_rcu(found, head, list) {
 626                 if (found->flags & flags) {
 627                         rcu_read_unlock();
 628                         return found;
 629                 }
 630         }
 631         rcu_read_unlock();
 632         return NULL;
 633 }
 634
 635 /*
 636  * after adding space to the filesystem, we need to clear the full flags
 637  * on all the space infos.
 638  */
 639 void btrfs_clear_space_info_full(struct btrfs_fs_info *info)
 640 {
 641         struct list_head *head = &info->space_info;
 642         struct btrfs_space_info *found;
 643
 644         rcu_read_lock();
 645         list_for_each_entry_rcu(found, head, list)
 646                 found->full = 0;
 647         rcu_read_unlock();
 648 }
 649
 650 static u64 div_factor(u64 num, int factor)
 651 {
 652         if (factor == 10)
 653                 return num;
 654         num *= factor;
 655         do_div(num, 10);
 656         return num;
 657 }
 658
 659 static u64 div_factor_fine(u64 num, int factor)
 660 {
 661         if (factor == 100)
 662                 return num;
 663         num *= factor;
 664         do_div(num, 100);
 665         return num;
 666 }
 667
 668 u64 btrfs_find_block_group(struct btrfs_root *root,
 669                            u64 search_start, u64 search_hint, int owner)
 670 {
 671         struct btrfs_block_group_cache *cache;
 672         u64 used;
 673         u64 last = max(search_hint, search_start);
 674         u64 group_start = 0;
 675         int full_search = 0;
 676         int factor = 9;
 677         int wrapped = 0;
 678 again:
 679         while (1) {
 680                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
 681                 if (!cache)
 682                         break;
 683
 684                 spin_lock(&cache->lock);
 685                 last = cache->key.objectid + cache->key.offset;
 686                 used = btrfs_block_group_used(&cache->item);
 687
 688                 if ((full_search || !cache->ro) &&
 689                     block_group_bits(cache, BTRFS_BLOCK_GROUP_METADATA)) {
 690                         if (used + cache->pinned + cache->reserved <
 691                             div_factor(cache->key.offset, factor)) {
 692                                 group_start = cache->key.objectid;
 693                                 spin_unlock(&cache->lock);
 694                                 btrfs_put_block_group(cache);
 695                                 goto found;
 696                         }
 697                 }
 698                 spin_unlock(&cache->lock);
 699                 btrfs_put_block_group(cache);
 700                 cond_resched();
 701         }
 702         if (!wrapped) {
 703                 last = search_start;
 704                 wrapped = 1;
 705                 goto again;
 706         }
 707         if (!full_search && factor < 10) {
 708                 last = search_start;
 709                 full_search = 1;
 710                 factor = 10;
 711                 goto again;
 712         }
 713 found:
 714         return group_start;
 715 }
 716
 717 /* simple helper to search for an existing extent at a given offset */
 718 int btrfs_lookup_extent(struct btrfs_root *root, u64 start, u64 len)
 719 {
 720         int ret;
 721         struct btrfs_key key;
 722         struct btrfs_path *path;
 723
 724         path = btrfs_alloc_path();
 725         if (!path)
 726                 return -ENOMEM;
 727
 728         key.objectid = start;
 729         key.offset = len;
 730         btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
 731         ret = btrfs_search_slot(NULL, root->fs_info->extent_root, &key, path,
 732                                 0, 0);
 733         btrfs_free_path(path);
 734         return ret;
 735 }
 736
 737 /*
 738  * helper function to lookup reference count and flags of extent.
 739  *
 740  * the head node for delayed ref is used to store the sum of all the
 741  * reference count modifications queued up in the rbtree. the head
 742  * node may also store the extent flags to set. This way you can check
 743  * to see what the reference count and extent flags would be if all of
 744  * the delayed refs are not processed.
 745  */
 746 int btrfs_lookup_extent_info(struct btrfs_trans_handle *trans,
 747                              struct btrfs_root *root, u64 bytenr,
 748                              u64 num_bytes, u64 *refs, u64 *flags)
 749 {
 750         struct btrfs_delayed_ref_head *head;
 751         struct btrfs_delayed_ref_root *delayed_refs;
 752         struct btrfs_path *path;
 753         struct btrfs_extent_item *ei;
 754         struct extent_buffer *leaf;
 755         struct btrfs_key key;
 756         u32 item_size;
 757         u64 num_refs;
 758         u64 extent_flags;
 759         int ret;
 760
 761         path = btrfs_alloc_path();
 762         if (!path)
 763                 return -ENOMEM;
 764
 765         key.objectid = bytenr;
 766         key.type = BTRFS_EXTENT_ITEM_KEY;
 767         key.offset = num_bytes;
 768         if (!trans) {
 769                 path->skip_locking = 1;
 770                 path->search_commit_root = 1;
 771         }
 772 again:
 773         ret = btrfs_search_slot(trans, root->fs_info->extent_root,
 774                                 &key, path, 0, 0);
 775         if (ret < 0)
 776                 goto out_free;
 777
 778         if (ret == 0) {
 779                 leaf = path->nodes[0];
 780                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
 781                 if (item_size >= sizeof(*ei)) {
 782                         ei = btrfs_item_ptr(leaf, path->slots[0],
 783                                             struct btrfs_extent_item);
 784                         num_refs = btrfs_extent_refs(leaf, ei);
 785                         extent_flags = btrfs_extent_flags(leaf, ei);
 786                 } else {
 787 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
 788                         struct btrfs_extent_item_v0 *ei0;
 789                         BUG_ON(item_size != sizeof(*ei0));
 790                         ei0 = btrfs_item_ptr(leaf, path->slots[0],
 791                                              struct btrfs_extent_item_v0);
 792                         num_refs = btrfs_extent_refs_v0(leaf, ei0);
 793                         /* FIXME: this isn't correct for data */
 794                         extent_flags = BTRFS_BLOCK_FLAG_FULL_BACKREF;
 795 #else
 796                         BUG();
 797 #endif
 798                 }
 799                 BUG_ON(num_refs == 0);
 800         } else {
 801                 num_refs = 0;
 802                 extent_flags = 0;
 803                 ret = 0;
 804         }
 805
 806         if (!trans)
 807                 goto out;
 808
 809         delayed_refs = &trans->transaction->delayed_refs;
 810         spin_lock(&delayed_refs->lock);
 811         head = btrfs_find_delayed_ref_head(trans, bytenr);
 812         if (head) {
 813                 if (!mutex_trylock(&head->mutex)) {
 814                         atomic_inc(&head->node.refs);
 815                         spin_unlock(&delayed_refs->lock);
 816
 817                         btrfs_release_path(path);
 818
 819                         /*
 820                          * Mutex was contended, block until it's released and try
 821                          * again
 822                          */
 823                         mutex_lock(&head->mutex);
 824                         mutex_unlock(&head->mutex);
 825                         btrfs_put_delayed_ref(&head->node);
 826                         goto again;
 827                 }
 828                 if (head->extent_op && head->extent_op->update_flags)
 829                         extent_flags |= head->extent_op->flags_to_set;
 830                 else
 831                         BUG_ON(num_refs == 0);
 832
 833                 num_refs += head->node.ref_mod;
 834                 mutex_unlock(&head->mutex);
 835         }
 836         spin_unlock(&delayed_refs->lock);
 837 out:
 838         WARN_ON(num_refs == 0);
 839         if (refs)
 840                 *refs = num_refs;
 841         if (flags)
 842                 *flags = extent_flags;
 843 out_free:
 844         btrfs_free_path(path);
 845         return ret;
 846 }
 847
 848 /*
 849  * Back reference rules.  Back refs have three main goals:
 850  *
 851  * 1) differentiate between all holders of references to an extent so that
 852  *    when a reference is dropped we can make sure it was a valid reference
 853  *    before freeing the extent.
 854  *
 855  * 2) Provide enough information to quickly find the holders of an extent
 856  *    if we notice a given block is corrupted or bad.
 857  *
 858  * 3) Make it easy to migrate blocks for FS shrinking or storage pool
 859  *    maintenance.  This is actually the same as #2, but with a slightly
 860  *    different use case.
 861  *
 862  * There are two kinds of back refs. The implicit back refs is optimized
 863  * for pointers in non-shared tree blocks. For a given pointer in a block,
 864  * back refs of this kind provide information about the block's owner tree
 865  * and the pointer's key. These information allow us to find the block by
 866  * b-tree searching. The full back refs is for pointers in tree blocks not
 867  * referenced by their owner trees. The location of tree block is recorded
 868  * in the back refs. Actually the full back refs is generic, and can be
 869  * used in all cases the implicit back refs is used. The major shortcoming
 870  * of the full back refs is its overhead. Every time a tree block gets
 871  * COWed, we have to update back refs entry for all pointers in it.
 872  *
 873  * For a newly allocated tree block, we use implicit back refs for
 874  * pointers in it. This means most tree related operations only involve
 875  * implicit back refs. For a tree block created in old transaction, the
 876  * only way to drop a reference to it is COW it. So we can detect the
 877  * event that tree block loses its owner tree's reference and do the
 878  * back refs conversion.
 879  *
 880  * When a tree block is COW'd through a tree, there are four cases:
 881  *
 882  * The reference count of the block is one and the tree is the block's
 883  * owner tree. Nothing to do in this case.
 884  *
 885  * The reference count of the block is one and the tree is not the
 886  * block's owner tree. In this case, full back refs is used for pointers
 887  * in the block. Remove these full back refs, add implicit back refs for
 888  * every pointers in the new block.
 889  *
 890  * The reference count of the block is greater than one and the tree is
 891  * the block's owner tree. In this case, implicit back refs is used for
 892  * pointers in the block. Add full back refs for every pointers in the
 893  * block, increase lower level extents' reference counts. The original
 894  * implicit back refs are entailed to the new block.
 895  *
 896  * The reference count of the block is greater than one and the tree is
 897  * not the block's owner tree. Add implicit back refs for every pointer in
 898  * the new block, increase lower level extents' reference count.
 899  *
 900  * Back Reference Key composing:
 901  *
 902  * The key objectid corresponds to the first byte in the extent,
 903  * The key type is used to differentiate between types of back refs.
 904  * There are different meanings of the key offset for different types
 905  * of back refs.
 906  *
 907  * File extents can be referenced by:
 908  *
 909  * - multiple snapshots, subvolumes, or different generations in one subvol
 910  * - different files inside a single subvolume
 911  * - different offsets inside a file (bookend extents in file.c)
 912  *
 913  * The extent ref structure for the implicit back refs has fields for:
 914  *
 915  * - Objectid of the subvolume root
 916  * - objectid of the file holding the reference
 917  * - original offset in the file
 918  * - how many bookend extents
 919  *
 920  * The key offset for the implicit back refs is hash of the first
 921  * three fields.
 922  *
 923  * The extent ref structure for the full back refs has field for:
 924  *
 925  * - number of pointers in the tree leaf
 926  *
 927  * The key offset for the implicit back refs is the first byte of
 928  * the tree leaf
 929  *
 930  * When a file extent is allocated, The implicit back refs is used.
 931  * the fields are filled in:
 932  *
 933  *     (root_key.objectid, inode objectid, offset in file, 1)
 934  *
 935  * When a file extent is removed file truncation, we find the
 936  * corresponding implicit back refs and check the following fields:
 937  *
 938  *     (btrfs_header_owner(leaf), inode objectid, offset in file)
 939  *
 940  * Btree extents can be referenced by:
 941  *
 942  * - Different subvolumes
 943  *
 944  * Both the implicit back refs and the full back refs for tree blocks
 945  * only consist of key. The key offset for the implicit back refs is
 946  * objectid of block's owner tree. The key offset for the full back refs
 947  * is the first byte of parent block.
 948  *
 949  * When implicit back refs is used, information about the lowest key and
 950  * level of the tree block are required. These information are stored in
 951  * tree block info structure.
 952  */
 953
 954 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
 955 static int convert_extent_item_v0(struct btrfs_trans_handle *trans,
 956                                   struct btrfs_root *root,
 957                                   struct btrfs_path *path,
 958                                   u64 owner, u32 extra_size)
 959 {
 960         struct btrfs_extent_item *item;
 961         struct btrfs_extent_item_v0 *ei0;
 962         struct btrfs_extent_ref_v0 *ref0;
 963         struct btrfs_tree_block_info *bi;
 964         struct extent_buffer *leaf;
 965         struct btrfs_key key;
 966         struct btrfs_key found_key;
 967         u32 new_size = sizeof(*item);
 968         u64 refs;
 969         int ret;
 970
 971         leaf = path->nodes[0];
 972         BUG_ON(btrfs_item_size_nr(leaf, path->slots[0]) != sizeof(*ei0));
 973
 974         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 975         ei0 = btrfs_item_ptr(leaf, path->slots[0],
 976                              struct btrfs_extent_item_v0);
 977         refs = btrfs_extent_refs_v0(leaf, ei0);
 978
 979         if (owner == (u64)-1) {
 980                 while (1) {
 981                         if (path->slots[0] >= btrfs_header_nritems(leaf)) {
 982                                 ret = btrfs_next_leaf(root, path);
 983                                 if (ret < 0)
 984                                         return ret;
 985                                 BUG_ON(ret > 0);
 986                                 leaf = path->nodes[0];
 987                         }
 988                         btrfs_item_key_to_cpu(leaf, &found_key,
 989                                               path->slots[0]);
 990                         BUG_ON(key.objectid != found_key.objectid);
 991                         if (found_key.type != BTRFS_EXTENT_REF_V0_KEY) {
 992                                 path->slots[0]++;
 993                                 continue;
 994                         }
 995                         ref0 = btrfs_item_ptr(leaf, path->slots[0],
 996                                               struct btrfs_extent_ref_v0);
 997                         owner = btrfs_ref_objectid_v0(leaf, ref0);
 998                         break;
 999                 }
1000         }
1001         btrfs_release_path(path);
1002
1003         if (owner < BTRFS_FIRST_FREE_OBJECTID)
1004                 new_size += sizeof(*bi);
1005
1006         new_size -= sizeof(*ei0);
1007         ret = btrfs_search_slot(trans, root, &key, path,
1008                                 new_size + extra_size, 1);
1009         if (ret < 0)
1010                 return ret;
1011         BUG_ON(ret);
1012
1013         ret = btrfs_extend_item(trans, root, path, new_size);
1014
1015         leaf = path->nodes[0];
1016         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1017         btrfs_set_extent_refs(leaf, item, refs);
1018         /* FIXME: get real generation */
1019         btrfs_set_extent_generation(leaf, item, 0);
1020         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1021                 btrfs_set_extent_flags(leaf, item,
1022                                        BTRFS_EXTENT_FLAG_TREE_BLOCK |
1023                                        BTRFS_BLOCK_FLAG_FULL_BACKREF);
1024                 bi = (struct btrfs_tree_block_info *)(item + 1);
1025                 /* FIXME: get first key of the block */
1026                 memset_extent_buffer(leaf, 0, (unsigned long)bi, sizeof(*bi));
1027                 btrfs_set_tree_block_level(leaf, bi, (int)owner);
1028         } else {
1029                 btrfs_set_extent_flags(leaf, item, BTRFS_EXTENT_FLAG_DATA);
1030         }
1031         btrfs_mark_buffer_dirty(leaf);
1032         return 0;
1033 }
1034 #endif
1035
1036 static u64 hash_extent_data_ref(u64 root_objectid, u64 owner, u64 offset)
1037 {
1038         u32 high_crc = ~(u32)0;
1039         u32 low_crc = ~(u32)0;
1040         __le64 lenum;
1041
1042         lenum = cpu_to_le64(root_objectid);
1043         high_crc = crc32c(high_crc, &lenum, sizeof(lenum));
1044         lenum = cpu_to_le64(owner);
1045         low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
1046         lenum = cpu_to_le64(offset);
1047         low_crc = crc32c(low_crc, &lenum, sizeof(lenum));
1048
1049         return ((u64)high_crc << 31) ^ (u64)low_crc;
1050 }
1051
1052 static u64 hash_extent_data_ref_item(struct extent_buffer *leaf,
1053                                      struct btrfs_extent_data_ref *ref)
1054 {
1055         return hash_extent_data_ref(btrfs_extent_data_ref_root(leaf, ref),
1056                                     btrfs_extent_data_ref_objectid(leaf, ref),
1057                                     btrfs_extent_data_ref_offset(leaf, ref));
1058 }
1059
1060 static int match_extent_data_ref(struct extent_buffer *leaf,
1061                                  struct btrfs_extent_data_ref *ref,
1062                                  u64 root_objectid, u64 owner, u64 offset)
1063 {
1064         if (btrfs_extent_data_ref_root(leaf, ref) != root_objectid ||
1065             btrfs_extent_data_ref_objectid(leaf, ref) != owner ||
1066             btrfs_extent_data_ref_offset(leaf, ref) != offset)
1067                 return 0;
1068         return 1;
1069 }
1070
1071 static noinline int lookup_extent_data_ref(struct btrfs_trans_handle *trans,
1072                                            struct btrfs_root *root,
1073                                            struct btrfs_path *path,
1074                                            u64 bytenr, u64 parent,
1075                                            u64 root_objectid,
1076                                            u64 owner, u64 offset)
1077 {
1078         struct btrfs_key key;
1079         struct btrfs_extent_data_ref *ref;
1080         struct extent_buffer *leaf;
1081         u32 nritems;
1082         int ret;
1083         int recow;
1084         int err = -ENOENT;
1085
1086         key.objectid = bytenr;
1087         if (parent) {
1088                 key.type = BTRFS_SHARED_DATA_REF_KEY;
1089                 key.offset = parent;
1090         } else {
1091                 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1092                 key.offset = hash_extent_data_ref(root_objectid,
1093                                                   owner, offset);
1094         }
1095 again:
1096         recow = 0;
1097         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1098         if (ret < 0) {
1099                 err = ret;
1100                 goto fail;
1101         }
1102
1103         if (parent) {
1104                 if (!ret)
1105                         return 0;
1106 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1107                 key.type = BTRFS_EXTENT_REF_V0_KEY;
1108                 btrfs_release_path(path);
1109                 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1110                 if (ret < 0) {
1111                         err = ret;
1112                         goto fail;
1113                 }
1114                 if (!ret)
1115                         return 0;
1116 #endif
1117                 goto fail;
1118         }
1119
1120         leaf = path->nodes[0];
1121         nritems = btrfs_header_nritems(leaf);
1122         while (1) {
1123                 if (path->slots[0] >= nritems) {
1124                         ret = btrfs_next_leaf(root, path);
1125                         if (ret < 0)
1126                                 err = ret;
1127                         if (ret)
1128                                 goto fail;
1129
1130                         leaf = path->nodes[0];
1131                         nritems = btrfs_header_nritems(leaf);
1132                         recow = 1;
1133                 }
1134
1135                 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1136                 if (key.objectid != bytenr ||
1137                     key.type != BTRFS_EXTENT_DATA_REF_KEY)
1138                         goto fail;
1139
1140                 ref = btrfs_item_ptr(leaf, path->slots[0],
1141                                      struct btrfs_extent_data_ref);
1142
1143                 if (match_extent_data_ref(leaf, ref, root_objectid,
1144                                           owner, offset)) {
1145                         if (recow) {
1146                                 btrfs_release_path(path);
1147                                 goto again;
1148                         }
1149                         err = 0;
1150                         break;
1151                 }
1152                 path->slots[0]++;
1153         }
1154 fail:
1155         return err;
1156 }
1157
1158 static noinline int insert_extent_data_ref(struct btrfs_trans_handle *trans,
1159                                            struct btrfs_root *root,
1160                                            struct btrfs_path *path,
1161                                            u64 bytenr, u64 parent,
1162                                            u64 root_objectid, u64 owner,
1163                                            u64 offset, int refs_to_add)
1164 {
1165         struct btrfs_key key;
1166         struct extent_buffer *leaf;
1167         u32 size;
1168         u32 num_refs;
1169         int ret;
1170
1171         key.objectid = bytenr;
1172         if (parent) {
1173                 key.type = BTRFS_SHARED_DATA_REF_KEY;
1174                 key.offset = parent;
1175                 size = sizeof(struct btrfs_shared_data_ref);
1176         } else {
1177                 key.type = BTRFS_EXTENT_DATA_REF_KEY;
1178                 key.offset = hash_extent_data_ref(root_objectid,
1179                                                   owner, offset);
1180                 size = sizeof(struct btrfs_extent_data_ref);
1181         }
1182
1183         ret = btrfs_insert_empty_item(trans, root, path, &key, size);
1184         if (ret && ret != -EEXIST)
1185                 goto fail;
1186
1187         leaf = path->nodes[0];
1188         if (parent) {
1189                 struct btrfs_shared_data_ref *ref;
1190                 ref = btrfs_item_ptr(leaf, path->slots[0],
1191                                      struct btrfs_shared_data_ref);
1192                 if (ret == 0) {
1193                         btrfs_set_shared_data_ref_count(leaf, ref, refs_to_add);
1194                 } else {
1195                         num_refs = btrfs_shared_data_ref_count(leaf, ref);
1196                         num_refs += refs_to_add;
1197                         btrfs_set_shared_data_ref_count(leaf, ref, num_refs);
1198                 }
1199         } else {
1200                 struct btrfs_extent_data_ref *ref;
1201                 while (ret == -EEXIST) {
1202                         ref = btrfs_item_ptr(leaf, path->slots[0],
1203                                              struct btrfs_extent_data_ref);
1204                         if (match_extent_data_ref(leaf, ref, root_objectid,
1205                                                   owner, offset))
1206                                 break;
1207                         btrfs_release_path(path);
1208                         key.offset++;
1209                         ret = btrfs_insert_empty_item(trans, root, path, &key,
1210                                                       size);
1211                         if (ret && ret != -EEXIST)
1212                                 goto fail;
1213
1214                         leaf = path->nodes[0];
1215                 }
1216                 ref = btrfs_item_ptr(leaf, path->slots[0],
1217                                      struct btrfs_extent_data_ref);
1218                 if (ret == 0) {
1219                         btrfs_set_extent_data_ref_root(leaf, ref,
1220                                                        root_objectid);
1221                         btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
1222                         btrfs_set_extent_data_ref_offset(leaf, ref, offset);
1223                         btrfs_set_extent_data_ref_count(leaf, ref, refs_to_add);
1224                 } else {
1225                         num_refs = btrfs_extent_data_ref_count(leaf, ref);
1226                         num_refs += refs_to_add;
1227                         btrfs_set_extent_data_ref_count(leaf, ref, num_refs);
1228                 }
1229         }
1230         btrfs_mark_buffer_dirty(leaf);
1231         ret = 0;
1232 fail:
1233         btrfs_release_path(path);
1234         return ret;
1235 }
1236
1237 static noinline int remove_extent_data_ref(struct btrfs_trans_handle *trans,
1238                                            struct btrfs_root *root,
1239                                            struct btrfs_path *path,
1240                                            int refs_to_drop)
1241 {
1242         struct btrfs_key key;
1243         struct btrfs_extent_data_ref *ref1 = NULL;
1244         struct btrfs_shared_data_ref *ref2 = NULL;
1245         struct extent_buffer *leaf;
1246         u32 num_refs = 0;
1247         int ret = 0;
1248
1249         leaf = path->nodes[0];
1250         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1251
1252         if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1253                 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1254                                       struct btrfs_extent_data_ref);
1255                 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1256         } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1257                 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1258                                       struct btrfs_shared_data_ref);
1259                 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1260 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1261         } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1262                 struct btrfs_extent_ref_v0 *ref0;
1263                 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1264                                       struct btrfs_extent_ref_v0);
1265                 num_refs = btrfs_ref_count_v0(leaf, ref0);
1266 #endif
1267         } else {
1268                 BUG();
1269         }
1270
1271         BUG_ON(num_refs < refs_to_drop);
1272         num_refs -= refs_to_drop;
1273
1274         if (num_refs == 0) {
1275                 ret = btrfs_del_item(trans, root, path);
1276         } else {
1277                 if (key.type == BTRFS_EXTENT_DATA_REF_KEY)
1278                         btrfs_set_extent_data_ref_count(leaf, ref1, num_refs);
1279                 else if (key.type == BTRFS_SHARED_DATA_REF_KEY)
1280                         btrfs_set_shared_data_ref_count(leaf, ref2, num_refs);
1281 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1282                 else {
1283                         struct btrfs_extent_ref_v0 *ref0;
1284                         ref0 = btrfs_item_ptr(leaf, path->slots[0],
1285                                         struct btrfs_extent_ref_v0);
1286                         btrfs_set_ref_count_v0(leaf, ref0, num_refs);
1287                 }
1288 #endif
1289                 btrfs_mark_buffer_dirty(leaf);
1290         }
1291         return ret;
1292 }
1293
1294 static noinline u32 extent_data_ref_count(struct btrfs_root *root,
1295                                           struct btrfs_path *path,
1296                                           struct btrfs_extent_inline_ref *iref)
1297 {
1298         struct btrfs_key key;
1299         struct extent_buffer *leaf;
1300         struct btrfs_extent_data_ref *ref1;
1301         struct btrfs_shared_data_ref *ref2;
1302         u32 num_refs = 0;
1303
1304         leaf = path->nodes[0];
1305         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1306         if (iref) {
1307                 if (btrfs_extent_inline_ref_type(leaf, iref) ==
1308                     BTRFS_EXTENT_DATA_REF_KEY) {
1309                         ref1 = (struct btrfs_extent_data_ref *)(&iref->offset);
1310                         num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1311                 } else {
1312                         ref2 = (struct btrfs_shared_data_ref *)(iref + 1);
1313                         num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1314                 }
1315         } else if (key.type == BTRFS_EXTENT_DATA_REF_KEY) {
1316                 ref1 = btrfs_item_ptr(leaf, path->slots[0],
1317                                       struct btrfs_extent_data_ref);
1318                 num_refs = btrfs_extent_data_ref_count(leaf, ref1);
1319         } else if (key.type == BTRFS_SHARED_DATA_REF_KEY) {
1320                 ref2 = btrfs_item_ptr(leaf, path->slots[0],
1321                                       struct btrfs_shared_data_ref);
1322                 num_refs = btrfs_shared_data_ref_count(leaf, ref2);
1323 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1324         } else if (key.type == BTRFS_EXTENT_REF_V0_KEY) {
1325                 struct btrfs_extent_ref_v0 *ref0;
1326                 ref0 = btrfs_item_ptr(leaf, path->slots[0],
1327                                       struct btrfs_extent_ref_v0);
1328                 num_refs = btrfs_ref_count_v0(leaf, ref0);
1329 #endif
1330         } else {
1331                 WARN_ON(1);
1332         }
1333         return num_refs;
1334 }
1335
1336 static noinline int lookup_tree_block_ref(struct btrfs_trans_handle *trans,
1337                                           struct btrfs_root *root,
1338                                           struct btrfs_path *path,
1339                                           u64 bytenr, u64 parent,
1340                                           u64 root_objectid)
1341 {
1342         struct btrfs_key key;
1343         int ret;
1344
1345         key.objectid = bytenr;
1346         if (parent) {
1347                 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1348                 key.offset = parent;
1349         } else {
1350                 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1351                 key.offset = root_objectid;
1352         }
1353
1354         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1355         if (ret > 0)
1356                 ret = -ENOENT;
1357 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1358         if (ret == -ENOENT && parent) {
1359                 btrfs_release_path(path);
1360                 key.type = BTRFS_EXTENT_REF_V0_KEY;
1361                 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1362                 if (ret > 0)
1363                         ret = -ENOENT;
1364         }
1365 #endif
1366         return ret;
1367 }
1368
1369 static noinline int insert_tree_block_ref(struct btrfs_trans_handle *trans,
1370                                           struct btrfs_root *root,
1371                                           struct btrfs_path *path,
1372                                           u64 bytenr, u64 parent,
1373                                           u64 root_objectid)
1374 {
1375         struct btrfs_key key;
1376         int ret;
1377
1378         key.objectid = bytenr;
1379         if (parent) {
1380                 key.type = BTRFS_SHARED_BLOCK_REF_KEY;
1381                 key.offset = parent;
1382         } else {
1383                 key.type = BTRFS_TREE_BLOCK_REF_KEY;
1384                 key.offset = root_objectid;
1385         }
1386
1387         ret = btrfs_insert_empty_item(trans, root, path, &key, 0);
1388         btrfs_release_path(path);
1389         return ret;
1390 }
1391
1392 static inline int extent_ref_type(u64 parent, u64 owner)
1393 {
1394         int type;
1395         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1396                 if (parent > 0)
1397                         type = BTRFS_SHARED_BLOCK_REF_KEY;
1398                 else
1399                         type = BTRFS_TREE_BLOCK_REF_KEY;
1400         } else {
1401                 if (parent > 0)
1402                         type = BTRFS_SHARED_DATA_REF_KEY;
1403                 else
1404                         type = BTRFS_EXTENT_DATA_REF_KEY;
1405         }
1406         return type;
1407 }
1408
1409 static int find_next_key(struct btrfs_path *path, int level,
1410                          struct btrfs_key *key)
1411
1412 {
1413         for (; level < BTRFS_MAX_LEVEL; level++) {
1414                 if (!path->nodes[level])
1415                         break;
1416                 if (path->slots[level] + 1 >=
1417                     btrfs_header_nritems(path->nodes[level]))
1418                         continue;
1419                 if (level == 0)
1420                         btrfs_item_key_to_cpu(path->nodes[level], key,
1421                                               path->slots[level] + 1);
1422                 else
1423                         btrfs_node_key_to_cpu(path->nodes[level], key,
1424                                               path->slots[level] + 1);
1425                 return 0;
1426         }
1427         return 1;
1428 }
1429
1430 /*
1431  * look for inline back ref. if back ref is found, *ref_ret is set
1432  * to the address of inline back ref, and 0 is returned.
1433  *
1434  * if back ref isn't found, *ref_ret is set to the address where it
1435  * should be inserted, and -ENOENT is returned.
1436  *
1437  * if insert is true and there are too many inline back refs, the path
1438  * points to the extent item, and -EAGAIN is returned.
1439  *
1440  * NOTE: inline back refs are ordered in the same way that back ref
1441  *       items in the tree are ordered.
1442  */
1443 static noinline_for_stack
1444 int lookup_inline_extent_backref(struct btrfs_trans_handle *trans,
1445                                  struct btrfs_root *root,
1446                                  struct btrfs_path *path,
1447                                  struct btrfs_extent_inline_ref **ref_ret,
1448                                  u64 bytenr, u64 num_bytes,
1449                                  u64 parent, u64 root_objectid,
1450                                  u64 owner, u64 offset, int insert)
1451 {
1452         struct btrfs_key key;
1453         struct extent_buffer *leaf;
1454         struct btrfs_extent_item *ei;
1455         struct btrfs_extent_inline_ref *iref;
1456         u64 flags;
1457         u64 item_size;
1458         unsigned long ptr;
1459         unsigned long end;
1460         int extra_size;
1461         int type;
1462         int want;
1463         int ret;
1464         int err = 0;
1465
1466         key.objectid = bytenr;
1467         key.type = BTRFS_EXTENT_ITEM_KEY;
1468         key.offset = num_bytes;
1469
1470         want = extent_ref_type(parent, owner);
1471         if (insert) {
1472                 extra_size = btrfs_extent_inline_ref_size(want);
1473                 path->keep_locks = 1;
1474         } else
1475                 extra_size = -1;
1476         ret = btrfs_search_slot(trans, root, &key, path, extra_size, 1);
1477         if (ret < 0) {
1478                 err = ret;
1479                 goto out;
1480         }
1481         BUG_ON(ret);
1482
1483         leaf = path->nodes[0];
1484         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1485 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
1486         if (item_size < sizeof(*ei)) {
1487                 if (!insert) {
1488                         err = -ENOENT;
1489                         goto out;
1490                 }
1491                 ret = convert_extent_item_v0(trans, root, path, owner,
1492                                              extra_size);
1493                 if (ret < 0) {
1494                         err = ret;
1495                         goto out;
1496                 }
1497                 leaf = path->nodes[0];
1498                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1499         }
1500 #endif
1501         BUG_ON(item_size < sizeof(*ei));
1502
1503         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1504         flags = btrfs_extent_flags(leaf, ei);
1505
1506         ptr = (unsigned long)(ei + 1);
1507         end = (unsigned long)ei + item_size;
1508
1509         if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
1510                 ptr += sizeof(struct btrfs_tree_block_info);
1511                 BUG_ON(ptr > end);
1512         } else {
1513                 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA));
1514         }
1515
1516         err = -ENOENT;
1517         while (1) {
1518                 if (ptr >= end) {
1519                         WARN_ON(ptr > end);
1520                         break;
1521                 }
1522                 iref = (struct btrfs_extent_inline_ref *)ptr;
1523                 type = btrfs_extent_inline_ref_type(leaf, iref);
1524                 if (want < type)
1525                         break;
1526                 if (want > type) {
1527                         ptr += btrfs_extent_inline_ref_size(type);
1528                         continue;
1529                 }
1530
1531                 if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1532                         struct btrfs_extent_data_ref *dref;
1533                         dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1534                         if (match_extent_data_ref(leaf, dref, root_objectid,
1535                                                   owner, offset)) {
1536                                 err = 0;
1537                                 break;
1538                         }
1539                         if (hash_extent_data_ref_item(leaf, dref) <
1540                             hash_extent_data_ref(root_objectid, owner, offset))
1541                                 break;
1542                 } else {
1543                         u64 ref_offset;
1544                         ref_offset = btrfs_extent_inline_ref_offset(leaf, iref);
1545                         if (parent > 0) {
1546                                 if (parent == ref_offset) {
1547                                         err = 0;
1548                                         break;
1549                                 }
1550                                 if (ref_offset < parent)
1551                                         break;
1552                         } else {
1553                                 if (root_objectid == ref_offset) {
1554                                         err = 0;
1555                                         break;
1556                                 }
1557                                 if (ref_offset < root_objectid)
1558                                         break;
1559                         }
1560                 }
1561                 ptr += btrfs_extent_inline_ref_size(type);
1562         }
1563         if (err == -ENOENT && insert) {
1564                 if (item_size + extra_size >=
1565                     BTRFS_MAX_EXTENT_ITEM_SIZE(root)) {
1566                         err = -EAGAIN;
1567                         goto out;
1568                 }
1569                 /*
1570                  * To add new inline back ref, we have to make sure
1571                  * there is no corresponding back ref item.
1572                  * For simplicity, we just do not add new inline back
1573                  * ref if there is any kind of item for this block
1574                  */
1575                 if (find_next_key(path, 0, &key) == 0 &&
1576                     key.objectid == bytenr &&
1577                     key.type < BTRFS_BLOCK_GROUP_ITEM_KEY) {
1578                         err = -EAGAIN;
1579                         goto out;
1580                 }
1581         }
1582         *ref_ret = (struct btrfs_extent_inline_ref *)ptr;
1583 out:
1584         if (insert) {
1585                 path->keep_locks = 0;
1586                 btrfs_unlock_up_safe(path, 1);
1587         }
1588         return err;
1589 }
1590
1591 /*
1592  * helper to add new inline back ref
1593  */
1594 static noinline_for_stack
1595 int setup_inline_extent_backref(struct btrfs_trans_handle *trans,
1596                                 struct btrfs_root *root,
1597                                 struct btrfs_path *path,
1598                                 struct btrfs_extent_inline_ref *iref,
1599                                 u64 parent, u64 root_objectid,
1600                                 u64 owner, u64 offset, int refs_to_add,
1601                                 struct btrfs_delayed_extent_op *extent_op)
1602 {
1603         struct extent_buffer *leaf;
1604         struct btrfs_extent_item *ei;
1605         unsigned long ptr;
1606         unsigned long end;
1607         unsigned long item_offset;
1608         u64 refs;
1609         int size;
1610         int type;
1611         int ret;
1612
1613         leaf = path->nodes[0];
1614         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1615         item_offset = (unsigned long)iref - (unsigned long)ei;
1616
1617         type = extent_ref_type(parent, owner);
1618         size = btrfs_extent_inline_ref_size(type);
1619
1620         ret = btrfs_extend_item(trans, root, path, size);
1621
1622         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1623         refs = btrfs_extent_refs(leaf, ei);
1624         refs += refs_to_add;
1625         btrfs_set_extent_refs(leaf, ei, refs);
1626         if (extent_op)
1627                 __run_delayed_extent_op(extent_op, leaf, ei);
1628
1629         ptr = (unsigned long)ei + item_offset;
1630         end = (unsigned long)ei + btrfs_item_size_nr(leaf, path->slots[0]);
1631         if (ptr < end - size)
1632                 memmove_extent_buffer(leaf, ptr + size, ptr,
1633                                       end - size - ptr);
1634
1635         iref = (struct btrfs_extent_inline_ref *)ptr;
1636         btrfs_set_extent_inline_ref_type(leaf, iref, type);
1637         if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1638                 struct btrfs_extent_data_ref *dref;
1639                 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1640                 btrfs_set_extent_data_ref_root(leaf, dref, root_objectid);
1641                 btrfs_set_extent_data_ref_objectid(leaf, dref, owner);
1642                 btrfs_set_extent_data_ref_offset(leaf, dref, offset);
1643                 btrfs_set_extent_data_ref_count(leaf, dref, refs_to_add);
1644         } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1645                 struct btrfs_shared_data_ref *sref;
1646                 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1647                 btrfs_set_shared_data_ref_count(leaf, sref, refs_to_add);
1648                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1649         } else if (type == BTRFS_SHARED_BLOCK_REF_KEY) {
1650                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
1651         } else {
1652                 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
1653         }
1654         btrfs_mark_buffer_dirty(leaf);
1655         return 0;
1656 }
1657
1658 static int lookup_extent_backref(struct btrfs_trans_handle *trans,
1659                                  struct btrfs_root *root,
1660                                  struct btrfs_path *path,
1661                                  struct btrfs_extent_inline_ref **ref_ret,
1662                                  u64 bytenr, u64 num_bytes, u64 parent,
1663                                  u64 root_objectid, u64 owner, u64 offset)
1664 {
1665         int ret;
1666
1667         ret = lookup_inline_extent_backref(trans, root, path, ref_ret,
1668                                            bytenr, num_bytes, parent,
1669                                            root_objectid, owner, offset, 0);
1670         if (ret != -ENOENT)
1671                 return ret;
1672
1673         btrfs_release_path(path);
1674         *ref_ret = NULL;
1675
1676         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1677                 ret = lookup_tree_block_ref(trans, root, path, bytenr, parent,
1678                                             root_objectid);
1679         } else {
1680                 ret = lookup_extent_data_ref(trans, root, path, bytenr, parent,
1681                                              root_objectid, owner, offset);
1682         }
1683         return ret;
1684 }
1685
1686 /*
1687  * helper to update/remove inline back ref
1688  */
1689 static noinline_for_stack
1690 int update_inline_extent_backref(struct btrfs_trans_handle *trans,
1691                                  struct btrfs_root *root,
1692                                  struct btrfs_path *path,
1693                                  struct btrfs_extent_inline_ref *iref,
1694                                  int refs_to_mod,
1695                                  struct btrfs_delayed_extent_op *extent_op)
1696 {
1697         struct extent_buffer *leaf;
1698         struct btrfs_extent_item *ei;
1699         struct btrfs_extent_data_ref *dref = NULL;
1700         struct btrfs_shared_data_ref *sref = NULL;
1701         unsigned long ptr;
1702         unsigned long end;
1703         u32 item_size;
1704         int size;
1705         int type;
1706         int ret;
1707         u64 refs;
1708
1709         leaf = path->nodes[0];
1710         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1711         refs = btrfs_extent_refs(leaf, ei);
1712         WARN_ON(refs_to_mod < 0 && refs + refs_to_mod <= 0);
1713         refs += refs_to_mod;
1714         btrfs_set_extent_refs(leaf, ei, refs);
1715         if (extent_op)
1716                 __run_delayed_extent_op(extent_op, leaf, ei);
1717
1718         type = btrfs_extent_inline_ref_type(leaf, iref);
1719
1720         if (type == BTRFS_EXTENT_DATA_REF_KEY) {
1721                 dref = (struct btrfs_extent_data_ref *)(&iref->offset);
1722                 refs = btrfs_extent_data_ref_count(leaf, dref);
1723         } else if (type == BTRFS_SHARED_DATA_REF_KEY) {
1724                 sref = (struct btrfs_shared_data_ref *)(iref + 1);
1725                 refs = btrfs_shared_data_ref_count(leaf, sref);
1726         } else {
1727                 refs = 1;
1728                 BUG_ON(refs_to_mod != -1);
1729         }
1730
1731         BUG_ON(refs_to_mod < 0 && refs < -refs_to_mod);
1732         refs += refs_to_mod;
1733
1734         if (refs > 0) {
1735                 if (type == BTRFS_EXTENT_DATA_REF_KEY)
1736                         btrfs_set_extent_data_ref_count(leaf, dref, refs);
1737                 else
1738                         btrfs_set_shared_data_ref_count(leaf, sref, refs);
1739         } else {
1740                 size =  btrfs_extent_inline_ref_size(type);
1741                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
1742                 ptr = (unsigned long)iref;
1743                 end = (unsigned long)ei + item_size;
1744                 if (ptr + size < end)
1745                         memmove_extent_buffer(leaf, ptr, ptr + size,
1746                                               end - ptr - size);
1747                 item_size -= size;
1748                 ret = btrfs_truncate_item(trans, root, path, item_size, 1);
1749         }
1750         btrfs_mark_buffer_dirty(leaf);
1751         return 0;
1752 }
1753
1754 static noinline_for_stack
1755 int insert_inline_extent_backref(struct btrfs_trans_handle *trans,
1756                                  struct btrfs_root *root,
1757                                  struct btrfs_path *path,
1758                                  u64 bytenr, u64 num_bytes, u64 parent,
1759                                  u64 root_objectid, u64 owner,
1760                                  u64 offset, int refs_to_add,
1761                                  struct btrfs_delayed_extent_op *extent_op)
1762 {
1763         struct btrfs_extent_inline_ref *iref;
1764         int ret;
1765
1766         ret = lookup_inline_extent_backref(trans, root, path, &iref,
1767                                            bytenr, num_bytes, parent,
1768                                            root_objectid, owner, offset, 1);
1769         if (ret == 0) {
1770                 BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID);
1771                 ret = update_inline_extent_backref(trans, root, path, iref,
1772                                                    refs_to_add, extent_op);
1773         } else if (ret == -ENOENT) {
1774                 ret = setup_inline_extent_backref(trans, root, path, iref,
1775                                                   parent, root_objectid,
1776                                                   owner, offset, refs_to_add,
1777                                                   extent_op);
1778         }
1779         return ret;
1780 }
1781
1782 static int insert_extent_backref(struct btrfs_trans_handle *trans,
1783                                  struct btrfs_root *root,
1784                                  struct btrfs_path *path,
1785                                  u64 bytenr, u64 parent, u64 root_objectid,
1786                                  u64 owner, u64 offset, int refs_to_add)
1787 {
1788         int ret;
1789         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1790                 BUG_ON(refs_to_add != 1);
1791                 ret = insert_tree_block_ref(trans, root, path, bytenr,
1792                                             parent, root_objectid);
1793         } else {
1794                 ret = insert_extent_data_ref(trans, root, path, bytenr,
1795                                              parent, root_objectid,
1796                                              owner, offset, refs_to_add);
1797         }
1798         return ret;
1799 }
1800
1801 static int remove_extent_backref(struct btrfs_trans_handle *trans,
1802                                  struct btrfs_root *root,
1803                                  struct btrfs_path *path,
1804                                  struct btrfs_extent_inline_ref *iref,
1805                                  int refs_to_drop, int is_data)
1806 {
1807         int ret;
1808
1809         BUG_ON(!is_data && refs_to_drop != 1);
1810         if (iref) {
1811                 ret = update_inline_extent_backref(trans, root, path, iref,
1812                                                    -refs_to_drop, NULL);
1813         } else if (is_data) {
1814                 ret = remove_extent_data_ref(trans, root, path, refs_to_drop);
1815         } else {
1816                 ret = btrfs_del_item(trans, root, path);
1817         }
1818         return ret;
1819 }
1820
1821 static int btrfs_issue_discard(struct block_device *bdev,
1822                                 u64 start, u64 len)
1823 {
1824         return blkdev_issue_discard(bdev, start >> 9, len >> 9, GFP_NOFS, 0);
1825 }
1826
1827 static int btrfs_discard_extent(struct btrfs_root *root, u64 bytenr,
1828                                 u64 num_bytes, u64 *actual_bytes)
1829 {
1830         int ret;
1831         u64 discarded_bytes = 0;
1832         struct btrfs_bio *bbio = NULL;
1833
1834
1835         /* Tell the block device(s) that the sectors can be discarded */
1836         ret = btrfs_map_block(&root->fs_info->mapping_tree, REQ_DISCARD,
1837                               bytenr, &num_bytes, &bbio, 0);
1838         if (!ret) {
1839                 struct btrfs_bio_stripe *stripe = bbio->stripes;
1840                 int i;
1841
1842
1843                 for (i = 0; i < bbio->num_stripes; i++, stripe++) {
1844                         if (!stripe->dev->can_discard)
1845                                 continue;
1846
1847                         ret = btrfs_issue_discard(stripe->dev->bdev,
1848                                                   stripe->physical,
1849                                                   stripe->length);
1850                         if (!ret)
1851                                 discarded_bytes += stripe->length;
1852                         else if (ret != -EOPNOTSUPP)
1853                                 break;
1854
1855                         /*
1856                          * Just in case we get back EOPNOTSUPP for some reason,
1857                          * just ignore the return value so we don't screw up
1858                          * people calling discard_extent.
1859                          */
1860                         ret = 0;
1861                 }
1862                 kfree(bbio);
1863         }
1864
1865         if (actual_bytes)
1866                 *actual_bytes = discarded_bytes;
1867
1868
1869         return ret;
1870 }
1871
1872 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1873                          struct btrfs_root *root,
1874                          u64 bytenr, u64 num_bytes, u64 parent,
1875                          u64 root_objectid, u64 owner, u64 offset, int for_cow)
1876 {
1877         int ret;
1878         struct btrfs_fs_info *fs_info = root->fs_info;
1879
1880         BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID &&
1881                root_objectid == BTRFS_TREE_LOG_OBJECTID);
1882
1883         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1884                 ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr,
1885                                         num_bytes,
1886                                         parent, root_objectid, (int)owner,
1887                                         BTRFS_ADD_DELAYED_REF, NULL, for_cow);
1888         } else {
1889                 ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr,
1890                                         num_bytes,
1891                                         parent, root_objectid, owner, offset,
1892                                         BTRFS_ADD_DELAYED_REF, NULL, for_cow);
1893         }
1894         return ret;
1895 }
1896
1897 static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1898                                   struct btrfs_root *root,
1899                                   u64 bytenr, u64 num_bytes,
1900                                   u64 parent, u64 root_objectid,
1901                                   u64 owner, u64 offset, int refs_to_add,
1902                                   struct btrfs_delayed_extent_op *extent_op)
1903 {
1904         struct btrfs_path *path;
1905         struct extent_buffer *leaf;
1906         struct btrfs_extent_item *item;
1907         u64 refs;
1908         int ret;
1909         int err = 0;
1910
1911         path = btrfs_alloc_path();
1912         if (!path)
1913                 return -ENOMEM;
1914
1915         path->reada = 1;
1916         path->leave_spinning = 1;
1917         /* this will setup the path even if it fails to insert the back ref */
1918         ret = insert_inline_extent_backref(trans, root->fs_info->extent_root,
1919                                            path, bytenr, num_bytes, parent,
1920                                            root_objectid, owner, offset,
1921                                            refs_to_add, extent_op);
1922         if (ret == 0)
1923                 goto out;
1924
1925         if (ret != -EAGAIN) {
1926                 err = ret;
1927                 goto out;
1928         }
1929
1930         leaf = path->nodes[0];
1931         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1932         refs = btrfs_extent_refs(leaf, item);
1933         btrfs_set_extent_refs(leaf, item, refs + refs_to_add);
1934         if (extent_op)
1935                 __run_delayed_extent_op(extent_op, leaf, item);
1936
1937         btrfs_mark_buffer_dirty(leaf);
1938         btrfs_release_path(path);
1939
1940         path->reada = 1;
1941         path->leave_spinning = 1;
1942
1943         /* now insert the actual backref */
1944         ret = insert_extent_backref(trans, root->fs_info->extent_root,
1945                                     path, bytenr, parent, root_objectid,
1946                                     owner, offset, refs_to_add);
1947         BUG_ON(ret);
1948 out:
1949         btrfs_free_path(path);
1950         return err;
1951 }
1952
1953 static int run_delayed_data_ref(struct btrfs_trans_handle *trans,
1954                                 struct btrfs_root *root,
1955                                 struct btrfs_delayed_ref_node *node,
1956                                 struct btrfs_delayed_extent_op *extent_op,
1957                                 int insert_reserved)
1958 {
1959         int ret = 0;
1960         struct btrfs_delayed_data_ref *ref;
1961         struct btrfs_key ins;
1962         u64 parent = 0;
1963         u64 ref_root = 0;
1964         u64 flags = 0;
1965
1966         ins.objectid = node->bytenr;
1967         ins.offset = node->num_bytes;
1968         ins.type = BTRFS_EXTENT_ITEM_KEY;
1969
1970         ref = btrfs_delayed_node_to_data_ref(node);
1971         if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1972                 parent = ref->parent;
1973         else
1974                 ref_root = ref->root;
1975
1976         if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1977                 if (extent_op) {
1978                         BUG_ON(extent_op->update_key);
1979                         flags |= extent_op->flags_to_set;
1980                 }
1981                 ret = alloc_reserved_file_extent(trans, root,
1982                                                  parent, ref_root, flags,
1983                                                  ref->objectid, ref->offset,
1984                                                  &ins, node->ref_mod);
1985         } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1986                 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
1987                                              node->num_bytes, parent,
1988                                              ref_root, ref->objectid,
1989                                              ref->offset, node->ref_mod,
1990                                              extent_op);
1991         } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1992                 ret = __btrfs_free_extent(trans, root, node->bytenr,
1993                                           node->num_bytes, parent,
1994                                           ref_root, ref->objectid,
1995                                           ref->offset, node->ref_mod,
1996                                           extent_op);
1997         } else {
1998                 BUG();
1999         }
2000         return ret;
2001 }
2002
2003 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
2004                                     struct extent_buffer *leaf,
2005                                     struct btrfs_extent_item *ei)
2006 {
2007         u64 flags = btrfs_extent_flags(leaf, ei);
2008         if (extent_op->update_flags) {
2009                 flags |= extent_op->flags_to_set;
2010                 btrfs_set_extent_flags(leaf, ei, flags);
2011         }
2012
2013         if (extent_op->update_key) {
2014                 struct btrfs_tree_block_info *bi;
2015                 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK));
2016                 bi = (struct btrfs_tree_block_info *)(ei + 1);
2017                 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
2018         }
2019 }
2020
2021 static int run_delayed_extent_op(struct btrfs_trans_handle *trans,
2022                                  struct btrfs_root *root,
2023                                  struct btrfs_delayed_ref_node *node,
2024                                  struct btrfs_delayed_extent_op *extent_op)
2025 {
2026         struct btrfs_key key;
2027         struct btrfs_path *path;
2028         struct btrfs_extent_item *ei;
2029         struct extent_buffer *leaf;
2030         u32 item_size;
2031         int ret;
2032         int err = 0;
2033
2034         path = btrfs_alloc_path();
2035         if (!path)
2036                 return -ENOMEM;
2037
2038         key.objectid = node->bytenr;
2039         key.type = BTRFS_EXTENT_ITEM_KEY;
2040         key.offset = node->num_bytes;
2041
2042         path->reada = 1;
2043         path->leave_spinning = 1;
2044         ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key,
2045                                 path, 0, 1);
2046         if (ret < 0) {
2047                 err = ret;
2048                 goto out;
2049         }
2050         if (ret > 0) {
2051                 err = -EIO;
2052                 goto out;
2053         }
2054
2055         leaf = path->nodes[0];
2056         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2057 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2058         if (item_size < sizeof(*ei)) {
2059                 ret = convert_extent_item_v0(trans, root->fs_info->extent_root,
2060                                              path, (u64)-1, 0);
2061                 if (ret < 0) {
2062                         err = ret;
2063                         goto out;
2064                 }
2065                 leaf = path->nodes[0];
2066                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2067         }
2068 #endif
2069         BUG_ON(item_size < sizeof(*ei));
2070         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2071         __run_delayed_extent_op(extent_op, leaf, ei);
2072
2073         btrfs_mark_buffer_dirty(leaf);
2074 out:
2075         btrfs_free_path(path);
2076         return err;
2077 }
2078
2079 static int run_delayed_tree_ref(struct btrfs_trans_handle *trans,
2080                                 struct btrfs_root *root,
2081                                 struct btrfs_delayed_ref_node *node,
2082                                 struct btrfs_delayed_extent_op *extent_op,
2083                                 int insert_reserved)
2084 {
2085         int ret = 0;
2086         struct btrfs_delayed_tree_ref *ref;
2087         struct btrfs_key ins;
2088         u64 parent = 0;
2089         u64 ref_root = 0;
2090
2091         ins.objectid = node->bytenr;
2092         ins.offset = node->num_bytes;
2093         ins.type = BTRFS_EXTENT_ITEM_KEY;
2094
2095         ref = btrfs_delayed_node_to_tree_ref(node);
2096         if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2097                 parent = ref->parent;
2098         else
2099                 ref_root = ref->root;
2100
2101         BUG_ON(node->ref_mod != 1);
2102         if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
2103                 BUG_ON(!extent_op || !extent_op->update_flags ||
2104                        !extent_op->update_key);
2105                 ret = alloc_reserved_tree_block(trans, root,
2106                                                 parent, ref_root,
2107                                                 extent_op->flags_to_set,
2108                                                 &extent_op->key,
2109                                                 ref->level, &ins);
2110         } else if (node->action == BTRFS_ADD_DELAYED_REF) {
2111                 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
2112                                              node->num_bytes, parent, ref_root,
2113                                              ref->level, 0, 1, extent_op);
2114         } else if (node->action == BTRFS_DROP_DELAYED_REF) {
2115                 ret = __btrfs_free_extent(trans, root, node->bytenr,
2116                                           node->num_bytes, parent, ref_root,
2117                                           ref->level, 0, 1, extent_op);
2118         } else {
2119                 BUG();
2120         }
2121         return ret;
2122 }
2123
2124 /* helper function to actually process a single delayed ref entry */
2125 static int run_one_delayed_ref(struct btrfs_trans_handle *trans,
2126                                struct btrfs_root *root,
2127                                struct btrfs_delayed_ref_node *node,
2128                                struct btrfs_delayed_extent_op *extent_op,
2129                                int insert_reserved)
2130 {
2131         int ret;
2132         if (btrfs_delayed_ref_is_head(node)) {
2133                 struct btrfs_delayed_ref_head *head;
2134                 /*
2135                  * we've hit the end of the chain and we were supposed
2136                  * to insert this extent into the tree.  But, it got
2137                  * deleted before we ever needed to insert it, so all
2138                  * we have to do is clean up the accounting
2139                  */
2140                 BUG_ON(extent_op);
2141                 head = btrfs_delayed_node_to_head(node);
2142                 if (insert_reserved) {
2143                         btrfs_pin_extent(root, node->bytenr,
2144                                          node->num_bytes, 1);
2145                         if (head->is_data) {
2146                                 ret = btrfs_del_csums(trans, root,
2147                                                       node->bytenr,
2148                                                       node->num_bytes);
2149                                 BUG_ON(ret);
2150                         }
2151                 }
2152                 mutex_unlock(&head->mutex);
2153                 return 0;
2154         }
2155
2156         if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
2157             node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2158                 ret = run_delayed_tree_ref(trans, root, node, extent_op,
2159                                            insert_reserved);
2160         else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
2161                  node->type == BTRFS_SHARED_DATA_REF_KEY)
2162                 ret = run_delayed_data_ref(trans, root, node, extent_op,
2163                                            insert_reserved);
2164         else
2165                 BUG();
2166         return ret;
2167 }
2168
2169 static noinline struct btrfs_delayed_ref_node *
2170 select_delayed_ref(struct btrfs_delayed_ref_head *head)
2171 {
2172         struct rb_node *node;
2173         struct btrfs_delayed_ref_node *ref;
2174         int action = BTRFS_ADD_DELAYED_REF;
2175 again:
2176         /*
2177          * select delayed ref of type BTRFS_ADD_DELAYED_REF first.
2178          * this prevents ref count from going down to zero when
2179          * there still are pending delayed ref.
2180          */
2181         node = rb_prev(&head->node.rb_node);
2182         while (1) {
2183                 if (!node)
2184                         break;
2185                 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2186                                 rb_node);
2187                 if (ref->bytenr != head->node.bytenr)
2188                         break;
2189                 if (ref->action == action)
2190                         return ref;
2191                 node = rb_prev(node);
2192         }
2193         if (action == BTRFS_ADD_DELAYED_REF) {
2194                 action = BTRFS_DROP_DELAYED_REF;
2195                 goto again;
2196         }
2197         return NULL;
2198 }
2199
2200 static noinline int run_clustered_refs(struct btrfs_trans_handle *trans,
2201                                        struct btrfs_root *root,
2202                                        struct list_head *cluster)
2203 {
2204         struct btrfs_delayed_ref_root *delayed_refs;
2205         struct btrfs_delayed_ref_node *ref;
2206         struct btrfs_delayed_ref_head *locked_ref = NULL;
2207         struct btrfs_delayed_extent_op *extent_op;
2208         int ret;
2209         int count = 0;
2210         int must_insert_reserved = 0;
2211
2212         delayed_refs = &trans->transaction->delayed_refs;
2213         while (1) {
2214                 if (!locked_ref) {
2215                         /* pick a new head ref from the cluster list */
2216                         if (list_empty(cluster))
2217                                 break;
2218
2219                         locked_ref = list_entry(cluster->next,
2220                                      struct btrfs_delayed_ref_head, cluster);
2221
2222                         /* grab the lock that says we are going to process
2223                          * all the refs for this head */
2224                         ret = btrfs_delayed_ref_lock(trans, locked_ref);
2225
2226                         /*
2227                          * we may have dropped the spin lock to get the head
2228                          * mutex lock, and that might have given someone else
2229                          * time to free the head.  If that's true, it has been
2230                          * removed from our list and we can move on.
2231                          */
2232                         if (ret == -EAGAIN) {
2233                                 locked_ref = NULL;
2234                                 count++;
2235                                 continue;
2236                         }
2237                 }
2238
2239                 /*
2240                  * locked_ref is the head node, so we have to go one
2241                  * node back for any delayed ref updates
2242                  */
2243                 ref = select_delayed_ref(locked_ref);
2244
2245                 if (ref && ref->seq &&
2246                     btrfs_check_delayed_seq(delayed_refs, ref->seq)) {
2247                         /*
2248                          * there are still refs with lower seq numbers in the
2249                          * process of being added. Don't run this ref yet.
2250                          */
2251                         list_del_init(&locked_ref->cluster);
2252                         mutex_unlock(&locked_ref->mutex);
2253                         locked_ref = NULL;
2254                         delayed_refs->num_heads_ready++;
2255                         spin_unlock(&delayed_refs->lock);
2256                         cond_resched();
2257                         spin_lock(&delayed_refs->lock);
2258                         continue;
2259                 }
2260
2261                 /*
2262                  * record the must insert reserved flag before we
2263                  * drop the spin lock.
2264                  */
2265                 must_insert_reserved = locked_ref->must_insert_reserved;
2266                 locked_ref->must_insert_reserved = 0;
2267
2268                 extent_op = locked_ref->extent_op;
2269                 locked_ref->extent_op = NULL;
2270
2271                 if (!ref) {
2272                         /* All delayed refs have been processed, Go ahead
2273                          * and send the head node to run_one_delayed_ref,
2274                          * so that any accounting fixes can happen
2275                          */
2276                         ref = &locked_ref->node;
2277
2278                         if (extent_op && must_insert_reserved) {
2279                                 kfree(extent_op);
2280                                 extent_op = NULL;
2281                         }
2282
2283                         if (extent_op) {
2284                                 spin_unlock(&delayed_refs->lock);
2285
2286                                 ret = run_delayed_extent_op(trans, root,
2287                                                             ref, extent_op);
2288                                 BUG_ON(ret);
2289                                 kfree(extent_op);
2290
2291                                 goto next;
2292                         }
2293
2294                         list_del_init(&locked_ref->cluster);
2295                         locked_ref = NULL;
2296                 }
2297
2298                 ref->in_tree = 0;
2299                 rb_erase(&ref->rb_node, &delayed_refs->root);
2300                 delayed_refs->num_entries--;
2301                 /*
2302                  * we modified num_entries, but as we're currently running
2303                  * delayed refs, skip
2304                  *     wake_up(&delayed_refs->seq_wait);
2305                  * here.
2306                  */
2307                 spin_unlock(&delayed_refs->lock);
2308
2309                 ret = run_one_delayed_ref(trans, root, ref, extent_op,
2310                                           must_insert_reserved);
2311                 BUG_ON(ret);
2312
2313                 btrfs_put_delayed_ref(ref);
2314                 kfree(extent_op);
2315                 count++;
2316 next:
2317                 do_chunk_alloc(trans, root->fs_info->extent_root,
2318                                2 * 1024 * 1024,
2319                                btrfs_get_alloc_profile(root, 0),
2320                                CHUNK_ALLOC_NO_FORCE);
2321                 cond_resched();
2322                 spin_lock(&delayed_refs->lock);
2323         }
2324         return count;
2325 }
2326
2327
2328 static void wait_for_more_refs(struct btrfs_delayed_ref_root *delayed_refs,
2329                         unsigned long num_refs)
2330 {
2331         struct list_head *first_seq = delayed_refs->seq_head.next;
2332
2333         spin_unlock(&delayed_refs->lock);
2334         pr_debug("waiting for more refs (num %ld, first %p)\n",
2335                  num_refs, first_seq);
2336         wait_event(delayed_refs->seq_wait,
2337                    num_refs != delayed_refs->num_entries ||
2338                    delayed_refs->seq_head.next != first_seq);
2339         pr_debug("done waiting for more refs (num %ld, first %p)\n",
2340                  delayed_refs->num_entries, delayed_refs->seq_head.next);
2341         spin_lock(&delayed_refs->lock);
2342 }
2343
2344 /*
2345  * this starts processing the delayed reference count updates and
2346  * extent insertions we have queued up so far.  count can be
2347  * 0, which means to process everything in the tree at the start
2348  * of the run (but not newly added entries), or it can be some target
2349  * number you'd like to process.
2350  */
2351 int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans,
2352                            struct btrfs_root *root, unsigned long count)
2353 {
2354         struct rb_node *node;
2355         struct btrfs_delayed_ref_root *delayed_refs;
2356         struct btrfs_delayed_ref_node *ref;
2357         struct list_head cluster;
2358         int ret;
2359         u64 delayed_start;
2360         int run_all = count == (unsigned long)-1;
2361         int run_most = 0;
2362         unsigned long num_refs = 0;
2363         int consider_waiting;
2364
2365         if (root == root->fs_info->extent_root)
2366                 root = root->fs_info->tree_root;
2367
2368         do_chunk_alloc(trans, root->fs_info->extent_root,
2369                        2 * 1024 * 1024, btrfs_get_alloc_profile(root, 0),
2370                        CHUNK_ALLOC_NO_FORCE);
2371
2372         delayed_refs = &trans->transaction->delayed_refs;
2373         INIT_LIST_HEAD(&cluster);
2374 again:
2375         consider_waiting = 0;
2376         spin_lock(&delayed_refs->lock);
2377         if (count == 0) {
2378                 count = delayed_refs->num_entries * 2;
2379                 run_most = 1;
2380         }
2381         while (1) {
2382                 if (!(run_all || run_most) &&
2383                     delayed_refs->num_heads_ready < 64)
2384                         break;
2385
2386                 /*
2387                  * go find something we can process in the rbtree.  We start at
2388                  * the beginning of the tree, and then build a cluster
2389                  * of refs to process starting at the first one we are able to
2390                  * lock
2391                  */
2392                 delayed_start = delayed_refs->run_delayed_start;
2393                 ret = btrfs_find_ref_cluster(trans, &cluster,
2394                                              delayed_refs->run_delayed_start);
2395                 if (ret)
2396                         break;
2397
2398                 if (delayed_start >= delayed_refs->run_delayed_start) {
2399                         if (consider_waiting == 0) {
2400                                 /*
2401                                  * btrfs_find_ref_cluster looped. let's do one
2402                                  * more cycle. if we don't run any delayed ref
2403                                  * during that cycle (because we can't because
2404                                  * all of them are blocked) and if the number of
2405                                  * refs doesn't change, we avoid busy waiting.
2406                                  */
2407                                 consider_waiting = 1;
2408                                 num_refs = delayed_refs->num_entries;
2409                         } else {
2410                                 wait_for_more_refs(delayed_refs, num_refs);
2411                                 /*
2412                                  * after waiting, things have changed. we
2413                                  * dropped the lock and someone else might have
2414                                  * run some refs, built new clusters and so on.
2415                                  * therefore, we restart staleness detection.
2416                                  */
2417                                 consider_waiting = 0;
2418                         }
2419                 }
2420
2421                 ret = run_clustered_refs(trans, root, &cluster);
2422                 BUG_ON(ret < 0);
2423
2424                 count -= min_t(unsigned long, ret, count);
2425
2426                 if (count == 0)
2427                         break;
2428
2429                 if (ret || delayed_refs->run_delayed_start == 0) {
2430                         /* refs were run, let's reset staleness detection */
2431                         consider_waiting = 0;
2432                 }
2433         }
2434
2435         if (run_all) {
2436                 node = rb_first(&delayed_refs->root);
2437                 if (!node)
2438                         goto out;
2439                 count = (unsigned long)-1;
2440
2441                 while (node) {
2442                         ref = rb_entry(node, struct btrfs_delayed_ref_node,
2443                                        rb_node);
2444                         if (btrfs_delayed_ref_is_head(ref)) {
2445                                 struct btrfs_delayed_ref_head *head;
2446
2447                                 head = btrfs_delayed_node_to_head(ref);
2448                                 atomic_inc(&ref->refs);
2449
2450                                 spin_unlock(&delayed_refs->lock);
2451                                 /*
2452                                  * Mutex was contended, block until it's
2453                                  * released and try again
2454                                  */
2455                                 mutex_lock(&head->mutex);
2456                                 mutex_unlock(&head->mutex);
2457
2458                                 btrfs_put_delayed_ref(ref);
2459                                 cond_resched();
2460                                 goto again;
2461                         }
2462                         node = rb_next(node);
2463                 }
2464                 spin_unlock(&delayed_refs->lock);
2465                 schedule_timeout(1);
2466                 goto again;
2467         }
2468 out:
2469         spin_unlock(&delayed_refs->lock);
2470         return 0;
2471 }
2472
2473 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans,
2474                                 struct btrfs_root *root,
2475                                 u64 bytenr, u64 num_bytes, u64 flags,
2476                                 int is_data)
2477 {
2478         struct btrfs_delayed_extent_op *extent_op;
2479         int ret;
2480
2481         extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2482         if (!extent_op)
2483                 return -ENOMEM;
2484
2485         extent_op->flags_to_set = flags;
2486         extent_op->update_flags = 1;
2487         extent_op->update_key = 0;
2488         extent_op->is_data = is_data ? 1 : 0;
2489
2490         ret = btrfs_add_delayed_extent_op(root->fs_info, trans, bytenr,
2491                                           num_bytes, extent_op);
2492         if (ret)
2493                 kfree(extent_op);
2494         return ret;
2495 }
2496
2497 static noinline int check_delayed_ref(struct btrfs_trans_handle *trans,
2498                                       struct btrfs_root *root,
2499                                       struct btrfs_path *path,
2500                                       u64 objectid, u64 offset, u64 bytenr)
2501 {
2502         struct btrfs_delayed_ref_head *head;
2503         struct btrfs_delayed_ref_node *ref;
2504         struct btrfs_delayed_data_ref *data_ref;
2505         struct btrfs_delayed_ref_root *delayed_refs;
2506         struct rb_node *node;
2507         int ret = 0;
2508
2509         ret = -ENOENT;
2510         delayed_refs = &trans->transaction->delayed_refs;
2511         spin_lock(&delayed_refs->lock);
2512         head = btrfs_find_delayed_ref_head(trans, bytenr);
2513         if (!head)
2514                 goto out;
2515
2516         if (!mutex_trylock(&head->mutex)) {
2517                 atomic_inc(&head->node.refs);
2518                 spin_unlock(&delayed_refs->lock);
2519
2520                 btrfs_release_path(path);
2521
2522                 /*
2523                  * Mutex was contended, block until it's released and let
2524                  * caller try again
2525                  */
2526                 mutex_lock(&head->mutex);
2527                 mutex_unlock(&head->mutex);
2528                 btrfs_put_delayed_ref(&head->node);
2529                 return -EAGAIN;
2530         }
2531
2532         node = rb_prev(&head->node.rb_node);
2533         if (!node)
2534                 goto out_unlock;
2535
2536         ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2537
2538         if (ref->bytenr != bytenr)
2539                 goto out_unlock;
2540
2541         ret = 1;
2542         if (ref->type != BTRFS_EXTENT_DATA_REF_KEY)
2543                 goto out_unlock;
2544
2545         data_ref = btrfs_delayed_node_to_data_ref(ref);
2546
2547         node = rb_prev(node);
2548         if (node) {
2549                 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2550                 if (ref->bytenr == bytenr)
2551                         goto out_unlock;
2552         }
2553
2554         if (data_ref->root != root->root_key.objectid ||
2555             data_ref->objectid != objectid || data_ref->offset != offset)
2556                 goto out_unlock;
2557
2558         ret = 0;
2559 out_unlock:
2560         mutex_unlock(&head->mutex);
2561 out:
2562         spin_unlock(&delayed_refs->lock);
2563         return ret;
2564 }
2565
2566 static noinline int check_committed_ref(struct btrfs_trans_handle *trans,
2567                                         struct btrfs_root *root,
2568                                         struct btrfs_path *path,
2569                                         u64 objectid, u64 offset, u64 bytenr)
2570 {
2571         struct btrfs_root *extent_root = root->fs_info->extent_root;
2572         struct extent_buffer *leaf;
2573         struct btrfs_extent_data_ref *ref;
2574         struct btrfs_extent_inline_ref *iref;
2575         struct btrfs_extent_item *ei;
2576         struct btrfs_key key;
2577         u32 item_size;
2578         int ret;
2579
2580         key.objectid = bytenr;
2581         key.offset = (u64)-1;
2582         key.type = BTRFS_EXTENT_ITEM_KEY;
2583
2584         ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2585         if (ret < 0)
2586                 goto out;
2587         BUG_ON(ret == 0);
2588
2589         ret = -ENOENT;
2590         if (path->slots[0] == 0)
2591                 goto out;
2592
2593         path->slots[0]--;
2594         leaf = path->nodes[0];
2595         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2596
2597         if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2598                 goto out;
2599
2600         ret = 1;
2601         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2602 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2603         if (item_size < sizeof(*ei)) {
2604                 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
2605                 goto out;
2606         }
2607 #endif
2608         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2609
2610         if (item_size != sizeof(*ei) +
2611             btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY))
2612                 goto out;
2613
2614         if (btrfs_extent_generation(leaf, ei) <=
2615             btrfs_root_last_snapshot(&root->root_item))
2616                 goto out;
2617
2618         iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2619         if (btrfs_extent_inline_ref_type(leaf, iref) !=
2620             BTRFS_EXTENT_DATA_REF_KEY)
2621                 goto out;
2622
2623         ref = (struct btrfs_extent_data_ref *)(&iref->offset);
2624         if (btrfs_extent_refs(leaf, ei) !=
2625             btrfs_extent_data_ref_count(leaf, ref) ||
2626             btrfs_extent_data_ref_root(leaf, ref) !=
2627             root->root_key.objectid ||
2628             btrfs_extent_data_ref_objectid(leaf, ref) != objectid ||
2629             btrfs_extent_data_ref_offset(leaf, ref) != offset)
2630                 goto out;
2631
2632         ret = 0;
2633 out:
2634         return ret;
2635 }
2636
2637 int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans,
2638                           struct btrfs_root *root,
2639                           u64 objectid, u64 offset, u64 bytenr)
2640 {
2641         struct btrfs_path *path;
2642         int ret;
2643         int ret2;
2644
2645         path = btrfs_alloc_path();
2646         if (!path)
2647                 return -ENOENT;
2648
2649         do {
2650                 ret = check_committed_ref(trans, root, path, objectid,
2651                                           offset, bytenr);
2652                 if (ret && ret != -ENOENT)
2653                         goto out;
2654
2655                 ret2 = check_delayed_ref(trans, root, path, objectid,
2656                                          offset, bytenr);
2657         } while (ret2 == -EAGAIN);
2658
2659         if (ret2 && ret2 != -ENOENT) {
2660                 ret = ret2;
2661                 goto out;
2662         }
2663
2664         if (ret != -ENOENT || ret2 != -ENOENT)
2665                 ret = 0;
2666 out:
2667         btrfs_free_path(path);
2668         if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2669                 WARN_ON(ret > 0);
2670         return ret;
2671 }
2672
2673 static int __btrfs_mod_ref(struct btrfs_trans_handle *trans,
2674                            struct btrfs_root *root,
2675                            struct extent_buffer *buf,
2676                            int full_backref, int inc, int for_cow)
2677 {
2678         u64 bytenr;
2679         u64 num_bytes;
2680         u64 parent;
2681         u64 ref_root;
2682         u32 nritems;
2683         struct btrfs_key key;
2684         struct btrfs_file_extent_item *fi;
2685         int i;
2686         int level;
2687         int ret = 0;
2688         int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *,
2689                             u64, u64, u64, u64, u64, u64, int);
2690
2691         ref_root = btrfs_header_owner(buf);
2692         nritems = btrfs_header_nritems(buf);
2693         level = btrfs_header_level(buf);
2694
2695         if (!root->ref_cows && level == 0)
2696                 return 0;
2697
2698         if (inc)
2699                 process_func = btrfs_inc_extent_ref;
2700         else
2701                 process_func = btrfs_free_extent;
2702
2703         if (full_backref)
2704                 parent = buf->start;
2705         else
2706                 parent = 0;
2707
2708         for (i = 0; i < nritems; i++) {
2709                 if (level == 0) {
2710                         btrfs_item_key_to_cpu(buf, &key, i);
2711                         if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2712                                 continue;
2713                         fi = btrfs_item_ptr(buf, i,
2714                                             struct btrfs_file_extent_item);
2715                         if (btrfs_file_extent_type(buf, fi) ==
2716                             BTRFS_FILE_EXTENT_INLINE)
2717                                 continue;
2718                         bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2719                         if (bytenr == 0)
2720                                 continue;
2721
2722                         num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi);
2723                         key.offset -= btrfs_file_extent_offset(buf, fi);
2724                         ret = process_func(trans, root, bytenr, num_bytes,
2725                                            parent, ref_root, key.objectid,
2726                                            key.offset, for_cow);
2727                         if (ret)
2728                                 goto fail;
2729                 } else {
2730                         bytenr = btrfs_node_blockptr(buf, i);
2731                         num_bytes = btrfs_level_size(root, level - 1);
2732                         ret = process_func(trans, root, bytenr, num_bytes,
2733                                            parent, ref_root, level - 1, 0,
2734                                            for_cow);
2735                         if (ret)
2736                                 goto fail;
2737                 }
2738         }
2739         return 0;
2740 fail:
2741         BUG();
2742         return ret;
2743 }
2744
2745 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2746                   struct extent_buffer *buf, int full_backref, int for_cow)
2747 {
2748         return __btrfs_mod_ref(trans, root, buf, full_backref, 1, for_cow);
2749 }
2750
2751 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2752                   struct extent_buffer *buf, int full_backref, int for_cow)
2753 {
2754         return __btrfs_mod_ref(trans, root, buf, full_backref, 0, for_cow);
2755 }
2756
2757 static int write_one_cache_group(struct btrfs_trans_handle *trans,
2758                                  struct btrfs_root *root,
2759                                  struct btrfs_path *path,
2760                                  struct btrfs_block_group_cache *cache)
2761 {
2762         int ret;
2763         struct btrfs_root *extent_root = root->fs_info->extent_root;
2764         unsigned long bi;
2765         struct extent_buffer *leaf;
2766
2767         ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1);
2768         if (ret < 0)
2769                 goto fail;
2770         BUG_ON(ret);
2771
2772         leaf = path->nodes[0];
2773         bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
2774         write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item));
2775         btrfs_mark_buffer_dirty(leaf);
2776         btrfs_release_path(path);
2777 fail:
2778         if (ret)
2779                 return ret;
2780         return 0;
2781
2782 }
2783
2784 static struct btrfs_block_group_cache *
2785 next_block_group(struct btrfs_root *root,
2786                  struct btrfs_block_group_cache *cache)
2787 {
2788         struct rb_node *node;
2789         spin_lock(&root->fs_info->block_group_cache_lock);
2790         node = rb_next(&cache->cache_node);
2791         btrfs_put_block_group(cache);
2792         if (node) {
2793                 cache = rb_entry(node, struct btrfs_block_group_cache,
2794                                  cache_node);
2795                 btrfs_get_block_group(cache);
2796         } else
2797                 cache = NULL;
2798         spin_unlock(&root->fs_info->block_group_cache_lock);
2799         return cache;
2800 }
2801
2802 static int cache_save_setup(struct btrfs_block_group_cache *block_group,
2803                             struct btrfs_trans_handle *trans,
2804                             struct btrfs_path *path)
2805 {
2806         struct btrfs_root *root = block_group->fs_info->tree_root;
2807         struct inode *inode = NULL;
2808         u64 alloc_hint = 0;
2809         int dcs = BTRFS_DC_ERROR;
2810         int num_pages = 0;
2811         int retries = 0;
2812         int ret = 0;
2813
2814         /*
2815          * If this block group is smaller than 100 megs don't bother caching the
2816          * block group.
2817          */
2818         if (block_group->key.offset < (100 * 1024 * 1024)) {
2819                 spin_lock(&block_group->lock);
2820                 block_group->disk_cache_state = BTRFS_DC_WRITTEN;
2821                 spin_unlock(&block_group->lock);
2822                 return 0;
2823         }
2824
2825 again:
2826         inode = lookup_free_space_inode(root, block_group, path);
2827         if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
2828                 ret = PTR_ERR(inode);
2829                 btrfs_release_path(path);
2830                 goto out;
2831         }
2832
2833         if (IS_ERR(inode)) {
2834                 BUG_ON(retries);
2835                 retries++;
2836
2837                 if (block_group->ro)
2838                         goto out_free;
2839
2840                 ret = create_free_space_inode(root, trans, block_group, path);
2841                 if (ret)
2842                         goto out_free;
2843                 goto again;
2844         }
2845
2846         /* We've already setup this transaction, go ahead and exit */
2847         if (block_group->cache_generation == trans->transid &&
2848             i_size_read(inode)) {
2849                 dcs = BTRFS_DC_SETUP;
2850                 goto out_put;
2851         }
2852
2853         /*
2854          * We want to set the generation to 0, that way if anything goes wrong
2855          * from here on out we know not to trust this cache when we load up next
2856          * time.
2857          */
2858         BTRFS_I(inode)->generation = 0;
2859         ret = btrfs_update_inode(trans, root, inode);
2860         WARN_ON(ret);
2861
2862         if (i_size_read(inode) > 0) {
2863                 ret = btrfs_truncate_free_space_cache(root, trans, path,
2864                                                       inode);
2865                 if (ret)
2866                         goto out_put;
2867         }
2868
2869         spin_lock(&block_group->lock);
2870         if (block_group->cached != BTRFS_CACHE_FINISHED) {
2871                 /* We're not cached, don't bother trying to write stuff out */
2872                 dcs = BTRFS_DC_WRITTEN;
2873                 spin_unlock(&block_group->lock);
2874                 goto out_put;
2875         }
2876         spin_unlock(&block_group->lock);
2877
2878         num_pages = (int)div64_u64(block_group->key.offset, 1024 * 1024 * 1024);
2879         if (!num_pages)
2880                 num_pages = 1;
2881
2882         /*
2883          * Just to make absolutely sure we have enough space, we're going to
2884          * preallocate 12 pages worth of space for each block group.  In
2885          * practice we ought to use at most 8, but we need extra space so we can
2886          * add our header and have a terminator between the extents and the
2887          * bitmaps.
2888          */
2889         num_pages *= 16;
2890         num_pages *= PAGE_CACHE_SIZE;
2891
2892         ret = btrfs_check_data_free_space(inode, num_pages);
2893         if (ret)
2894                 goto out_put;
2895
2896         ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages,
2897                                               num_pages, num_pages,
2898                                               &alloc_hint);
2899         if (!ret)
2900                 dcs = BTRFS_DC_SETUP;
2901         btrfs_free_reserved_data_space(inode, num_pages);
2902
2903 out_put:
2904         iput(inode);
2905 out_free:
2906         btrfs_release_path(path);
2907 out:
2908         spin_lock(&block_group->lock);
2909         if (!ret && dcs == BTRFS_DC_SETUP)
2910                 block_group->cache_generation = trans->transid;
2911         block_group->disk_cache_state = dcs;
2912         spin_unlock(&block_group->lock);
2913
2914         return ret;
2915 }
2916
2917 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans,
2918                                    struct btrfs_root *root)
2919 {
2920         struct btrfs_block_group_cache *cache;
2921         int err = 0;
2922         struct btrfs_path *path;
2923         u64 last = 0;
2924
2925         path = btrfs_alloc_path();
2926         if (!path)
2927                 return -ENOMEM;
2928
2929 again:
2930         while (1) {
2931                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2932                 while (cache) {
2933                         if (cache->disk_cache_state == BTRFS_DC_CLEAR)
2934                                 break;
2935                         cache = next_block_group(root, cache);
2936                 }
2937                 if (!cache) {
2938                         if (last == 0)
2939                                 break;
2940                         last = 0;
2941                         continue;
2942                 }
2943                 err = cache_save_setup(cache, trans, path);
2944                 last = cache->key.objectid + cache->key.offset;
2945                 btrfs_put_block_group(cache);
2946         }
2947
2948         while (1) {
2949                 if (last == 0) {
2950                         err = btrfs_run_delayed_refs(trans, root,
2951                                                      (unsigned long)-1);
2952                         BUG_ON(err);
2953                 }
2954
2955                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2956                 while (cache) {
2957                         if (cache->disk_cache_state == BTRFS_DC_CLEAR) {
2958                                 btrfs_put_block_group(cache);
2959                                 goto again;
2960                         }
2961
2962                         if (cache->dirty)
2963                                 break;
2964                         cache = next_block_group(root, cache);
2965                 }
2966                 if (!cache) {
2967                         if (last == 0)
2968                                 break;
2969                         last = 0;
2970                         continue;
2971                 }
2972
2973                 if (cache->disk_cache_state == BTRFS_DC_SETUP)
2974                         cache->disk_cache_state = BTRFS_DC_NEED_WRITE;
2975                 cache->dirty = 0;
2976                 last = cache->key.objectid + cache->key.offset;
2977
2978                 err = write_one_cache_group(trans, root, path, cache);
2979                 BUG_ON(err);
2980                 btrfs_put_block_group(cache);
2981         }
2982
2983         while (1) {
2984                 /*
2985                  * I don't think this is needed since we're just marking our
2986                  * preallocated extent as written, but just in case it can't
2987                  * hurt.
2988                  */
2989                 if (last == 0) {
2990                         err = btrfs_run_delayed_refs(trans, root,
2991                                                      (unsigned long)-1);
2992                         BUG_ON(err);
2993                 }
2994
2995                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2996                 while (cache) {
2997                         /*
2998                          * Really this shouldn't happen, but it could if we
2999                          * couldn't write the entire preallocated extent and
3000                          * splitting the extent resulted in a new block.
3001                          */
3002                         if (cache->dirty) {
3003                                 btrfs_put_block_group(cache);
3004                                 goto again;
3005                         }
3006                         if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
3007                                 break;
3008                         cache = next_block_group(root, cache);
3009                 }
3010                 if (!cache) {
3011                         if (last == 0)
3012                                 break;
3013                         last = 0;
3014                         continue;
3015                 }
3016
3017                 btrfs_write_out_cache(root, trans, cache, path);
3018
3019                 /*
3020                  * If we didn't have an error then the cache state is still
3021                  * NEED_WRITE, so we can set it to WRITTEN.
3022                  */
3023                 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
3024                         cache->disk_cache_state = BTRFS_DC_WRITTEN;
3025                 last = cache->key.objectid + cache->key.offset;
3026                 btrfs_put_block_group(cache);
3027         }
3028
3029         btrfs_free_path(path);
3030         return 0;
3031 }
3032
3033 int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr)
3034 {
3035         struct btrfs_block_group_cache *block_group;
3036         int readonly = 0;
3037
3038         block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
3039         if (!block_group || block_group->ro)
3040                 readonly = 1;
3041         if (block_group)
3042                 btrfs_put_block_group(block_group);
3043         return readonly;
3044 }
3045
3046 static int update_space_info(struct btrfs_fs_info *info, u64 flags,
3047                              u64 total_bytes, u64 bytes_used,
3048                              struct btrfs_space_info **space_info)
3049 {
3050         struct btrfs_space_info *found;
3051         int i;
3052         int factor;
3053
3054         if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
3055                      BTRFS_BLOCK_GROUP_RAID10))
3056                 factor = 2;
3057         else
3058                 factor = 1;
3059
3060         found = __find_space_info(info, flags);
3061         if (found) {
3062                 spin_lock(&found->lock);
3063                 found->total_bytes += total_bytes;
3064                 found->disk_total += total_bytes * factor;
3065                 found->bytes_used += bytes_used;
3066                 found->disk_used += bytes_used * factor;
3067                 found->full = 0;
3068                 spin_unlock(&found->lock);
3069                 *space_info = found;
3070                 return 0;
3071         }
3072         found = kzalloc(sizeof(*found), GFP_NOFS);
3073         if (!found)
3074                 return -ENOMEM;
3075
3076         for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
3077                 INIT_LIST_HEAD(&found->block_groups[i]);
3078         init_rwsem(&found->groups_sem);
3079         spin_lock_init(&found->lock);
3080         found->flags = flags & BTRFS_BLOCK_GROUP_TYPE_MASK;
3081         found->total_bytes = total_bytes;
3082         found->disk_total = total_bytes * factor;
3083         found->bytes_used = bytes_used;
3084         found->disk_used = bytes_used * factor;
3085         found->bytes_pinned = 0;
3086         found->bytes_reserved = 0;
3087         found->bytes_readonly = 0;
3088         found->bytes_may_use = 0;
3089         found->full = 0;
3090         found->force_alloc = CHUNK_ALLOC_NO_FORCE;
3091         found->chunk_alloc = 0;
3092         found->flush = 0;
3093         init_waitqueue_head(&found->wait);
3094         *space_info = found;
3095         list_add_rcu(&found->list, &info->space_info);
3096         return 0;
3097 }
3098
3099 static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
3100 {
3101         u64 extra_flags = chunk_to_extended(flags) &
3102                                 BTRFS_EXTENDED_PROFILE_MASK;
3103
3104         if (flags & BTRFS_BLOCK_GROUP_DATA)
3105                 fs_info->avail_data_alloc_bits |= extra_flags;
3106         if (flags & BTRFS_BLOCK_GROUP_METADATA)
3107                 fs_info->avail_metadata_alloc_bits |= extra_flags;
3108         if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3109                 fs_info->avail_system_alloc_bits |= extra_flags;
3110 }
3111
3112 /*
3113  * @flags: available profiles in extended format (see ctree.h)
3114  *
3115  * Returns reduced profile in chunk format.  If profile changing is in
3116  * progress (either running or paused) picks the target profile (if it's
3117  * already available), otherwise falls back to plain reducing.
3118  */
3119 u64 btrfs_reduce_alloc_profile(struct btrfs_root *root, u64 flags)
3120 {
3121         /*
3122          * we add in the count of missing devices because we want
3123          * to make sure that any RAID levels on a degraded FS
3124          * continue to be honored.
3125          */
3126         u64 num_devices = root->fs_info->fs_devices->rw_devices +
3127                 root->fs_info->fs_devices->missing_devices;
3128
3129         /* pick restriper's target profile if it's available */
3130         spin_lock(&root->fs_info->balance_lock);
3131         if (root->fs_info->balance_ctl) {
3132                 struct btrfs_balance_control *bctl = root->fs_info->balance_ctl;
3133                 u64 tgt = 0;
3134
3135                 if ((flags & BTRFS_BLOCK_GROUP_DATA) &&
3136                     (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3137                     (flags & bctl->data.target)) {
3138                         tgt = BTRFS_BLOCK_GROUP_DATA | bctl->data.target;
3139                 } else if ((flags & BTRFS_BLOCK_GROUP_SYSTEM) &&
3140                            (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3141                            (flags & bctl->sys.target)) {
3142                         tgt = BTRFS_BLOCK_GROUP_SYSTEM | bctl->sys.target;
3143                 } else if ((flags & BTRFS_BLOCK_GROUP_METADATA) &&
3144                            (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3145                            (flags & bctl->meta.target)) {
3146                         tgt = BTRFS_BLOCK_GROUP_METADATA | bctl->meta.target;
3147                 }
3148
3149                 if (tgt) {
3150                         spin_unlock(&root->fs_info->balance_lock);
3151                         flags = tgt;
3152                         goto out;
3153                 }
3154         }
3155         spin_unlock(&root->fs_info->balance_lock);
3156
3157         if (num_devices == 1)
3158                 flags &= ~(BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID0);
3159         if (num_devices < 4)
3160                 flags &= ~BTRFS_BLOCK_GROUP_RAID10;
3161
3162         if ((flags & BTRFS_BLOCK_GROUP_DUP) &&
3163             (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3164                       BTRFS_BLOCK_GROUP_RAID10))) {
3165                 flags &= ~BTRFS_BLOCK_GROUP_DUP;
3166         }
3167
3168         if ((flags & BTRFS_BLOCK_GROUP_RAID1) &&
3169             (flags & BTRFS_BLOCK_GROUP_RAID10)) {
3170                 flags &= ~BTRFS_BLOCK_GROUP_RAID1;
3171         }
3172
3173         if ((flags & BTRFS_BLOCK_GROUP_RAID0) &&
3174             ((flags & BTRFS_BLOCK_GROUP_RAID1) |
3175              (flags & BTRFS_BLOCK_GROUP_RAID10) |
3176              (flags & BTRFS_BLOCK_GROUP_DUP))) {
3177                 flags &= ~BTRFS_BLOCK_GROUP_RAID0;
3178         }
3179
3180 out:
3181         return extended_to_chunk(flags);
3182 }
3183
3184 static u64 get_alloc_profile(struct btrfs_root *root, u64 flags)
3185 {
3186         if (flags & BTRFS_BLOCK_GROUP_DATA)
3187                 flags |= root->fs_info->avail_data_alloc_bits;
3188         else if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
3189                 flags |= root->fs_info->avail_system_alloc_bits;
3190         else if (flags & BTRFS_BLOCK_GROUP_METADATA)
3191                 flags |= root->fs_info->avail_metadata_alloc_bits;
3192
3193         return btrfs_reduce_alloc_profile(root, flags);
3194 }
3195
3196 u64 btrfs_get_alloc_profile(struct btrfs_root *root, int data)
3197 {
3198         u64 flags;
3199
3200         if (data)
3201                 flags = BTRFS_BLOCK_GROUP_DATA;
3202         else if (root == root->fs_info->chunk_root)
3203                 flags = BTRFS_BLOCK_GROUP_SYSTEM;
3204         else
3205                 flags = BTRFS_BLOCK_GROUP_METADATA;
3206
3207         return get_alloc_profile(root, flags);
3208 }
3209
3210 void btrfs_set_inode_space_info(struct btrfs_root *root, struct inode *inode)
3211 {
3212         BTRFS_I(inode)->space_info = __find_space_info(root->fs_info,
3213                                                        BTRFS_BLOCK_GROUP_DATA);
3214 }
3215
3216 /*
3217  * This will check the space that the inode allocates from to make sure we have
3218  * enough space for bytes.
3219  */
3220 int btrfs_check_data_free_space(struct inode *inode, u64 bytes)
3221 {
3222         struct btrfs_space_info *data_sinfo;
3223         struct btrfs_root *root = BTRFS_I(inode)->root;
3224         u64 used;
3225         int ret = 0, committed = 0, alloc_chunk = 1;
3226
3227         /* make sure bytes are sectorsize aligned */
3228         bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3229
3230         if (root == root->fs_info->tree_root ||
3231             BTRFS_I(inode)->location.objectid == BTRFS_FREE_INO_OBJECTID) {
3232                 alloc_chunk = 0;
3233                 committed = 1;
3234         }
3235
3236         data_sinfo = BTRFS_I(inode)->space_info;
3237         if (!data_sinfo)
3238                 goto alloc;
3239
3240 again:
3241         /* make sure we have enough space to handle the data first */
3242         spin_lock(&data_sinfo->lock);
3243         used = data_sinfo->bytes_used + data_sinfo->bytes_reserved +
3244                 data_sinfo->bytes_pinned + data_sinfo->bytes_readonly +
3245                 data_sinfo->bytes_may_use;
3246
3247         if (used + bytes > data_sinfo->total_bytes) {
3248                 struct btrfs_trans_handle *trans;
3249
3250                 /*
3251                  * if we don't have enough free bytes in this space then we need
3252                  * to alloc a new chunk.
3253                  */
3254                 if (!data_sinfo->full && alloc_chunk) {
3255                         u64 alloc_target;
3256
3257                         data_sinfo->force_alloc = CHUNK_ALLOC_FORCE;
3258                         spin_unlock(&data_sinfo->lock);
3259 alloc:
3260                         alloc_target = btrfs_get_alloc_profile(root, 1);
3261                         trans = btrfs_join_transaction(root);
3262                         if (IS_ERR(trans))
3263                                 return PTR_ERR(trans);
3264
3265                         ret = do_chunk_alloc(trans, root->fs_info->extent_root,
3266                                              bytes + 2 * 1024 * 1024,
3267                                              alloc_target,
3268                                              CHUNK_ALLOC_NO_FORCE);
3269                         btrfs_end_transaction(trans, root);
3270                         if (ret < 0) {
3271                                 if (ret != -ENOSPC)
3272                                         return ret;
3273                                 else
3274                                         goto commit_trans;
3275                         }
3276
3277                         if (!data_sinfo) {
3278                                 btrfs_set_inode_space_info(root, inode);
3279                                 data_sinfo = BTRFS_I(inode)->space_info;
3280                         }
3281                         goto again;
3282                 }
3283
3284                 /*
3285                  * If we have less pinned bytes than we want to allocate then
3286                  * don't bother committing the transaction, it won't help us.
3287                  */
3288                 if (data_sinfo->bytes_pinned < bytes)
3289                         committed = 1;
3290                 spin_unlock(&data_sinfo->lock);
3291
3292                 /* commit the current transaction and try again */
3293 commit_trans:
3294                 if (!committed &&
3295                     !atomic_read(&root->fs_info->open_ioctl_trans)) {
3296                         committed = 1;
3297                         trans = btrfs_join_transaction(root);
3298                         if (IS_ERR(trans))
3299                                 return PTR_ERR(trans);
3300                         ret = btrfs_commit_transaction(trans, root);
3301                         if (ret)
3302                                 return ret;
3303                         goto again;
3304                 }
3305
3306                 return -ENOSPC;
3307         }
3308         data_sinfo->bytes_may_use += bytes;
3309         trace_btrfs_space_reservation(root->fs_info, "space_info",
3310                                       (u64)(unsigned long)data_sinfo,
3311                                       bytes, 1);
3312         spin_unlock(&data_sinfo->lock);
3313
3314         return 0;
3315 }
3316
3317 /*
3318  * Called if we need to clear a data reservation for this inode.
3319  */
3320 void btrfs_free_reserved_data_space(struct inode *inode, u64 bytes)
3321 {
3322         struct btrfs_root *root = BTRFS_I(inode)->root;
3323         struct btrfs_space_info *data_sinfo;
3324
3325         /* make sure bytes are sectorsize aligned */
3326         bytes = (bytes + root->sectorsize - 1) & ~((u64)root->sectorsize - 1);
3327
3328         data_sinfo = BTRFS_I(inode)->space_info;
3329         spin_lock(&data_sinfo->lock);
3330         data_sinfo->bytes_may_use -= bytes;
3331         trace_btrfs_space_reservation(root->fs_info, "space_info",
3332                                       (u64)(unsigned long)data_sinfo,
3333                                       bytes, 0);
3334         spin_unlock(&data_sinfo->lock);
3335 }
3336
3337 static void force_metadata_allocation(struct btrfs_fs_info *info)
3338 {
3339         struct list_head *head = &info->space_info;
3340         struct btrfs_space_info *found;
3341
3342         rcu_read_lock();
3343         list_for_each_entry_rcu(found, head, list) {
3344                 if (found->flags & BTRFS_BLOCK_GROUP_METADATA)
3345                         found->force_alloc = CHUNK_ALLOC_FORCE;
3346         }
3347         rcu_read_unlock();
3348 }
3349
3350 static int should_alloc_chunk(struct btrfs_root *root,
3351                               struct btrfs_space_info *sinfo, u64 alloc_bytes,
3352                               int force)
3353 {
3354         struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
3355         u64 num_bytes = sinfo->total_bytes - sinfo->bytes_readonly;
3356         u64 num_allocated = sinfo->bytes_used + sinfo->bytes_reserved;
3357         u64 thresh;
3358
3359         if (force == CHUNK_ALLOC_FORCE)
3360                 return 1;
3361
3362         /*
3363          * We need to take into account the global rsv because for all intents
3364          * and purposes it's used space.  Don't worry about locking the
3365          * global_rsv, it doesn't change except when the transaction commits.
3366          */
3367         num_allocated += global_rsv->size;
3368
3369         /*
3370          * in limited mode, we want to have some free space up to
3371          * about 1% of the FS size.
3372          */
3373         if (force == CHUNK_ALLOC_LIMITED) {
3374                 thresh = btrfs_super_total_bytes(root->fs_info->super_copy);
3375                 thresh = max_t(u64, 64 * 1024 * 1024,
3376                                div_factor_fine(thresh, 1));
3377
3378                 if (num_bytes - num_allocated < thresh)
3379                         return 1;
3380         }
3381         thresh = btrfs_super_total_bytes(root->fs_info->super_copy);
3382
3383         /* 256MB or 2% of the FS */
3384         thresh = max_t(u64, 256 * 1024 * 1024, div_factor_fine(thresh, 2));
3385         /* system chunks need a much small threshold */
3386         if (sinfo->flags & BTRFS_BLOCK_GROUP_SYSTEM)
3387                 thresh = 32 * 1024 * 1024;
3388
3389         if (num_bytes > thresh && sinfo->bytes_used < div_factor(num_bytes, 8))
3390                 return 0;
3391         return 1;
3392 }
3393
3394 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
3395                           struct btrfs_root *extent_root, u64 alloc_bytes,
3396                           u64 flags, int force)
3397 {
3398         struct btrfs_space_info *space_info;
3399         struct btrfs_fs_info *fs_info = extent_root->fs_info;
3400         int wait_for_alloc = 0;
3401         int ret = 0;
3402
3403         BUG_ON(!profile_is_valid(flags, 0));
3404
3405         space_info = __find_space_info(extent_root->fs_info, flags);
3406         if (!space_info) {
3407                 ret = update_space_info(extent_root->fs_info, flags,
3408                                         0, 0, &space_info);
3409                 BUG_ON(ret);
3410         }
3411         BUG_ON(!space_info);
3412
3413 again:
3414         spin_lock(&space_info->lock);
3415         if (force < space_info->force_alloc)
3416                 force = space_info->force_alloc;
3417         if (space_info->full) {
3418                 spin_unlock(&space_info->lock);
3419                 return 0;
3420         }
3421
3422         if (!should_alloc_chunk(extent_root, space_info, alloc_bytes, force)) {
3423                 spin_unlock(&space_info->lock);
3424                 return 0;
3425         } else if (space_info->chunk_alloc) {
3426                 wait_for_alloc = 1;
3427         } else {
3428                 space_info->chunk_alloc = 1;
3429         }
3430
3431         spin_unlock(&space_info->lock);
3432
3433         mutex_lock(&fs_info->chunk_mutex);
3434
3435         /*
3436          * The chunk_mutex is held throughout the entirety of a chunk
3437          * allocation, so once we've acquired the chunk_mutex we know that the
3438          * other guy is done and we need to recheck and see if we should
3439          * allocate.
3440          */
3441         if (wait_for_alloc) {
3442                 mutex_unlock(&fs_info->chunk_mutex);
3443                 wait_for_alloc = 0;
3444                 goto again;
3445         }
3446
3447         /*
3448          * If we have mixed data/metadata chunks we want to make sure we keep
3449          * allocating mixed chunks instead of individual chunks.
3450          */
3451         if (btrfs_mixed_space_info(space_info))
3452                 flags |= (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA);
3453
3454         /*
3455          * if we're doing a data chunk, go ahead and make sure that
3456          * we keep a reasonable number of metadata chunks allocated in the
3457          * FS as well.
3458          */
3459         if (flags & BTRFS_BLOCK_GROUP_DATA && fs_info->metadata_ratio) {
3460                 fs_info->data_chunk_allocations++;
3461                 if (!(fs_info->data_chunk_allocations %
3462                       fs_info->metadata_ratio))
3463                         force_metadata_allocation(fs_info);
3464         }
3465
3466         ret = btrfs_alloc_chunk(trans, extent_root, flags);
3467         if (ret < 0 && ret != -ENOSPC)
3468                 goto out;
3469
3470         spin_lock(&space_info->lock);
3471         if (ret)
3472                 space_info->full = 1;
3473         else
3474                 ret = 1;
3475
3476         space_info->force_alloc = CHUNK_ALLOC_NO_FORCE;
3477         space_info->chunk_alloc = 0;
3478         spin_unlock(&space_info->lock);
3479 out:
3480         mutex_unlock(&extent_root->fs_info->chunk_mutex);
3481         return ret;
3482 }
3483
3484 /*
3485  * shrink metadata reservation for delalloc
3486  */
3487 static int shrink_delalloc(struct btrfs_root *root, u64 to_reclaim,
3488                            bool wait_ordered)
3489 {
3490         struct btrfs_block_rsv *block_rsv;
3491         struct btrfs_space_info *space_info;
3492         struct btrfs_trans_handle *trans;
3493         u64 reserved;
3494         u64 max_reclaim;
3495         u64 reclaimed = 0;
3496         long time_left;
3497         unsigned long nr_pages = (2 * 1024 * 1024) >> PAGE_CACHE_SHIFT;
3498         int loops = 0;
3499         unsigned long progress;
3500
3501         trans = (struct btrfs_trans_handle *)current->journal_info;
3502         block_rsv = &root->fs_info->delalloc_block_rsv;
3503         space_info = block_rsv->space_info;
3504
3505         smp_mb();
3506         reserved = space_info->bytes_may_use;
3507         progress = space_info->reservation_progress;
3508
3509         if (reserved == 0)
3510                 return 0;
3511
3512         smp_mb();
3513         if (root->fs_info->delalloc_bytes == 0) {
3514                 if (trans)
3515                         return 0;
3516                 btrfs_wait_ordered_extents(root, 0, 0);
3517                 return 0;
3518         }
3519
3520         max_reclaim = min(reserved, to_reclaim);
3521         nr_pages = max_t(unsigned long, nr_pages,
3522                          max_reclaim >> PAGE_CACHE_SHIFT);
3523         while (loops < 1024) {
3524                 /* have the flusher threads jump in and do some IO */
3525                 smp_mb();
3526                 nr_pages = min_t(unsigned long, nr_pages,
3527                        root->fs_info->delalloc_bytes >> PAGE_CACHE_SHIFT);
3528                 writeback_inodes_sb_nr_if_idle(root->fs_info->sb, nr_pages,
3529                                                 WB_REASON_FS_FREE_SPACE);
3530
3531                 spin_lock(&space_info->lock);
3532                 if (reserved > space_info->bytes_may_use)
3533                         reclaimed += reserved - space_info->bytes_may_use;
3534                 reserved = space_info->bytes_may_use;
3535                 spin_unlock(&space_info->lock);
3536
3537                 loops++;
3538
3539                 if (reserved == 0 || reclaimed >= max_reclaim)
3540                         break;
3541
3542                 if (trans && trans->transaction->blocked)
3543                         return -EAGAIN;
3544
3545                 if (wait_ordered && !trans) {
3546                         btrfs_wait_ordered_extents(root, 0, 0);
3547                 } else {
3548                         time_left = schedule_timeout_interruptible(1);
3549
3550                         /* We were interrupted, exit */
3551                         if (time_left)
3552                                 break;
3553                 }
3554
3555                 /* we've kicked the IO a few times, if anything has been freed,
3556                  * exit.  There is no sense in looping here for a long time
3557                  * when we really need to commit the transaction, or there are
3558                  * just too many writers without enough free space
3559                  */
3560
3561                 if (loops > 3) {
3562                         smp_mb();
3563                         if (progress != space_info->reservation_progress)
3564                                 break;
3565                 }
3566
3567         }
3568
3569         return reclaimed >= to_reclaim;
3570 }
3571
3572 /**
3573  * maybe_commit_transaction - possibly commit the transaction if its ok to
3574  * @root - the root we're allocating for
3575  * @bytes - the number of bytes we want to reserve
3576  * @force - force the commit
3577  *
3578  * This will check to make sure that committing the transaction will actually
3579  * get us somewhere and then commit the transaction if it does.  Otherwise it
3580  * will return -ENOSPC.
3581  */
3582 static int may_commit_transaction(struct btrfs_root *root,
3583                                   struct btrfs_space_info *space_info,
3584                                   u64 bytes, int force)
3585 {
3586         struct btrfs_block_rsv *delayed_rsv = &root->fs_info->delayed_block_rsv;
3587         struct btrfs_trans_handle *trans;
3588
3589         trans = (struct btrfs_trans_handle *)current->journal_info;
3590         if (trans)
3591                 return -EAGAIN;
3592
3593         if (force)
3594                 goto commit;
3595
3596         /* See if there is enough pinned space to make this reservation */
3597         spin_lock(&space_info->lock);
3598         if (space_info->bytes_pinned >= bytes) {
3599                 spin_unlock(&space_info->lock);
3600                 goto commit;
3601         }
3602         spin_unlock(&space_info->lock);
3603
3604         /*
3605          * See if there is some space in the delayed insertion reservation for
3606          * this reservation.
3607          */
3608         if (space_info != delayed_rsv->space_info)
3609                 return -ENOSPC;
3610
3611         spin_lock(&space_info->lock);
3612         spin_lock(&delayed_rsv->lock);
3613         if (space_info->bytes_pinned + delayed_rsv->size < bytes) {
3614                 spin_unlock(&delayed_rsv->lock);
3615                 spin_unlock(&space_info->lock);
3616                 return -ENOSPC;
3617         }
3618         spin_unlock(&delayed_rsv->lock);
3619         spin_unlock(&space_info->lock);
3620
3621 commit:
3622         trans = btrfs_join_transaction(root);
3623         if (IS_ERR(trans))
3624                 return -ENOSPC;
3625
3626         return btrfs_commit_transaction(trans, root);
3627 }
3628
3629 /**
3630  * reserve_metadata_bytes - try to reserve bytes from the block_rsv's space
3631  * @root - the root we're allocating for
3632  * @block_rsv - the block_rsv we're allocating for
3633  * @orig_bytes - the number of bytes we want
3634  * @flush - wether or not we can flush to make our reservation
3635  *
3636  * This will reserve orgi_bytes number of bytes from the space info associated
3637  * with the block_rsv.  If there is not enough space it will make an attempt to
3638  * flush out space to make room.  It will do this by flushing delalloc if
3639  * possible or committing the transaction.  If flush is 0 then no attempts to
3640  * regain reservations will be made and this will fail if there is not enough
3641  * space already.
3642  */
3643 static int reserve_metadata_bytes(struct btrfs_root *root,
3644                                   struct btrfs_block_rsv *block_rsv,
3645                                   u64 orig_bytes, int flush)
3646 {
3647         struct btrfs_space_info *space_info = block_rsv->space_info;
3648         u64 used;
3649         u64 num_bytes = orig_bytes;
3650         int retries = 0;
3651         int ret = 0;
3652         bool committed = false;
3653         bool flushing = false;
3654         bool wait_ordered = false;
3655
3656 again:
3657         ret = 0;
3658         spin_lock(&space_info->lock);
3659         /*
3660          * We only want to wait if somebody other than us is flushing and we are
3661          * actually alloed to flush.
3662          */
3663         while (flush && !flushing && space_info->flush) {
3664                 spin_unlock(&space_info->lock);
3665                 /*
3666                  * If we have a trans handle we can't wait because the flusher
3667                  * may have to commit the transaction, which would mean we would
3668                  * deadlock since we are waiting for the flusher to finish, but
3669                  * hold the current transaction open.
3670                  */
3671                 if (current->journal_info)
3672                         return -EAGAIN;
3673                 ret = wait_event_interruptible(space_info->wait,
3674                                                !space_info->flush);
3675                 /* Must have been interrupted, return */
3676                 if (ret)
3677                         return -EINTR;
3678
3679                 spin_lock(&space_info->lock);
3680         }
3681
3682         ret = -ENOSPC;
3683         used = space_info->bytes_used + space_info->bytes_reserved +
3684                 space_info->bytes_pinned + space_info->bytes_readonly +
3685                 space_info->bytes_may_use;
3686
3687         /*
3688          * The idea here is that we've not already over-reserved the block group
3689          * then we can go ahead and save our reservation first and then start
3690          * flushing if we need to.  Otherwise if we've already overcommitted
3691          * lets start flushing stuff first and then come back and try to make
3692          * our reservation.
3693          */
3694         if (used <= space_info->total_bytes) {
3695                 if (used + orig_bytes <= space_info->total_bytes) {
3696                         space_info->bytes_may_use += orig_bytes;
3697                         trace_btrfs_space_reservation(root->fs_info,
3698                                               "space_info",
3699                                               (u64)(unsigned long)space_info,
3700                                               orig_bytes, 1);
3701                         ret = 0;
3702                 } else {
3703                         /*
3704                          * Ok set num_bytes to orig_bytes since we aren't
3705                          * overocmmitted, this way we only try and reclaim what
3706                          * we need.
3707                          */
3708                         num_bytes = orig_bytes;
3709                 }
3710         } else {
3711                 /*
3712                  * Ok we're over committed, set num_bytes to the overcommitted
3713                  * amount plus the amount of bytes that we need for this
3714                  * reservation.
3715                  */
3716                 wait_ordered = true;
3717                 num_bytes = used - space_info->total_bytes +
3718                         (orig_bytes * (retries + 1));
3719         }
3720
3721         if (ret) {
3722                 u64 profile = btrfs_get_alloc_profile(root, 0);
3723                 u64 avail;
3724
3725                 /*
3726                  * If we have a lot of space that's pinned, don't bother doing
3727                  * the overcommit dance yet and just commit the transaction.
3728                  */
3729                 avail = (space_info->total_bytes - space_info->bytes_used) * 8;
3730                 do_div(avail, 10);
3731                 if (space_info->bytes_pinned >= avail && flush && !committed) {
3732                         space_info->flush = 1;
3733                         flushing = true;
3734                         spin_unlock(&space_info->lock);
3735                         ret = may_commit_transaction(root, space_info,
3736                                                      orig_bytes, 1);
3737                         if (ret)
3738                                 goto out;
3739                         committed = true;
3740                         goto again;
3741                 }
3742
3743                 spin_lock(&root->fs_info->free_chunk_lock);
3744                 avail = root->fs_info->free_chunk_space;
3745
3746                 /*
3747                  * If we have dup, raid1 or raid10 then only half of the free
3748                  * space is actually useable.
3749                  */
3750                 if (profile & (BTRFS_BLOCK_GROUP_DUP |
3751                                BTRFS_BLOCK_GROUP_RAID1 |
3752                                BTRFS_BLOCK_GROUP_RAID10))
3753                         avail >>= 1;
3754
3755                 /*
3756                  * If we aren't flushing don't let us overcommit too much, say
3757                  * 1/8th of the space.  If we can flush, let it overcommit up to
3758                  * 1/2 of the space.
3759                  */
3760                 if (flush)
3761                         avail >>= 3;
3762                 else
3763                         avail >>= 1;
3764                  spin_unlock(&root->fs_info->free_chunk_lock);
3765
3766                 if (used + num_bytes < space_info->total_bytes + avail) {
3767                         space_info->bytes_may_use += orig_bytes;
3768                         trace_btrfs_space_reservation(root->fs_info,
3769                                               "space_info",
3770                                               (u64)(unsigned long)space_info,
3771                                               orig_bytes, 1);
3772                         ret = 0;
3773                 } else {
3774                         wait_ordered = true;
3775                 }
3776         }
3777
3778         /*
3779          * Couldn't make our reservation, save our place so while we're trying
3780          * to reclaim space we can actually use it instead of somebody else
3781          * stealing it from us.
3782          */
3783         if (ret && flush) {
3784                 flushing = true;
3785                 space_info->flush = 1;
3786         }
3787
3788         spin_unlock(&space_info->lock);
3789
3790         if (!ret || !flush)
3791                 goto out;
3792
3793         /*
3794          * We do synchronous shrinking since we don't actually unreserve
3795          * metadata until after the IO is completed.
3796          */
3797         ret = shrink_delalloc(root, num_bytes, wait_ordered);
3798         if (ret < 0)
3799                 goto out;
3800
3801         ret = 0;
3802
3803         /*
3804          * So if we were overcommitted it's possible that somebody else flushed
3805          * out enough space and we simply didn't have enough space to reclaim,
3806          * so go back around and try again.
3807          */
3808         if (retries < 2) {
3809                 wait_ordered = true;
3810                 retries++;
3811                 goto again;
3812         }
3813
3814         ret = -ENOSPC;
3815         if (committed)
3816                 goto out;
3817
3818         ret = may_commit_transaction(root, space_info, orig_bytes, 0);
3819         if (!ret) {
3820                 committed = true;
3821                 goto again;
3822         }
3823
3824 out:
3825         if (flushing) {
3826                 spin_lock(&space_info->lock);
3827                 space_info->flush = 0;
3828                 wake_up_all(&space_info->wait);
3829                 spin_unlock(&space_info->lock);
3830         }
3831         return ret;
3832 }
3833
3834 static struct btrfs_block_rsv *get_block_rsv(struct btrfs_trans_handle *trans,
3835                                              struct btrfs_root *root)
3836 {
3837         struct btrfs_block_rsv *block_rsv = NULL;
3838
3839         if (root->ref_cows || root == root->fs_info->csum_root)
3840                 block_rsv = trans->block_rsv;
3841
3842         if (!block_rsv)
3843                 block_rsv = root->block_rsv;
3844
3845         if (!block_rsv)
3846                 block_rsv = &root->fs_info->empty_block_rsv;
3847
3848         return block_rsv;
3849 }
3850
3851 static int block_rsv_use_bytes(struct btrfs_block_rsv *block_rsv,
3852                                u64 num_bytes)
3853 {
3854         int ret = -ENOSPC;
3855         spin_lock(&block_rsv->lock);
3856         if (block_rsv->reserved >= num_bytes) {
3857                 block_rsv->reserved -= num_bytes;
3858                 if (block_rsv->reserved < block_rsv->size)
3859                         block_rsv->full = 0;
3860                 ret = 0;
3861         }
3862         spin_unlock(&block_rsv->lock);
3863         return ret;
3864 }
3865
3866 static void block_rsv_add_bytes(struct btrfs_block_rsv *block_rsv,
3867                                 u64 num_bytes, int update_size)
3868 {
3869         spin_lock(&block_rsv->lock);
3870         block_rsv->reserved += num_bytes;
3871         if (update_size)
3872                 block_rsv->size += num_bytes;
3873         else if (block_rsv->reserved >= block_rsv->size)
3874                 block_rsv->full = 1;
3875         spin_unlock(&block_rsv->lock);
3876 }
3877
3878 static void block_rsv_release_bytes(struct btrfs_fs_info *fs_info,
3879                                     struct btrfs_block_rsv *block_rsv,
3880                                     struct btrfs_block_rsv *dest, u64 num_bytes)
3881 {
3882         struct btrfs_space_info *space_info = block_rsv->space_info;
3883
3884         spin_lock(&block_rsv->lock);
3885         if (num_bytes == (u64)-1)
3886                 num_bytes = block_rsv->size;
3887         block_rsv->size -= num_bytes;
3888         if (block_rsv->reserved >= block_rsv->size) {
3889                 num_bytes = block_rsv->reserved - block_rsv->size;
3890                 block_rsv->reserved = block_rsv->size;
3891                 block_rsv->full = 1;
3892         } else {
3893                 num_bytes = 0;
3894         }
3895         spin_unlock(&block_rsv->lock);
3896
3897         if (num_bytes > 0) {
3898                 if (dest) {
3899                         spin_lock(&dest->lock);
3900                         if (!dest->full) {
3901                                 u64 bytes_to_add;
3902
3903                                 bytes_to_add = dest->size - dest->reserved;
3904                                 bytes_to_add = min(num_bytes, bytes_to_add);
3905                                 dest->reserved += bytes_to_add;
3906                                 if (dest->reserved >= dest->size)
3907                                         dest->full = 1;
3908                                 num_bytes -= bytes_to_add;
3909                         }
3910                         spin_unlock(&dest->lock);
3911                 }
3912                 if (num_bytes) {
3913                         spin_lock(&space_info->lock);
3914                         space_info->bytes_may_use -= num_bytes;
3915                         trace_btrfs_space_reservation(fs_info, "space_info",
3916                                               (u64)(unsigned long)space_info,
3917                                               num_bytes, 0);
3918                         space_info->reservation_progress++;
3919                         spin_unlock(&space_info->lock);
3920                 }
3921         }
3922 }
3923
3924 static int block_rsv_migrate_bytes(struct btrfs_block_rsv *src,
3925                                    struct btrfs_block_rsv *dst, u64 num_bytes)
3926 {
3927         int ret;
3928
3929         ret = block_rsv_use_bytes(src, num_bytes);
3930         if (ret)
3931                 return ret;
3932
3933         block_rsv_add_bytes(dst, num_bytes, 1);
3934         return 0;
3935 }
3936
3937 void btrfs_init_block_rsv(struct btrfs_block_rsv *rsv)
3938 {
3939         memset(rsv, 0, sizeof(*rsv));
3940         spin_lock_init(&rsv->lock);
3941 }
3942
3943 struct btrfs_block_rsv *btrfs_alloc_block_rsv(struct btrfs_root *root)
3944 {
3945         struct btrfs_block_rsv *block_rsv;
3946         struct btrfs_fs_info *fs_info = root->fs_info;
3947
3948         block_rsv = kmalloc(sizeof(*block_rsv), GFP_NOFS);
3949         if (!block_rsv)
3950                 return NULL;
3951
3952         btrfs_init_block_rsv(block_rsv);
3953         block_rsv->space_info = __find_space_info(fs_info,
3954                                                   BTRFS_BLOCK_GROUP_METADATA);
3955         return block_rsv;
3956 }
3957
3958 void btrfs_free_block_rsv(struct btrfs_root *root,
3959                           struct btrfs_block_rsv *rsv)
3960 {
3961         btrfs_block_rsv_release(root, rsv, (u64)-1);
3962         kfree(rsv);
3963 }
3964
3965 static inline int __block_rsv_add(struct btrfs_root *root,
3966                                   struct btrfs_block_rsv *block_rsv,
3967                                   u64 num_bytes, int flush)
3968 {
3969         int ret;
3970
3971         if (num_bytes == 0)
3972                 return 0;
3973
3974         ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush);
3975         if (!ret) {
3976                 block_rsv_add_bytes(block_rsv, num_bytes, 1);
3977                 return 0;
3978         }
3979
3980         return ret;
3981 }
3982
3983 int btrfs_block_rsv_add(struct btrfs_root *root,
3984                         struct btrfs_block_rsv *block_rsv,
3985                         u64 num_bytes)
3986 {
3987         return __block_rsv_add(root, block_rsv, num_bytes, 1);
3988 }
3989
3990 int btrfs_block_rsv_add_noflush(struct btrfs_root *root,
3991                                 struct btrfs_block_rsv *block_rsv,
3992                                 u64 num_bytes)
3993 {
3994         return __block_rsv_add(root, block_rsv, num_bytes, 0);
3995 }
3996
3997 int btrfs_block_rsv_check(struct btrfs_root *root,
3998                           struct btrfs_block_rsv *block_rsv, int min_factor)
3999 {
4000         u64 num_bytes = 0;
4001         int ret = -ENOSPC;
4002
4003         if (!block_rsv)
4004                 return 0;
4005
4006         spin_lock(&block_rsv->lock);
4007         num_bytes = div_factor(block_rsv->size, min_factor);
4008         if (block_rsv->reserved >= num_bytes)
4009                 ret = 0;
4010         spin_unlock(&block_rsv->lock);
4011
4012         return ret;
4013 }
4014
4015 static inline int __btrfs_block_rsv_refill(struct btrfs_root *root,
4016                                            struct btrfs_block_rsv *block_rsv,
4017                                            u64 min_reserved, int flush)
4018 {
4019         u64 num_bytes = 0;
4020         int ret = -ENOSPC;
4021
4022         if (!block_rsv)
4023                 return 0;
4024
4025         spin_lock(&block_rsv->lock);
4026         num_bytes = min_reserved;
4027         if (block_rsv->reserved >= num_bytes)
4028                 ret = 0;
4029         else
4030                 num_bytes -= block_rsv->reserved;
4031         spin_unlock(&block_rsv->lock);
4032
4033         if (!ret)
4034                 return 0;
4035
4036         ret = reserve_metadata_bytes(root, block_rsv, num_bytes, flush);
4037         if (!ret) {
4038                 block_rsv_add_bytes(block_rsv, num_bytes, 0);
4039                 return 0;
4040         }
4041
4042         return ret;
4043 }
4044
4045 int btrfs_block_rsv_refill(struct btrfs_root *root,
4046                            struct btrfs_block_rsv *block_rsv,
4047                            u64 min_reserved)
4048 {
4049         return __btrfs_block_rsv_refill(root, block_rsv, min_reserved, 1);
4050 }
4051
4052 int btrfs_block_rsv_refill_noflush(struct btrfs_root *root,
4053                                    struct btrfs_block_rsv *block_rsv,
4054                                    u64 min_reserved)
4055 {
4056         return __btrfs_block_rsv_refill(root, block_rsv, min_reserved, 0);
4057 }
4058
4059 int btrfs_block_rsv_migrate(struct btrfs_block_rsv *src_rsv,
4060                             struct btrfs_block_rsv *dst_rsv,
4061                             u64 num_bytes)
4062 {
4063         return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
4064 }
4065
4066 void btrfs_block_rsv_release(struct btrfs_root *root,
4067                              struct btrfs_block_rsv *block_rsv,
4068                              u64 num_bytes)
4069 {
4070         struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
4071         if (global_rsv->full || global_rsv == block_rsv ||
4072             block_rsv->space_info != global_rsv->space_info)
4073                 global_rsv = NULL;
4074         block_rsv_release_bytes(root->fs_info, block_rsv, global_rsv,
4075                                 num_bytes);
4076 }
4077
4078 /*
4079  * helper to calculate size of global block reservation.
4080  * the desired value is sum of space used by extent tree,
4081  * checksum tree and root tree
4082  */
4083 static u64 calc_global_metadata_size(struct btrfs_fs_info *fs_info)
4084 {
4085         struct btrfs_space_info *sinfo;
4086         u64 num_bytes;
4087         u64 meta_used;
4088         u64 data_used;
4089         int csum_size = btrfs_super_csum_size(fs_info->super_copy);
4090
4091         sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_DATA);
4092         spin_lock(&sinfo->lock);
4093         data_used = sinfo->bytes_used;
4094         spin_unlock(&sinfo->lock);
4095
4096         sinfo = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
4097         spin_lock(&sinfo->lock);
4098         if (sinfo->flags & BTRFS_BLOCK_GROUP_DATA)
4099                 data_used = 0;
4100         meta_used = sinfo->bytes_used;
4101         spin_unlock(&sinfo->lock);
4102
4103         num_bytes = (data_used >> fs_info->sb->s_blocksize_bits) *
4104                     csum_size * 2;
4105         num_bytes += div64_u64(data_used + meta_used, 50);
4106
4107         if (num_bytes * 3 > meta_used)
4108                 num_bytes = div64_u64(meta_used, 3) * 2;
4109
4110         return ALIGN(num_bytes, fs_info->extent_root->leafsize << 10);
4111 }
4112
4113 static void update_global_block_rsv(struct btrfs_fs_info *fs_info)
4114 {
4115         struct btrfs_block_rsv *block_rsv = &fs_info->global_block_rsv;
4116         struct btrfs_space_info *sinfo = block_rsv->space_info;
4117         u64 num_bytes;
4118
4119         num_bytes = calc_global_metadata_size(fs_info);
4120
4121         spin_lock(&block_rsv->lock);
4122         spin_lock(&sinfo->lock);
4123
4124         block_rsv->size = num_bytes;
4125
4126         num_bytes = sinfo->bytes_used + sinfo->bytes_pinned +
4127                     sinfo->bytes_reserved + sinfo->bytes_readonly +
4128                     sinfo->bytes_may_use;
4129
4130         if (sinfo->total_bytes > num_bytes) {
4131                 num_bytes = sinfo->total_bytes - num_bytes;
4132                 block_rsv->reserved += num_bytes;
4133                 sinfo->bytes_may_use += num_bytes;
4134                 trace_btrfs_space_reservation(fs_info, "space_info",
4135                                       (u64)(unsigned long)sinfo, num_bytes, 1);
4136         }
4137
4138         if (block_rsv->reserved >= block_rsv->size) {
4139                 num_bytes = block_rsv->reserved - block_rsv->size;
4140                 sinfo->bytes_may_use -= num_bytes;
4141                 trace_btrfs_space_reservation(fs_info, "space_info",
4142                                       (u64)(unsigned long)sinfo, num_bytes, 0);
4143                 sinfo->reservation_progress++;
4144                 block_rsv->reserved = block_rsv->size;
4145                 block_rsv->full = 1;
4146         }
4147
4148         spin_unlock(&sinfo->lock);
4149         spin_unlock(&block_rsv->lock);
4150 }
4151
4152 static void init_global_block_rsv(struct btrfs_fs_info *fs_info)
4153 {
4154         struct btrfs_space_info *space_info;
4155
4156         space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_SYSTEM);
4157         fs_info->chunk_block_rsv.space_info = space_info;
4158
4159         space_info = __find_space_info(fs_info, BTRFS_BLOCK_GROUP_METADATA);
4160         fs_info->global_block_rsv.space_info = space_info;
4161         fs_info->delalloc_block_rsv.space_info = space_info;
4162         fs_info->trans_block_rsv.space_info = space_info;
4163         fs_info->empty_block_rsv.space_info = space_info;
4164         fs_info->delayed_block_rsv.space_info = space_info;
4165
4166         fs_info->extent_root->block_rsv = &fs_info->global_block_rsv;
4167         fs_info->csum_root->block_rsv = &fs_info->global_block_rsv;
4168         fs_info->dev_root->block_rsv = &fs_info->global_block_rsv;
4169         fs_info->tree_root->block_rsv = &fs_info->global_block_rsv;
4170         fs_info->chunk_root->block_rsv = &fs_info->chunk_block_rsv;
4171
4172         update_global_block_rsv(fs_info);
4173 }
4174
4175 static void release_global_block_rsv(struct btrfs_fs_info *fs_info)
4176 {
4177         block_rsv_release_bytes(fs_info, &fs_info->global_block_rsv, NULL,
4178                                 (u64)-1);
4179         WARN_ON(fs_info->delalloc_block_rsv.size > 0);
4180         WARN_ON(fs_info->delalloc_block_rsv.reserved > 0);
4181         WARN_ON(fs_info->trans_block_rsv.size > 0);
4182         WARN_ON(fs_info->trans_block_rsv.reserved > 0);
4183         WARN_ON(fs_info->chunk_block_rsv.size > 0);
4184         WARN_ON(fs_info->chunk_block_rsv.reserved > 0);
4185         WARN_ON(fs_info->delayed_block_rsv.size > 0);
4186         WARN_ON(fs_info->delayed_block_rsv.reserved > 0);
4187 }
4188
4189 void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans,
4190                                   struct btrfs_root *root)
4191 {
4192         if (!trans->bytes_reserved)
4193                 return;
4194
4195         trace_btrfs_space_reservation(root->fs_info, "transaction",
4196                                       (u64)(unsigned long)trans,
4197                                       trans->bytes_reserved, 0);
4198         btrfs_block_rsv_release(root, trans->block_rsv, trans->bytes_reserved);
4199         trans->bytes_reserved = 0;
4200 }
4201
4202 int btrfs_orphan_reserve_metadata(struct btrfs_trans_handle *trans,
4203                                   struct inode *inode)
4204 {
4205         struct btrfs_root *root = BTRFS_I(inode)->root;
4206         struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
4207         struct btrfs_block_rsv *dst_rsv = root->orphan_block_rsv;
4208
4209         /*
4210          * We need to hold space in order to delete our orphan item once we've
4211          * added it, so this takes the reservation so we can release it later
4212          * when we are truly done with the orphan item.
4213          */
4214         u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
4215         trace_btrfs_space_reservation(root->fs_info, "orphan",
4216                                       btrfs_ino(inode), num_bytes, 1);
4217         return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
4218 }
4219
4220 void btrfs_orphan_release_metadata(struct inode *inode)
4221 {
4222         struct btrfs_root *root = BTRFS_I(inode)->root;
4223         u64 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
4224         trace_btrfs_space_reservation(root->fs_info, "orphan",
4225                                       btrfs_ino(inode), num_bytes, 0);
4226         btrfs_block_rsv_release(root, root->orphan_block_rsv, num_bytes);
4227 }
4228
4229 int btrfs_snap_reserve_metadata(struct btrfs_trans_handle *trans,
4230                                 struct btrfs_pending_snapshot *pending)
4231 {
4232         struct btrfs_root *root = pending->root;
4233         struct btrfs_block_rsv *src_rsv = get_block_rsv(trans, root);
4234         struct btrfs_block_rsv *dst_rsv = &pending->block_rsv;
4235         /*
4236          * two for root back/forward refs, two for directory entries
4237          * and one for root of the snapshot.
4238          */
4239         u64 num_bytes = btrfs_calc_trans_metadata_size(root, 5);
4240         dst_rsv->space_info = src_rsv->space_info;
4241         return block_rsv_migrate_bytes(src_rsv, dst_rsv, num_bytes);
4242 }
4243
4244 /**
4245  * drop_outstanding_extent - drop an outstanding extent
4246  * @inode: the inode we're dropping the extent for
4247  *
4248  * This is called when we are freeing up an outstanding extent, either called
4249  * after an error or after an extent is written.  This will return the number of
4250  * reserved extents that need to be freed.  This must be called with
4251  * BTRFS_I(inode)->lock held.
4252  */
4253 static unsigned drop_outstanding_extent(struct inode *inode)
4254 {
4255         unsigned drop_inode_space = 0;
4256         unsigned dropped_extents = 0;
4257
4258         BUG_ON(!BTRFS_I(inode)->outstanding_extents);
4259         BTRFS_I(inode)->outstanding_extents--;
4260
4261         if (BTRFS_I(inode)->outstanding_extents == 0 &&
4262             BTRFS_I(inode)->delalloc_meta_reserved) {
4263                 drop_inode_space = 1;
4264                 BTRFS_I(inode)->delalloc_meta_reserved = 0;
4265         }
4266
4267         /*
4268          * If we have more or the same amount of outsanding extents than we have
4269          * reserved then we need to leave the reserved extents count alone.
4270          */
4271         if (BTRFS_I(inode)->outstanding_extents >=
4272             BTRFS_I(inode)->reserved_extents)
4273                 return drop_inode_space;
4274
4275         dropped_extents = BTRFS_I(inode)->reserved_extents -
4276                 BTRFS_I(inode)->outstanding_extents;
4277         BTRFS_I(inode)->reserved_extents -= dropped_extents;
4278         return dropped_extents + drop_inode_space;
4279 }
4280
4281 /**
4282  * calc_csum_metadata_size - return the amount of metada space that must be
4283  *      reserved/free'd for the given bytes.
4284  * @inode: the inode we're manipulating
4285  * @num_bytes: the number of bytes in question
4286  * @reserve: 1 if we are reserving space, 0 if we are freeing space
4287  *
4288  * This adjusts the number of csum_bytes in the inode and then returns the
4289  * correct amount of metadata that must either be reserved or freed.  We
4290  * calculate how many checksums we can fit into one leaf and then divide the
4291  * number of bytes that will need to be checksumed by this value to figure out
4292  * how many checksums will be required.  If we are adding bytes then the number
4293  * may go up and we will return the number of additional bytes that must be
4294  * reserved.  If it is going down we will return the number of bytes that must
4295  * be freed.
4296  *
4297  * This must be called with BTRFS_I(inode)->lock held.
4298  */
4299 static u64 calc_csum_metadata_size(struct inode *inode, u64 num_bytes,
4300                                    int reserve)
4301 {
4302         struct btrfs_root *root = BTRFS_I(inode)->root;
4303         u64 csum_size;
4304         int num_csums_per_leaf;
4305         int num_csums;
4306         int old_csums;
4307
4308         if (BTRFS_I(inode)->flags & BTRFS_INODE_NODATASUM &&
4309             BTRFS_I(inode)->csum_bytes == 0)
4310                 return 0;
4311
4312         old_csums = (int)div64_u64(BTRFS_I(inode)->csum_bytes, root->sectorsize);
4313         if (reserve)
4314                 BTRFS_I(inode)->csum_bytes += num_bytes;
4315         else
4316                 BTRFS_I(inode)->csum_bytes -= num_bytes;
4317         csum_size = BTRFS_LEAF_DATA_SIZE(root) - sizeof(struct btrfs_item);
4318         num_csums_per_leaf = (int)div64_u64(csum_size,
4319                                             sizeof(struct btrfs_csum_item) +
4320                                             sizeof(struct btrfs_disk_key));
4321         num_csums = (int)div64_u64(BTRFS_I(inode)->csum_bytes, root->sectorsize);
4322         num_csums = num_csums + num_csums_per_leaf - 1;
4323         num_csums = num_csums / num_csums_per_leaf;
4324
4325         old_csums = old_csums + num_csums_per_leaf - 1;
4326         old_csums = old_csums / num_csums_per_leaf;
4327
4328         /* No change, no need to reserve more */
4329         if (old_csums == num_csums)
4330                 return 0;
4331
4332         if (reserve)
4333                 return btrfs_calc_trans_metadata_size(root,
4334                                                       num_csums - old_csums);
4335
4336         return btrfs_calc_trans_metadata_size(root, old_csums - num_csums);
4337 }
4338
4339 int btrfs_delalloc_reserve_metadata(struct inode *inode, u64 num_bytes)
4340 {
4341         struct btrfs_root *root = BTRFS_I(inode)->root;
4342         struct btrfs_block_rsv *block_rsv = &root->fs_info->delalloc_block_rsv;
4343         u64 to_reserve = 0;
4344         u64 csum_bytes;
4345         unsigned nr_extents = 0;
4346         int extra_reserve = 0;
4347         int flush = 1;
4348         int ret;
4349
4350         /* Need to be holding the i_mutex here if we aren't free space cache */
4351         if (btrfs_is_free_space_inode(root, inode))
4352                 flush = 0;
4353
4354         if (flush && btrfs_transaction_in_commit(root->fs_info))
4355                 schedule_timeout(1);
4356
4357         mutex_lock(&BTRFS_I(inode)->delalloc_mutex);
4358         num_bytes = ALIGN(num_bytes, root->sectorsize);
4359
4360         spin_lock(&BTRFS_I(inode)->lock);
4361         BTRFS_I(inode)->outstanding_extents++;
4362
4363         if (BTRFS_I(inode)->outstanding_extents >
4364             BTRFS_I(inode)->reserved_extents)
4365                 nr_extents = BTRFS_I(inode)->outstanding_extents -
4366                         BTRFS_I(inode)->reserved_extents;
4367
4368         /*
4369          * Add an item to reserve for updating the inode when we complete the
4370          * delalloc io.
4371          */
4372         if (!BTRFS_I(inode)->delalloc_meta_reserved) {
4373                 nr_extents++;
4374                 extra_reserve = 1;
4375         }
4376
4377         to_reserve = btrfs_calc_trans_metadata_size(root, nr_extents);
4378         to_reserve += calc_csum_metadata_size(inode, num_bytes, 1);
4379         csum_bytes = BTRFS_I(inode)->csum_bytes;
4380         spin_unlock(&BTRFS_I(inode)->lock);
4381
4382         ret = reserve_metadata_bytes(root, block_rsv, to_reserve, flush);
4383         if (ret) {
4384                 u64 to_free = 0;
4385                 unsigned dropped;
4386
4387                 spin_lock(&BTRFS_I(inode)->lock);
4388                 dropped = drop_outstanding_extent(inode);
4389                 /*
4390                  * If the inodes csum_bytes is the same as the original
4391                  * csum_bytes then we know we haven't raced with any free()ers
4392                  * so we can just reduce our inodes csum bytes and carry on.
4393                  * Otherwise we have to do the normal free thing to account for
4394                  * the case that the free side didn't free up its reserve
4395                  * because of this outstanding reservation.
4396                  */
4397                 if (BTRFS_I(inode)->csum_bytes == csum_bytes)
4398                         calc_csum_metadata_size(inode, num_bytes, 0);
4399                 else
4400                         to_free = calc_csum_metadata_size(inode, num_bytes, 0);
4401                 spin_unlock(&BTRFS_I(inode)->lock);
4402                 if (dropped)
4403                         to_free += btrfs_calc_trans_metadata_size(root, dropped);
4404
4405                 if (to_free) {
4406                         btrfs_block_rsv_release(root, block_rsv, to_free);
4407                         trace_btrfs_space_reservation(root->fs_info,
4408                                                       "delalloc",
4409                                                       btrfs_ino(inode),
4410                                                       to_free, 0);
4411                 }
4412                 mutex_unlock(&BTRFS_I(inode)->delalloc_mutex);
4413                 return ret;
4414         }
4415
4416         spin_lock(&BTRFS_I(inode)->lock);
4417         if (extra_reserve) {
4418                 BTRFS_I(inode)->delalloc_meta_reserved = 1;
4419                 nr_extents--;
4420         }
4421         BTRFS_I(inode)->reserved_extents += nr_extents;
4422         spin_unlock(&BTRFS_I(inode)->lock);
4423         mutex_unlock(&BTRFS_I(inode)->delalloc_mutex);
4424
4425         if (to_reserve)
4426                 trace_btrfs_space_reservation(root->fs_info,"delalloc",
4427                                               btrfs_ino(inode), to_reserve, 1);
4428         block_rsv_add_bytes(block_rsv, to_reserve, 1);
4429
4430         return 0;
4431 }
4432
4433 /**
4434  * btrfs_delalloc_release_metadata - release a metadata reservation for an inode
4435  * @inode: the inode to release the reservation for
4436  * @num_bytes: the number of bytes we're releasing
4437  *
4438  * This will release the metadata reservation for an inode.  This can be called
4439  * once we complete IO for a given set of bytes to release their metadata
4440  * reservations.
4441  */
4442 void btrfs_delalloc_release_metadata(struct inode *inode, u64 num_bytes)
4443 {
4444         struct btrfs_root *root = BTRFS_I(inode)->root;
4445         u64 to_free = 0;
4446         unsigned dropped;
4447
4448         num_bytes = ALIGN(num_bytes, root->sectorsize);
4449         spin_lock(&BTRFS_I(inode)->lock);
4450         dropped = drop_outstanding_extent(inode);
4451
4452         to_free = calc_csum_metadata_size(inode, num_bytes, 0);
4453         spin_unlock(&BTRFS_I(inode)->lock);
4454         if (dropped > 0)
4455                 to_free += btrfs_calc_trans_metadata_size(root, dropped);
4456
4457         trace_btrfs_space_reservation(root->fs_info, "delalloc",
4458                                       btrfs_ino(inode), to_free, 0);
4459         btrfs_block_rsv_release(root, &root->fs_info->delalloc_block_rsv,
4460                                 to_free);
4461 }
4462
4463 /**
4464  * btrfs_delalloc_reserve_space - reserve data and metadata space for delalloc
4465  * @inode: inode we're writing to
4466  * @num_bytes: the number of bytes we want to allocate
4467  *
4468  * This will do the following things
4469  *
4470  * o reserve space in the data space info for num_bytes
4471  * o reserve space in the metadata space info based on number of outstanding
4472  *   extents and how much csums will be needed
4473  * o add to the inodes ->delalloc_bytes
4474  * o add it to the fs_info's delalloc inodes list.
4475  *
4476  * This will return 0 for success and -ENOSPC if there is no space left.
4477  */
4478 int btrfs_delalloc_reserve_space(struct inode *inode, u64 num_bytes)
4479 {
4480         int ret;
4481
4482         ret = btrfs_check_data_free_space(inode, num_bytes);
4483         if (ret)
4484                 return ret;
4485
4486         ret = btrfs_delalloc_reserve_metadata(inode, num_bytes);
4487         if (ret) {
4488                 btrfs_free_reserved_data_space(inode, num_bytes);
4489                 return ret;
4490         }
4491
4492         return 0;
4493 }
4494
4495 /**
4496  * btrfs_delalloc_release_space - release data and metadata space for delalloc
4497  * @inode: inode we're releasing space for
4498  * @num_bytes: the number of bytes we want to free up
4499  *
4500  * This must be matched with a call to btrfs_delalloc_reserve_space.  This is
4501  * called in the case that we don't need the metadata AND data reservations
4502  * anymore.  So if there is an error or we insert an inline extent.
4503  *
4504  * This function will release the metadata space that was not used and will
4505  * decrement ->delalloc_bytes and remove it from the fs_info delalloc_inodes
4506  * list if there are no delalloc bytes left.
4507  */
4508 void btrfs_delalloc_release_space(struct inode *inode, u64 num_bytes)
4509 {
4510         btrfs_delalloc_release_metadata(inode, num_bytes);
4511         btrfs_free_reserved_data_space(inode, num_bytes);
4512 }
4513
4514 static int update_block_group(struct btrfs_trans_handle *trans,
4515                               struct btrfs_root *root,
4516                               u64 bytenr, u64 num_bytes, int alloc)
4517 {
4518         struct btrfs_block_group_cache *cache = NULL;
4519         struct btrfs_fs_info *info = root->fs_info;
4520         u64 total = num_bytes;
4521         u64 old_val;
4522         u64 byte_in_group;
4523         int factor;
4524
4525         /* block accounting for super block */
4526         spin_lock(&info->delalloc_lock);
4527         old_val = btrfs_super_bytes_used(info->super_copy);
4528         if (alloc)
4529                 old_val += num_bytes;
4530         else
4531                 old_val -= num_bytes;
4532         btrfs_set_super_bytes_used(info->super_copy, old_val);
4533         spin_unlock(&info->delalloc_lock);
4534
4535         while (total) {
4536                 cache = btrfs_lookup_block_group(info, bytenr);
4537                 if (!cache)
4538                         return -1;
4539                 if (cache->flags & (BTRFS_BLOCK_GROUP_DUP |
4540                                     BTRFS_BLOCK_GROUP_RAID1 |
4541                                     BTRFS_BLOCK_GROUP_RAID10))
4542                         factor = 2;
4543                 else
4544                         factor = 1;
4545                 /*
4546                  * If this block group has free space cache written out, we
4547                  * need to make sure to load it if we are removing space.  This
4548                  * is because we need the unpinning stage to actually add the
4549                  * space back to the block group, otherwise we will leak space.
4550                  */
4551                 if (!alloc && cache->cached == BTRFS_CACHE_NO)
4552                         cache_block_group(cache, trans, NULL, 1);
4553
4554                 byte_in_group = bytenr - cache->key.objectid;
4555                 WARN_ON(byte_in_group > cache->key.offset);
4556
4557                 spin_lock(&cache->space_info->lock);
4558                 spin_lock(&cache->lock);
4559
4560                 if (btrfs_test_opt(root, SPACE_CACHE) &&
4561                     cache->disk_cache_state < BTRFS_DC_CLEAR)
4562                         cache->disk_cache_state = BTRFS_DC_CLEAR;
4563
4564                 cache->dirty = 1;
4565                 old_val = btrfs_block_group_used(&cache->item);
4566                 num_bytes = min(total, cache->key.offset - byte_in_group);
4567                 if (alloc) {
4568                         old_val += num_bytes;
4569                         btrfs_set_block_group_used(&cache->item, old_val);
4570                         cache->reserved -= num_bytes;
4571                         cache->space_info->bytes_reserved -= num_bytes;
4572                         cache->space_info->bytes_used += num_bytes;
4573                         cache->space_info->disk_used += num_bytes * factor;
4574                         spin_unlock(&cache->lock);
4575                         spin_unlock(&cache->space_info->lock);
4576                 } else {
4577                         old_val -= num_bytes;
4578                         btrfs_set_block_group_used(&cache->item, old_val);
4579                         cache->pinned += num_bytes;
4580                         cache->space_info->bytes_pinned += num_bytes;
4581                         cache->space_info->bytes_used -= num_bytes;
4582                         cache->space_info->disk_used -= num_bytes * factor;
4583                         spin_unlock(&cache->lock);
4584                         spin_unlock(&cache->space_info->lock);
4585
4586                         set_extent_dirty(info->pinned_extents,
4587                                          bytenr, bytenr + num_bytes - 1,
4588                                          GFP_NOFS | __GFP_NOFAIL);
4589                 }
4590                 btrfs_put_block_group(cache);
4591                 total -= num_bytes;
4592                 bytenr += num_bytes;
4593         }
4594         return 0;
4595 }
4596
4597 static u64 first_logical_byte(struct btrfs_root *root, u64 search_start)
4598 {
4599         struct btrfs_block_group_cache *cache;
4600         u64 bytenr;
4601
4602         cache = btrfs_lookup_first_block_group(root->fs_info, search_start);
4603         if (!cache)
4604                 return 0;
4605
4606         bytenr = cache->key.objectid;
4607         btrfs_put_block_group(cache);
4608
4609         return bytenr;
4610 }
4611
4612 static int pin_down_extent(struct btrfs_root *root,
4613                            struct btrfs_block_group_cache *cache,
4614                            u64 bytenr, u64 num_bytes, int reserved)
4615 {
4616         spin_lock(&cache->space_info->lock);
4617         spin_lock(&cache->lock);
4618         cache->pinned += num_bytes;
4619         cache->space_info->bytes_pinned += num_bytes;
4620         if (reserved) {
4621                 cache->reserved -= num_bytes;
4622                 cache->space_info->bytes_reserved -= num_bytes;
4623         }
4624         spin_unlock(&cache->lock);
4625         spin_unlock(&cache->space_info->lock);
4626
4627         set_extent_dirty(root->fs_info->pinned_extents, bytenr,
4628                          bytenr + num_bytes - 1, GFP_NOFS | __GFP_NOFAIL);
4629         return 0;
4630 }
4631
4632 /*
4633  * this function must be called within transaction
4634  */
4635 int btrfs_pin_extent(struct btrfs_root *root,
4636                      u64 bytenr, u64 num_bytes, int reserved)
4637 {
4638         struct btrfs_block_group_cache *cache;
4639
4640         cache = btrfs_lookup_block_group(root->fs_info, bytenr);
4641         BUG_ON(!cache);
4642
4643         pin_down_extent(root, cache, bytenr, num_bytes, reserved);
4644
4645         btrfs_put_block_group(cache);
4646         return 0;
4647 }
4648
4649 /*
4650  * this function must be called within transaction
4651  */
4652 int btrfs_pin_extent_for_log_replay(struct btrfs_trans_handle *trans,
4653                                     struct btrfs_root *root,
4654                                     u64 bytenr, u64 num_bytes)
4655 {
4656         struct btrfs_block_group_cache *cache;
4657
4658         cache = btrfs_lookup_block_group(root->fs_info, bytenr);
4659         BUG_ON(!cache);
4660
4661         /*
4662          * pull in the free space cache (if any) so that our pin
4663          * removes the free space from the cache.  We have load_only set
4664          * to one because the slow code to read in the free extents does check
4665          * the pinned extents.
4666          */
4667         cache_block_group(cache, trans, root, 1);
4668
4669         pin_down_extent(root, cache, bytenr, num_bytes, 0);
4670
4671         /* remove us from the free space cache (if we're there at all) */
4672         btrfs_remove_free_space(cache, bytenr, num_bytes);
4673         btrfs_put_block_group(cache);
4674         return 0;
4675 }
4676
4677 /**
4678  * btrfs_update_reserved_bytes - update the block_group and space info counters
4679  * @cache:      The cache we are manipulating
4680  * @num_bytes:  The number of bytes in question
4681  * @reserve:    One of the reservation enums
4682  *
4683  * This is called by the allocator when it reserves space, or by somebody who is
4684  * freeing space that was never actually used on disk.  For example if you
4685  * reserve some space for a new leaf in transaction A and before transaction A
4686  * commits you free that leaf, you call this with reserve set to 0 in order to
4687  * clear the reservation.
4688  *
4689  * Metadata reservations should be called with RESERVE_ALLOC so we do the proper
4690  * ENOSPC accounting.  For data we handle the reservation through clearing the
4691  * delalloc bits in the io_tree.  We have to do this since we could end up
4692  * allocating less disk space for the amount of data we have reserved in the
4693  * case of compression.
4694  *
4695  * If this is a reservation and the block group has become read only we cannot
4696  * make the reservation and return -EAGAIN, otherwise this function always
4697  * succeeds.
4698  */
4699 static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache,
4700                                        u64 num_bytes, int reserve)
4701 {
4702         struct btrfs_space_info *space_info = cache->space_info;
4703         int ret = 0;
4704         spin_lock(&space_info->lock);
4705         spin_lock(&cache->lock);
4706         if (reserve != RESERVE_FREE) {
4707                 if (cache->ro) {
4708                         ret = -EAGAIN;
4709                 } else {
4710                         cache->reserved += num_bytes;
4711                         space_info->bytes_reserved += num_bytes;
4712                         if (reserve == RESERVE_ALLOC) {
4713                                 trace_btrfs_space_reservation(cache->fs_info,
4714                                               "space_info",
4715                                               (u64)(unsigned long)space_info,
4716                                               num_bytes, 0);
4717                                 space_info->bytes_may_use -= num_bytes;
4718                         }
4719                 }
4720         } else {
4721                 if (cache->ro)
4722                         space_info->bytes_readonly += num_bytes;
4723                 cache->reserved -= num_bytes;
4724                 space_info->bytes_reserved -= num_bytes;
4725                 space_info->reservation_progress++;
4726         }
4727         spin_unlock(&cache->lock);
4728         spin_unlock(&space_info->lock);
4729         return ret;
4730 }
4731
4732 int btrfs_prepare_extent_commit(struct btrfs_trans_handle *trans,
4733                                 struct btrfs_root *root)
4734 {
4735         struct btrfs_fs_info *fs_info = root->fs_info;
4736         struct btrfs_caching_control *next;
4737         struct btrfs_caching_control *caching_ctl;
4738         struct btrfs_block_group_cache *cache;
4739
4740         down_write(&fs_info->extent_commit_sem);
4741
4742         list_for_each_entry_safe(caching_ctl, next,
4743                                  &fs_info->caching_block_groups, list) {
4744                 cache = caching_ctl->block_group;
4745                 if (block_group_cache_done(cache)) {
4746                         cache->last_byte_to_unpin = (u64)-1;
4747                         list_del_init(&caching_ctl->list);
4748                         put_caching_control(caching_ctl);
4749                 } else {
4750                         cache->last_byte_to_unpin = caching_ctl->progress;
4751                 }
4752         }
4753
4754         if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4755                 fs_info->pinned_extents = &fs_info->freed_extents[1];
4756         else
4757                 fs_info->pinned_extents = &fs_info->freed_extents[0];
4758
4759         up_write(&fs_info->extent_commit_sem);
4760
4761         update_global_block_rsv(fs_info);
4762         return 0;
4763 }
4764
4765 static int unpin_extent_range(struct btrfs_root *root, u64 start, u64 end)
4766 {
4767         struct btrfs_fs_info *fs_info = root->fs_info;
4768         struct btrfs_block_group_cache *cache = NULL;
4769         u64 len;
4770
4771         while (start <= end) {
4772                 if (!cache ||
4773                     start >= cache->key.objectid + cache->key.offset) {
4774                         if (cache)
4775                                 btrfs_put_block_group(cache);
4776                         cache = btrfs_lookup_block_group(fs_info, start);
4777                         BUG_ON(!cache);
4778                 }
4779
4780                 len = cache->key.objectid + cache->key.offset - start;
4781                 len = min(len, end + 1 - start);
4782
4783                 if (start < cache->last_byte_to_unpin) {
4784                         len = min(len, cache->last_byte_to_unpin - start);
4785                         btrfs_add_free_space(cache, start, len);
4786                 }
4787
4788                 start += len;
4789
4790                 spin_lock(&cache->space_info->lock);
4791                 spin_lock(&cache->lock);
4792                 cache->pinned -= len;
4793                 cache->space_info->bytes_pinned -= len;
4794                 if (cache->ro)
4795                         cache->space_info->bytes_readonly += len;
4796                 spin_unlock(&cache->lock);
4797                 spin_unlock(&cache->space_info->lock);
4798         }
4799
4800         if (cache)
4801                 btrfs_put_block_group(cache);
4802         return 0;
4803 }
4804
4805 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans,
4806                                struct btrfs_root *root)
4807 {
4808         struct btrfs_fs_info *fs_info = root->fs_info;
4809         struct extent_io_tree *unpin;
4810         u64 start;
4811         u64 end;
4812         int ret;
4813
4814         if (fs_info->pinned_extents == &fs_info->freed_extents[0])
4815                 unpin = &fs_info->freed_extents[1];
4816         else
4817                 unpin = &fs_info->freed_extents[0];
4818
4819         while (1) {
4820                 ret = find_first_extent_bit(unpin, 0, &start, &end,
4821                                             EXTENT_DIRTY);
4822                 if (ret)
4823                         break;
4824
4825                 if (btrfs_test_opt(root, DISCARD))
4826                         ret = btrfs_discard_extent(root, start,
4827                                                    end + 1 - start, NULL);
4828
4829                 clear_extent_dirty(unpin, start, end, GFP_NOFS);
4830                 unpin_extent_range(root, start, end);
4831                 cond_resched();
4832         }
4833
4834         return 0;
4835 }
4836
4837 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
4838                                 struct btrfs_root *root,
4839                                 u64 bytenr, u64 num_bytes, u64 parent,
4840                                 u64 root_objectid, u64 owner_objectid,
4841                                 u64 owner_offset, int refs_to_drop,
4842                                 struct btrfs_delayed_extent_op *extent_op)
4843 {
4844         struct btrfs_key key;
4845         struct btrfs_path *path;
4846         struct btrfs_fs_info *info = root->fs_info;
4847         struct btrfs_root *extent_root = info->extent_root;
4848         struct extent_buffer *leaf;
4849         struct btrfs_extent_item *ei;
4850         struct btrfs_extent_inline_ref *iref;
4851         int ret;
4852         int is_data;
4853         int extent_slot = 0;
4854         int found_extent = 0;
4855         int num_to_del = 1;
4856         u32 item_size;
4857         u64 refs;
4858
4859         path = btrfs_alloc_path();
4860         if (!path)
4861                 return -ENOMEM;
4862
4863         path->reada = 1;
4864         path->leave_spinning = 1;
4865
4866         is_data = owner_objectid >= BTRFS_FIRST_FREE_OBJECTID;
4867         BUG_ON(!is_data && refs_to_drop != 1);
4868
4869         ret = lookup_extent_backref(trans, extent_root, path, &iref,
4870                                     bytenr, num_bytes, parent,
4871                                     root_objectid, owner_objectid,
4872                                     owner_offset);
4873         if (ret == 0) {
4874                 extent_slot = path->slots[0];
4875                 while (extent_slot >= 0) {
4876                         btrfs_item_key_to_cpu(path->nodes[0], &key,
4877                                               extent_slot);
4878                         if (key.objectid != bytenr)
4879                                 break;
4880                         if (key.type == BTRFS_EXTENT_ITEM_KEY &&
4881                             key.offset == num_bytes) {
4882                                 found_extent = 1;
4883                                 break;
4884                         }
4885                         if (path->slots[0] - extent_slot > 5)
4886                                 break;
4887                         extent_slot--;
4888                 }
4889 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4890                 item_size = btrfs_item_size_nr(path->nodes[0], extent_slot);
4891                 if (found_extent && item_size < sizeof(*ei))
4892                         found_extent = 0;
4893 #endif
4894                 if (!found_extent) {
4895                         BUG_ON(iref);
4896                         ret = remove_extent_backref(trans, extent_root, path,
4897                                                     NULL, refs_to_drop,
4898                                                     is_data);
4899                         BUG_ON(ret);
4900                         btrfs_release_path(path);
4901                         path->leave_spinning = 1;
4902
4903                         key.objectid = bytenr;
4904                         key.type = BTRFS_EXTENT_ITEM_KEY;
4905                         key.offset = num_bytes;
4906
4907                         ret = btrfs_search_slot(trans, extent_root,
4908                                                 &key, path, -1, 1);
4909                         if (ret) {
4910                                 printk(KERN_ERR "umm, got %d back from search"
4911                                        ", was looking for %llu\n", ret,
4912                                        (unsigned long long)bytenr);
4913                                 if (ret > 0)
4914                                         btrfs_print_leaf(extent_root,
4915                                                          path->nodes[0]);
4916                         }
4917                         BUG_ON(ret);
4918                         extent_slot = path->slots[0];
4919                 }
4920         } else {
4921                 btrfs_print_leaf(extent_root, path->nodes[0]);
4922                 WARN_ON(1);
4923                 printk(KERN_ERR "btrfs unable to find ref byte nr %llu "
4924                        "parent %llu root %llu  owner %llu offset %llu\n",
4925                        (unsigned long long)bytenr,
4926                        (unsigned long long)parent,
4927                        (unsigned long long)root_objectid,
4928                        (unsigned long long)owner_objectid,
4929                        (unsigned long long)owner_offset);
4930         }
4931
4932         leaf = path->nodes[0];
4933         item_size = btrfs_item_size_nr(leaf, extent_slot);
4934 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
4935         if (item_size < sizeof(*ei)) {
4936                 BUG_ON(found_extent || extent_slot != path->slots[0]);
4937                 ret = convert_extent_item_v0(trans, extent_root, path,
4938                                              owner_objectid, 0);
4939                 BUG_ON(ret < 0);
4940
4941                 btrfs_release_path(path);
4942                 path->leave_spinning = 1;
4943
4944                 key.objectid = bytenr;
4945                 key.type = BTRFS_EXTENT_ITEM_KEY;
4946                 key.offset = num_bytes;
4947
4948                 ret = btrfs_search_slot(trans, extent_root, &key, path,
4949                                         -1, 1);
4950                 if (ret) {
4951                         printk(KERN_ERR "umm, got %d back from search"
4952                                ", was looking for %llu\n", ret,
4953                                (unsigned long long)bytenr);
4954                         btrfs_print_leaf(extent_root, path->nodes[0]);
4955                 }
4956                 BUG_ON(ret);
4957                 extent_slot = path->slots[0];
4958                 leaf = path->nodes[0];
4959                 item_size = btrfs_item_size_nr(leaf, extent_slot);
4960         }
4961 #endif
4962         BUG_ON(item_size < sizeof(*ei));
4963         ei = btrfs_item_ptr(leaf, extent_slot,
4964                             struct btrfs_extent_item);
4965         if (owner_objectid < BTRFS_FIRST_FREE_OBJECTID) {
4966                 struct btrfs_tree_block_info *bi;
4967                 BUG_ON(item_size < sizeof(*ei) + sizeof(*bi));
4968                 bi = (struct btrfs_tree_block_info *)(ei + 1);
4969                 WARN_ON(owner_objectid != btrfs_tree_block_level(leaf, bi));
4970         }
4971
4972         refs = btrfs_extent_refs(leaf, ei);
4973         BUG_ON(refs < refs_to_drop);
4974         refs -= refs_to_drop;
4975
4976         if (refs > 0) {
4977                 if (extent_op)
4978                         __run_delayed_extent_op(extent_op, leaf, ei);
4979                 /*
4980                  * In the case of inline back ref, reference count will
4981                  * be updated by remove_extent_backref
4982                  */
4983                 if (iref) {
4984                         BUG_ON(!found_extent);
4985                 } else {
4986                         btrfs_set_extent_refs(leaf, ei, refs);
4987                         btrfs_mark_buffer_dirty(leaf);
4988                 }
4989                 if (found_extent) {
4990                         ret = remove_extent_backref(trans, extent_root, path,
4991                                                     iref, refs_to_drop,
4992                                                     is_data);
4993                         BUG_ON(ret);
4994                 }
4995         } else {
4996                 if (found_extent) {
4997                         BUG_ON(is_data && refs_to_drop !=
4998                                extent_data_ref_count(root, path, iref));
4999                         if (iref) {
5000                                 BUG_ON(path->slots[0] != extent_slot);
5001                         } else {
5002                                 BUG_ON(path->slots[0] != extent_slot + 1);
5003                                 path->slots[0] = extent_slot;
5004                                 num_to_del = 2;
5005                         }
5006                 }
5007
5008                 ret = btrfs_del_items(trans, extent_root, path, path->slots[0],
5009                                       num_to_del);
5010                 BUG_ON(ret);
5011                 btrfs_release_path(path);
5012
5013                 if (is_data) {
5014                         ret = btrfs_del_csums(trans, root, bytenr, num_bytes);
5015                         BUG_ON(ret);
5016                 }
5017
5018                 ret = update_block_group(trans, root, bytenr, num_bytes, 0);
5019                 BUG_ON(ret);
5020         }
5021         btrfs_free_path(path);
5022         return ret;
5023 }
5024
5025 /*
5026  * when we free an block, it is possible (and likely) that we free the last
5027  * delayed ref for that extent as well.  This searches the delayed ref tree for
5028  * a given extent, and if there are no other delayed refs to be processed, it
5029  * removes it from the tree.
5030  */
5031 static noinline int check_ref_cleanup(struct btrfs_trans_handle *trans,
5032                                       struct btrfs_root *root, u64 bytenr)
5033 {
5034         struct btrfs_delayed_ref_head *head;
5035         struct btrfs_delayed_ref_root *delayed_refs;
5036         struct btrfs_delayed_ref_node *ref;
5037         struct rb_node *node;
5038         int ret = 0;
5039
5040         delayed_refs = &trans->transaction->delayed_refs;
5041         spin_lock(&delayed_refs->lock);
5042         head = btrfs_find_delayed_ref_head(trans, bytenr);
5043         if (!head)
5044                 goto out;
5045
5046         node = rb_prev(&head->node.rb_node);
5047         if (!node)
5048                 goto out;
5049
5050         ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
5051
5052         /* there are still entries for this ref, we can't drop it */
5053         if (ref->bytenr == bytenr)
5054                 goto out;
5055
5056         if (head->extent_op) {
5057                 if (!head->must_insert_reserved)
5058                         goto out;
5059                 kfree(head->extent_op);
5060                 head->extent_op = NULL;
5061         }
5062
5063         /*
5064          * waiting for the lock here would deadlock.  If someone else has it
5065          * locked they are already in the process of dropping it anyway
5066          */
5067         if (!mutex_trylock(&head->mutex))
5068                 goto out;
5069
5070         /*
5071          * at this point we have a head with no other entries.  Go
5072          * ahead and process it.
5073          */
5074         head->node.in_tree = 0;
5075         rb_erase(&head->node.rb_node, &delayed_refs->root);
5076
5077         delayed_refs->num_entries--;
5078         if (waitqueue_active(&delayed_refs->seq_wait))
5079                 wake_up(&delayed_refs->seq_wait);
5080
5081         /*
5082          * we don't take a ref on the node because we're removing it from the
5083          * tree, so we just steal the ref the tree was holding.
5084          */
5085         delayed_refs->num_heads--;
5086         if (list_empty(&head->cluster))
5087                 delayed_refs->num_heads_ready--;
5088
5089         list_del_init(&head->cluster);
5090         spin_unlock(&delayed_refs->lock);
5091
5092         BUG_ON(head->extent_op);
5093         if (head->must_insert_reserved)
5094                 ret = 1;
5095
5096         mutex_unlock(&head->mutex);
5097         btrfs_put_delayed_ref(&head->node);
5098         return ret;
5099 out:
5100         spin_unlock(&delayed_refs->lock);
5101         return 0;
5102 }
5103
5104 void btrfs_free_tree_block(struct btrfs_trans_handle *trans,
5105                            struct btrfs_root *root,
5106                            struct extent_buffer *buf,
5107                            u64 parent, int last_ref, int for_cow)
5108 {
5109         struct btrfs_block_group_cache *cache = NULL;
5110         int ret;
5111
5112         if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
5113                 ret = btrfs_add_delayed_tree_ref(root->fs_info, trans,
5114                                         buf->start, buf->len,
5115                                         parent, root->root_key.objectid,
5116                                         btrfs_header_level(buf),
5117                                         BTRFS_DROP_DELAYED_REF, NULL, for_cow);
5118                 BUG_ON(ret);
5119         }
5120
5121         if (!last_ref)
5122                 return;
5123
5124         cache = btrfs_lookup_block_group(root->fs_info, buf->start);
5125
5126         if (btrfs_header_generation(buf) == trans->transid) {
5127                 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
5128                         ret = check_ref_cleanup(trans, root, buf->start);
5129                         if (!ret)
5130                                 goto out;
5131                 }
5132
5133                 if (btrfs_header_flag(buf, BTRFS_HEADER_FLAG_WRITTEN)) {
5134                         pin_down_extent(root, cache, buf->start, buf->len, 1);
5135                         goto out;
5136                 }
5137
5138                 WARN_ON(test_bit(EXTENT_BUFFER_DIRTY, &buf->bflags));
5139
5140                 btrfs_add_free_space(cache, buf->start, buf->len);
5141                 btrfs_update_reserved_bytes(cache, buf->len, RESERVE_FREE);
5142         }
5143 out:
5144         /*
5145          * Deleting the buffer, clear the corrupt flag since it doesn't matter
5146          * anymore.
5147          */
5148         clear_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags);
5149         btrfs_put_block_group(cache);
5150 }
5151
5152 int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root,
5153                       u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid,
5154                       u64 owner, u64 offset, int for_cow)
5155 {
5156         int ret;
5157         struct btrfs_fs_info *fs_info = root->fs_info;
5158
5159         /*
5160          * tree log blocks never actually go into the extent allocation
5161          * tree, just update pinning info and exit early.
5162          */
5163         if (root_objectid == BTRFS_TREE_LOG_OBJECTID) {
5164                 WARN_ON(owner >= BTRFS_FIRST_FREE_OBJECTID);
5165                 /* unlocks the pinned mutex */
5166                 btrfs_pin_extent(root, bytenr, num_bytes, 1);
5167                 ret = 0;
5168         } else if (owner < BTRFS_FIRST_FREE_OBJECTID) {
5169                 ret = btrfs_add_delayed_tree_ref(fs_info, trans, bytenr,
5170                                         num_bytes,
5171                                         parent, root_objectid, (int)owner,
5172                                         BTRFS_DROP_DELAYED_REF, NULL, for_cow);
5173                 BUG_ON(ret);
5174         } else {
5175                 ret = btrfs_add_delayed_data_ref(fs_info, trans, bytenr,
5176                                                 num_bytes,
5177                                                 parent, root_objectid, owner,
5178                                                 offset, BTRFS_DROP_DELAYED_REF,
5179                                                 NULL, for_cow);
5180                 BUG_ON(ret);
5181         }
5182         return ret;
5183 }
5184
5185 static u64 stripe_align(struct btrfs_root *root, u64 val)
5186 {
5187         u64 mask = ((u64)root->stripesize - 1);
5188         u64 ret = (val + mask) & ~mask;
5189         return ret;
5190 }
5191
5192 /*
5193  * when we wait for progress in the block group caching, its because
5194  * our allocation attempt failed at least once.  So, we must sleep
5195  * and let some progress happen before we try again.
5196  *
5197  * This function will sleep at least once waiting for new free space to
5198  * show up, and then it will check the block group free space numbers
5199  * for our min num_bytes.  Another option is to have it go ahead
5200  * and look in the rbtree for a free extent of a given size, but this
5201  * is a good start.
5202  */
5203 static noinline int
5204 wait_block_group_cache_progress(struct btrfs_block_group_cache *cache,
5205                                 u64 num_bytes)
5206 {
5207         struct btrfs_caching_control *caching_ctl;
5208         DEFINE_WAIT(wait);
5209
5210         caching_ctl = get_caching_control(cache);
5211         if (!caching_ctl)
5212                 return 0;
5213
5214         wait_event(caching_ctl->wait, block_group_cache_done(cache) ||
5215                    (cache->free_space_ctl->free_space >= num_bytes));
5216
5217         put_caching_control(caching_ctl);
5218         return 0;
5219 }
5220
5221 static noinline int
5222 wait_block_group_cache_done(struct btrfs_block_group_cache *cache)
5223 {
5224         struct btrfs_caching_control *caching_ctl;
5225         DEFINE_WAIT(wait);
5226
5227         caching_ctl = get_caching_control(cache);
5228         if (!caching_ctl)
5229                 return 0;
5230
5231         wait_event(caching_ctl->wait, block_group_cache_done(cache));
5232
5233         put_caching_control(caching_ctl);
5234         return 0;
5235 }
5236
5237 static int get_block_group_index(struct btrfs_block_group_cache *cache)
5238 {
5239         int index;
5240         if (cache->flags & BTRFS_BLOCK_GROUP_RAID10)
5241                 index = 0;
5242         else if (cache->flags & BTRFS_BLOCK_GROUP_RAID1)
5243                 index = 1;
5244         else if (cache->flags & BTRFS_BLOCK_GROUP_DUP)
5245                 index = 2;
5246         else if (cache->flags & BTRFS_BLOCK_GROUP_RAID0)
5247                 index = 3;
5248         else
5249                 index = 4;
5250         return index;
5251 }
5252
5253 enum btrfs_loop_type {
5254         LOOP_CACHING_NOWAIT = 0,
5255         LOOP_CACHING_WAIT = 1,
5256         LOOP_ALLOC_CHUNK = 2,
5257         LOOP_NO_EMPTY_SIZE = 3,
5258 };
5259
5260 /*
5261  * walks the btree of allocated extents and find a hole of a given size.
5262  * The key ins is changed to record the hole:
5263  * ins->objectid == block start
5264  * ins->flags = BTRFS_EXTENT_ITEM_KEY
5265  * ins->offset == number of blocks
5266  * Any available blocks before search_start are skipped.
5267  */
5268 static noinline int find_free_extent(struct btrfs_trans_handle *trans,
5269                                      struct btrfs_root *orig_root,
5270                                      u64 num_bytes, u64 empty_size,
5271                                      u64 hint_byte, struct btrfs_key *ins,
5272                                      u64 data)
5273 {
5274         int ret = 0;
5275         struct btrfs_root *root = orig_root->fs_info->extent_root;
5276         struct btrfs_free_cluster *last_ptr = NULL;
5277         struct btrfs_block_group_cache *block_group = NULL;
5278         struct btrfs_block_group_cache *used_block_group;
5279         u64 search_start = 0;
5280         int empty_cluster = 2 * 1024 * 1024;
5281         int allowed_chunk_alloc = 0;
5282         int done_chunk_alloc = 0;
5283         struct btrfs_space_info *space_info;
5284         int loop = 0;
5285         int index = 0;
5286         int alloc_type = (data & BTRFS_BLOCK_GROUP_DATA) ?
5287                 RESERVE_ALLOC_NO_ACCOUNT : RESERVE_ALLOC;
5288         bool found_uncached_bg = false;
5289         bool failed_cluster_refill = false;
5290         bool failed_alloc = false;
5291         bool use_cluster = true;
5292         bool have_caching_bg = false;
5293
5294         WARN_ON(num_bytes < root->sectorsize);
5295         btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY);
5296         ins->objectid = 0;
5297         ins->offset = 0;
5298
5299         trace_find_free_extent(orig_root, num_bytes, empty_size, data);
5300
5301         space_info = __find_space_info(root->fs_info, data);
5302         if (!space_info) {
5303                 printk(KERN_ERR "No space info for %llu\n", data);
5304                 return -ENOSPC;
5305         }
5306
5307         /*
5308          * If the space info is for both data and metadata it means we have a
5309          * small filesystem and we can't use the clustering stuff.
5310          */
5311         if (btrfs_mixed_space_info(space_info))
5312                 use_cluster = false;
5313
5314         if (orig_root->ref_cows || empty_size)
5315                 allowed_chunk_alloc = 1;
5316
5317         if (data & BTRFS_BLOCK_GROUP_METADATA && use_cluster) {
5318                 last_ptr = &root->fs_info->meta_alloc_cluster;
5319                 if (!btrfs_test_opt(root, SSD))
5320                         empty_cluster = 64 * 1024;
5321         }
5322
5323         if ((data & BTRFS_BLOCK_GROUP_DATA) && use_cluster &&
5324             btrfs_test_opt(root, SSD)) {
5325                 last_ptr = &root->fs_info->data_alloc_cluster;
5326         }
5327
5328         if (last_ptr) {
5329                 spin_lock(&last_ptr->lock);
5330                 if (last_ptr->block_group)
5331                         hint_byte = last_ptr->window_start;
5332                 spin_unlock(&last_ptr->lock);
5333         }
5334
5335         search_start = max(search_start, first_logical_byte(root, 0));
5336         search_start = max(search_start, hint_byte);
5337
5338         if (!last_ptr)
5339                 empty_cluster = 0;
5340
5341         if (search_start == hint_byte) {
5342                 block_group = btrfs_lookup_block_group(root->fs_info,
5343                                                        search_start);
5344                 used_block_group = block_group;
5345                 /*
5346                  * we don't want to use the block group if it doesn't match our
5347                  * allocation bits, or if its not cached.
5348                  *
5349                  * However if we are re-searching with an ideal block group
5350                  * picked out then we don't care that the block group is cached.
5351                  */
5352                 if (block_group && block_group_bits(block_group, data) &&
5353                     block_group->cached != BTRFS_CACHE_NO) {
5354                         down_read(&space_info->groups_sem);
5355                         if (list_empty(&block_group->list) ||
5356                             block_group->ro) {
5357                                 /*
5358                                  * someone is removing this block group,
5359                                  * we can't jump into the have_block_group
5360                                  * target because our list pointers are not
5361                                  * valid
5362                                  */
5363                                 btrfs_put_block_group(block_group);
5364                                 up_read(&space_info->groups_sem);
5365                         } else {
5366                                 index = get_block_group_index(block_group);
5367                                 goto have_block_group;
5368                         }
5369                 } else if (block_group) {
5370                         btrfs_put_block_group(block_group);
5371                 }
5372         }
5373 search:
5374         have_caching_bg = false;
5375         down_read(&space_info->groups_sem);
5376         list_for_each_entry(block_group, &space_info->block_groups[index],
5377                             list) {
5378                 u64 offset;
5379                 int cached;
5380
5381                 used_block_group = block_group;
5382                 btrfs_get_block_group(block_group);
5383                 search_start = block_group->key.objectid;
5384
5385                 /*
5386                  * this can happen if we end up cycling through all the
5387                  * raid types, but we want to make sure we only allocate
5388                  * for the proper type.
5389                  */
5390                 if (!block_group_bits(block_group, data)) {
5391                     u64 extra = BTRFS_BLOCK_GROUP_DUP |
5392                                 BTRFS_BLOCK_GROUP_RAID1 |
5393                                 BTRFS_BLOCK_GROUP_RAID10;
5394
5395                         /*
5396                          * if they asked for extra copies and this block group
5397                          * doesn't provide them, bail.  This does allow us to
5398                          * fill raid0 from raid1.
5399                          */
5400                         if ((data & extra) && !(block_group->flags & extra))
5401                                 goto loop;
5402                 }
5403
5404 have_block_group:
5405                 cached = block_group_cache_done(block_group);
5406                 if (unlikely(!cached)) {
5407                         found_uncached_bg = true;
5408                         ret = cache_block_group(block_group, trans,
5409                                                 orig_root, 0);
5410                         BUG_ON(ret);
5411                 }
5412
5413                 if (unlikely(block_group->ro))
5414                         goto loop;
5415
5416                 /*
5417                  * Ok we want to try and use the cluster allocator, so
5418                  * lets look there
5419                  */
5420                 if (last_ptr) {
5421                         /*
5422                          * the refill lock keeps out other
5423                          * people trying to start a new cluster
5424                          */
5425                         spin_lock(&last_ptr->refill_lock);
5426                         used_block_group = last_ptr->block_group;
5427                         if (used_block_group != block_group &&
5428                             (!used_block_group ||
5429                              used_block_group->ro ||
5430                              !block_group_bits(used_block_group, data))) {
5431                                 used_block_group = block_group;
5432                                 goto refill_cluster;
5433                         }
5434
5435                         if (used_block_group != block_group)
5436                                 btrfs_get_block_group(used_block_group);
5437
5438                         offset = btrfs_alloc_from_cluster(used_block_group,
5439                           last_ptr, num_bytes, used_block_group->key.objectid);
5440                         if (offset) {
5441                                 /* we have a block, we're done */
5442                                 spin_unlock(&last_ptr->refill_lock);
5443                                 trace_btrfs_reserve_extent_cluster(root,
5444                                         block_group, search_start, num_bytes);
5445                                 goto checks;
5446                         }
5447
5448                         WARN_ON(last_ptr->block_group != used_block_group);
5449                         if (used_block_group != block_group) {
5450                                 btrfs_put_block_group(used_block_group);
5451                                 used_block_group = block_group;
5452                         }
5453 refill_cluster:
5454                         BUG_ON(used_block_group != block_group);
5455                         /* If we are on LOOP_NO_EMPTY_SIZE, we can't
5456                          * set up a new clusters, so lets just skip it
5457                          * and let the allocator find whatever block
5458                          * it can find.  If we reach this point, we
5459                          * will have tried the cluster allocator
5460                          * plenty of times and not have found
5461                          * anything, so we are likely way too
5462                          * fragmented for the clustering stuff to find
5463                          * anything.
5464                          *
5465                          * However, if the cluster is taken from the
5466                          * current block group, release the cluster
5467                          * first, so that we stand a better chance of
5468                          * succeeding in the unclustered
5469                          * allocation.  */
5470                         if (loop >= LOOP_NO_EMPTY_SIZE &&
5471                             last_ptr->block_group != block_group) {
5472                                 spin_unlock(&last_ptr->refill_lock);
5473                                 goto unclustered_alloc;
5474                         }
5475
5476                         /*
5477                          * this cluster didn't work out, free it and
5478                          * start over
5479                          */
5480                         btrfs_return_cluster_to_free_space(NULL, last_ptr);
5481
5482                         if (loop >= LOOP_NO_EMPTY_SIZE) {
5483                                 spin_unlock(&last_ptr->refill_lock);
5484                                 goto unclustered_alloc;
5485                         }
5486
5487                         /* allocate a cluster in this block group */
5488                         ret = btrfs_find_space_cluster(trans, root,
5489                                                block_group, last_ptr,
5490                                                search_start, num_bytes,
5491                                                empty_cluster + empty_size);
5492                         if (ret == 0) {
5493                                 /*
5494                                  * now pull our allocation out of this
5495                                  * cluster
5496                                  */
5497                                 offset = btrfs_alloc_from_cluster(block_group,
5498                                                   last_ptr, num_bytes,
5499                                                   search_start);
5500                                 if (offset) {
5501                                         /* we found one, proceed */
5502                                         spin_unlock(&last_ptr->refill_lock);
5503                                         trace_btrfs_reserve_extent_cluster(root,
5504                                                 block_group, search_start,
5505                                                 num_bytes);
5506                                         goto checks;
5507                                 }
5508                         } else if (!cached && loop > LOOP_CACHING_NOWAIT
5509                                    && !failed_cluster_refill) {
5510                                 spin_unlock(&last_ptr->refill_lock);
5511
5512                                 failed_cluster_refill = true;
5513                                 wait_block_group_cache_progress(block_group,
5514                                        num_bytes + empty_cluster + empty_size);
5515                                 goto have_block_group;
5516                         }
5517
5518                         /*
5519                          * at this point we either didn't find a cluster
5520                          * or we weren't able to allocate a block from our
5521                          * cluster.  Free the cluster we've been trying
5522                          * to use, and go to the next block group
5523                          */
5524                         btrfs_return_cluster_to_free_space(NULL, last_ptr);
5525                         spin_unlock(&last_ptr->refill_lock);
5526                         goto loop;
5527                 }
5528
5529 unclustered_alloc:
5530                 spin_lock(&block_group->free_space_ctl->tree_lock);
5531                 if (cached &&
5532                     block_group->free_space_ctl->free_space <
5533                     num_bytes + empty_cluster + empty_size) {
5534                         spin_unlock(&block_group->free_space_ctl->tree_lock);
5535                         goto loop;
5536                 }
5537                 spin_unlock(&block_group->free_space_ctl->tree_lock);
5538
5539                 offset = btrfs_find_space_for_alloc(block_group, search_start,
5540                                                     num_bytes, empty_size);
5541                 /*
5542                  * If we didn't find a chunk, and we haven't failed on this
5543                  * block group before, and this block group is in the middle of
5544                  * caching and we are ok with waiting, then go ahead and wait
5545                  * for progress to be made, and set failed_alloc to true.
5546                  *
5547                  * If failed_alloc is true then we've already waited on this
5548                  * block group once and should move on to the next block group.
5549                  */
5550                 if (!offset && !failed_alloc && !cached &&
5551                     loop > LOOP_CACHING_NOWAIT) {
5552                         wait_block_group_cache_progress(block_group,
5553                                                 num_bytes + empty_size);
5554                         failed_alloc = true;
5555                         goto have_block_group;
5556                 } else if (!offset) {
5557                         if (!cached)
5558                                 have_caching_bg = true;
5559                         goto loop;
5560                 }
5561 checks:
5562                 search_start = stripe_align(root, offset);
5563
5564                 /* move on to the next group */
5565                 if (search_start + num_bytes >
5566                     used_block_group->key.objectid + used_block_group->key.offset) {
5567                         btrfs_add_free_space(used_block_group, offset, num_bytes);
5568                         goto loop;
5569                 }
5570
5571                 if (offset < search_start)
5572                         btrfs_add_free_space(used_block_group, offset,
5573                                              search_start - offset);
5574                 BUG_ON(offset > search_start);
5575
5576                 ret = btrfs_update_reserved_bytes(used_block_group, num_bytes,
5577                                                   alloc_type);
5578                 if (ret == -EAGAIN) {
5579                         btrfs_add_free_space(used_block_group, offset, num_bytes);
5580                         goto loop;
5581                 }
5582
5583                 /* we are all good, lets return */
5584                 ins->objectid = search_start;
5585                 ins->offset = num_bytes;
5586
5587                 trace_btrfs_reserve_extent(orig_root, block_group,
5588                                            search_start, num_bytes);
5589                 if (offset < search_start)
5590                         btrfs_add_free_space(used_block_group, offset,
5591                                              search_start - offset);
5592                 BUG_ON(offset > search_start);
5593                 if (used_block_group != block_group)
5594                         btrfs_put_block_group(used_block_group);
5595                 btrfs_put_block_group(block_group);
5596                 break;
5597 loop:
5598                 failed_cluster_refill = false;
5599                 failed_alloc = false;
5600                 BUG_ON(index != get_block_group_index(block_group));
5601                 if (used_block_group != block_group)
5602                         btrfs_put_block_group(used_block_group);
5603                 btrfs_put_block_group(block_group);
5604         }
5605         up_read(&space_info->groups_sem);
5606
5607         if (!ins->objectid && loop >= LOOP_CACHING_WAIT && have_caching_bg)
5608                 goto search;
5609
5610         if (!ins->objectid && ++index < BTRFS_NR_RAID_TYPES)
5611                 goto search;
5612
5613         /*
5614          * LOOP_CACHING_NOWAIT, search partially cached block groups, kicking
5615          *                      caching kthreads as we move along
5616          * LOOP_CACHING_WAIT, search everything, and wait if our bg is caching
5617          * LOOP_ALLOC_CHUNK, force a chunk allocation and try again
5618          * LOOP_NO_EMPTY_SIZE, set empty_size and empty_cluster to 0 and try
5619          *                      again
5620          */
5621         if (!ins->objectid && loop < LOOP_NO_EMPTY_SIZE) {
5622                 index = 0;
5623                 loop++;
5624                 if (loop == LOOP_ALLOC_CHUNK) {
5625                        if (allowed_chunk_alloc) {
5626                                 ret = do_chunk_alloc(trans, root, num_bytes +
5627                                                      2 * 1024 * 1024, data,
5628                                                      CHUNK_ALLOC_LIMITED);
5629                                 allowed_chunk_alloc = 0;
5630                                 if (ret == 1)
5631                                         done_chunk_alloc = 1;
5632                         } else if (!done_chunk_alloc &&
5633                                    space_info->force_alloc ==
5634                                    CHUNK_ALLOC_NO_FORCE) {
5635                                 space_info->force_alloc = CHUNK_ALLOC_LIMITED;
5636                         }
5637
5638                        /*
5639                         * We didn't allocate a chunk, go ahead and drop the
5640                         * empty size and loop again.
5641                         */
5642                        if (!done_chunk_alloc)
5643                                loop = LOOP_NO_EMPTY_SIZE;
5644                 }
5645
5646                 if (loop == LOOP_NO_EMPTY_SIZE) {
5647                         empty_size = 0;
5648                         empty_cluster = 0;
5649                 }
5650
5651                 goto search;
5652         } else if (!ins->objectid) {
5653                 ret = -ENOSPC;
5654         } else if (ins->objectid) {
5655                 ret = 0;
5656         }
5657
5658         return ret;
5659 }
5660
5661 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
5662                             int dump_block_groups)
5663 {
5664         struct btrfs_block_group_cache *cache;
5665         int index = 0;
5666
5667         spin_lock(&info->lock);
5668         printk(KERN_INFO "space_info %llu has %llu free, is %sfull\n",
5669                (unsigned long long)info->flags,
5670                (unsigned long long)(info->total_bytes - info->bytes_used -
5671                                     info->bytes_pinned - info->bytes_reserved -
5672                                     info->bytes_readonly),
5673                (info->full) ? "" : "not ");
5674         printk(KERN_INFO "space_info total=%llu, used=%llu, pinned=%llu, "
5675                "reserved=%llu, may_use=%llu, readonly=%llu\n",
5676                (unsigned long long)info->total_bytes,
5677                (unsigned long long)info->bytes_used,
5678                (unsigned long long)info->bytes_pinned,
5679                (unsigned long long)info->bytes_reserved,
5680                (unsigned long long)info->bytes_may_use,
5681                (unsigned long long)info->bytes_readonly);
5682         spin_unlock(&info->lock);
5683
5684         if (!dump_block_groups)
5685                 return;
5686
5687         down_read(&info->groups_sem);
5688 again:
5689         list_for_each_entry(cache, &info->block_groups[index], list) {
5690                 spin_lock(&cache->lock);
5691                 printk(KERN_INFO "block group %llu has %llu bytes, %llu used "
5692                        "%llu pinned %llu reserved\n",
5693                        (unsigned long long)cache->key.objectid,
5694                        (unsigned long long)cache->key.offset,
5695                        (unsigned long long)btrfs_block_group_used(&cache->item),
5696                        (unsigned long long)cache->pinned,
5697                        (unsigned long long)cache->reserved);
5698                 btrfs_dump_free_space(cache, bytes);
5699                 spin_unlock(&cache->lock);
5700         }
5701         if (++index < BTRFS_NR_RAID_TYPES)
5702                 goto again;
5703         up_read(&info->groups_sem);
5704 }
5705
5706 int btrfs_reserve_extent(struct btrfs_trans_handle *trans,
5707                          struct btrfs_root *root,
5708                          u64 num_bytes, u64 min_alloc_size,
5709                          u64 empty_size, u64 hint_byte,
5710                          struct btrfs_key *ins, u64 data)
5711 {
5712         bool final_tried = false;
5713         int ret;
5714
5715         data = btrfs_get_alloc_profile(root, data);
5716 again:
5717         /*
5718          * the only place that sets empty_size is btrfs_realloc_node, which
5719          * is not called recursively on allocations
5720          */
5721         if (empty_size || root->ref_cows)
5722                 ret = do_chunk_alloc(trans, root->fs_info->extent_root,
5723                                      num_bytes + 2 * 1024 * 1024, data,
5724                                      CHUNK_ALLOC_NO_FORCE);
5725
5726         WARN_ON(num_bytes < root->sectorsize);
5727         ret = find_free_extent(trans, root, num_bytes, empty_size,
5728                                hint_byte, ins, data);
5729
5730         if (ret == -ENOSPC) {
5731                 if (!final_tried) {
5732                         num_bytes = num_bytes >> 1;
5733                         num_bytes = num_bytes & ~(root->sectorsize - 1);
5734                         num_bytes = max(num_bytes, min_alloc_size);
5735                         do_chunk_alloc(trans, root->fs_info->extent_root,
5736                                        num_bytes, data, CHUNK_ALLOC_FORCE);
5737                         if (num_bytes == min_alloc_size)
5738                                 final_tried = true;
5739                         goto again;
5740                 } else if (btrfs_test_opt(root, ENOSPC_DEBUG)) {
5741                         struct btrfs_space_info *sinfo;
5742
5743                         sinfo = __find_space_info(root->fs_info, data);
5744                         printk(KERN_ERR "btrfs allocation failed flags %llu, "
5745                                "wanted %llu\n", (unsigned long long)data,
5746                                (unsigned long long)num_bytes);
5747                         dump_space_info(sinfo, num_bytes, 1);
5748                 }
5749         }
5750
5751         trace_btrfs_reserved_extent_alloc(root, ins->objectid, ins->offset);
5752
5753         return ret;
5754 }
5755
5756 static int __btrfs_free_reserved_extent(struct btrfs_root *root,
5757                                         u64 start, u64 len, int pin)
5758 {
5759         struct btrfs_block_group_cache *cache;
5760         int ret = 0;
5761
5762         cache = btrfs_lookup_block_group(root->fs_info, start);
5763         if (!cache) {
5764                 printk(KERN_ERR "Unable to find block group for %llu\n",
5765                        (unsigned long long)start);
5766                 return -ENOSPC;
5767         }
5768
5769         if (btrfs_test_opt(root, DISCARD))
5770                 ret = btrfs_discard_extent(root, start, len, NULL);
5771
5772         if (pin)
5773                 pin_down_extent(root, cache, start, len, 1);
5774         else {
5775                 btrfs_add_free_space(cache, start, len);
5776                 btrfs_update_reserved_bytes(cache, len, RESERVE_FREE);
5777         }
5778         btrfs_put_block_group(cache);
5779
5780         trace_btrfs_reserved_extent_free(root, start, len);
5781
5782         return ret;
5783 }
5784
5785 int btrfs_free_reserved_extent(struct btrfs_root *root,
5786                                         u64 start, u64 len)
5787 {
5788         return __btrfs_free_reserved_extent(root, start, len, 0);
5789 }
5790
5791 int btrfs_free_and_pin_reserved_extent(struct btrfs_root *root,
5792                                        u64 start, u64 len)
5793 {
5794         return __btrfs_free_reserved_extent(root, start, len, 1);
5795 }
5796
5797 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5798                                       struct btrfs_root *root,
5799                                       u64 parent, u64 root_objectid,
5800                                       u64 flags, u64 owner, u64 offset,
5801                                       struct btrfs_key *ins, int ref_mod)
5802 {
5803         int ret;
5804         struct btrfs_fs_info *fs_info = root->fs_info;
5805         struct btrfs_extent_item *extent_item;
5806         struct btrfs_extent_inline_ref *iref;
5807         struct btrfs_path *path;
5808         struct extent_buffer *leaf;
5809         int type;
5810         u32 size;
5811
5812         if (parent > 0)
5813                 type = BTRFS_SHARED_DATA_REF_KEY;
5814         else
5815                 type = BTRFS_EXTENT_DATA_REF_KEY;
5816
5817         size = sizeof(*extent_item) + btrfs_extent_inline_ref_size(type);
5818
5819         path = btrfs_alloc_path();
5820         if (!path)
5821                 return -ENOMEM;
5822
5823         path->leave_spinning = 1;
5824         ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5825                                       ins, size);
5826         BUG_ON(ret);
5827
5828         leaf = path->nodes[0];
5829         extent_item = btrfs_item_ptr(leaf, path->slots[0],
5830                                      struct btrfs_extent_item);
5831         btrfs_set_extent_refs(leaf, extent_item, ref_mod);
5832         btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5833         btrfs_set_extent_flags(leaf, extent_item,
5834                                flags | BTRFS_EXTENT_FLAG_DATA);
5835
5836         iref = (struct btrfs_extent_inline_ref *)(extent_item + 1);
5837         btrfs_set_extent_inline_ref_type(leaf, iref, type);
5838         if (parent > 0) {
5839                 struct btrfs_shared_data_ref *ref;
5840                 ref = (struct btrfs_shared_data_ref *)(iref + 1);
5841                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5842                 btrfs_set_shared_data_ref_count(leaf, ref, ref_mod);
5843         } else {
5844                 struct btrfs_extent_data_ref *ref;
5845                 ref = (struct btrfs_extent_data_ref *)(&iref->offset);
5846                 btrfs_set_extent_data_ref_root(leaf, ref, root_objectid);
5847                 btrfs_set_extent_data_ref_objectid(leaf, ref, owner);
5848                 btrfs_set_extent_data_ref_offset(leaf, ref, offset);
5849                 btrfs_set_extent_data_ref_count(leaf, ref, ref_mod);
5850         }
5851
5852         btrfs_mark_buffer_dirty(path->nodes[0]);
5853         btrfs_free_path(path);
5854
5855         ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5856         if (ret) {
5857                 printk(KERN_ERR "btrfs update block group failed for %llu "
5858                        "%llu\n", (unsigned long long)ins->objectid,
5859                        (unsigned long long)ins->offset);
5860                 BUG();
5861         }
5862         return ret;
5863 }
5864
5865 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
5866                                      struct btrfs_root *root,
5867                                      u64 parent, u64 root_objectid,
5868                                      u64 flags, struct btrfs_disk_key *key,
5869                                      int level, struct btrfs_key *ins)
5870 {
5871         int ret;
5872         struct btrfs_fs_info *fs_info = root->fs_info;
5873         struct btrfs_extent_item *extent_item;
5874         struct btrfs_tree_block_info *block_info;
5875         struct btrfs_extent_inline_ref *iref;
5876         struct btrfs_path *path;
5877         struct extent_buffer *leaf;
5878         u32 size = sizeof(*extent_item) + sizeof(*block_info) + sizeof(*iref);
5879
5880         path = btrfs_alloc_path();
5881         if (!path)
5882                 return -ENOMEM;
5883
5884         path->leave_spinning = 1;
5885         ret = btrfs_insert_empty_item(trans, fs_info->extent_root, path,
5886                                       ins, size);
5887         BUG_ON(ret);
5888
5889         leaf = path->nodes[0];
5890         extent_item = btrfs_item_ptr(leaf, path->slots[0],
5891                                      struct btrfs_extent_item);
5892         btrfs_set_extent_refs(leaf, extent_item, 1);
5893         btrfs_set_extent_generation(leaf, extent_item, trans->transid);
5894         btrfs_set_extent_flags(leaf, extent_item,
5895                                flags | BTRFS_EXTENT_FLAG_TREE_BLOCK);
5896         block_info = (struct btrfs_tree_block_info *)(extent_item + 1);
5897
5898         btrfs_set_tree_block_key(leaf, block_info, key);
5899         btrfs_set_tree_block_level(leaf, block_info, level);
5900
5901         iref = (struct btrfs_extent_inline_ref *)(block_info + 1);
5902         if (parent > 0) {
5903                 BUG_ON(!(flags & BTRFS_BLOCK_FLAG_FULL_BACKREF));
5904                 btrfs_set_extent_inline_ref_type(leaf, iref,
5905                                                  BTRFS_SHARED_BLOCK_REF_KEY);
5906                 btrfs_set_extent_inline_ref_offset(leaf, iref, parent);
5907         } else {
5908                 btrfs_set_extent_inline_ref_type(leaf, iref,
5909                                                  BTRFS_TREE_BLOCK_REF_KEY);
5910                 btrfs_set_extent_inline_ref_offset(leaf, iref, root_objectid);
5911         }
5912
5913         btrfs_mark_buffer_dirty(leaf);
5914         btrfs_free_path(path);
5915
5916         ret = update_block_group(trans, root, ins->objectid, ins->offset, 1);
5917         if (ret) {
5918                 printk(KERN_ERR "btrfs update block group failed for %llu "
5919                        "%llu\n", (unsigned long long)ins->objectid,
5920                        (unsigned long long)ins->offset);
5921                 BUG();
5922         }
5923         return ret;
5924 }
5925
5926 int btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
5927                                      struct btrfs_root *root,
5928                                      u64 root_objectid, u64 owner,
5929                                      u64 offset, struct btrfs_key *ins)
5930 {
5931         int ret;
5932
5933         BUG_ON(root_objectid == BTRFS_TREE_LOG_OBJECTID);
5934
5935         ret = btrfs_add_delayed_data_ref(root->fs_info, trans, ins->objectid,
5936                                          ins->offset, 0,
5937                                          root_objectid, owner, offset,
5938                                          BTRFS_ADD_DELAYED_EXTENT, NULL, 0);
5939         return ret;
5940 }
5941
5942 /*
5943  * this is used by the tree logging recovery code.  It records that
5944  * an extent has been allocated and makes sure to clear the free
5945  * space cache bits as well
5946  */
5947 int btrfs_alloc_logged_file_extent(struct btrfs_trans_handle *trans,
5948                                    struct btrfs_root *root,
5949                                    u64 root_objectid, u64 owner, u64 offset,
5950                                    struct btrfs_key *ins)
5951 {
5952         int ret;
5953         struct btrfs_block_group_cache *block_group;
5954         struct btrfs_caching_control *caching_ctl;
5955         u64 start = ins->objectid;
5956         u64 num_bytes = ins->offset;
5957
5958         block_group = btrfs_lookup_block_group(root->fs_info, ins->objectid);
5959         cache_block_group(block_group, trans, NULL, 0);
5960         caching_ctl = get_caching_control(block_group);
5961
5962         if (!caching_ctl) {
5963                 BUG_ON(!block_group_cache_done(block_group));
5964                 ret = btrfs_remove_free_space(block_group, start, num_bytes);
5965                 BUG_ON(ret);
5966         } else {
5967                 mutex_lock(&caching_ctl->mutex);
5968
5969                 if (start >= caching_ctl->progress) {
5970                         ret = add_excluded_extent(root, start, num_bytes);
5971                         BUG_ON(ret);
5972                 } else if (start + num_bytes <= caching_ctl->progress) {
5973                         ret = btrfs_remove_free_space(block_group,
5974                                                       start, num_bytes);
5975                         BUG_ON(ret);
5976                 } else {
5977                         num_bytes = caching_ctl->progress - start;
5978                         ret = btrfs_remove_free_space(block_group,
5979                                                       start, num_bytes);
5980                         BUG_ON(ret);
5981
5982                         start = caching_ctl->progress;
5983                         num_bytes = ins->objectid + ins->offset -
5984                                     caching_ctl->progress;
5985                         ret = add_excluded_extent(root, start, num_bytes);
5986                         BUG_ON(ret);
5987                 }
5988
5989                 mutex_unlock(&caching_ctl->mutex);
5990                 put_caching_control(caching_ctl);
5991         }
5992
5993         ret = btrfs_update_reserved_bytes(block_group, ins->offset,
5994                                           RESERVE_ALLOC_NO_ACCOUNT);
5995         BUG_ON(ret);
5996         btrfs_put_block_group(block_group);
5997         ret = alloc_reserved_file_extent(trans, root, 0, root_objectid,
5998                                          0, owner, offset, ins, 1);
5999         return ret;
6000 }
6001
6002 struct extent_buffer *btrfs_init_new_buffer(struct btrfs_trans_handle *trans,
6003                                             struct btrfs_root *root,
6004                                             u64 bytenr, u32 blocksize,
6005                                             int level)
6006 {
6007         struct extent_buffer *buf;
6008
6009         buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
6010         if (!buf)
6011                 return ERR_PTR(-ENOMEM);
6012         btrfs_set_header_generation(buf, trans->transid);
6013         btrfs_set_buffer_lockdep_class(root->root_key.objectid, buf, level);
6014         btrfs_tree_lock(buf);
6015         clean_tree_block(trans, root, buf);
6016         clear_bit(EXTENT_BUFFER_STALE, &buf->bflags);
6017
6018         btrfs_set_lock_blocking(buf);
6019         btrfs_set_buffer_uptodate(buf);
6020
6021         if (root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID) {
6022                 /*
6023                  * we allow two log transactions at a time, use different
6024                  * EXENT bit to differentiate dirty pages.
6025                  */
6026                 if (root->log_transid % 2 == 0)
6027                         set_extent_dirty(&root->dirty_log_pages, buf->start,
6028                                         buf->start + buf->len - 1, GFP_NOFS);
6029                 else
6030                         set_extent_new(&root->dirty_log_pages, buf->start,
6031                                         buf->start + buf->len - 1, GFP_NOFS);
6032         } else {
6033                 set_extent_dirty(&trans->transaction->dirty_pages, buf->start,
6034                          buf->start + buf->len - 1, GFP_NOFS);
6035         }
6036         trans->blocks_used++;
6037         /* this returns a buffer locked for blocking */
6038         return buf;
6039 }
6040
6041 static struct btrfs_block_rsv *
6042 use_block_rsv(struct btrfs_trans_handle *trans,
6043               struct btrfs_root *root, u32 blocksize)
6044 {
6045         struct btrfs_block_rsv *block_rsv;
6046         struct btrfs_block_rsv *global_rsv = &root->fs_info->global_block_rsv;
6047         int ret;
6048
6049         block_rsv = get_block_rsv(trans, root);
6050
6051         if (block_rsv->size == 0) {
6052                 ret = reserve_metadata_bytes(root, block_rsv, blocksize, 0);
6053                 /*
6054                  * If we couldn't reserve metadata bytes try and use some from
6055                  * the global reserve.
6056                  */
6057                 if (ret && block_rsv != global_rsv) {
6058                         ret = block_rsv_use_bytes(global_rsv, blocksize);
6059                         if (!ret)
6060                                 return global_rsv;
6061                         return ERR_PTR(ret);
6062                 } else if (ret) {
6063                         return ERR_PTR(ret);
6064                 }
6065                 return block_rsv;
6066         }
6067
6068         ret = block_rsv_use_bytes(block_rsv, blocksize);
6069         if (!ret)
6070                 return block_rsv;
6071         if (ret) {
6072                 static DEFINE_RATELIMIT_STATE(_rs,
6073                                 DEFAULT_RATELIMIT_INTERVAL,
6074                                 /*DEFAULT_RATELIMIT_BURST*/ 2);
6075                 if (__ratelimit(&_rs)) {
6076                         printk(KERN_DEBUG "btrfs: block rsv returned %d\n", ret);
6077                         WARN_ON(1);
6078                 }
6079                 ret = reserve_metadata_bytes(root, block_rsv, blocksize, 0);
6080                 if (!ret) {
6081                         return block_rsv;
6082                 } else if (ret && block_rsv != global_rsv) {
6083                         ret = block_rsv_use_bytes(global_rsv, blocksize);
6084                         if (!ret)
6085                                 return global_rsv;
6086                 }
6087         }
6088
6089         return ERR_PTR(-ENOSPC);
6090 }
6091
6092 static void unuse_block_rsv(struct btrfs_fs_info *fs_info,
6093                             struct btrfs_block_rsv *block_rsv, u32 blocksize)
6094 {
6095         block_rsv_add_bytes(block_rsv, blocksize, 0);
6096         block_rsv_release_bytes(fs_info, block_rsv, NULL, 0);
6097 }
6098
6099 /*
6100  * finds a free extent and does all the dirty work required for allocation
6101  * returns the key for the extent through ins, and a tree buffer for
6102  * the first block of the extent through buf.
6103  *
6104  * returns the tree buffer or NULL.
6105  */
6106 struct extent_buffer *btrfs_alloc_free_block(struct btrfs_trans_handle *trans,
6107                                         struct btrfs_root *root, u32 blocksize,
6108                                         u64 parent, u64 root_objectid,
6109                                         struct btrfs_disk_key *key, int level,
6110                                         u64 hint, u64 empty_size, int for_cow)
6111 {
6112         struct btrfs_key ins;
6113         struct btrfs_block_rsv *block_rsv;
6114         struct extent_buffer *buf;
6115         u64 flags = 0;
6116         int ret;
6117
6118
6119         block_rsv = use_block_rsv(trans, root, blocksize);
6120         if (IS_ERR(block_rsv))
6121                 return ERR_CAST(block_rsv);
6122
6123         ret = btrfs_reserve_extent(trans, root, blocksize, blocksize,
6124                                    empty_size, hint, &ins, 0);
6125         if (ret) {
6126                 unuse_block_rsv(root->fs_info, block_rsv, blocksize);
6127                 return ERR_PTR(ret);
6128         }
6129
6130         buf = btrfs_init_new_buffer(trans, root, ins.objectid,
6131                                     blocksize, level);
6132         BUG_ON(IS_ERR(buf));
6133
6134         if (root_objectid == BTRFS_TREE_RELOC_OBJECTID) {
6135                 if (parent == 0)
6136                         parent = ins.objectid;
6137                 flags |= BTRFS_BLOCK_FLAG_FULL_BACKREF;
6138         } else
6139                 BUG_ON(parent > 0);
6140
6141         if (root_objectid != BTRFS_TREE_LOG_OBJECTID) {
6142                 struct btrfs_delayed_extent_op *extent_op;
6143                 extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
6144                 BUG_ON(!extent_op);
6145                 if (key)
6146                         memcpy(&extent_op->key, key, sizeof(extent_op->key));
6147                 else
6148                         memset(&extent_op->key, 0, sizeof(extent_op->key));
6149                 extent_op->flags_to_set = flags;
6150                 extent_op->update_key = 1;
6151                 extent_op->update_flags = 1;
6152                 extent_op->is_data = 0;
6153
6154                 ret = btrfs_add_delayed_tree_ref(root->fs_info, trans,
6155                                         ins.objectid,
6156                                         ins.offset, parent, root_objectid,
6157                                         level, BTRFS_ADD_DELAYED_EXTENT,
6158                                         extent_op, for_cow);
6159                 BUG_ON(ret);
6160         }
6161         return buf;
6162 }
6163
6164 struct walk_control {
6165         u64 refs[BTRFS_MAX_LEVEL];
6166         u64 flags[BTRFS_MAX_LEVEL];
6167         struct btrfs_key update_progress;
6168         int stage;
6169         int level;
6170         int shared_level;
6171         int update_ref;
6172         int keep_locks;
6173         int reada_slot;
6174         int reada_count;
6175         int for_reloc;
6176 };
6177
6178 #define DROP_REFERENCE  1
6179 #define UPDATE_BACKREF  2
6180
6181 static noinline void reada_walk_down(struct btrfs_trans_handle *trans,
6182                                      struct btrfs_root *root,
6183                                      struct walk_control *wc,
6184                                      struct btrfs_path *path)
6185 {
6186         u64 bytenr;
6187         u64 generation;
6188         u64 refs;
6189         u64 flags;
6190         u32 nritems;
6191         u32 blocksize;
6192         struct btrfs_key key;
6193         struct extent_buffer *eb;
6194         int ret;
6195         int slot;
6196         int nread = 0;
6197
6198         if (path->slots[wc->level] < wc->reada_slot) {
6199                 wc->reada_count = wc->reada_count * 2 / 3;
6200                 wc->reada_count = max(wc->reada_count, 2);
6201         } else {
6202                 wc->reada_count = wc->reada_count * 3 / 2;
6203                 wc->reada_count = min_t(int, wc->reada_count,
6204                                         BTRFS_NODEPTRS_PER_BLOCK(root));
6205         }
6206
6207         eb = path->nodes[wc->level];
6208         nritems = btrfs_header_nritems(eb);
6209         blocksize = btrfs_level_size(root, wc->level - 1);
6210
6211         for (slot = path->slots[wc->level]; slot < nritems; slot++) {
6212                 if (nread >= wc->reada_count)
6213                         break;
6214
6215                 cond_resched();
6216                 bytenr = btrfs_node_blockptr(eb, slot);
6217                 generation = btrfs_node_ptr_generation(eb, slot);
6218
6219                 if (slot == path->slots[wc->level])
6220                         goto reada;
6221
6222                 if (wc->stage == UPDATE_BACKREF &&
6223                     generation <= root->root_key.offset)
6224                         continue;
6225
6226                 /* We don't lock the tree block, it's OK to be racy here */
6227                 ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize,
6228                                                &refs, &flags);
6229                 BUG_ON(ret);
6230                 BUG_ON(refs == 0);
6231
6232                 if (wc->stage == DROP_REFERENCE) {
6233                         if (refs == 1)
6234                                 goto reada;
6235
6236                         if (wc->level == 1 &&
6237                             (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6238                                 continue;
6239                         if (!wc->update_ref ||
6240                             generation <= root->root_key.offset)
6241                                 continue;
6242                         btrfs_node_key_to_cpu(eb, &key, slot);
6243                         ret = btrfs_comp_cpu_keys(&key,
6244                                                   &wc->update_progress);
6245                         if (ret < 0)
6246                                 continue;
6247                 } else {
6248                         if (wc->level == 1 &&
6249                             (flags & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6250                                 continue;
6251                 }
6252 reada:
6253                 ret = readahead_tree_block(root, bytenr, blocksize,
6254                                            generation);
6255                 if (ret)
6256                         break;
6257                 nread++;
6258         }
6259         wc->reada_slot = slot;
6260 }
6261
6262 /*
6263  * hepler to process tree block while walking down the tree.
6264  *
6265  * when wc->stage == UPDATE_BACKREF, this function updates
6266  * back refs for pointers in the block.
6267  *
6268  * NOTE: return value 1 means we should stop walking down.
6269  */
6270 static noinline int walk_down_proc(struct btrfs_trans_handle *trans,
6271                                    struct btrfs_root *root,
6272                                    struct btrfs_path *path,
6273                                    struct walk_control *wc, int lookup_info)
6274 {
6275         int level = wc->level;
6276         struct extent_buffer *eb = path->nodes[level];
6277         u64 flag = BTRFS_BLOCK_FLAG_FULL_BACKREF;
6278         int ret;
6279
6280         if (wc->stage == UPDATE_BACKREF &&
6281             btrfs_header_owner(eb) != root->root_key.objectid)
6282                 return 1;
6283
6284         /*
6285          * when reference count of tree block is 1, it won't increase
6286          * again. once full backref flag is set, we never clear it.
6287          */
6288         if (lookup_info &&
6289             ((wc->stage == DROP_REFERENCE && wc->refs[level] != 1) ||
6290              (wc->stage == UPDATE_BACKREF && !(wc->flags[level] & flag)))) {
6291                 BUG_ON(!path->locks[level]);
6292                 ret = btrfs_lookup_extent_info(trans, root,
6293                                                eb->start, eb->len,
6294                                                &wc->refs[level],
6295                                                &wc->flags[level]);
6296                 BUG_ON(ret);
6297                 BUG_ON(wc->refs[level] == 0);
6298         }
6299
6300         if (wc->stage == DROP_REFERENCE) {
6301                 if (wc->refs[level] > 1)
6302                         return 1;
6303
6304                 if (path->locks[level] && !wc->keep_locks) {
6305                         btrfs_tree_unlock_rw(eb, path->locks[level]);
6306                         path->locks[level] = 0;
6307                 }
6308                 return 0;
6309         }
6310
6311         /* wc->stage == UPDATE_BACKREF */
6312         if (!(wc->flags[level] & flag)) {
6313                 BUG_ON(!path->locks[level]);
6314                 ret = btrfs_inc_ref(trans, root, eb, 1, wc->for_reloc);
6315                 BUG_ON(ret);
6316                 ret = btrfs_dec_ref(trans, root, eb, 0, wc->for_reloc);
6317                 BUG_ON(ret);
6318                 ret = btrfs_set_disk_extent_flags(trans, root, eb->start,
6319                                                   eb->len, flag, 0);
6320                 BUG_ON(ret);
6321                 wc->flags[level] |= flag;
6322         }
6323
6324         /*
6325          * the block is shared by multiple trees, so it's not good to
6326          * keep the tree lock
6327          */
6328         if (path->locks[level] && level > 0) {
6329                 btrfs_tree_unlock_rw(eb, path->locks[level]);
6330                 path->locks[level] = 0;
6331         }
6332         return 0;
6333 }
6334
6335 /*
6336  * hepler to process tree block pointer.
6337  *
6338  * when wc->stage == DROP_REFERENCE, this function checks
6339  * reference count of the block pointed to. if the block
6340  * is shared and we need update back refs for the subtree
6341  * rooted at the block, this function changes wc->stage to
6342  * UPDATE_BACKREF. if the block is shared and there is no
6343  * need to update back, this function drops the reference
6344  * to the block.
6345  *
6346  * NOTE: return value 1 means we should stop walking down.
6347  */
6348 static noinline int do_walk_down(struct btrfs_trans_handle *trans,
6349                                  struct btrfs_root *root,
6350                                  struct btrfs_path *path,
6351                                  struct walk_control *wc, int *lookup_info)
6352 {
6353         u64 bytenr;
6354         u64 generation;
6355         u64 parent;
6356         u32 blocksize;
6357         struct btrfs_key key;
6358         struct extent_buffer *next;
6359         int level = wc->level;
6360         int reada = 0;
6361         int ret = 0;
6362
6363         generation = btrfs_node_ptr_generation(path->nodes[level],
6364                                                path->slots[level]);
6365         /*
6366          * if the lower level block was created before the snapshot
6367          * was created, we know there is no need to update back refs
6368          * for the subtree
6369          */
6370         if (wc->stage == UPDATE_BACKREF &&
6371             generation <= root->root_key.offset) {
6372                 *lookup_info = 1;
6373                 return 1;
6374         }
6375
6376         bytenr = btrfs_node_blockptr(path->nodes[level], path->slots[level]);
6377         blocksize = btrfs_level_size(root, level - 1);
6378
6379         next = btrfs_find_tree_block(root, bytenr, blocksize);
6380         if (!next) {
6381                 next = btrfs_find_create_tree_block(root, bytenr, blocksize);
6382                 if (!next)
6383                         return -ENOMEM;
6384                 reada = 1;
6385         }
6386         btrfs_tree_lock(next);
6387         btrfs_set_lock_blocking(next);
6388
6389         ret = btrfs_lookup_extent_info(trans, root, bytenr, blocksize,
6390                                        &wc->refs[level - 1],
6391                                        &wc->flags[level - 1]);
6392         BUG_ON(ret);
6393         BUG_ON(wc->refs[level - 1] == 0);
6394         *lookup_info = 0;
6395
6396         if (wc->stage == DROP_REFERENCE) {
6397                 if (wc->refs[level - 1] > 1) {
6398                         if (level == 1 &&
6399                             (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6400                                 goto skip;
6401
6402                         if (!wc->update_ref ||
6403                             generation <= root->root_key.offset)
6404                                 goto skip;
6405
6406                         btrfs_node_key_to_cpu(path->nodes[level], &key,
6407                                               path->slots[level]);
6408                         ret = btrfs_comp_cpu_keys(&key, &wc->update_progress);
6409                         if (ret < 0)
6410                                 goto skip;
6411
6412                         wc->stage = UPDATE_BACKREF;
6413                         wc->shared_level = level - 1;
6414                 }
6415         } else {
6416                 if (level == 1 &&
6417                     (wc->flags[0] & BTRFS_BLOCK_FLAG_FULL_BACKREF))
6418                         goto skip;
6419         }
6420
6421         if (!btrfs_buffer_uptodate(next, generation)) {
6422                 btrfs_tree_unlock(next);
6423                 free_extent_buffer(next);
6424                 next = NULL;
6425                 *lookup_info = 1;
6426         }
6427
6428         if (!next) {
6429                 if (reada && level == 1)
6430                         reada_walk_down(trans, root, wc, path);
6431                 next = read_tree_block(root, bytenr, blocksize, generation);
6432                 if (!next)
6433                         return -EIO;
6434                 btrfs_tree_lock(next);
6435                 btrfs_set_lock_blocking(next);
6436         }
6437
6438         level--;
6439         BUG_ON(level != btrfs_header_level(next));
6440         path->nodes[level] = next;
6441         path->slots[level] = 0;
6442         path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6443         wc->level = level;
6444         if (wc->level == 1)
6445                 wc->reada_slot = 0;
6446         return 0;
6447 skip:
6448         wc->refs[level - 1] = 0;
6449         wc->flags[level - 1] = 0;
6450         if (wc->stage == DROP_REFERENCE) {
6451                 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF) {
6452                         parent = path->nodes[level]->start;
6453                 } else {
6454                         BUG_ON(root->root_key.objectid !=
6455                                btrfs_header_owner(path->nodes[level]));
6456                         parent = 0;
6457                 }
6458
6459                 ret = btrfs_free_extent(trans, root, bytenr, blocksize, parent,
6460                                 root->root_key.objectid, level - 1, 0, 0);
6461                 BUG_ON(ret);
6462         }
6463         btrfs_tree_unlock(next);
6464         free_extent_buffer(next);
6465         *lookup_info = 1;
6466         return 1;
6467 }
6468
6469 /*
6470  * hepler to process tree block while walking up the tree.
6471  *
6472  * when wc->stage == DROP_REFERENCE, this function drops
6473  * reference count on the block.
6474  *
6475  * when wc->stage == UPDATE_BACKREF, this function changes
6476  * wc->stage back to DROP_REFERENCE if we changed wc->stage
6477  * to UPDATE_BACKREF previously while processing the block.
6478  *
6479  * NOTE: return value 1 means we should stop walking up.
6480  */
6481 static noinline int walk_up_proc(struct btrfs_trans_handle *trans,
6482                                  struct btrfs_root *root,
6483                                  struct btrfs_path *path,
6484                                  struct walk_control *wc)
6485 {
6486         int ret;
6487         int level = wc->level;
6488         struct extent_buffer *eb = path->nodes[level];
6489         u64 parent = 0;
6490
6491         if (wc->stage == UPDATE_BACKREF) {
6492                 BUG_ON(wc->shared_level < level);
6493                 if (level < wc->shared_level)
6494                         goto out;
6495
6496                 ret = find_next_key(path, level + 1, &wc->update_progress);
6497                 if (ret > 0)
6498                         wc->update_ref = 0;
6499
6500                 wc->stage = DROP_REFERENCE;
6501                 wc->shared_level = -1;
6502                 path->slots[level] = 0;
6503
6504                 /*
6505                  * check reference count again if the block isn't locked.
6506                  * we should start walking down the tree again if reference
6507                  * count is one.
6508                  */
6509                 if (!path->locks[level]) {
6510                         BUG_ON(level == 0);
6511                         btrfs_tree_lock(eb);
6512                         btrfs_set_lock_blocking(eb);
6513                         path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6514
6515                         ret = btrfs_lookup_extent_info(trans, root,
6516                                                        eb->start, eb->len,
6517                                                        &wc->refs[level],
6518                                                        &wc->flags[level]);
6519                         BUG_ON(ret);
6520                         BUG_ON(wc->refs[level] == 0);
6521                         if (wc->refs[level] == 1) {
6522                                 btrfs_tree_unlock_rw(eb, path->locks[level]);
6523                                 return 1;
6524                         }
6525                 }
6526         }
6527
6528         /* wc->stage == DROP_REFERENCE */
6529         BUG_ON(wc->refs[level] > 1 && !path->locks[level]);
6530
6531         if (wc->refs[level] == 1) {
6532                 if (level == 0) {
6533                         if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6534                                 ret = btrfs_dec_ref(trans, root, eb, 1,
6535                                                     wc->for_reloc);
6536                         else
6537                                 ret = btrfs_dec_ref(trans, root, eb, 0,
6538                                                     wc->for_reloc);
6539                         BUG_ON(ret);
6540                 }
6541                 /* make block locked assertion in clean_tree_block happy */
6542                 if (!path->locks[level] &&
6543                     btrfs_header_generation(eb) == trans->transid) {
6544                         btrfs_tree_lock(eb);
6545                         btrfs_set_lock_blocking(eb);
6546                         path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6547                 }
6548                 clean_tree_block(trans, root, eb);
6549         }
6550
6551         if (eb == root->node) {
6552                 if (wc->flags[level] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6553                         parent = eb->start;
6554                 else
6555                         BUG_ON(root->root_key.objectid !=
6556                                btrfs_header_owner(eb));
6557         } else {
6558                 if (wc->flags[level + 1] & BTRFS_BLOCK_FLAG_FULL_BACKREF)
6559                         parent = path->nodes[level + 1]->start;
6560                 else
6561                         BUG_ON(root->root_key.objectid !=
6562                                btrfs_header_owner(path->nodes[level + 1]));
6563         }
6564
6565         btrfs_free_tree_block(trans, root, eb, parent, wc->refs[level] == 1, 0);
6566 out:
6567         wc->refs[level] = 0;
6568         wc->flags[level] = 0;
6569         return 0;
6570 }
6571
6572 static noinline int walk_down_tree(struct btrfs_trans_handle *trans,
6573                                    struct btrfs_root *root,
6574                                    struct btrfs_path *path,
6575                                    struct walk_control *wc)
6576 {
6577         int level = wc->level;
6578         int lookup_info = 1;
6579         int ret;
6580
6581         while (level >= 0) {
6582                 ret = walk_down_proc(trans, root, path, wc, lookup_info);
6583                 if (ret > 0)
6584                         break;
6585
6586                 if (level == 0)
6587                         break;
6588
6589                 if (path->slots[level] >=
6590                     btrfs_header_nritems(path->nodes[level]))
6591                         break;
6592
6593                 ret = do_walk_down(trans, root, path, wc, &lookup_info);
6594                 if (ret > 0) {
6595                         path->slots[level]++;
6596                         continue;
6597                 } else if (ret < 0)
6598                         return ret;
6599                 level = wc->level;
6600         }
6601         return 0;
6602 }
6603
6604 static noinline int walk_up_tree(struct btrfs_trans_handle *trans,
6605                                  struct btrfs_root *root,
6606                                  struct btrfs_path *path,
6607                                  struct walk_control *wc, int max_level)
6608 {
6609         int level = wc->level;
6610         int ret;
6611
6612         path->slots[level] = btrfs_header_nritems(path->nodes[level]);
6613         while (level < max_level && path->nodes[level]) {
6614                 wc->level = level;
6615                 if (path->slots[level] + 1 <
6616                     btrfs_header_nritems(path->nodes[level])) {
6617                         path->slots[level]++;
6618                         return 0;
6619                 } else {
6620                         ret = walk_up_proc(trans, root, path, wc);
6621                         if (ret > 0)
6622                                 return 0;
6623
6624                         if (path->locks[level]) {
6625                                 btrfs_tree_unlock_rw(path->nodes[level],
6626                                                      path->locks[level]);
6627                                 path->locks[level] = 0;
6628                         }
6629                         free_extent_buffer(path->nodes[level]);
6630                         path->nodes[level] = NULL;
6631                         level++;
6632                 }
6633         }
6634         return 1;
6635 }
6636
6637 /*
6638  * drop a subvolume tree.
6639  *
6640  * this function traverses the tree freeing any blocks that only
6641  * referenced by the tree.
6642  *
6643  * when a shared tree block is found. this function decreases its
6644  * reference count by one. if update_ref is true, this function
6645  * also make sure backrefs for the shared block and all lower level
6646  * blocks are properly updated.
6647  */
6648 void btrfs_drop_snapshot(struct btrfs_root *root,
6649                          struct btrfs_block_rsv *block_rsv, int update_ref,
6650                          int for_reloc)
6651 {
6652         struct btrfs_path *path;
6653         struct btrfs_trans_handle *trans;
6654         struct btrfs_root *tree_root = root->fs_info->tree_root;
6655         struct btrfs_root_item *root_item = &root->root_item;
6656         struct walk_control *wc;
6657         struct btrfs_key key;
6658         int err = 0;
6659         int ret;
6660         int level;
6661
6662         path = btrfs_alloc_path();
6663         if (!path) {
6664                 err = -ENOMEM;
6665                 goto out;
6666         }
6667
6668         wc = kzalloc(sizeof(*wc), GFP_NOFS);
6669         if (!wc) {
6670                 btrfs_free_path(path);
6671                 err = -ENOMEM;
6672                 goto out;
6673         }
6674
6675         trans = btrfs_start_transaction(tree_root, 0);
6676         BUG_ON(IS_ERR(trans));
6677
6678         if (block_rsv)
6679                 trans->block_rsv = block_rsv;
6680
6681         if (btrfs_disk_key_objectid(&root_item->drop_progress) == 0) {
6682                 level = btrfs_header_level(root->node);
6683                 path->nodes[level] = btrfs_lock_root_node(root);
6684                 btrfs_set_lock_blocking(path->nodes[level]);
6685                 path->slots[level] = 0;
6686                 path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6687                 memset(&wc->update_progress, 0,
6688                        sizeof(wc->update_progress));
6689         } else {
6690                 btrfs_disk_key_to_cpu(&key, &root_item->drop_progress);
6691                 memcpy(&wc->update_progress, &key,
6692                        sizeof(wc->update_progress));
6693
6694                 level = root_item->drop_level;
6695                 BUG_ON(level == 0);
6696                 path->lowest_level = level;
6697                 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
6698                 path->lowest_level = 0;
6699                 if (ret < 0) {
6700                         err = ret;
6701                         goto out_free;
6702                 }
6703                 WARN_ON(ret > 0);
6704
6705                 /*
6706                  * unlock our path, this is safe because only this
6707                  * function is allowed to delete this snapshot
6708                  */
6709                 btrfs_unlock_up_safe(path, 0);
6710
6711                 level = btrfs_header_level(root->node);
6712                 while (1) {
6713                         btrfs_tree_lock(path->nodes[level]);
6714                         btrfs_set_lock_blocking(path->nodes[level]);
6715
6716                         ret = btrfs_lookup_extent_info(trans, root,
6717                                                 path->nodes[level]->start,
6718                                                 path->nodes[level]->len,
6719                                                 &wc->refs[level],
6720                                                 &wc->flags[level]);
6721                         BUG_ON(ret);
6722                         BUG_ON(wc->refs[level] == 0);
6723
6724                         if (level == root_item->drop_level)
6725                                 break;
6726
6727                         btrfs_tree_unlock(path->nodes[level]);
6728                         WARN_ON(wc->refs[level] != 1);
6729                         level--;
6730                 }
6731         }
6732
6733         wc->level = level;
6734         wc->shared_level = -1;
6735         wc->stage = DROP_REFERENCE;
6736         wc->update_ref = update_ref;
6737         wc->keep_locks = 0;
6738         wc->for_reloc = for_reloc;
6739         wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root);
6740
6741         while (1) {
6742                 ret = walk_down_tree(trans, root, path, wc);
6743                 if (ret < 0) {
6744                         err = ret;
6745                         break;
6746                 }
6747
6748                 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL);
6749                 if (ret < 0) {
6750                         err = ret;
6751                         break;
6752                 }
6753
6754                 if (ret > 0) {
6755                         BUG_ON(wc->stage != DROP_REFERENCE);
6756                         break;
6757                 }
6758
6759                 if (wc->stage == DROP_REFERENCE) {
6760                         level = wc->level;
6761                         btrfs_node_key(path->nodes[level],
6762                                        &root_item->drop_progress,
6763                                        path->slots[level]);
6764                         root_item->drop_level = level;
6765                 }
6766
6767                 BUG_ON(wc->level == 0);
6768                 if (btrfs_should_end_transaction(trans, tree_root)) {
6769                         ret = btrfs_update_root(trans, tree_root,
6770                                                 &root->root_key,
6771                                                 root_item);
6772                         BUG_ON(ret);
6773
6774                         btrfs_end_transaction_throttle(trans, tree_root);
6775                         trans = btrfs_start_transaction(tree_root, 0);
6776                         BUG_ON(IS_ERR(trans));
6777                         if (block_rsv)
6778                                 trans->block_rsv = block_rsv;
6779                 }
6780         }
6781         btrfs_release_path(path);
6782         BUG_ON(err);
6783
6784         ret = btrfs_del_root(trans, tree_root, &root->root_key);
6785         BUG_ON(ret);
6786
6787         if (root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID) {
6788                 ret = btrfs_find_last_root(tree_root, root->root_key.objectid,
6789                                            NULL, NULL);
6790                 BUG_ON(ret < 0);
6791                 if (ret > 0) {
6792                         /* if we fail to delete the orphan item this time
6793                          * around, it'll get picked up the next time.
6794                          *
6795                          * The most common failure here is just -ENOENT.
6796                          */
6797                         btrfs_del_orphan_item(trans, tree_root,
6798                                               root->root_key.objectid);
6799                 }
6800         }
6801
6802         if (root->in_radix) {
6803                 btrfs_free_fs_root(tree_root->fs_info, root);
6804         } else {
6805                 free_extent_buffer(root->node);
6806                 free_extent_buffer(root->commit_root);
6807                 kfree(root);
6808         }
6809 out_free:
6810         btrfs_end_transaction_throttle(trans, tree_root);
6811         kfree(wc);
6812         btrfs_free_path(path);
6813 out:
6814         if (err)
6815                 btrfs_std_error(root->fs_info, err);
6816         return;
6817 }
6818
6819 /*
6820  * drop subtree rooted at tree block 'node'.
6821  *
6822  * NOTE: this function will unlock and release tree block 'node'
6823  * only used by relocation code
6824  */
6825 int btrfs_drop_subtree(struct btrfs_trans_handle *trans,
6826                         struct btrfs_root *root,
6827                         struct extent_buffer *node,
6828                         struct extent_buffer *parent)
6829 {
6830         struct btrfs_path *path;
6831         struct walk_control *wc;
6832         int level;
6833         int parent_level;
6834         int ret = 0;
6835         int wret;
6836
6837         BUG_ON(root->root_key.objectid != BTRFS_TREE_RELOC_OBJECTID);
6838
6839         path = btrfs_alloc_path();
6840         if (!path)
6841                 return -ENOMEM;
6842
6843         wc = kzalloc(sizeof(*wc), GFP_NOFS);
6844         if (!wc) {
6845                 btrfs_free_path(path);
6846                 return -ENOMEM;
6847         }
6848
6849         btrfs_assert_tree_locked(parent);
6850         parent_level = btrfs_header_level(parent);
6851         extent_buffer_get(parent);
6852         path->nodes[parent_level] = parent;
6853         path->slots[parent_level] = btrfs_header_nritems(parent);
6854
6855         btrfs_assert_tree_locked(node);
6856         level = btrfs_header_level(node);
6857         path->nodes[level] = node;
6858         path->slots[level] = 0;
6859         path->locks[level] = BTRFS_WRITE_LOCK_BLOCKING;
6860
6861         wc->refs[parent_level] = 1;
6862         wc->flags[parent_level] = BTRFS_BLOCK_FLAG_FULL_BACKREF;
6863         wc->level = level;
6864         wc->shared_level = -1;
6865         wc->stage = DROP_REFERENCE;
6866         wc->update_ref = 0;
6867         wc->keep_locks = 1;
6868         wc->for_reloc = 1;
6869         wc->reada_count = BTRFS_NODEPTRS_PER_BLOCK(root);
6870
6871         while (1) {
6872                 wret = walk_down_tree(trans, root, path, wc);
6873                 if (wret < 0) {
6874                         ret = wret;
6875                         break;
6876                 }
6877
6878                 wret = walk_up_tree(trans, root, path, wc, parent_level);
6879                 if (wret < 0)
6880                         ret = wret;
6881                 if (wret != 0)
6882                         break;
6883         }
6884
6885         kfree(wc);
6886         btrfs_free_path(path);
6887         return ret;
6888 }
6889
6890 static u64 update_block_group_flags(struct btrfs_root *root, u64 flags)
6891 {
6892         u64 num_devices;
6893         u64 stripped = BTRFS_BLOCK_GROUP_RAID0 |
6894                 BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10;
6895
6896         if (root->fs_info->balance_ctl) {
6897                 struct btrfs_balance_control *bctl = root->fs_info->balance_ctl;
6898                 u64 tgt = 0;
6899
6900                 /* pick restriper's target profile and return */
6901                 if (flags & BTRFS_BLOCK_GROUP_DATA &&
6902                     bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) {
6903                         tgt = BTRFS_BLOCK_GROUP_DATA | bctl->data.target;
6904                 } else if (flags & BTRFS_BLOCK_GROUP_SYSTEM &&
6905                            bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) {
6906                         tgt = BTRFS_BLOCK_GROUP_SYSTEM | bctl->sys.target;
6907                 } else if (flags & BTRFS_BLOCK_GROUP_METADATA &&
6908                            bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) {
6909                         tgt = BTRFS_BLOCK_GROUP_METADATA | bctl->meta.target;
6910                 }
6911
6912                 if (tgt)
6913                         return extended_to_chunk(tgt);
6914         }
6915
6916         /*
6917          * we add in the count of missing devices because we want
6918          * to make sure that any RAID levels on a degraded FS
6919          * continue to be honored.
6920          */
6921         num_devices = root->fs_info->fs_devices->rw_devices +
6922                 root->fs_info->fs_devices->missing_devices;
6923
6924         if (num_devices == 1) {
6925                 stripped |= BTRFS_BLOCK_GROUP_DUP;
6926                 stripped = flags & ~stripped;
6927
6928                 /* turn raid0 into single device chunks */
6929                 if (flags & BTRFS_BLOCK_GROUP_RAID0)
6930                         return stripped;
6931
6932                 /* turn mirroring into duplication */
6933                 if (flags & (BTRFS_BLOCK_GROUP_RAID1 |
6934                              BTRFS_BLOCK_GROUP_RAID10))
6935                         return stripped | BTRFS_BLOCK_GROUP_DUP;
6936         } else {
6937                 /* they already had raid on here, just return */
6938                 if (flags & stripped)
6939                         return flags;
6940
6941                 stripped |= BTRFS_BLOCK_GROUP_DUP;
6942                 stripped = flags & ~stripped;
6943
6944                 /* switch duplicated blocks with raid1 */
6945                 if (flags & BTRFS_BLOCK_GROUP_DUP)
6946                         return stripped | BTRFS_BLOCK_GROUP_RAID1;
6947
6948                 /* this is drive concat, leave it alone */
6949         }
6950
6951         return flags;
6952 }
6953
6954 static int set_block_group_ro(struct btrfs_block_group_cache *cache, int force)
6955 {
6956         struct btrfs_space_info *sinfo = cache->space_info;
6957         u64 num_bytes;
6958         u64 min_allocable_bytes;
6959         int ret = -ENOSPC;
6960
6961
6962         /*
6963          * We need some metadata space and system metadata space for
6964          * allocating chunks in some corner cases until we force to set
6965          * it to be readonly.
6966          */
6967         if ((sinfo->flags &
6968              (BTRFS_BLOCK_GROUP_SYSTEM | BTRFS_BLOCK_GROUP_METADATA)) &&
6969             !force)
6970                 min_allocable_bytes = 1 * 1024 * 1024;
6971         else
6972                 min_allocable_bytes = 0;
6973
6974         spin_lock(&sinfo->lock);
6975         spin_lock(&cache->lock);
6976
6977         if (cache->ro) {
6978                 ret = 0;
6979                 goto out;
6980         }
6981
6982         num_bytes = cache->key.offset - cache->reserved - cache->pinned -
6983                     cache->bytes_super - btrfs_block_group_used(&cache->item);
6984
6985         if (sinfo->bytes_used + sinfo->bytes_reserved + sinfo->bytes_pinned +
6986             sinfo->bytes_may_use + sinfo->bytes_readonly + num_bytes +
6987             min_allocable_bytes <= sinfo->total_bytes) {
6988                 sinfo->bytes_readonly += num_bytes;
6989                 cache->ro = 1;
6990                 ret = 0;
6991         }
6992 out:
6993         spin_unlock(&cache->lock);
6994         spin_unlock(&sinfo->lock);
6995         return ret;
6996 }
6997
6998 int btrfs_set_block_group_ro(struct btrfs_root *root,
6999                              struct btrfs_block_group_cache *cache)
7000
7001 {
7002         struct btrfs_trans_handle *trans;
7003         u64 alloc_flags;
7004         int ret;
7005
7006         BUG_ON(cache->ro);
7007
7008         trans = btrfs_join_transaction(root);
7009         BUG_ON(IS_ERR(trans));
7010
7011         alloc_flags = update_block_group_flags(root, cache->flags);
7012         if (alloc_flags != cache->flags)
7013                 do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags,
7014                                CHUNK_ALLOC_FORCE);
7015
7016         ret = set_block_group_ro(cache, 0);
7017         if (!ret)
7018                 goto out;
7019         alloc_flags = get_alloc_profile(root, cache->space_info->flags);
7020         ret = do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags,
7021                              CHUNK_ALLOC_FORCE);
7022         if (ret < 0)
7023                 goto out;
7024         ret = set_block_group_ro(cache, 0);
7025 out:
7026         btrfs_end_transaction(trans, root);
7027         return ret;
7028 }
7029
7030 int btrfs_force_chunk_alloc(struct btrfs_trans_handle *trans,
7031                             struct btrfs_root *root, u64 type)
7032 {
7033         u64 alloc_flags = get_alloc_profile(root, type);
7034         return do_chunk_alloc(trans, root, 2 * 1024 * 1024, alloc_flags,
7035                               CHUNK_ALLOC_FORCE);
7036 }
7037
7038 /*
7039  * helper to account the unused space of all the readonly block group in the
7040  * list. takes mirrors into account.
7041  */
7042 static u64 __btrfs_get_ro_block_group_free_space(struct list_head *groups_list)
7043 {
7044         struct btrfs_block_group_cache *block_group;
7045         u64 free_bytes = 0;
7046         int factor;
7047
7048         list_for_each_entry(block_group, groups_list, list) {
7049                 spin_lock(&block_group->lock);
7050
7051                 if (!block_group->ro) {
7052                         spin_unlock(&block_group->lock);
7053                         continue;
7054                 }
7055
7056                 if (block_group->flags & (BTRFS_BLOCK_GROUP_RAID1 |
7057                                           BTRFS_BLOCK_GROUP_RAID10 |
7058                                           BTRFS_BLOCK_GROUP_DUP))
7059                         factor = 2;
7060                 else
7061                         factor = 1;
7062
7063                 free_bytes += (block_group->key.offset -
7064                                btrfs_block_group_used(&block_group->item)) *
7065                                factor;
7066
7067                 spin_unlock(&block_group->lock);
7068         }
7069
7070         return free_bytes;
7071 }
7072
7073 /*
7074  * helper to account the unused space of all the readonly block group in the
7075  * space_info. takes mirrors into account.
7076  */
7077 u64 btrfs_account_ro_block_groups_free_space(struct btrfs_space_info *sinfo)
7078 {
7079         int i;
7080         u64 free_bytes = 0;
7081
7082         spin_lock(&sinfo->lock);
7083
7084         for(i = 0; i < BTRFS_NR_RAID_TYPES; i++)
7085                 if (!list_empty(&sinfo->block_groups[i]))
7086                         free_bytes += __btrfs_get_ro_block_group_free_space(
7087                                                 &sinfo->block_groups[i]);
7088
7089         spin_unlock(&sinfo->lock);
7090
7091         return free_bytes;
7092 }
7093
7094 int btrfs_set_block_group_rw(struct btrfs_root *root,
7095                               struct btrfs_block_group_cache *cache)
7096 {
7097         struct btrfs_space_info *sinfo = cache->space_info;
7098         u64 num_bytes;
7099
7100         BUG_ON(!cache->ro);
7101
7102         spin_lock(&sinfo->lock);
7103         spin_lock(&cache->lock);
7104         num_bytes = cache->key.offset - cache->reserved - cache->pinned -
7105                     cache->bytes_super - btrfs_block_group_used(&cache->item);
7106         sinfo->bytes_readonly -= num_bytes;
7107         cache->ro = 0;
7108         spin_unlock(&cache->lock);
7109         spin_unlock(&sinfo->lock);
7110         return 0;
7111 }
7112
7113 /*
7114  * checks to see if its even possible to relocate this block group.
7115  *
7116  * @return - -1 if it's not a good idea to relocate this block group, 0 if its
7117  * ok to go ahead and try.
7118  */
7119 int btrfs_can_relocate(struct btrfs_root *root, u64 bytenr)
7120 {
7121         struct btrfs_block_group_cache *block_group;
7122         struct btrfs_space_info *space_info;
7123         struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
7124         struct btrfs_device *device;
7125         u64 min_free;
7126         u64 dev_min = 1;
7127         u64 dev_nr = 0;
7128         int index;
7129         int full = 0;
7130         int ret = 0;
7131
7132         block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
7133
7134         /* odd, couldn't find the block group, leave it alone */
7135         if (!block_group)
7136                 return -1;
7137
7138         min_free = btrfs_block_group_used(&block_group->item);
7139
7140         /* no bytes used, we're good */
7141         if (!min_free)
7142                 goto out;
7143
7144         space_info = block_group->space_info;
7145         spin_lock(&space_info->lock);
7146
7147         full = space_info->full;
7148
7149         /*
7150          * if this is the last block group we have in this space, we can't
7151          * relocate it unless we're able to allocate a new chunk below.
7152          *
7153          * Otherwise, we need to make sure we have room in the space to handle
7154          * all of the extents from this block group.  If we can, we're good
7155          */
7156         if ((space_info->total_bytes != block_group->key.offset) &&
7157             (space_info->bytes_used + space_info->bytes_reserved +
7158              space_info->bytes_pinned + space_info->bytes_readonly +
7159              min_free < space_info->total_bytes)) {
7160                 spin_unlock(&space_info->lock);
7161                 goto out;
7162         }
7163         spin_unlock(&space_info->lock);
7164
7165         /*
7166          * ok we don't have enough space, but maybe we have free space on our
7167          * devices to allocate new chunks for relocation, so loop through our
7168          * alloc devices and guess if we have enough space.  However, if we
7169          * were marked as full, then we know there aren't enough chunks, and we
7170          * can just return.
7171          */
7172         ret = -1;
7173         if (full)
7174                 goto out;
7175
7176         /*
7177          * index:
7178          *      0: raid10
7179          *      1: raid1
7180          *      2: dup
7181          *      3: raid0
7182          *      4: single
7183          */
7184         index = get_block_group_index(block_group);
7185         if (index == 0) {
7186                 dev_min = 4;
7187                 /* Divide by 2 */
7188                 min_free >>= 1;
7189         } else if (index == 1) {
7190                 dev_min = 2;
7191         } else if (index == 2) {
7192                 /* Multiply by 2 */
7193                 min_free <<= 1;
7194         } else if (index == 3) {
7195                 dev_min = fs_devices->rw_devices;
7196                 do_div(min_free, dev_min);
7197         }
7198
7199         mutex_lock(&root->fs_info->chunk_mutex);
7200         list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) {
7201                 u64 dev_offset;
7202
7203                 /*
7204                  * check to make sure we can actually find a chunk with enough
7205                  * space to fit our block group in.
7206                  */
7207                 if (device->total_bytes > device->bytes_used + min_free) {
7208                         ret = find_free_dev_extent(device, min_free,
7209                                                    &dev_offset, NULL);
7210                         if (!ret)
7211                                 dev_nr++;
7212
7213                         if (dev_nr >= dev_min)
7214                                 break;
7215
7216                         ret = -1;
7217                 }
7218         }
7219         mutex_unlock(&root->fs_info->chunk_mutex);
7220 out:
7221         btrfs_put_block_group(block_group);
7222         return ret;
7223 }
7224
7225 static int find_first_block_group(struct btrfs_root *root,
7226                 struct btrfs_path *path, struct btrfs_key *key)
7227 {
7228         int ret = 0;
7229         struct btrfs_key found_key;
7230         struct extent_buffer *leaf;
7231         int slot;
7232
7233         ret = btrfs_search_slot(NULL, root, key, path, 0, 0);
7234         if (ret < 0)
7235                 goto out;
7236
7237         while (1) {
7238                 slot = path->slots[0];
7239                 leaf = path->nodes[0];
7240                 if (slot >= btrfs_header_nritems(leaf)) {
7241                         ret = btrfs_next_leaf(root, path);
7242                         if (ret == 0)
7243                                 continue;
7244                         if (ret < 0)
7245                                 goto out;
7246                         break;
7247                 }
7248                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
7249
7250                 if (found_key.objectid >= key->objectid &&
7251                     found_key.type == BTRFS_BLOCK_GROUP_ITEM_KEY) {
7252                         ret = 0;
7253                         goto out;
7254                 }
7255                 path->slots[0]++;
7256         }
7257 out:
7258         return ret;
7259 }
7260
7261 void btrfs_put_block_group_cache(struct btrfs_fs_info *info)
7262 {
7263         struct btrfs_block_group_cache *block_group;
7264         u64 last = 0;
7265
7266         while (1) {
7267                 struct inode *inode;
7268
7269                 block_group = btrfs_lookup_first_block_group(info, last);
7270                 while (block_group) {
7271                         spin_lock(&block_group->lock);
7272                         if (block_group->iref)
7273                                 break;
7274                         spin_unlock(&block_group->lock);
7275                         block_group = next_block_group(info->tree_root,
7276                                                        block_group);
7277                 }
7278                 if (!block_group) {
7279                         if (last == 0)
7280                                 break;
7281                         last = 0;
7282                         continue;
7283                 }
7284
7285                 inode = block_group->inode;
7286                 block_group->iref = 0;
7287                 block_group->inode = NULL;
7288                 spin_unlock(&block_group->lock);
7289                 iput(inode);
7290                 last = block_group->key.objectid + block_group->key.offset;
7291                 btrfs_put_block_group(block_group);
7292         }
7293 }
7294
7295 int btrfs_free_block_groups(struct btrfs_fs_info *info)
7296 {
7297         struct btrfs_block_group_cache *block_group;
7298         struct btrfs_space_info *space_info;
7299         struct btrfs_caching_control *caching_ctl;
7300         struct rb_node *n;
7301
7302         down_write(&info->extent_commit_sem);
7303         while (!list_empty(&info->caching_block_groups)) {
7304                 caching_ctl = list_entry(info->caching_block_groups.next,
7305                                          struct btrfs_caching_control, list);
7306                 list_del(&caching_ctl->list);
7307                 put_caching_control(caching_ctl);
7308         }
7309         up_write(&info->extent_commit_sem);
7310
7311         spin_lock(&info->block_group_cache_lock);
7312         while ((n = rb_last(&info->block_group_cache_tree)) != NULL) {
7313                 block_group = rb_entry(n, struct btrfs_block_group_cache,
7314                                        cache_node);
7315                 rb_erase(&block_group->cache_node,
7316                          &info->block_group_cache_tree);
7317                 spin_unlock(&info->block_group_cache_lock);
7318
7319                 down_write(&block_group->space_info->groups_sem);
7320                 list_del(&block_group->list);
7321                 up_write(&block_group->space_info->groups_sem);
7322
7323                 if (block_group->cached == BTRFS_CACHE_STARTED)
7324                         wait_block_group_cache_done(block_group);
7325
7326                 /*
7327                  * We haven't cached this block group, which means we could
7328                  * possibly have excluded extents on this block group.
7329                  */
7330                 if (block_group->cached == BTRFS_CACHE_NO)
7331                         free_excluded_extents(info->extent_root, block_group);
7332
7333                 btrfs_remove_free_space_cache(block_group);
7334                 btrfs_put_block_group(block_group);
7335
7336                 spin_lock(&info->block_group_cache_lock);
7337         }
7338         spin_unlock(&info->block_group_cache_lock);
7339
7340         /* now that all the block groups are freed, go through and
7341          * free all the space_info structs.  This is only called during
7342          * the final stages of unmount, and so we know nobody is
7343          * using them.  We call synchronize_rcu() once before we start,
7344          * just to be on the safe side.
7345          */
7346         synchronize_rcu();
7347
7348         release_global_block_rsv(info);
7349
7350         while(!list_empty(&info->space_info)) {
7351                 space_info = list_entry(info->space_info.next,
7352                                         struct btrfs_space_info,
7353                                         list);
7354                 if (space_info->bytes_pinned > 0 ||
7355                     space_info->bytes_reserved > 0 ||
7356                     space_info->bytes_may_use > 0) {
7357                         WARN_ON(1);
7358                         dump_space_info(space_info, 0, 0);
7359                 }
7360                 list_del(&space_info->list);
7361                 kfree(space_info);
7362         }
7363         return 0;
7364 }
7365
7366 static void __link_block_group(struct btrfs_space_info *space_info,
7367                                struct btrfs_block_group_cache *cache)
7368 {
7369         int index = get_block_group_index(cache);
7370
7371         down_write(&space_info->groups_sem);
7372         list_add_tail(&cache->list, &space_info->block_groups[index]);
7373         up_write(&space_info->groups_sem);
7374 }
7375
7376 int btrfs_read_block_groups(struct btrfs_root *root)
7377 {
7378         struct btrfs_path *path;
7379         int ret;
7380         struct btrfs_block_group_cache *cache;
7381         struct btrfs_fs_info *info = root->fs_info;
7382         struct btrfs_space_info *space_info;
7383         struct btrfs_key key;
7384         struct btrfs_key found_key;
7385         struct extent_buffer *leaf;
7386         int need_clear = 0;
7387         u64 cache_gen;
7388
7389         root = info->extent_root;
7390         key.objectid = 0;
7391         key.offset = 0;
7392         btrfs_set_key_type(&key, BTRFS_BLOCK_GROUP_ITEM_KEY);
7393         path = btrfs_alloc_path();
7394         if (!path)
7395                 return -ENOMEM;
7396         path->reada = 1;
7397
7398         cache_gen = btrfs_super_cache_generation(root->fs_info->super_copy);
7399         if (btrfs_test_opt(root, SPACE_CACHE) &&
7400             btrfs_super_generation(root->fs_info->super_copy) != cache_gen)
7401                 need_clear = 1;
7402         if (btrfs_test_opt(root, CLEAR_CACHE))
7403                 need_clear = 1;
7404
7405         while (1) {
7406                 ret = find_first_block_group(root, path, &key);
7407                 if (ret > 0)
7408                         break;
7409                 if (ret != 0)
7410                         goto error;
7411                 leaf = path->nodes[0];
7412                 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
7413                 cache = kzalloc(sizeof(*cache), GFP_NOFS);
7414                 if (!cache) {
7415                         ret = -ENOMEM;
7416                         goto error;
7417                 }
7418                 cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl),
7419                                                 GFP_NOFS);
7420                 if (!cache->free_space_ctl) {
7421                         kfree(cache);
7422                         ret = -ENOMEM;
7423                         goto error;
7424                 }
7425
7426                 atomic_set(&cache->count, 1);
7427                 spin_lock_init(&cache->lock);
7428                 cache->fs_info = info;
7429                 INIT_LIST_HEAD(&cache->list);
7430                 INIT_LIST_HEAD(&cache->cluster_list);
7431
7432                 if (need_clear)
7433                         cache->disk_cache_state = BTRFS_DC_CLEAR;
7434
7435                 read_extent_buffer(leaf, &cache->item,
7436                                    btrfs_item_ptr_offset(leaf, path->slots[0]),
7437                                    sizeof(cache->item));
7438                 memcpy(&cache->key, &found_key, sizeof(found_key));
7439
7440                 key.objectid = found_key.objectid + found_key.offset;
7441                 btrfs_release_path(path);
7442                 cache->flags = btrfs_block_group_flags(&cache->item);
7443                 cache->sectorsize = root->sectorsize;
7444
7445                 btrfs_init_free_space_ctl(cache);
7446
7447                 /*
7448                  * We need to exclude the super stripes now so that the space
7449                  * info has super bytes accounted for, otherwise we'll think
7450                  * we have more space than we actually do.
7451                  */
7452                 exclude_super_stripes(root, cache);
7453
7454                 /*
7455                  * check for two cases, either we are full, and therefore
7456                  * don't need to bother with the caching work since we won't
7457                  * find any space, or we are empty, and we can just add all
7458                  * the space in and be done with it.  This saves us _alot_ of
7459                  * time, particularly in the full case.
7460                  */
7461                 if (found_key.offset == btrfs_block_group_used(&cache->item)) {
7462                         cache->last_byte_to_unpin = (u64)-1;
7463                         cache->cached = BTRFS_CACHE_FINISHED;
7464                         free_excluded_extents(root, cache);
7465                 } else if (btrfs_block_group_used(&cache->item) == 0) {
7466                         cache->last_byte_to_unpin = (u64)-1;
7467                         cache->cached = BTRFS_CACHE_FINISHED;
7468                         add_new_free_space(cache, root->fs_info,
7469                                            found_key.objectid,
7470                                            found_key.objectid +
7471                                            found_key.offset);
7472                         free_excluded_extents(root, cache);
7473                 }
7474
7475                 ret = update_space_info(info, cache->flags, found_key.offset,
7476                                         btrfs_block_group_used(&cache->item),
7477                                         &space_info);
7478                 BUG_ON(ret);
7479                 cache->space_info = space_info;
7480                 spin_lock(&cache->space_info->lock);
7481                 cache->space_info->bytes_readonly += cache->bytes_super;
7482                 spin_unlock(&cache->space_info->lock);
7483
7484                 __link_block_group(space_info, cache);
7485
7486                 ret = btrfs_add_block_group_cache(root->fs_info, cache);
7487                 BUG_ON(ret);
7488
7489                 set_avail_alloc_bits(root->fs_info, cache->flags);
7490                 if (btrfs_chunk_readonly(root, cache->key.objectid))
7491                         set_block_group_ro(cache, 1);
7492         }
7493
7494         list_for_each_entry_rcu(space_info, &root->fs_info->space_info, list) {
7495                 if (!(get_alloc_profile(root, space_info->flags) &
7496                       (BTRFS_BLOCK_GROUP_RAID10 |
7497                        BTRFS_BLOCK_GROUP_RAID1 |
7498                        BTRFS_BLOCK_GROUP_DUP)))
7499                         continue;
7500                 /*
7501                  * avoid allocating from un-mirrored block group if there are
7502                  * mirrored block groups.
7503                  */
7504                 list_for_each_entry(cache, &space_info->block_groups[3], list)
7505                         set_block_group_ro(cache, 1);
7506                 list_for_each_entry(cache, &space_info->block_groups[4], list)
7507                         set_block_group_ro(cache, 1);
7508         }
7509
7510         init_global_block_rsv(info);
7511         ret = 0;
7512 error:
7513         btrfs_free_path(path);
7514         return ret;
7515 }
7516
7517 int btrfs_make_block_group(struct btrfs_trans_handle *trans,
7518                            struct btrfs_root *root, u64 bytes_used,
7519                            u64 type, u64 chunk_objectid, u64 chunk_offset,
7520                            u64 size)
7521 {
7522         int ret;
7523         struct btrfs_root *extent_root;
7524         struct btrfs_block_group_cache *cache;
7525
7526         extent_root = root->fs_info->extent_root;
7527
7528         root->fs_info->last_trans_log_full_commit = trans->transid;
7529
7530         cache = kzalloc(sizeof(*cache), GFP_NOFS);
7531         if (!cache)
7532                 return -ENOMEM;
7533         cache->free_space_ctl = kzalloc(sizeof(*cache->free_space_ctl),
7534                                         GFP_NOFS);
7535         if (!cache->free_space_ctl) {
7536                 kfree(cache);
7537                 return -ENOMEM;
7538         }
7539
7540         cache->key.objectid = chunk_offset;
7541         cache->key.offset = size;
7542         cache->key.type = BTRFS_BLOCK_GROUP_ITEM_KEY;
7543         cache->sectorsize = root->sectorsize;
7544         cache->fs_info = root->fs_info;
7545
7546         atomic_set(&cache->count, 1);
7547         spin_lock_init(&cache->lock);
7548         INIT_LIST_HEAD(&cache->list);
7549         INIT_LIST_HEAD(&cache->cluster_list);
7550
7551         btrfs_init_free_space_ctl(cache);
7552
7553         btrfs_set_block_group_used(&cache->item, bytes_used);
7554         btrfs_set_block_group_chunk_objectid(&cache->item, chunk_objectid);
7555         cache->flags = type;
7556         btrfs_set_block_group_flags(&cache->item, type);
7557
7558         cache->last_byte_to_unpin = (u64)-1;
7559         cache->cached = BTRFS_CACHE_FINISHED;
7560         exclude_super_stripes(root, cache);
7561
7562         add_new_free_space(cache, root->fs_info, chunk_offset,
7563                            chunk_offset + size);
7564
7565         free_excluded_extents(root, cache);
7566
7567         ret = update_space_info(root->fs_info, cache->flags, size, bytes_used,
7568                                 &cache->space_info);
7569         BUG_ON(ret);
7570         update_global_block_rsv(root->fs_info);
7571
7572         spin_lock(&cache->space_info->lock);
7573         cache->space_info->bytes_readonly += cache->bytes_super;
7574         spin_unlock(&cache->space_info->lock);
7575
7576         __link_block_group(cache->space_info, cache);
7577
7578         ret = btrfs_add_block_group_cache(root->fs_info, cache);
7579         BUG_ON(ret);
7580
7581         ret = btrfs_insert_item(trans, extent_root, &cache->key, &cache->item,
7582                                 sizeof(cache->item));
7583         BUG_ON(ret);
7584
7585         set_avail_alloc_bits(extent_root->fs_info, type);
7586
7587         return 0;
7588 }
7589
7590 static void clear_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
7591 {
7592         u64 extra_flags = chunk_to_extended(flags) &
7593                                 BTRFS_EXTENDED_PROFILE_MASK;
7594
7595         if (flags & BTRFS_BLOCK_GROUP_DATA)
7596                 fs_info->avail_data_alloc_bits &= ~extra_flags;
7597         if (flags & BTRFS_BLOCK_GROUP_METADATA)
7598                 fs_info->avail_metadata_alloc_bits &= ~extra_flags;
7599         if (flags & BTRFS_BLOCK_GROUP_SYSTEM)
7600                 fs_info->avail_system_alloc_bits &= ~extra_flags;
7601 }
7602
7603 int btrfs_remove_block_group(struct btrfs_trans_handle *trans,
7604                              struct btrfs_root *root, u64 group_start)
7605 {
7606         struct btrfs_path *path;
7607         struct btrfs_block_group_cache *block_group;
7608         struct btrfs_free_cluster *cluster;
7609         struct btrfs_root *tree_root = root->fs_info->tree_root;
7610         struct btrfs_key key;
7611         struct inode *inode;
7612         int ret;
7613         int index;
7614         int factor;
7615
7616         root = root->fs_info->extent_root;
7617
7618         block_group = btrfs_lookup_block_group(root->fs_info, group_start);
7619         BUG_ON(!block_group);
7620         BUG_ON(!block_group->ro);
7621
7622         /*
7623          * Free the reserved super bytes from this block group before
7624          * remove it.
7625          */
7626         free_excluded_extents(root, block_group);
7627
7628         memcpy(&key, &block_group->key, sizeof(key));
7629         index = get_block_group_index(block_group);
7630         if (block_group->flags & (BTRFS_BLOCK_GROUP_DUP |
7631                                   BTRFS_BLOCK_GROUP_RAID1 |
7632                                   BTRFS_BLOCK_GROUP_RAID10))
7633                 factor = 2;
7634         else
7635                 factor = 1;
7636
7637         /* make sure this block group isn't part of an allocation cluster */
7638         cluster = &root->fs_info->data_alloc_cluster;
7639         spin_lock(&cluster->refill_lock);
7640         btrfs_return_cluster_to_free_space(block_group, cluster);
7641         spin_unlock(&cluster->refill_lock);
7642
7643         /*
7644          * make sure this block group isn't part of a metadata
7645          * allocation cluster
7646          */
7647         cluster = &root->fs_info->meta_alloc_cluster;
7648         spin_lock(&cluster->refill_lock);
7649         btrfs_return_cluster_to_free_space(block_group, cluster);
7650         spin_unlock(&cluster->refill_lock);
7651
7652         path = btrfs_alloc_path();
7653         if (!path) {
7654                 ret = -ENOMEM;
7655                 goto out;
7656         }
7657
7658         inode = lookup_free_space_inode(tree_root, block_group, path);
7659         if (!IS_ERR(inode)) {
7660                 ret = btrfs_orphan_add(trans, inode);
7661                 BUG_ON(ret);
7662                 clear_nlink(inode);
7663                 /* One for the block groups ref */
7664                 spin_lock(&block_group->lock);
7665                 if (block_group->iref) {
7666                         block_group->iref = 0;
7667                         block_group->inode = NULL;
7668                         spin_unlock(&block_group->lock);
7669                         iput(inode);
7670                 } else {
7671                         spin_unlock(&block_group->lock);
7672                 }
7673                 /* One for our lookup ref */
7674                 btrfs_add_delayed_iput(inode);
7675         }
7676
7677         key.objectid = BTRFS_FREE_SPACE_OBJECTID;
7678         key.offset = block_group->key.objectid;
7679         key.type = 0;
7680
7681         ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
7682         if (ret < 0)
7683                 goto out;
7684         if (ret > 0)
7685                 btrfs_release_path(path);
7686         if (ret == 0) {
7687                 ret = btrfs_del_item(trans, tree_root, path);
7688                 if (ret)
7689                         goto out;
7690                 btrfs_release_path(path);
7691         }
7692
7693         spin_lock(&root->fs_info->block_group_cache_lock);
7694         rb_erase(&block_group->cache_node,
7695                  &root->fs_info->block_group_cache_tree);
7696         spin_unlock(&root->fs_info->block_group_cache_lock);
7697
7698         down_write(&block_group->space_info->groups_sem);
7699         /*
7700          * we must use list_del_init so people can check to see if they
7701          * are still on the list after taking the semaphore
7702          */
7703         list_del_init(&block_group->list);
7704         if (list_empty(&block_group->space_info->block_groups[index]))
7705                 clear_avail_alloc_bits(root->fs_info, block_group->flags);
7706         up_write(&block_group->space_info->groups_sem);
7707
7708         if (block_group->cached == BTRFS_CACHE_STARTED)
7709                 wait_block_group_cache_done(block_group);
7710
7711         btrfs_remove_free_space_cache(block_group);
7712
7713         spin_lock(&block_group->space_info->lock);
7714         block_group->space_info->total_bytes -= block_group->key.offset;
7715         block_group->space_info->bytes_readonly -= block_group->key.offset;
7716         block_group->space_info->disk_total -= block_group->key.offset * factor;
7717         spin_unlock(&block_group->space_info->lock);
7718
7719         memcpy(&key, &block_group->key, sizeof(key));
7720
7721         btrfs_clear_space_info_full(root->fs_info);
7722
7723         btrfs_put_block_group(block_group);
7724         btrfs_put_block_group(block_group);
7725
7726         ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
7727         if (ret > 0)
7728                 ret = -EIO;
7729         if (ret < 0)
7730                 goto out;
7731
7732         ret = btrfs_del_item(trans, root, path);
7733 out:
7734         btrfs_free_path(path);
7735         return ret;
7736 }
7737
7738 int btrfs_init_space_info(struct btrfs_fs_info *fs_info)
7739 {
7740         struct btrfs_space_info *space_info;
7741         struct btrfs_super_block *disk_super;
7742         u64 features;
7743         u64 flags;
7744         int mixed = 0;
7745         int ret;
7746
7747         disk_super = fs_info->super_copy;
7748         if (!btrfs_super_root(disk_super))
7749                 return 1;
7750
7751         features = btrfs_super_incompat_flags(disk_super);
7752         if (features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
7753                 mixed = 1;
7754
7755         flags = BTRFS_BLOCK_GROUP_SYSTEM;
7756         ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7757         if (ret)
7758                 goto out;
7759
7760         if (mixed) {
7761                 flags = BTRFS_BLOCK_GROUP_METADATA | BTRFS_BLOCK_GROUP_DATA;
7762                 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7763         } else {
7764                 flags = BTRFS_BLOCK_GROUP_METADATA;
7765                 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7766                 if (ret)
7767                         goto out;
7768
7769                 flags = BTRFS_BLOCK_GROUP_DATA;
7770                 ret = update_space_info(fs_info, flags, 0, 0, &space_info);
7771         }
7772 out:
7773         return ret;
7774 }
7775
7776 int btrfs_error_unpin_extent_range(struct btrfs_root *root, u64 start, u64 end)
7777 {
7778         return unpin_extent_range(root, start, end);
7779 }
7780
7781 int btrfs_error_discard_extent(struct btrfs_root *root, u64 bytenr,
7782                                u64 num_bytes, u64 *actual_bytes)
7783 {
7784         return btrfs_discard_extent(root, bytenr, num_bytes, actual_bytes);
7785 }
7786
7787 int btrfs_trim_fs(struct btrfs_root *root, struct fstrim_range *range)
7788 {
7789         struct btrfs_fs_info *fs_info = root->fs_info;
7790         struct btrfs_block_group_cache *cache = NULL;
7791         u64 group_trimmed;
7792         u64 start;
7793         u64 end;
7794         u64 trimmed = 0;
7795         u64 total_bytes = btrfs_super_total_bytes(fs_info->super_copy);
7796         int ret = 0;
7797
7798         /*
7799          * try to trim all FS space, our block group may start from non-zero.
7800          */
7801         if (range->len == total_bytes)
7802                 cache = btrfs_lookup_first_block_group(fs_info, range->start);
7803         else
7804                 cache = btrfs_lookup_block_group(fs_info, range->start);
7805
7806         while (cache) {
7807                 if (cache->key.objectid >= (range->start + range->len)) {
7808                         btrfs_put_block_group(cache);
7809                         break;
7810                 }
7811
7812                 start = max(range->start, cache->key.objectid);
7813                 end = min(range->start + range->len,
7814                                 cache->key.objectid + cache->key.offset);
7815
7816                 if (end - start >= range->minlen) {
7817                         if (!block_group_cache_done(cache)) {
7818                                 ret = cache_block_group(cache, NULL, root, 0);
7819                                 if (!ret)
7820                                         wait_block_group_cache_done(cache);
7821                         }
7822                         ret = btrfs_trim_block_group(cache,
7823                                                      &group_trimmed,
7824                                                      start,
7825                                                      end,
7826                                                      range->minlen);
7827
7828                         trimmed += group_trimmed;
7829                         if (ret) {
7830                                 btrfs_put_block_group(cache);
7831                                 break;
7832                         }
7833                 }
7834
7835                 cache = next_block_group(fs_info->tree_root, cache);
7836         }
7837
7838         range->len = trimmed;
7839         return ret;
7840 }