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 /* control flags for do_chunk_alloc's force field
  38  * CHUNK_ALLOC_NO_FORCE means to only allocate a chunk
  39  * if we really need one.
  40  *
  41  * CHUNK_ALLOC_FORCE means it must try to allocate one
  42  *
  43  * CHUNK_ALLOC_LIMITED means to only try and allocate one
  44  * if we have very few chunks already allocated.  This is
  45  * used as part of the clustering code to help make sure
  46  * we have a good pool of storage to cluster in, without
  47  * filling the FS with empty chunks
  48  *
  49  */
  50 enum {
  51         CHUNK_ALLOC_NO_FORCE = 0,
  52         CHUNK_ALLOC_FORCE = 1,
  53         CHUNK_ALLOC_LIMITED = 2,
  54 };
  55
  56 /*
  57  * Control how reservations are dealt with.
  58  *
  59  * RESERVE_FREE - freeing a reservation.
  60  * RESERVE_ALLOC - allocating space and we need to update bytes_may_use for
  61  *   ENOSPC accounting
  62  * RESERVE_ALLOC_NO_ACCOUNT - allocating space and we should not update
  63  *   bytes_may_use as the ENOSPC accounting is done elsewhere
  64  */
  65 enum {
  66         RESERVE_FREE = 0,
  67         RESERVE_ALLOC = 1,
  68         RESERVE_ALLOC_NO_ACCOUNT = 2,
  69 };
  70
  71 static int update_block_group(struct btrfs_trans_handle *trans,
  72                               struct btrfs_root *root,
  73                               u64 bytenr, u64 num_bytes, int alloc);
  74 static int __btrfs_free_extent(struct btrfs_trans_handle *trans,
  75                                 struct btrfs_root *root,
  76                                 u64 bytenr, u64 num_bytes, u64 parent,
  77                                 u64 root_objectid, u64 owner_objectid,
  78                                 u64 owner_offset, int refs_to_drop,
  79                                 struct btrfs_delayed_extent_op *extra_op);
  80 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
  81                                     struct extent_buffer *leaf,
  82                                     struct btrfs_extent_item *ei);
  83 static int alloc_reserved_file_extent(struct btrfs_trans_handle *trans,
  84                                       struct btrfs_root *root,
  85                                       u64 parent, u64 root_objectid,
  86                                       u64 flags, u64 owner, u64 offset,
  87                                       struct btrfs_key *ins, int ref_mod);
  88 static int alloc_reserved_tree_block(struct btrfs_trans_handle *trans,
  89                                      struct btrfs_root *root,
  90                                      u64 parent, u64 root_objectid,
  91                                      u64 flags, struct btrfs_disk_key *key,
  92                                      int level, struct btrfs_key *ins);
  93 static int do_chunk_alloc(struct btrfs_trans_handle *trans,
  94                           struct btrfs_root *extent_root, u64 alloc_bytes,
  95                           u64 flags, int force);
  96 static int find_next_key(struct btrfs_path *path, int level,
  97                          struct btrfs_key *key);
  98 static void dump_space_info(struct btrfs_space_info *info, u64 bytes,
  99                             int dump_block_groups);
 100 static int btrfs_update_reserved_bytes(struct btrfs_block_group_cache *cache,
 101                                        u64 num_bytes, int reserve);
 102
 103 static noinline int
 104 block_group_cache_done(struct btrfs_block_group_cache *cache)
 105 {
 106         smp_mb();
 107         return cache->cached == BTRFS_CACHE_FINISHED;
 108 }
 109
 110 static int block_group_bits(struct btrfs_block_group_cache *cache, u64 bits)
 111 {
 112         return (cache->flags & bits) == bits;
 113 }
 114
 115 static void btrfs_get_block_group(struct btrfs_block_group_cache *cache)
 116 {
 117         atomic_inc(&cache->count);
 118 }
 119
 120 void btrfs_put_block_group(struct btrfs_block_group_cache *cache)
 121 {
 122         if (atomic_dec_and_test(&cache->count)) {
 123                 WARN_ON(cache->pinned > 0);
 124                 WARN_ON(cache->reserved > 0);
 125                 kfree(cache->free_space_ctl);
 126                 kfree(cache);
 127         }
 128 }
 129
 130 /*
 131  * this adds the block group to the fs_info rb tree for the block group
 132  * cache
 133  */
 134 static int btrfs_add_block_group_cache(struct btrfs_fs_info *info,
 135                                 struct btrfs_block_group_cache *block_group)
 136 {
 137         struct rb_node **p;
 138         struct rb_node *parent = NULL;
 139         struct btrfs_block_group_cache *cache;
 140
 141         spin_lock(&info->block_group_cache_lock);
 142         p = &info->block_group_cache_tree.rb_node;
 143
 144         while (*p) {
 145                 parent = *p;
 146                 cache = rb_entry(parent, struct btrfs_block_group_cache,
 147                                  cache_node);
 148                 if (block_group->key.objectid < cache->key.objectid) {
 149                         p = &(*p)->rb_left;
 150                 } else if (block_group->key.objectid > cache->key.objectid) {
 151                         p = &(*p)->rb_right;
 152                 } else {
 153                         spin_unlock(&info->block_group_cache_lock);
 154                         return -EEXIST;
 155                 }
 156         }
 157
 158         rb_link_node(&block_group->cache_node, parent, p);
 159         rb_insert_color(&block_group->cache_node,
 160                         &info->block_group_cache_tree);
 161         spin_unlock(&info->block_group_cache_lock);
 162
 163         return 0;
 164 }
 165
 166 /*
 167  * This will return the block group at or after bytenr if contains is 0, else
 168  * it will return the block group that contains the bytenr
 169  */
 170 static struct btrfs_block_group_cache *
 171 block_group_cache_tree_search(struct btrfs_fs_info *info, u64 bytenr,
 172                               int contains)
 173 {
 174         struct btrfs_block_group_cache *cache, *ret = NULL;
 175         struct rb_node *n;
 176         u64 end, start;
 177
 178         spin_lock(&info->block_group_cache_lock);
 179         n = info->block_group_cache_tree.rb_node;
 180
 181         while (n) {
 182                 cache = rb_entry(n, struct btrfs_block_group_cache,
 183                                  cache_node);
 184                 end = cache->key.objectid + cache->key.offset - 1;
 185                 start = cache->key.objectid;
 186
 187                 if (bytenr < start) {
 188                         if (!contains && (!ret || start < ret->key.objectid))
 189                                 ret = cache;
 190                         n = n->rb_left;
 191                 } else if (bytenr > start) {
 192                         if (contains && bytenr <= end) {
 193                                 ret = cache;
 194                                 break;
 195                         }
 196                         n = n->rb_right;
 197                 } else {
 198                         ret = cache;
 199                         break;
 200                 }
 201         }
 202         if (ret)
 203                 btrfs_get_block_group(ret);
 204         spin_unlock(&info->block_group_cache_lock);
 205
 206         return ret;
 207 }
 208
 209 static int add_excluded_extent(struct btrfs_root *root,
 210                                u64 start, u64 num_bytes)
 211 {
 212         u64 end = start + num_bytes - 1;
 213         set_extent_bits(&root->fs_info->freed_extents[0],
 214                         start, end, EXTENT_UPTODATE, GFP_NOFS);
 215         set_extent_bits(&root->fs_info->freed_extents[1],
 216                         start, end, EXTENT_UPTODATE, GFP_NOFS);
 217         return 0;
 218 }
 219
 220 static void free_excluded_extents(struct btrfs_root *root,
 221                                   struct btrfs_block_group_cache *cache)
 222 {
 223         u64 start, end;
 224
 225         start = cache->key.objectid;
 226         end = start + cache->key.offset - 1;
 227
 228         clear_extent_bits(&root->fs_info->freed_extents[0],
 229                           start, end, EXTENT_UPTODATE, GFP_NOFS);
 230         clear_extent_bits(&root->fs_info->freed_extents[1],
 231                           start, end, EXTENT_UPTODATE, GFP_NOFS);
 232 }
 233
 234 static int exclude_super_stripes(struct btrfs_root *root,
 235                                  struct btrfs_block_group_cache *cache)
 236 {
 237         u64 bytenr;
 238         u64 *logical;
 239         int stripe_len;
 240         int i, nr, ret;
 241
 242         if (cache->key.objectid < BTRFS_SUPER_INFO_OFFSET) {
 243                 stripe_len = BTRFS_SUPER_INFO_OFFSET - cache->key.objectid;
 244                 cache->bytes_super += stripe_len;
 245                 ret = add_excluded_extent(root, cache->key.objectid,
 246                                           stripe_len);
 247                 BUG_ON(ret);
 248         }
 249
 250         for (i = 0; i < BTRFS_SUPER_MIRROR_MAX; i++) {
 251                 bytenr = btrfs_sb_offset(i);
 252                 ret = btrfs_rmap_block(&root->fs_info->mapping_tree,
 253                                        cache->key.objectid, bytenr,
 254                                        0, &logical, &nr, &stripe_len);
 255                 BUG_ON(ret);
 256
 257                 while (nr--) {
 258                         cache->bytes_super += stripe_len;
 259                         ret = add_excluded_extent(root, logical[nr],
 260                                                   stripe_len);
 261                         BUG_ON(ret);
 262                 }
 263
 264                 kfree(logical);
 265         }
 266         return 0;
 267 }
 268
 269 static struct btrfs_caching_control *
 270 get_caching_control(struct btrfs_block_group_cache *cache)
 271 {
 272         struct btrfs_caching_control *ctl;
 273
 274         spin_lock(&cache->lock);
 275         if (cache->cached != BTRFS_CACHE_STARTED) {
 276                 spin_unlock(&cache->lock);
 277                 return NULL;
 278         }
 279
 280         /* We're loading it the fast way, so we don't have a caching_ctl. */
 281         if (!cache->caching_ctl) {
 282                 spin_unlock(&cache->lock);
 283                 return NULL;
 284         }
 285
 286         ctl = cache->caching_ctl;
 287         atomic_inc(&ctl->count);
 288         spin_unlock(&cache->lock);
 289         return ctl;
 290 }
 291
 292 static void put_caching_control(struct btrfs_caching_control *ctl)
 293 {
 294         if (atomic_dec_and_test(&ctl->count))
 295                 kfree(ctl);
 296 }
 297
 298 /*
 299  * this is only called by cache_block_group, since we could have freed extents
 300  * we need to check the pinned_extents for any extents that can't be used yet
 301  * since their free space will be released as soon as the transaction commits.
 302  */
 303 static u64 add_new_free_space(struct btrfs_block_group_cache *block_group,
 304                               struct btrfs_fs_info *info, u64 start, u64 end)
 305 {
 306         u64 extent_start, extent_end, size, total_added = 0;
 307         int ret;
 308
 309         while (start < end) {
 310                 ret = find_first_extent_bit(info->pinned_extents, start,
 311                                             &extent_start, &extent_end,
 312                                             EXTENT_DIRTY | EXTENT_UPTODATE);
 313                 if (ret)
 314                         break;
 315
 316                 if (extent_start <= start) {
 317                         start = extent_end + 1;
 318                 } else if (extent_start > start && extent_start < end) {
 319                         size = extent_start - start;
 320                         total_added += size;
 321                         ret = btrfs_add_free_space(block_group, start,
 322                                                    size);
 323                         BUG_ON(ret);
 324                         start = extent_end + 1;
 325                 } else {
 326                         break;
 327                 }
 328         }
 329
 330         if (start < end) {
 331                 size = end - start;
 332                 total_added += size;
 333                 ret = btrfs_add_free_space(block_group, start, size);
 334                 BUG_ON(ret);
 335         }
 336
 337         return total_added;
 338 }
 339
 340 static noinline void caching_thread(struct btrfs_work *work)
 341 {
 342         struct btrfs_block_group_cache *block_group;
 343         struct btrfs_fs_info *fs_info;
 344         struct btrfs_caching_control *caching_ctl;
 345         struct btrfs_root *extent_root;
 346         struct btrfs_path *path;
 347         struct extent_buffer *leaf;
 348         struct btrfs_key key;
 349         u64 total_found = 0;
 350         u64 last = 0;
 351         u32 nritems;
 352         int ret = 0;
 353
 354         caching_ctl = container_of(work, struct btrfs_caching_control, work);
 355         block_group = caching_ctl->block_group;
 356         fs_info = block_group->fs_info;
 357         extent_root = fs_info->extent_root;
 358
 359         path = btrfs_alloc_path();
 360         if (!path)
 361                 goto out;
 362
 363         last = max_t(u64, block_group->key.objectid, BTRFS_SUPER_INFO_OFFSET);
 364
 365         /*
 366          * We don't want to deadlock with somebody trying to allocate a new
 367          * extent for the extent root while also trying to search the extent
 368          * root to add free space.  So we skip locking and search the commit
 369          * root, since its read-only
 370          */
 371         path->skip_locking = 1;
 372         path->search_commit_root = 1;
 373         path->reada = 1;
 374
 375         key.objectid = last;
 376         key.offset = 0;
 377         key.type = BTRFS_EXTENT_ITEM_KEY;
 378 again:
 379         mutex_lock(&caching_ctl->mutex);
 380         /* need to make sure the commit_root doesn't disappear */
 381         down_read(&fs_info->extent_commit_sem);
 382
 383         ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
 384         if (ret < 0)
 385                 goto err;
 386
 387         leaf = path->nodes[0];
 388         nritems = btrfs_header_nritems(leaf);
 389
 390         while (1) {
 391                 if (btrfs_fs_closing(fs_info) > 1) {
 392                         last = (u64)-1;
 393                         break;
 394                 }
 395
 396                 if (path->slots[0] < nritems) {
 397                         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
 398                 } else {
 399                         ret = find_next_key(path, 0, &key);
 400                         if (ret)
 401                                 break;
 402
 403                         if (need_resched() ||
 404                             btrfs_next_leaf(extent_root, path)) {
 405                                 caching_ctl->progress = last;
 406                                 btrfs_release_path(path);
 407                                 up_read(&fs_info->extent_commit_sem);
 408                                 mutex_unlock(&caching_ctl->mutex);
 409                                 cond_resched();
 410                                 goto again;
 411                         }
 412                         leaf = path->nodes[0];
 413                         nritems = btrfs_header_nritems(leaf);
 414                         continue;
 415                 }
 416
 417                 if (key.objectid < block_group->key.objectid) {
 418                         path->slots[0]++;
 419                         continue;
 420                 }
 421
 422                 if (key.objectid >= block_group->key.objectid +
 423                     block_group->key.offset)
 424                         break;
 425
 426                 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
 427                         total_found += add_new_free_space(block_group,
 428                                                           fs_info, last,
 429                                                           key.objectid);
 430                         last = key.objectid + key.offset;
 431
 432                         if (total_found > (1024 * 1024 * 2)) {
 433                                 total_found = 0;
 434                                 wake_up(&caching_ctl->wait);
 435                         }
 436                 }
 437                 path->slots[0]++;
 438         }
 439         ret = 0;
 440
 441         total_found += add_new_free_space(block_group, fs_info, last,
 442                                           block_group->key.objectid +
 443                                           block_group->key.offset);
 444         caching_ctl->progress = (u64)-1;
 445
 446         spin_lock(&block_group->lock);
 447         block_group->caching_ctl = NULL;
 448         block_group->cached = BTRFS_CACHE_FINISHED;
 449         spin_unlock(&block_group->lock);
 450
 451 err:
 452         btrfs_free_path(path);
 453         up_read(&fs_info->extent_commit_sem);
 454
 455         free_excluded_extents(extent_root, block_group);
 456
 457         mutex_unlock(&caching_ctl->mutex);
 458 out:
 459         wake_up(&caching_ctl->wait);
 460
 461         put_caching_control(caching_ctl);
 462         btrfs_put_block_group(block_group);
 463 }
 464
 465 static int cache_block_group(struct btrfs_block_group_cache *cache,
 466                              struct btrfs_trans_handle *trans,
 467                              struct btrfs_root *root,
 468                              int load_cache_only)
 469 {
 470         DEFINE_WAIT(wait);
 471         struct btrfs_fs_info *fs_info = cache->fs_info;
 472         struct btrfs_caching_control *caching_ctl;
 473         int ret = 0;
 474
 475         caching_ctl = kzalloc(sizeof(*caching_ctl), GFP_NOFS);
 476         BUG_ON(!caching_ctl);
 477
 478         INIT_LIST_HEAD(&caching_ctl->list);
 479         mutex_init(&caching_ctl->mutex);
 480         init_waitqueue_head(&caching_ctl->wait);
 481         caching_ctl->block_group = cache;
 482         caching_ctl->progress = cache->key.objectid;
 483         atomic_set(&caching_ctl->count, 1);
 484         caching_ctl->work.func = caching_thread;
 485
 486         spin_lock(&cache->lock);
 487         /*
 488          * This should be a rare occasion, but this could happen I think in the
 489          * case where one thread starts to load the space cache info, and then
 490          * some other thread starts a transaction commit which tries to do an
 491          * allocation while the other thread is still loading the space cache
 492          * info.  The previous loop should have kept us from choosing this block
 493          * group, but if we've moved to the state where we will wait on caching
 494          * block groups we need to first check if we're doing a fast load here,
 495          * so we can wait for it to finish, otherwise we could end up allocating
 496          * from a block group who's cache gets evicted for one reason or
 497          * another.
 498          */
 499         while (cache->cached == BTRFS_CACHE_FAST) {
 500                 struct btrfs_caching_control *ctl;
 501
 502                 ctl = cache->caching_ctl;
 503                 atomic_inc(&ctl->count);
 504                 prepare_to_wait(&ctl->wait, &wait, TASK_UNINTERRUPTIBLE);
 505                 spin_unlock(&cache->lock);
 506
 507                 schedule();
 508
 509                 finish_wait(&ctl->wait, &wait);
 510                 put_caching_control(ctl);
 511                 spin_lock(&cache->lock);
 512         }
 513
 514         if (cache->cached != BTRFS_CACHE_NO) {
 515                 spin_unlock(&cache->lock);
 516                 kfree(caching_ctl);
 517                 return 0;
 518         }
 519         WARN_ON(cache->caching_ctl);
 520         cache->caching_ctl = caching_ctl;
 521         cache->cached = BTRFS_CACHE_FAST;
 522         spin_unlock(&cache->lock);
 523
 524         /*
 525          * We can't do the read from on-disk cache during a commit since we need
 526          * to have the normal tree locking.  Also if we are currently trying to
 527          * allocate blocks for the tree root we can't do the fast caching since
 528          * we likely hold important locks.
 529          */
 530         if (trans && (!trans->transaction->in_commit) &&
 531             (root && root != root->fs_info->tree_root) &&
 532             btrfs_test_opt(root, SPACE_CACHE)) {
 533                 ret = load_free_space_cache(fs_info, cache);
 534
 535                 spin_lock(&cache->lock);
 536                 if (ret == 1) {
 537                         cache->caching_ctl = NULL;
 538                         cache->cached = BTRFS_CACHE_FINISHED;
 539                         cache->last_byte_to_unpin = (u64)-1;
 540                 } else {
 541                         if (load_cache_only) {
 542                                 cache->caching_ctl = NULL;
 543                                 cache->cached = BTRFS_CACHE_NO;
 544                         } else {
 545                                 cache->cached = BTRFS_CACHE_STARTED;
 546                         }
 547                 }
 548                 spin_unlock(&cache->lock);
 549                 wake_up(&caching_ctl->wait);
 550                 if (ret == 1) {
 551                         put_caching_control(caching_ctl);
 552                         free_excluded_extents(fs_info->extent_root, cache);
 553                         return 0;
 554                 }
 555         } else {
 556                 /*
 557                  * We are not going to do the fast caching, set cached to the
 558                  * appropriate value and wakeup any waiters.
 559                  */
 560                 spin_lock(&cache->lock);
 561                 if (load_cache_only) {
 562                         cache->caching_ctl = NULL;
 563                         cache->cached = BTRFS_CACHE_NO;
 564                 } else {
 565                         cache->cached = BTRFS_CACHE_STARTED;
 566                 }
 567                 spin_unlock(&cache->lock);
 568                 wake_up(&caching_ctl->wait);
 569         }
 570
 571         if (load_cache_only) {
 572                 put_caching_control(caching_ctl);
 573                 return 0;
 574         }
 575
 576         down_write(&fs_info->extent_commit_sem);
 577         atomic_inc(&caching_ctl->count);
 578         list_add_tail(&caching_ctl->list, &fs_info->caching_block_groups);
 579         up_write(&fs_info->extent_commit_sem);
 580
 581         btrfs_get_block_group(cache);
 582
 583         btrfs_queue_worker(&fs_info->caching_workers, &caching_ctl->work);
 584
 585         return ret;
 586 }
 587
 588 /*
 589  * return the block group that starts at or after bytenr
 590  */
 591 static struct btrfs_block_group_cache *
 592 btrfs_lookup_first_block_group(struct btrfs_fs_info *info, u64 bytenr)
 593 {
 594         struct btrfs_block_group_cache *cache;
 595
 596         cache = block_group_cache_tree_search(info, bytenr, 0);
 597
 598         return cache;
 599 }
 600
 601 /*
 602  * return the block group that contains the given bytenr
 603  */
 604 struct btrfs_block_group_cache *btrfs_lookup_block_group(
 605                                                  struct btrfs_fs_info *info,
 606                                                  u64 bytenr)
 607 {
 608         struct btrfs_block_group_cache *cache;
 609
 610         cache = block_group_cache_tree_search(info, bytenr, 1);
 611
 612         return cache;
 613 }
 614
 615 static struct btrfs_space_info *__find_space_info(struct btrfs_fs_info *info,
 616                                                   u64 flags)
 617 {
 618         struct list_head *head = &info->space_info;
 619         struct btrfs_space_info *found;
 620
 621         flags &= BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_SYSTEM |
 622                  BTRFS_BLOCK_GROUP_METADATA;
 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)
1876 {
1877         int ret;
1878         BUG_ON(owner < BTRFS_FIRST_FREE_OBJECTID &&
1879                root_objectid == BTRFS_TREE_LOG_OBJECTID);
1880
1881         if (owner < BTRFS_FIRST_FREE_OBJECTID) {
1882                 ret = btrfs_add_delayed_tree_ref(trans, bytenr, num_bytes,
1883                                         parent, root_objectid, (int)owner,
1884                                         BTRFS_ADD_DELAYED_REF, NULL);
1885         } else {
1886                 ret = btrfs_add_delayed_data_ref(trans, bytenr, num_bytes,
1887                                         parent, root_objectid, owner, offset,
1888                                         BTRFS_ADD_DELAYED_REF, NULL);
1889         }
1890         return ret;
1891 }
1892
1893 static int __btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
1894                                   struct btrfs_root *root,
1895                                   u64 bytenr, u64 num_bytes,
1896                                   u64 parent, u64 root_objectid,
1897                                   u64 owner, u64 offset, int refs_to_add,
1898                                   struct btrfs_delayed_extent_op *extent_op)
1899 {
1900         struct btrfs_path *path;
1901         struct extent_buffer *leaf;
1902         struct btrfs_extent_item *item;
1903         u64 refs;
1904         int ret;
1905         int err = 0;
1906
1907         path = btrfs_alloc_path();
1908         if (!path)
1909                 return -ENOMEM;
1910
1911         path->reada = 1;
1912         path->leave_spinning = 1;
1913         /* this will setup the path even if it fails to insert the back ref */
1914         ret = insert_inline_extent_backref(trans, root->fs_info->extent_root,
1915                                            path, bytenr, num_bytes, parent,
1916                                            root_objectid, owner, offset,
1917                                            refs_to_add, extent_op);
1918         if (ret == 0)
1919                 goto out;
1920
1921         if (ret != -EAGAIN) {
1922                 err = ret;
1923                 goto out;
1924         }
1925
1926         leaf = path->nodes[0];
1927         item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
1928         refs = btrfs_extent_refs(leaf, item);
1929         btrfs_set_extent_refs(leaf, item, refs + refs_to_add);
1930         if (extent_op)
1931                 __run_delayed_extent_op(extent_op, leaf, item);
1932
1933         btrfs_mark_buffer_dirty(leaf);
1934         btrfs_release_path(path);
1935
1936         path->reada = 1;
1937         path->leave_spinning = 1;
1938
1939         /* now insert the actual backref */
1940         ret = insert_extent_backref(trans, root->fs_info->extent_root,
1941                                     path, bytenr, parent, root_objectid,
1942                                     owner, offset, refs_to_add);
1943         BUG_ON(ret);
1944 out:
1945         btrfs_free_path(path);
1946         return err;
1947 }
1948
1949 static int run_delayed_data_ref(struct btrfs_trans_handle *trans,
1950                                 struct btrfs_root *root,
1951                                 struct btrfs_delayed_ref_node *node,
1952                                 struct btrfs_delayed_extent_op *extent_op,
1953                                 int insert_reserved)
1954 {
1955         int ret = 0;
1956         struct btrfs_delayed_data_ref *ref;
1957         struct btrfs_key ins;
1958         u64 parent = 0;
1959         u64 ref_root = 0;
1960         u64 flags = 0;
1961
1962         ins.objectid = node->bytenr;
1963         ins.offset = node->num_bytes;
1964         ins.type = BTRFS_EXTENT_ITEM_KEY;
1965
1966         ref = btrfs_delayed_node_to_data_ref(node);
1967         if (node->type == BTRFS_SHARED_DATA_REF_KEY)
1968                 parent = ref->parent;
1969         else
1970                 ref_root = ref->root;
1971
1972         if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
1973                 if (extent_op) {
1974                         BUG_ON(extent_op->update_key);
1975                         flags |= extent_op->flags_to_set;
1976                 }
1977                 ret = alloc_reserved_file_extent(trans, root,
1978                                                  parent, ref_root, flags,
1979                                                  ref->objectid, ref->offset,
1980                                                  &ins, node->ref_mod);
1981         } else if (node->action == BTRFS_ADD_DELAYED_REF) {
1982                 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
1983                                              node->num_bytes, parent,
1984                                              ref_root, ref->objectid,
1985                                              ref->offset, node->ref_mod,
1986                                              extent_op);
1987         } else if (node->action == BTRFS_DROP_DELAYED_REF) {
1988                 ret = __btrfs_free_extent(trans, root, node->bytenr,
1989                                           node->num_bytes, parent,
1990                                           ref_root, ref->objectid,
1991                                           ref->offset, node->ref_mod,
1992                                           extent_op);
1993         } else {
1994                 BUG();
1995         }
1996         return ret;
1997 }
1998
1999 static void __run_delayed_extent_op(struct btrfs_delayed_extent_op *extent_op,
2000                                     struct extent_buffer *leaf,
2001                                     struct btrfs_extent_item *ei)
2002 {
2003         u64 flags = btrfs_extent_flags(leaf, ei);
2004         if (extent_op->update_flags) {
2005                 flags |= extent_op->flags_to_set;
2006                 btrfs_set_extent_flags(leaf, ei, flags);
2007         }
2008
2009         if (extent_op->update_key) {
2010                 struct btrfs_tree_block_info *bi;
2011                 BUG_ON(!(flags & BTRFS_EXTENT_FLAG_TREE_BLOCK));
2012                 bi = (struct btrfs_tree_block_info *)(ei + 1);
2013                 btrfs_set_tree_block_key(leaf, bi, &extent_op->key);
2014         }
2015 }
2016
2017 static int run_delayed_extent_op(struct btrfs_trans_handle *trans,
2018                                  struct btrfs_root *root,
2019                                  struct btrfs_delayed_ref_node *node,
2020                                  struct btrfs_delayed_extent_op *extent_op)
2021 {
2022         struct btrfs_key key;
2023         struct btrfs_path *path;
2024         struct btrfs_extent_item *ei;
2025         struct extent_buffer *leaf;
2026         u32 item_size;
2027         int ret;
2028         int err = 0;
2029
2030         path = btrfs_alloc_path();
2031         if (!path)
2032                 return -ENOMEM;
2033
2034         key.objectid = node->bytenr;
2035         key.type = BTRFS_EXTENT_ITEM_KEY;
2036         key.offset = node->num_bytes;
2037
2038         path->reada = 1;
2039         path->leave_spinning = 1;
2040         ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key,
2041                                 path, 0, 1);
2042         if (ret < 0) {
2043                 err = ret;
2044                 goto out;
2045         }
2046         if (ret > 0) {
2047                 err = -EIO;
2048                 goto out;
2049         }
2050
2051         leaf = path->nodes[0];
2052         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2053 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2054         if (item_size < sizeof(*ei)) {
2055                 ret = convert_extent_item_v0(trans, root->fs_info->extent_root,
2056                                              path, (u64)-1, 0);
2057                 if (ret < 0) {
2058                         err = ret;
2059                         goto out;
2060                 }
2061                 leaf = path->nodes[0];
2062                 item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2063         }
2064 #endif
2065         BUG_ON(item_size < sizeof(*ei));
2066         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2067         __run_delayed_extent_op(extent_op, leaf, ei);
2068
2069         btrfs_mark_buffer_dirty(leaf);
2070 out:
2071         btrfs_free_path(path);
2072         return err;
2073 }
2074
2075 static int run_delayed_tree_ref(struct btrfs_trans_handle *trans,
2076                                 struct btrfs_root *root,
2077                                 struct btrfs_delayed_ref_node *node,
2078                                 struct btrfs_delayed_extent_op *extent_op,
2079                                 int insert_reserved)
2080 {
2081         int ret = 0;
2082         struct btrfs_delayed_tree_ref *ref;
2083         struct btrfs_key ins;
2084         u64 parent = 0;
2085         u64 ref_root = 0;
2086
2087         ins.objectid = node->bytenr;
2088         ins.offset = node->num_bytes;
2089         ins.type = BTRFS_EXTENT_ITEM_KEY;
2090
2091         ref = btrfs_delayed_node_to_tree_ref(node);
2092         if (node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2093                 parent = ref->parent;
2094         else
2095                 ref_root = ref->root;
2096
2097         BUG_ON(node->ref_mod != 1);
2098         if (node->action == BTRFS_ADD_DELAYED_REF && insert_reserved) {
2099                 BUG_ON(!extent_op || !extent_op->update_flags ||
2100                        !extent_op->update_key);
2101                 ret = alloc_reserved_tree_block(trans, root,
2102                                                 parent, ref_root,
2103                                                 extent_op->flags_to_set,
2104                                                 &extent_op->key,
2105                                                 ref->level, &ins);
2106         } else if (node->action == BTRFS_ADD_DELAYED_REF) {
2107                 ret = __btrfs_inc_extent_ref(trans, root, node->bytenr,
2108                                              node->num_bytes, parent, ref_root,
2109                                              ref->level, 0, 1, extent_op);
2110         } else if (node->action == BTRFS_DROP_DELAYED_REF) {
2111                 ret = __btrfs_free_extent(trans, root, node->bytenr,
2112                                           node->num_bytes, parent, ref_root,
2113                                           ref->level, 0, 1, extent_op);
2114         } else {
2115                 BUG();
2116         }
2117         return ret;
2118 }
2119
2120 /* helper function to actually process a single delayed ref entry */
2121 static int run_one_delayed_ref(struct btrfs_trans_handle *trans,
2122                                struct btrfs_root *root,
2123                                struct btrfs_delayed_ref_node *node,
2124                                struct btrfs_delayed_extent_op *extent_op,
2125                                int insert_reserved)
2126 {
2127         int ret;
2128         if (btrfs_delayed_ref_is_head(node)) {
2129                 struct btrfs_delayed_ref_head *head;
2130                 /*
2131                  * we've hit the end of the chain and we were supposed
2132                  * to insert this extent into the tree.  But, it got
2133                  * deleted before we ever needed to insert it, so all
2134                  * we have to do is clean up the accounting
2135                  */
2136                 BUG_ON(extent_op);
2137                 head = btrfs_delayed_node_to_head(node);
2138                 if (insert_reserved) {
2139                         btrfs_pin_extent(root, node->bytenr,
2140                                          node->num_bytes, 1);
2141                         if (head->is_data) {
2142                                 ret = btrfs_del_csums(trans, root,
2143                                                       node->bytenr,
2144                                                       node->num_bytes);
2145                                 BUG_ON(ret);
2146                         }
2147                 }
2148                 mutex_unlock(&head->mutex);
2149                 return 0;
2150         }
2151
2152         if (node->type == BTRFS_TREE_BLOCK_REF_KEY ||
2153             node->type == BTRFS_SHARED_BLOCK_REF_KEY)
2154                 ret = run_delayed_tree_ref(trans, root, node, extent_op,
2155                                            insert_reserved);
2156         else if (node->type == BTRFS_EXTENT_DATA_REF_KEY ||
2157                  node->type == BTRFS_SHARED_DATA_REF_KEY)
2158                 ret = run_delayed_data_ref(trans, root, node, extent_op,
2159                                            insert_reserved);
2160         else
2161                 BUG();
2162         return ret;
2163 }
2164
2165 static noinline struct btrfs_delayed_ref_node *
2166 select_delayed_ref(struct btrfs_delayed_ref_head *head)
2167 {
2168         struct rb_node *node;
2169         struct btrfs_delayed_ref_node *ref;
2170         int action = BTRFS_ADD_DELAYED_REF;
2171 again:
2172         /*
2173          * select delayed ref of type BTRFS_ADD_DELAYED_REF first.
2174          * this prevents ref count from going down to zero when
2175          * there still are pending delayed ref.
2176          */
2177         node = rb_prev(&head->node.rb_node);
2178         while (1) {
2179                 if (!node)
2180                         break;
2181                 ref = rb_entry(node, struct btrfs_delayed_ref_node,
2182                                 rb_node);
2183                 if (ref->bytenr != head->node.bytenr)
2184                         break;
2185                 if (ref->action == action)
2186                         return ref;
2187                 node = rb_prev(node);
2188         }
2189         if (action == BTRFS_ADD_DELAYED_REF) {
2190                 action = BTRFS_DROP_DELAYED_REF;
2191                 goto again;
2192         }
2193         return NULL;
2194 }
2195
2196 static noinline int run_clustered_refs(struct btrfs_trans_handle *trans,
2197                                        struct btrfs_root *root,
2198                                        struct list_head *cluster)
2199 {
2200         struct btrfs_delayed_ref_root *delayed_refs;
2201         struct btrfs_delayed_ref_node *ref;
2202         struct btrfs_delayed_ref_head *locked_ref = NULL;
2203         struct btrfs_delayed_extent_op *extent_op;
2204         int ret;
2205         int count = 0;
2206         int must_insert_reserved = 0;
2207
2208         delayed_refs = &trans->transaction->delayed_refs;
2209         while (1) {
2210                 if (!locked_ref) {
2211                         /* pick a new head ref from the cluster list */
2212                         if (list_empty(cluster))
2213                                 break;
2214
2215                         locked_ref = list_entry(cluster->next,
2216                                      struct btrfs_delayed_ref_head, cluster);
2217
2218                         /* grab the lock that says we are going to process
2219                          * all the refs for this head */
2220                         ret = btrfs_delayed_ref_lock(trans, locked_ref);
2221
2222                         /*
2223                          * we may have dropped the spin lock to get the head
2224                          * mutex lock, and that might have given someone else
2225                          * time to free the head.  If that's true, it has been
2226                          * removed from our list and we can move on.
2227                          */
2228                         if (ret == -EAGAIN) {
2229                                 locked_ref = NULL;
2230                                 count++;
2231                                 continue;
2232                         }
2233                 }
2234
2235                 /*
2236                  * record the must insert reserved flag before we
2237                  * drop the spin lock.
2238                  */
2239                 must_insert_reserved = locked_ref->must_insert_reserved;
2240                 locked_ref->must_insert_reserved = 0;
2241
2242                 extent_op = locked_ref->extent_op;
2243                 locked_ref->extent_op = NULL;
2244
2245                 /*
2246                  * locked_ref is the head node, so we have to go one
2247                  * node back for any delayed ref updates
2248                  */
2249                 ref = select_delayed_ref(locked_ref);
2250                 if (!ref) {
2251                         /* All delayed refs have been processed, Go ahead
2252                          * and send the head node to run_one_delayed_ref,
2253                          * so that any accounting fixes can happen
2254                          */
2255                         ref = &locked_ref->node;
2256
2257                         if (extent_op && must_insert_reserved) {
2258                                 kfree(extent_op);
2259                                 extent_op = NULL;
2260                         }
2261
2262                         if (extent_op) {
2263                                 spin_unlock(&delayed_refs->lock);
2264
2265                                 ret = run_delayed_extent_op(trans, root,
2266                                                             ref, extent_op);
2267                                 BUG_ON(ret);
2268                                 kfree(extent_op);
2269
2270                                 cond_resched();
2271                                 spin_lock(&delayed_refs->lock);
2272                                 continue;
2273                         }
2274
2275                         list_del_init(&locked_ref->cluster);
2276                         locked_ref = NULL;
2277                 }
2278
2279                 ref->in_tree = 0;
2280                 rb_erase(&ref->rb_node, &delayed_refs->root);
2281                 delayed_refs->num_entries--;
2282
2283                 spin_unlock(&delayed_refs->lock);
2284
2285                 ret = run_one_delayed_ref(trans, root, ref, extent_op,
2286                                           must_insert_reserved);
2287                 BUG_ON(ret);
2288
2289                 btrfs_put_delayed_ref(ref);
2290                 kfree(extent_op);
2291                 count++;
2292
2293                 cond_resched();
2294                 spin_lock(&delayed_refs->lock);
2295         }
2296         return count;
2297 }
2298
2299 /*
2300  * this starts processing the delayed reference count updates and
2301  * extent insertions we have queued up so far.  count can be
2302  * 0, which means to process everything in the tree at the start
2303  * of the run (but not newly added entries), or it can be some target
2304  * number you'd like to process.
2305  */
2306 int btrfs_run_delayed_refs(struct btrfs_trans_handle *trans,
2307                            struct btrfs_root *root, unsigned long count)
2308 {
2309         struct rb_node *node;
2310         struct btrfs_delayed_ref_root *delayed_refs;
2311         struct btrfs_delayed_ref_node *ref;
2312         struct list_head cluster;
2313         int ret;
2314         int run_all = count == (unsigned long)-1;
2315         int run_most = 0;
2316
2317         if (root == root->fs_info->extent_root)
2318                 root = root->fs_info->tree_root;
2319
2320         delayed_refs = &trans->transaction->delayed_refs;
2321         INIT_LIST_HEAD(&cluster);
2322 again:
2323         spin_lock(&delayed_refs->lock);
2324         if (count == 0) {
2325                 count = delayed_refs->num_entries * 2;
2326                 run_most = 1;
2327         }
2328         while (1) {
2329                 if (!(run_all || run_most) &&
2330                     delayed_refs->num_heads_ready < 64)
2331                         break;
2332
2333                 /*
2334                  * go find something we can process in the rbtree.  We start at
2335                  * the beginning of the tree, and then build a cluster
2336                  * of refs to process starting at the first one we are able to
2337                  * lock
2338                  */
2339                 ret = btrfs_find_ref_cluster(trans, &cluster,
2340                                              delayed_refs->run_delayed_start);
2341                 if (ret)
2342                         break;
2343
2344                 ret = run_clustered_refs(trans, root, &cluster);
2345                 BUG_ON(ret < 0);
2346
2347                 count -= min_t(unsigned long, ret, count);
2348
2349                 if (count == 0)
2350                         break;
2351         }
2352
2353         if (run_all) {
2354                 node = rb_first(&delayed_refs->root);
2355                 if (!node)
2356                         goto out;
2357                 count = (unsigned long)-1;
2358
2359                 while (node) {
2360                         ref = rb_entry(node, struct btrfs_delayed_ref_node,
2361                                        rb_node);
2362                         if (btrfs_delayed_ref_is_head(ref)) {
2363                                 struct btrfs_delayed_ref_head *head;
2364
2365                                 head = btrfs_delayed_node_to_head(ref);
2366                                 atomic_inc(&ref->refs);
2367
2368                                 spin_unlock(&delayed_refs->lock);
2369                                 /*
2370                                  * Mutex was contended, block until it's
2371                                  * released and try again
2372                                  */
2373                                 mutex_lock(&head->mutex);
2374                                 mutex_unlock(&head->mutex);
2375
2376                                 btrfs_put_delayed_ref(ref);
2377                                 cond_resched();
2378                                 goto again;
2379                         }
2380                         node = rb_next(node);
2381                 }
2382                 spin_unlock(&delayed_refs->lock);
2383                 schedule_timeout(1);
2384                 goto again;
2385         }
2386 out:
2387         spin_unlock(&delayed_refs->lock);
2388         return 0;
2389 }
2390
2391 int btrfs_set_disk_extent_flags(struct btrfs_trans_handle *trans,
2392                                 struct btrfs_root *root,
2393                                 u64 bytenr, u64 num_bytes, u64 flags,
2394                                 int is_data)
2395 {
2396         struct btrfs_delayed_extent_op *extent_op;
2397         int ret;
2398
2399         extent_op = kmalloc(sizeof(*extent_op), GFP_NOFS);
2400         if (!extent_op)
2401                 return -ENOMEM;
2402
2403         extent_op->flags_to_set = flags;
2404         extent_op->update_flags = 1;
2405         extent_op->update_key = 0;
2406         extent_op->is_data = is_data ? 1 : 0;
2407
2408         ret = btrfs_add_delayed_extent_op(trans, bytenr, num_bytes, extent_op);
2409         if (ret)
2410                 kfree(extent_op);
2411         return ret;
2412 }
2413
2414 static noinline int check_delayed_ref(struct btrfs_trans_handle *trans,
2415                                       struct btrfs_root *root,
2416                                       struct btrfs_path *path,
2417                                       u64 objectid, u64 offset, u64 bytenr)
2418 {
2419         struct btrfs_delayed_ref_head *head;
2420         struct btrfs_delayed_ref_node *ref;
2421         struct btrfs_delayed_data_ref *data_ref;
2422         struct btrfs_delayed_ref_root *delayed_refs;
2423         struct rb_node *node;
2424         int ret = 0;
2425
2426         ret = -ENOENT;
2427         delayed_refs = &trans->transaction->delayed_refs;
2428         spin_lock(&delayed_refs->lock);
2429         head = btrfs_find_delayed_ref_head(trans, bytenr);
2430         if (!head)
2431                 goto out;
2432
2433         if (!mutex_trylock(&head->mutex)) {
2434                 atomic_inc(&head->node.refs);
2435                 spin_unlock(&delayed_refs->lock);
2436
2437                 btrfs_release_path(path);
2438
2439                 /*
2440                  * Mutex was contended, block until it's released and let
2441                  * caller try again
2442                  */
2443                 mutex_lock(&head->mutex);
2444                 mutex_unlock(&head->mutex);
2445                 btrfs_put_delayed_ref(&head->node);
2446                 return -EAGAIN;
2447         }
2448
2449         node = rb_prev(&head->node.rb_node);
2450         if (!node)
2451                 goto out_unlock;
2452
2453         ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2454
2455         if (ref->bytenr != bytenr)
2456                 goto out_unlock;
2457
2458         ret = 1;
2459         if (ref->type != BTRFS_EXTENT_DATA_REF_KEY)
2460                 goto out_unlock;
2461
2462         data_ref = btrfs_delayed_node_to_data_ref(ref);
2463
2464         node = rb_prev(node);
2465         if (node) {
2466                 ref = rb_entry(node, struct btrfs_delayed_ref_node, rb_node);
2467                 if (ref->bytenr == bytenr)
2468                         goto out_unlock;
2469         }
2470
2471         if (data_ref->root != root->root_key.objectid ||
2472             data_ref->objectid != objectid || data_ref->offset != offset)
2473                 goto out_unlock;
2474
2475         ret = 0;
2476 out_unlock:
2477         mutex_unlock(&head->mutex);
2478 out:
2479         spin_unlock(&delayed_refs->lock);
2480         return ret;
2481 }
2482
2483 static noinline int check_committed_ref(struct btrfs_trans_handle *trans,
2484                                         struct btrfs_root *root,
2485                                         struct btrfs_path *path,
2486                                         u64 objectid, u64 offset, u64 bytenr)
2487 {
2488         struct btrfs_root *extent_root = root->fs_info->extent_root;
2489         struct extent_buffer *leaf;
2490         struct btrfs_extent_data_ref *ref;
2491         struct btrfs_extent_inline_ref *iref;
2492         struct btrfs_extent_item *ei;
2493         struct btrfs_key key;
2494         u32 item_size;
2495         int ret;
2496
2497         key.objectid = bytenr;
2498         key.offset = (u64)-1;
2499         key.type = BTRFS_EXTENT_ITEM_KEY;
2500
2501         ret = btrfs_search_slot(NULL, extent_root, &key, path, 0, 0);
2502         if (ret < 0)
2503                 goto out;
2504         BUG_ON(ret == 0);
2505
2506         ret = -ENOENT;
2507         if (path->slots[0] == 0)
2508                 goto out;
2509
2510         path->slots[0]--;
2511         leaf = path->nodes[0];
2512         btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2513
2514         if (key.objectid != bytenr || key.type != BTRFS_EXTENT_ITEM_KEY)
2515                 goto out;
2516
2517         ret = 1;
2518         item_size = btrfs_item_size_nr(leaf, path->slots[0]);
2519 #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
2520         if (item_size < sizeof(*ei)) {
2521                 WARN_ON(item_size != sizeof(struct btrfs_extent_item_v0));
2522                 goto out;
2523         }
2524 #endif
2525         ei = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_extent_item);
2526
2527         if (item_size != sizeof(*ei) +
2528             btrfs_extent_inline_ref_size(BTRFS_EXTENT_DATA_REF_KEY))
2529                 goto out;
2530
2531         if (btrfs_extent_generation(leaf, ei) <=
2532             btrfs_root_last_snapshot(&root->root_item))
2533                 goto out;
2534
2535         iref = (struct btrfs_extent_inline_ref *)(ei + 1);
2536         if (btrfs_extent_inline_ref_type(leaf, iref) !=
2537             BTRFS_EXTENT_DATA_REF_KEY)
2538                 goto out;
2539
2540         ref = (struct btrfs_extent_data_ref *)(&iref->offset);
2541         if (btrfs_extent_refs(leaf, ei) !=
2542             btrfs_extent_data_ref_count(leaf, ref) ||
2543             btrfs_extent_data_ref_root(leaf, ref) !=
2544             root->root_key.objectid ||
2545             btrfs_extent_data_ref_objectid(leaf, ref) != objectid ||
2546             btrfs_extent_data_ref_offset(leaf, ref) != offset)
2547                 goto out;
2548
2549         ret = 0;
2550 out:
2551         return ret;
2552 }
2553
2554 int btrfs_cross_ref_exist(struct btrfs_trans_handle *trans,
2555                           struct btrfs_root *root,
2556                           u64 objectid, u64 offset, u64 bytenr)
2557 {
2558         struct btrfs_path *path;
2559         int ret;
2560         int ret2;
2561
2562         path = btrfs_alloc_path();
2563         if (!path)
2564                 return -ENOENT;
2565
2566         do {
2567                 ret = check_committed_ref(trans, root, path, objectid,
2568                                           offset, bytenr);
2569                 if (ret && ret != -ENOENT)
2570                         goto out;
2571
2572                 ret2 = check_delayed_ref(trans, root, path, objectid,
2573                                          offset, bytenr);
2574         } while (ret2 == -EAGAIN);
2575
2576         if (ret2 && ret2 != -ENOENT) {
2577                 ret = ret2;
2578                 goto out;
2579         }
2580
2581         if (ret != -ENOENT || ret2 != -ENOENT)
2582                 ret = 0;
2583 out:
2584         btrfs_free_path(path);
2585         if (root->root_key.objectid == BTRFS_DATA_RELOC_TREE_OBJECTID)
2586                 WARN_ON(ret > 0);
2587         return ret;
2588 }
2589
2590 static int __btrfs_mod_ref(struct btrfs_trans_handle *trans,
2591                            struct btrfs_root *root,
2592                            struct extent_buffer *buf,
2593                            int full_backref, int inc)
2594 {
2595         u64 bytenr;
2596         u64 num_bytes;
2597         u64 parent;
2598         u64 ref_root;
2599         u32 nritems;
2600         struct btrfs_key key;
2601         struct btrfs_file_extent_item *fi;
2602         int i;
2603         int level;
2604         int ret = 0;
2605         int (*process_func)(struct btrfs_trans_handle *, struct btrfs_root *,
2606                             u64, u64, u64, u64, u64, u64);
2607
2608         ref_root = btrfs_header_owner(buf);
2609         nritems = btrfs_header_nritems(buf);
2610         level = btrfs_header_level(buf);
2611
2612         if (!root->ref_cows && level == 0)
2613                 return 0;
2614
2615         if (inc)
2616                 process_func = btrfs_inc_extent_ref;
2617         else
2618                 process_func = btrfs_free_extent;
2619
2620         if (full_backref)
2621                 parent = buf->start;
2622         else
2623                 parent = 0;
2624
2625         for (i = 0; i < nritems; i++) {
2626                 if (level == 0) {
2627                         btrfs_item_key_to_cpu(buf, &key, i);
2628                         if (btrfs_key_type(&key) != BTRFS_EXTENT_DATA_KEY)
2629                                 continue;
2630                         fi = btrfs_item_ptr(buf, i,
2631                                             struct btrfs_file_extent_item);
2632                         if (btrfs_file_extent_type(buf, fi) ==
2633                             BTRFS_FILE_EXTENT_INLINE)
2634                                 continue;
2635                         bytenr = btrfs_file_extent_disk_bytenr(buf, fi);
2636                         if (bytenr == 0)
2637                                 continue;
2638
2639                         num_bytes = btrfs_file_extent_disk_num_bytes(buf, fi);
2640                         key.offset -= btrfs_file_extent_offset(buf, fi);
2641                         ret = process_func(trans, root, bytenr, num_bytes,
2642                                            parent, ref_root, key.objectid,
2643                                            key.offset);
2644                         if (ret)
2645                                 goto fail;
2646                 } else {
2647                         bytenr = btrfs_node_blockptr(buf, i);
2648                         num_bytes = btrfs_level_size(root, level - 1);
2649                         ret = process_func(trans, root, bytenr, num_bytes,
2650                                            parent, ref_root, level - 1, 0);
2651                         if (ret)
2652                                 goto fail;
2653                 }
2654         }
2655         return 0;
2656 fail:
2657         BUG();
2658         return ret;
2659 }
2660
2661 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2662                   struct extent_buffer *buf, int full_backref)
2663 {
2664         return __btrfs_mod_ref(trans, root, buf, full_backref, 1);
2665 }
2666
2667 int btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
2668                   struct extent_buffer *buf, int full_backref)
2669 {
2670         return __btrfs_mod_ref(trans, root, buf, full_backref, 0);
2671 }
2672
2673 static int write_one_cache_group(struct btrfs_trans_handle *trans,
2674                                  struct btrfs_root *root,
2675                                  struct btrfs_path *path,
2676                                  struct btrfs_block_group_cache *cache)
2677 {
2678         int ret;
2679         struct btrfs_root *extent_root = root->fs_info->extent_root;
2680         unsigned long bi;
2681         struct extent_buffer *leaf;
2682
2683         ret = btrfs_search_slot(trans, extent_root, &cache->key, path, 0, 1);
2684         if (ret < 0)
2685                 goto fail;
2686         BUG_ON(ret);
2687
2688         leaf = path->nodes[0];
2689         bi = btrfs_item_ptr_offset(leaf, path->slots[0]);
2690         write_extent_buffer(leaf, &cache->item, bi, sizeof(cache->item));
2691         btrfs_mark_buffer_dirty(leaf);
2692         btrfs_release_path(path);
2693 fail:
2694         if (ret)
2695                 return ret;
2696         return 0;
2697
2698 }
2699
2700 static struct btrfs_block_group_cache *
2701 next_block_group(struct btrfs_root *root,
2702                  struct btrfs_block_group_cache *cache)
2703 {
2704         struct rb_node *node;
2705         spin_lock(&root->fs_info->block_group_cache_lock);
2706         node = rb_next(&cache->cache_node);
2707         btrfs_put_block_group(cache);
2708         if (node) {
2709                 cache = rb_entry(node, struct btrfs_block_group_cache,
2710                                  cache_node);
2711                 btrfs_get_block_group(cache);
2712         } else
2713                 cache = NULL;
2714         spin_unlock(&root->fs_info->block_group_cache_lock);
2715         return cache;
2716 }
2717
2718 static int cache_save_setup(struct btrfs_block_group_cache *block_group,
2719                             struct btrfs_trans_handle *trans,
2720                             struct btrfs_path *path)
2721 {
2722         struct btrfs_root *root = block_group->fs_info->tree_root;
2723         struct inode *inode = NULL;
2724         u64 alloc_hint = 0;
2725         int dcs = BTRFS_DC_ERROR;
2726         int num_pages = 0;
2727         int retries = 0;
2728         int ret = 0;
2729
2730         /*
2731          * If this block group is smaller than 100 megs don't bother caching the
2732          * block group.
2733          */
2734         if (block_group->key.offset < (100 * 1024 * 1024)) {
2735                 spin_lock(&block_group->lock);
2736                 block_group->disk_cache_state = BTRFS_DC_WRITTEN;
2737                 spin_unlock(&block_group->lock);
2738                 return 0;
2739         }
2740
2741 again:
2742         inode = lookup_free_space_inode(root, block_group, path);
2743         if (IS_ERR(inode) && PTR_ERR(inode) != -ENOENT) {
2744                 ret = PTR_ERR(inode);
2745                 btrfs_release_path(path);
2746                 goto out;
2747         }
2748
2749         if (IS_ERR(inode)) {
2750                 BUG_ON(retries);
2751                 retries++;
2752
2753                 if (block_group->ro)
2754                         goto out_free;
2755
2756                 ret = create_free_space_inode(root, trans, block_group, path);
2757                 if (ret)
2758                         goto out_free;
2759                 goto again;
2760         }
2761
2762         /* We've already setup this transaction, go ahead and exit */
2763         if (block_group->cache_generation == trans->transid &&
2764             i_size_read(inode)) {
2765                 dcs = BTRFS_DC_SETUP;
2766                 goto out_put;
2767         }
2768
2769         /*
2770          * We want to set the generation to 0, that way if anything goes wrong
2771          * from here on out we know not to trust this cache when we load up next
2772          * time.
2773          */
2774         BTRFS_I(inode)->generation = 0;
2775         ret = btrfs_update_inode(trans, root, inode);
2776         WARN_ON(ret);
2777
2778         if (i_size_read(inode) > 0) {
2779                 ret = btrfs_truncate_free_space_cache(root, trans, path,
2780                                                       inode);
2781                 if (ret)
2782                         goto out_put;
2783         }
2784
2785         spin_lock(&block_group->lock);
2786         if (block_group->cached != BTRFS_CACHE_FINISHED) {
2787                 /* We're not cached, don't bother trying to write stuff out */
2788                 dcs = BTRFS_DC_WRITTEN;
2789                 spin_unlock(&block_group->lock);
2790                 goto out_put;
2791         }
2792         spin_unlock(&block_group->lock);
2793
2794         num_pages = (int)div64_u64(block_group->key.offset, 1024 * 1024 * 1024);
2795         if (!num_pages)
2796                 num_pages = 1;
2797
2798         /*
2799          * Just to make absolutely sure we have enough space, we're going to
2800          * preallocate 12 pages worth of space for each block group.  In
2801          * practice we ought to use at most 8, but we need extra space so we can
2802          * add our header and have a terminator between the extents and the
2803          * bitmaps.
2804          */
2805         num_pages *= 16;
2806         num_pages *= PAGE_CACHE_SIZE;
2807
2808         ret = btrfs_check_data_free_space(inode, num_pages);
2809         if (ret)
2810                 goto out_put;
2811
2812         ret = btrfs_prealloc_file_range_trans(inode, trans, 0, 0, num_pages,
2813                                               num_pages, num_pages,
2814                                               &alloc_hint);
2815         if (!ret)
2816                 dcs = BTRFS_DC_SETUP;
2817         btrfs_free_reserved_data_space(inode, num_pages);
2818
2819 out_put:
2820         iput(inode);
2821 out_free:
2822         btrfs_release_path(path);
2823 out:
2824         spin_lock(&block_group->lock);
2825         if (!ret)
2826                 block_group->cache_generation = trans->transid;
2827         block_group->disk_cache_state = dcs;
2828         spin_unlock(&block_group->lock);
2829
2830         return ret;
2831 }
2832
2833 int btrfs_write_dirty_block_groups(struct btrfs_trans_handle *trans,
2834                                    struct btrfs_root *root)
2835 {
2836         struct btrfs_block_group_cache *cache;
2837         int err = 0;
2838         struct btrfs_path *path;
2839         u64 last = 0;
2840
2841         path = btrfs_alloc_path();
2842         if (!path)
2843                 return -ENOMEM;
2844
2845 again:
2846         while (1) {
2847                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2848                 while (cache) {
2849                         if (cache->disk_cache_state == BTRFS_DC_CLEAR)
2850                                 break;
2851                         cache = next_block_group(root, cache);
2852                 }
2853                 if (!cache) {
2854                         if (last == 0)
2855                                 break;
2856                         last = 0;
2857                         continue;
2858                 }
2859                 err = cache_save_setup(cache, trans, path);
2860                 last = cache->key.objectid + cache->key.offset;
2861                 btrfs_put_block_group(cache);
2862         }
2863
2864         while (1) {
2865                 if (last == 0) {
2866                         err = btrfs_run_delayed_refs(trans, root,
2867                                                      (unsigned long)-1);
2868                         BUG_ON(err);
2869                 }
2870
2871                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2872                 while (cache) {
2873                         if (cache->disk_cache_state == BTRFS_DC_CLEAR) {
2874                                 btrfs_put_block_group(cache);
2875                                 goto again;
2876                         }
2877
2878                         if (cache->dirty)
2879                                 break;
2880                         cache = next_block_group(root, cache);
2881                 }
2882                 if (!cache) {
2883                         if (last == 0)
2884                                 break;
2885                         last = 0;
2886                         continue;
2887                 }
2888
2889                 if (cache->disk_cache_state == BTRFS_DC_SETUP)
2890                         cache->disk_cache_state = BTRFS_DC_NEED_WRITE;
2891                 cache->dirty = 0;
2892                 last = cache->key.objectid + cache->key.offset;
2893
2894                 err = write_one_cache_group(trans, root, path, cache);
2895                 BUG_ON(err);
2896                 btrfs_put_block_group(cache);
2897         }
2898
2899         while (1) {
2900                 /*
2901                  * I don't think this is needed since we're just marking our
2902                  * preallocated extent as written, but just in case it can't
2903                  * hurt.
2904                  */
2905                 if (last == 0) {
2906                         err = btrfs_run_delayed_refs(trans, root,
2907                                                      (unsigned long)-1);
2908                         BUG_ON(err);
2909                 }
2910
2911                 cache = btrfs_lookup_first_block_group(root->fs_info, last);
2912                 while (cache) {
2913                         /*
2914                          * Really this shouldn't happen, but it could if we
2915                          * couldn't write the entire preallocated extent and
2916                          * splitting the extent resulted in a new block.
2917                          */
2918                         if (cache->dirty) {
2919                                 btrfs_put_block_group(cache);
2920                                 goto again;
2921                         }
2922                         if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2923                                 break;
2924                         cache = next_block_group(root, cache);
2925                 }
2926                 if (!cache) {
2927                         if (last == 0)
2928                                 break;
2929                         last = 0;
2930                         continue;
2931                 }
2932
2933                 btrfs_write_out_cache(root, trans, cache, path);
2934
2935                 /*
2936                  * If we didn't have an error then the cache state is still
2937                  * NEED_WRITE, so we can set it to WRITTEN.
2938                  */
2939                 if (cache->disk_cache_state == BTRFS_DC_NEED_WRITE)
2940                         cache->disk_cache_state = BTRFS_DC_WRITTEN;
2941                 last = cache->key.objectid + cache->key.offset;
2942                 btrfs_put_block_group(cache);
2943         }
2944
2945         btrfs_free_path(path);
2946         return 0;
2947 }
2948
2949 int btrfs_extent_readonly(struct btrfs_root *root, u64 bytenr)
2950 {
2951         struct btrfs_block_group_cache *block_group;
2952         int readonly = 0;
2953
2954         block_group = btrfs_lookup_block_group(root->fs_info, bytenr);
2955         if (!block_group || block_group->ro)
2956                 readonly = 1;
2957         if (block_group)
2958                 btrfs_put_block_group(block_group);
2959         return readonly;
2960 }
2961
2962 static int update_space_info(struct btrfs_fs_info *info, u64 flags,
2963                              u64 total_bytes, u64 bytes_used,
2964                              struct btrfs_space_info **space_info)
2965 {
2966         struct btrfs_space_info *found;
2967         int i;
2968         int factor;
2969
2970         if (flags & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
2971                      BTRFS_BLOCK_GROUP_RAID10))
2972                 factor = 2;
2973         else
2974                 factor = 1;
2975
2976         found = __find_space_info(info, flags);
2977         if (found) {
2978                 spin_lock(&found->lock);
2979                 found->total_bytes += total_bytes;
2980                 found->disk_total += total_bytes * factor;
2981                 found->bytes_used += bytes_used;
2982                 found->disk_used += bytes_used * factor;
2983                 found->full = 0;
2984                 spin_unlock(&found->lock);
2985                 *space_info = found;
2986                 return 0;
2987         }
2988         found = kzalloc(sizeof(*found), GFP_NOFS);
2989         if (!found)
2990                 return -ENOMEM;
2991
2992         for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
2993                 INIT_LIST_HEAD(&found->block_groups[i]);
2994         init_rwsem(&found->groups_sem);
2995         spin_lock_init(&found->lock);
2996         found->flags = flags & (BTRFS_BLOCK_GROUP_DATA |
2997                                 BTRFS_BLOCK_GROUP_SYSTEM |
2998                                 BTRFS_BLOCK_GROUP_METADATA);
2999         found->total_bytes = total_bytes;
3000         found->disk_total = total_bytes * factor;
3001         found->bytes_used = bytes_used;
3002         found->disk_used = bytes_used * factor;
3003         found->bytes_pinned = 0;
3004         found->bytes_reserved = 0;
3005         found->bytes_readonly = 0;
3006         found->bytes_may_use = 0;
3007         found->full = 0;
3008         found->force_alloc = CHUNK_ALLOC_NO_FORCE;
3009         found->chunk_alloc = 0;
3010         found->flush = 0;
3011         init_waitqueue_head(&found->wait);
3012         *space_info = found;
3013         list_add_rcu(&found->list, &info->space_info);
3014         return 0;
3015 }
3016
3017 static void set_avail_alloc_bits(struct btrfs_fs_info *fs_info, u64 flags)
3018 {
3019         u64 extra_flags = flags & (BTRFS_BLOCK_GROUP_RAID0 |
3020                                    BTRFS_BLOCK_GROUP_RAID1 |
3021                                    BTRFS_BLOCK_GROUP_RAID10 |
3022                                    BTRFS_BLOCK_GROUP_DUP);
3023         if (extra_flags) {
3024                 if (flags & BTRFS_BLOCK_GROUP_DATA)
3025                         fs_info->avail_data_alloc_bits |= extra_flags;
3026                 if (flags & BTRFS_BLOCK_GROUP_METADATA)
3027                         fs_info->avail_metadata_alloc_bits |= extra_fl