fs/btrfs/extent-tree.c

   1 #include <linux/module.h>
   2 #include "ctree.h"
   3 #include "disk-io.h"
   4 #include "print-tree.h"
   5 #include "transaction.h"
   6
   7 static int find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root
   8                             *orig_root, u64 num_blocks, u64 search_start, u64
   9                             search_end, struct btrfs_key *ins);
  10 static int finish_current_insert(struct btrfs_trans_handle *trans, struct
  11                                  btrfs_root *extent_root);
  12 static int del_pending_extents(struct btrfs_trans_handle *trans, struct
  13                                btrfs_root *extent_root);
  14
  15 int btrfs_inc_extent_ref(struct btrfs_trans_handle *trans,
  16                                 struct btrfs_root *root,
  17                                 u64 blocknr, u64 num_blocks)
  18 {
  19         struct btrfs_path *path;
  20         int ret;
  21         struct btrfs_key key;
  22         struct btrfs_leaf *l;
  23         struct btrfs_extent_item *item;
  24         struct btrfs_key ins;
  25         u32 refs;
  26
  27         find_free_extent(trans, root->fs_info->extent_root, 0, 0, (u64)-1,
  28                          &ins);
  29         path = btrfs_alloc_path();
  30         BUG_ON(!path);
  31         btrfs_init_path(path);
  32         key.objectid = blocknr;
  33         key.flags = 0;
  34         btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
  35         key.offset = num_blocks;
  36         ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path,
  37                                 0, 1);
  38         if (ret != 0)
  39                 BUG();
  40         BUG_ON(ret != 0);
  41         l = btrfs_buffer_leaf(path->nodes[0]);
  42         item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item);
  43         refs = btrfs_extent_refs(item);
  44         btrfs_set_extent_refs(item, refs + 1);
  45         btrfs_mark_buffer_dirty(path->nodes[0]);
  46
  47         btrfs_release_path(root->fs_info->extent_root, path);
  48         btrfs_free_path(path);
  49         finish_current_insert(trans, root->fs_info->extent_root);
  50         del_pending_extents(trans, root->fs_info->extent_root);
  51         return 0;
  52 }
  53
  54 static int lookup_extent_ref(struct btrfs_trans_handle *trans,
  55                              struct btrfs_root *root, u64 blocknr,
  56                              u64 num_blocks, u32 *refs)
  57 {
  58         struct btrfs_path *path;
  59         int ret;
  60         struct btrfs_key key;
  61         struct btrfs_leaf *l;
  62         struct btrfs_extent_item *item;
  63
  64         path = btrfs_alloc_path();
  65         btrfs_init_path(path);
  66         key.objectid = blocknr;
  67         key.offset = num_blocks;
  68         key.flags = 0;
  69         btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
  70         ret = btrfs_search_slot(trans, root->fs_info->extent_root, &key, path,
  71                                 0, 0);
  72         if (ret != 0)
  73                 BUG();
  74         l = btrfs_buffer_leaf(path->nodes[0]);
  75         item = btrfs_item_ptr(l, path->slots[0], struct btrfs_extent_item);
  76         *refs = btrfs_extent_refs(item);
  77         btrfs_release_path(root->fs_info->extent_root, path);
  78         btrfs_free_path(path);
  79         return 0;
  80 }
  81
  82 int btrfs_inc_root_ref(struct btrfs_trans_handle *trans,
  83                        struct btrfs_root *root)
  84 {
  85         return btrfs_inc_extent_ref(trans, root, bh_blocknr(root->node), 1);
  86 }
  87
  88 int btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root,
  89                   struct buffer_head *buf)
  90 {
  91         u64 blocknr;
  92         struct btrfs_node *buf_node;
  93         struct btrfs_leaf *buf_leaf;
  94         struct btrfs_disk_key *key;
  95         struct btrfs_file_extent_item *fi;
  96         int i;
  97         int leaf;
  98         int ret;
  99
 100         if (!root->ref_cows)
 101                 return 0;
 102         buf_node = btrfs_buffer_node(buf);
 103         leaf = btrfs_is_leaf(buf_node);
 104         buf_leaf = btrfs_buffer_leaf(buf);
 105         for (i = 0; i < btrfs_header_nritems(&buf_node->header); i++) {
 106                 if (leaf) {
 107                         key = &buf_leaf->items[i].key;
 108                         if (btrfs_disk_key_type(key) != BTRFS_EXTENT_DATA_KEY)
 109                                 continue;
 110                         fi = btrfs_item_ptr(buf_leaf, i,
 111                                             struct btrfs_file_extent_item);
 112                         ret = btrfs_inc_extent_ref(trans, root,
 113                                     btrfs_file_extent_disk_blocknr(fi),
 114                                     btrfs_file_extent_disk_num_blocks(fi));
 115                         BUG_ON(ret);
 116                 } else {
 117                         blocknr = btrfs_node_blockptr(buf_node, i);
 118                         ret = btrfs_inc_extent_ref(trans, root, blocknr, 1);
 119                         BUG_ON(ret);
 120                 }
 121         }
 122         return 0;
 123 }
 124
 125 int btrfs_finish_extent_commit(struct btrfs_trans_handle *trans, struct
 126                                btrfs_root *root)
 127 {
 128         unsigned long gang[8];
 129         u64 first = 0;
 130         int ret;
 131         int i;
 132         struct radix_tree_root *pinned_radix = &root->fs_info->pinned_radix;
 133
 134         while(1) {
 135                 ret = find_first_radix_bit(pinned_radix, gang,
 136                                            ARRAY_SIZE(gang));
 137                 if (!ret)
 138                         break;
 139                 if (!first)
 140                         first = gang[0];
 141                 for (i = 0; i < ret; i++) {
 142                         clear_radix_bit(pinned_radix, gang[i]);
 143                 }
 144         }
 145         if (root->fs_info->last_insert.objectid > first)
 146                 root->fs_info->last_insert.objectid = first;
 147         root->fs_info->last_insert.offset = 0;
 148         return 0;
 149 }
 150
 151 static int finish_current_insert(struct btrfs_trans_handle *trans, struct
 152                                  btrfs_root *extent_root)
 153 {
 154         struct btrfs_key ins;
 155         struct btrfs_extent_item extent_item;
 156         int i;
 157         int ret;
 158         u64 super_blocks_used;
 159         struct btrfs_fs_info *info = extent_root->fs_info;
 160
 161         btrfs_set_extent_refs(&extent_item, 1);
 162         ins.offset = 1;
 163         ins.flags = 0;
 164         btrfs_set_key_type(&ins, BTRFS_EXTENT_ITEM_KEY);
 165
 166         for (i = 0; i < extent_root->fs_info->current_insert.flags; i++) {
 167                 ins.objectid = extent_root->fs_info->current_insert.objectid +
 168                                 i;
 169                 super_blocks_used = btrfs_super_blocks_used(info->disk_super);
 170                 btrfs_set_super_blocks_used(info->disk_super,
 171                                             super_blocks_used + 1);
 172                 ret = btrfs_insert_item(trans, extent_root, &ins, &extent_item,
 173                                         sizeof(extent_item));
 174                 BUG_ON(ret);
 175         }
 176         extent_root->fs_info->current_insert.offset = 0;
 177         return 0;
 178 }
 179
 180 static int pin_down_block(struct btrfs_root *root, u64 blocknr, int pending)
 181 {
 182         int err;
 183         struct btrfs_header *header;
 184         struct buffer_head *bh;
 185
 186         if (!pending) {
 187                 bh = btrfs_find_tree_block(root, blocknr);
 188                 if (bh) {
 189                         if (buffer_uptodate(bh)) {
 190                                 u64 transid =
 191                                     root->fs_info->running_transaction->transid;
 192                                 header = btrfs_buffer_header(bh);
 193                                 if (btrfs_header_generation(header) ==
 194                                     transid) {
 195                                         btrfs_block_release(root, bh);
 196                                         return 0;
 197                                 }
 198                         }
 199                         btrfs_block_release(root, bh);
 200                 }
 201                 err = set_radix_bit(&root->fs_info->pinned_radix, blocknr);
 202         } else {
 203                 err = set_radix_bit(&root->fs_info->pending_del_radix, blocknr);
 204         }
 205         BUG_ON(err);
 206         return 0;
 207 }
 208
 209 /*
 210  * remove an extent from the root, returns 0 on success
 211  */
 212 static int __free_extent(struct btrfs_trans_handle *trans, struct btrfs_root
 213                          *root, u64 blocknr, u64 num_blocks, int pin)
 214 {
 215         struct btrfs_path *path;
 216         struct btrfs_key key;
 217         struct btrfs_fs_info *info = root->fs_info;
 218         struct btrfs_root *extent_root = info->extent_root;
 219         int ret;
 220         struct btrfs_extent_item *ei;
 221         struct btrfs_key ins;
 222         u32 refs;
 223
 224         key.objectid = blocknr;
 225         key.flags = 0;
 226         btrfs_set_key_type(&key, BTRFS_EXTENT_ITEM_KEY);
 227         key.offset = num_blocks;
 228
 229         find_free_extent(trans, root, 0, 0, (u64)-1, &ins);
 230         path = btrfs_alloc_path();
 231         BUG_ON(!path);
 232         btrfs_init_path(path);
 233
 234         ret = btrfs_search_slot(trans, extent_root, &key, path, -1, 1);
 235         if (ret) {
 236                 printk("failed to find %Lu\n", key.objectid);
 237                 btrfs_print_tree(extent_root, extent_root->node);
 238                 printk("failed to find %Lu\n", key.objectid);
 239                 BUG();
 240         }
 241         ei = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
 242                             struct btrfs_extent_item);
 243         BUG_ON(ei->refs == 0);
 244         refs = btrfs_extent_refs(ei) - 1;
 245         btrfs_set_extent_refs(ei, refs);
 246         btrfs_mark_buffer_dirty(path->nodes[0]);
 247         if (refs == 0) {
 248                 u64 super_blocks_used;
 249
 250                 if (pin) {
 251                         ret = pin_down_block(root, blocknr, 0);
 252                         BUG_ON(ret);
 253                 }
 254
 255                 super_blocks_used = btrfs_super_blocks_used(info->disk_super);
 256                 btrfs_set_super_blocks_used(info->disk_super,
 257                                             super_blocks_used - num_blocks);
 258                 ret = btrfs_del_item(trans, extent_root, path);
 259                 if (ret)
 260                         BUG();
 261         }
 262         btrfs_release_path(extent_root, path);
 263         btrfs_free_path(path);
 264         finish_current_insert(trans, extent_root);
 265         return ret;
 266 }
 267
 268 /*
 269  * find all the blocks marked as pending in the radix tree and remove
 270  * them from the extent map
 271  */
 272 static int del_pending_extents(struct btrfs_trans_handle *trans, struct
 273                                btrfs_root *extent_root)
 274 {
 275         int ret;
 276         int wret;
 277         int err = 0;
 278         unsigned long gang[4];
 279         int i;
 280         struct radix_tree_root *pending_radix;
 281         struct radix_tree_root *pinned_radix;
 282
 283         pending_radix = &extent_root->fs_info->pending_del_radix;
 284         pinned_radix = &extent_root->fs_info->pinned_radix;
 285
 286         while(1) {
 287                 ret = find_first_radix_bit(pending_radix, gang,
 288                                            ARRAY_SIZE(gang));
 289                 if (!ret)
 290                         break;
 291                 for (i = 0; i < ret; i++) {
 292                         wret = set_radix_bit(pinned_radix, gang[i]);
 293                         BUG_ON(wret);
 294                         wret = clear_radix_bit(pending_radix, gang[i]);
 295                         BUG_ON(wret);
 296                         wret = __free_extent(trans, extent_root,
 297                                              gang[i], 1, 0);
 298                         if (wret)
 299                                 err = wret;
 300                 }
 301         }
 302         return err;
 303 }
 304
 305 /*
 306  * remove an extent from the root, returns 0 on success
 307  */
 308 int btrfs_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root
 309                       *root, u64 blocknr, u64 num_blocks, int pin)
 310 {
 311         struct btrfs_root *extent_root = root->fs_info->extent_root;
 312         int pending_ret;
 313         int ret;
 314
 315         if (root == extent_root) {
 316                 pin_down_block(root, blocknr, 1);
 317                 return 0;
 318         }
 319         ret = __free_extent(trans, root, blocknr, num_blocks, pin);
 320         pending_ret = del_pending_extents(trans, root->fs_info->extent_root);
 321         return ret ? ret : pending_ret;
 322 }
 323
 324 /*
 325  * walks the btree of allocated extents and find a hole of a given size.
 326  * The key ins is changed to record the hole:
 327  * ins->objectid == block start
 328  * ins->flags = BTRFS_EXTENT_ITEM_KEY
 329  * ins->offset == number of blocks
 330  * Any available blocks before search_start are skipped.
 331  */
 332 static int find_free_extent(struct btrfs_trans_handle *trans, struct btrfs_root
 333                             *orig_root, u64 num_blocks, u64 search_start, u64
 334                             search_end, struct btrfs_key *ins)
 335 {
 336         struct btrfs_path *path;
 337         struct btrfs_key key;
 338         int ret;
 339         u64 hole_size = 0;
 340         int slot = 0;
 341         u64 last_block = 0;
 342         u64 test_block;
 343         int start_found;
 344         struct btrfs_leaf *l;
 345         struct btrfs_root * root = orig_root->fs_info->extent_root;
 346         int total_needed = num_blocks;
 347         int level;
 348
 349         path = btrfs_alloc_path();
 350         ins->flags = 0;
 351         btrfs_set_key_type(ins, BTRFS_EXTENT_ITEM_KEY);
 352
 353         level = btrfs_header_level(btrfs_buffer_header(root->node));
 354         total_needed += (level + 1) * 3;
 355         if (root->fs_info->last_insert.objectid == 0 && search_end == (u64)-1) {
 356                 struct btrfs_disk_key *last_key;
 357                 btrfs_init_path(path);
 358                 ins->objectid = (u64)-1;
 359                 ins->offset = (u64)-1;
 360                 ret = btrfs_search_slot(trans, root, ins, path, 0, 0);
 361                 if (ret < 0)
 362                         goto error;
 363                 BUG_ON(ret == 0);
 364                 if (path->slots[0] > 0)
 365                         path->slots[0]--;
 366                 l = btrfs_buffer_leaf(path->nodes[0]);
 367                 last_key = &l->items[path->slots[0]].key;
 368                 search_start = btrfs_disk_key_objectid(last_key);
 369         }
 370         if (root->fs_info->last_insert.objectid > search_start)
 371                 search_start = root->fs_info->last_insert.objectid;
 372
 373 check_failed:
 374         btrfs_init_path(path);
 375         ins->objectid = search_start;
 376         ins->offset = 0;
 377         start_found = 0;
 378         ret = btrfs_search_slot(trans, root, ins, path, 0, 0);
 379         if (ret < 0)
 380                 goto error;
 381
 382         if (path->slots[0] > 0)
 383                 path->slots[0]--;
 384
 385         while (1) {
 386                 l = btrfs_buffer_leaf(path->nodes[0]);
 387                 slot = path->slots[0];
 388                 if (slot >= btrfs_header_nritems(&l->header)) {
 389                         ret = btrfs_next_leaf(root, path);
 390                         if (ret == 0)
 391                                 continue;
 392                         if (ret < 0)
 393                                 goto error;
 394                         if (!start_found) {
 395                                 ins->objectid = search_start;
 396                                 ins->offset = (u64)-1;
 397                                 start_found = 1;
 398                                 goto check_pending;
 399                         }
 400                         ins->objectid = last_block > search_start ?
 401                                         last_block : search_start;
 402                         ins->offset = (u64)-1;
 403                         goto check_pending;
 404                 }
 405                 btrfs_disk_key_to_cpu(&key, &l->items[slot].key);
 406                 if (key.objectid >= search_start) {
 407                         if (start_found) {
 408                                 if (last_block < search_start)
 409                                         last_block = search_start;
 410                                 hole_size = key.objectid - last_block;
 411                                 if (hole_size > total_needed) {
 412                                         ins->objectid = last_block;
 413                                         ins->offset = hole_size;
 414                                         goto check_pending;
 415                                 }
 416                         }
 417                 }
 418                 start_found = 1;
 419                 last_block = key.objectid + key.offset;
 420                 path->slots[0]++;
 421         }
 422         // FIXME -ENOSPC
 423 check_pending:
 424         /* we have to make sure we didn't find an extent that has already
 425          * been allocated by the map tree or the original allocation
 426          */
 427         btrfs_release_path(root, path);
 428         BUG_ON(ins->objectid < search_start);
 429         for (test_block = ins->objectid;
 430              test_block < ins->objectid + total_needed; test_block++) {
 431                 if (test_radix_bit(&root->fs_info->pinned_radix,
 432                                       test_block)) {
 433                         search_start = test_block + 1;
 434                         goto check_failed;
 435                 }
 436         }
 437         BUG_ON(root->fs_info->current_insert.offset);
 438         root->fs_info->current_insert.offset = total_needed - num_blocks;
 439         root->fs_info->current_insert.objectid = ins->objectid + num_blocks;
 440         root->fs_info->current_insert.flags = 0;
 441         root->fs_info->last_insert.objectid = ins->objectid;
 442         ins->offset = num_blocks;
 443         btrfs_free_path(path);
 444         return 0;
 445 error:
 446         btrfs_release_path(root, path);
 447         btrfs_free_path(path);
 448         return ret;
 449 }
 450
 451 /*
 452  * finds a free extent and does all the dirty work required for allocation
 453  * returns the key for the extent through ins, and a tree buffer for
 454  * the first block of the extent through buf.
 455  *
 456  * returns 0 if everything worked, non-zero otherwise.
 457  */
 458 int btrfs_alloc_extent(struct btrfs_trans_handle *trans, struct btrfs_root
 459                         *root, u64 num_blocks, u64 search_start, u64
 460                         search_end, struct btrfs_key *ins)
 461 {
 462         int ret;
 463         int pending_ret;
 464         u64 super_blocks_used;
 465         struct btrfs_fs_info *info = root->fs_info;
 466         struct btrfs_root *extent_root = info->extent_root;
 467         struct btrfs_extent_item extent_item;
 468
 469         btrfs_set_extent_refs(&extent_item, 1);
 470
 471         if (root == extent_root) {
 472                 BUG_ON(extent_root->fs_info->current_insert.offset == 0);
 473                 BUG_ON(num_blocks != 1);
 474                 BUG_ON(extent_root->fs_info->current_insert.flags ==
 475                        extent_root->fs_info->current_insert.offset);
 476                 ins->offset = 1;
 477                 ins->objectid = extent_root->fs_info->current_insert.objectid +
 478                                 extent_root->fs_info->current_insert.flags++;
 479                 return 0;
 480         }
 481         ret = find_free_extent(trans, root, num_blocks, search_start,
 482                                search_end, ins);
 483         if (ret)
 484                 return ret;
 485
 486         super_blocks_used = btrfs_super_blocks_used(info->disk_super);
 487         btrfs_set_super_blocks_used(info->disk_super, super_blocks_used +
 488                                     num_blocks);
 489         ret = btrfs_insert_item(trans, extent_root, ins, &extent_item,
 490                                 sizeof(extent_item));
 491
 492         finish_current_insert(trans, extent_root);
 493         pending_ret = del_pending_extents(trans, extent_root);
 494         if (ret)
 495                 return ret;
 496         if (pending_ret)
 497                 return pending_ret;
 498         return 0;
 499 }
 500
 501 /*
 502  * helper function to allocate a block for a given tree
 503  * returns the tree buffer or NULL.
 504  */
 505 struct buffer_head *btrfs_alloc_free_block(struct btrfs_trans_handle *trans,
 506                                             struct btrfs_root *root)
 507 {
 508         struct btrfs_key ins;
 509         int ret;
 510         struct buffer_head *buf;
 511
 512         ret = btrfs_alloc_extent(trans, root, 1, 0, (unsigned long)-1, &ins);
 513         if (ret) {
 514                 BUG();
 515                 return NULL;
 516         }
 517         buf = btrfs_find_create_tree_block(root, ins.objectid);
 518         set_buffer_uptodate(buf);
 519         return buf;
 520 }
 521
 522 static int drop_leaf_ref(struct btrfs_trans_handle *trans,
 523                          struct btrfs_root *root, struct buffer_head *cur)
 524 {
 525         struct btrfs_disk_key *key;
 526         struct btrfs_leaf *leaf;
 527         struct btrfs_file_extent_item *fi;
 528         int i;
 529         int nritems;
 530         int ret;
 531
 532         BUG_ON(!btrfs_is_leaf(btrfs_buffer_node(cur)));
 533         leaf = btrfs_buffer_leaf(cur);
 534         nritems = btrfs_header_nritems(&leaf->header);
 535         for (i = 0; i < nritems; i++) {
 536                 key = &leaf->items[i].key;
 537                 if (btrfs_disk_key_type(key) != BTRFS_EXTENT_DATA_KEY)
 538                         continue;
 539                 fi = btrfs_item_ptr(leaf, i, struct btrfs_file_extent_item);
 540                 /*
 541                  * FIXME make sure to insert a trans record that
 542                  * repeats the snapshot del on crash
 543                  */
 544                 ret = btrfs_free_extent(trans, root,
 545                                         btrfs_file_extent_disk_blocknr(fi),
 546                                         btrfs_file_extent_disk_num_blocks(fi),
 547                                         0);
 548                 BUG_ON(ret);
 549         }
 550         return 0;
 551 }
 552
 553 /*
 554  * helper function for drop_snapshot, this walks down the tree dropping ref
 555  * counts as it goes.
 556  */
 557 static int walk_down_tree(struct btrfs_trans_handle *trans, struct btrfs_root
 558                           *root, struct btrfs_path *path, int *level)
 559 {
 560         struct buffer_head *next;
 561         struct buffer_head *cur;
 562         u64 blocknr;
 563         int ret;
 564         u32 refs;
 565
 566         WARN_ON(*level < 0);
 567         WARN_ON(*level >= BTRFS_MAX_LEVEL);
 568         ret = lookup_extent_ref(trans, root, bh_blocknr(path->nodes[*level]),
 569                                1, &refs);
 570         BUG_ON(ret);
 571         if (refs > 1)
 572                 goto out;
 573         /*
 574          * walk down to the last node level and free all the leaves
 575          */
 576         while(*level >= 0) {
 577                 WARN_ON(*level < 0);
 578                 WARN_ON(*level >= BTRFS_MAX_LEVEL);
 579                 cur = path->nodes[*level];
 580                 if (btrfs_header_level(btrfs_buffer_header(cur)) != *level)
 581                         WARN_ON(1);
 582                 if (path->slots[*level] >=
 583                     btrfs_header_nritems(btrfs_buffer_header(cur)))
 584                         break;
 585                 if (*level == 0) {
 586                         ret = drop_leaf_ref(trans, root, cur);
 587                         BUG_ON(ret);
 588                         break;
 589                 }
 590                 blocknr = btrfs_node_blockptr(btrfs_buffer_node(cur),
 591                                               path->slots[*level]);
 592                 ret = lookup_extent_ref(trans, root, blocknr, 1, &refs);
 593                 BUG_ON(ret);
 594                 if (refs != 1) {
 595                         path->slots[*level]++;
 596                         ret = btrfs_free_extent(trans, root, blocknr, 1, 1);
 597                         BUG_ON(ret);
 598                         continue;
 599                 }
 600                 next = read_tree_block(root, blocknr);
 601                 WARN_ON(*level <= 0);
 602                 if (path->nodes[*level-1])
 603                         btrfs_block_release(root, path->nodes[*level-1]);
 604                 path->nodes[*level-1] = next;
 605                 *level = btrfs_header_level(btrfs_buffer_header(next));
 606                 path->slots[*level] = 0;
 607         }
 608 out:
 609         WARN_ON(*level < 0);
 610         WARN_ON(*level >= BTRFS_MAX_LEVEL);
 611         ret = btrfs_free_extent(trans, root,
 612                                 bh_blocknr(path->nodes[*level]), 1, 1);
 613         btrfs_block_release(root, path->nodes[*level]);
 614         path->nodes[*level] = NULL;
 615         *level += 1;
 616         BUG_ON(ret);
 617         return 0;
 618 }
 619
 620 /*
 621  * helper for dropping snapshots.  This walks back up the tree in the path
 622  * to find the first node higher up where we haven't yet gone through
 623  * all the slots
 624  */
 625 static int walk_up_tree(struct btrfs_trans_handle *trans, struct btrfs_root
 626                         *root, struct btrfs_path *path, int *level)
 627 {
 628         int i;
 629         int slot;
 630         int ret;
 631         for(i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
 632                 slot = path->slots[i];
 633                 if (slot < btrfs_header_nritems(
 634                     btrfs_buffer_header(path->nodes[i])) - 1) {
 635                         path->slots[i]++;
 636                         *level = i;
 637                         return 0;
 638                 } else {
 639                         ret = btrfs_free_extent(trans, root,
 640                                                 bh_blocknr(path->nodes[*level]),
 641                                                 1, 1);
 642                         BUG_ON(ret);
 643                         btrfs_block_release(root, path->nodes[*level]);
 644                         path->nodes[*level] = NULL;
 645                         *level = i + 1;
 646                 }
 647         }
 648         return 1;
 649 }
 650
 651 /*
 652  * drop the reference count on the tree rooted at 'snap'.  This traverses
 653  * the tree freeing any blocks that have a ref count of zero after being
 654  * decremented.
 655  */
 656 int btrfs_drop_snapshot(struct btrfs_trans_handle *trans, struct btrfs_root
 657                         *root, struct buffer_head *snap)
 658 {
 659         int ret = 0;
 660         int wret;
 661         int level;
 662         struct btrfs_path *path;
 663         int i;
 664         int orig_level;
 665
 666         path = btrfs_alloc_path();
 667         BUG_ON(!path);
 668         btrfs_init_path(path);
 669
 670         level = btrfs_header_level(btrfs_buffer_header(snap));
 671         orig_level = level;
 672         path->nodes[level] = snap;
 673         path->slots[level] = 0;
 674         while(1) {
 675                 wret = walk_down_tree(trans, root, path, &level);
 676                 if (wret > 0)
 677                         break;
 678                 if (wret < 0)
 679                         ret = wret;
 680
 681                 wret = walk_up_tree(trans, root, path, &level);
 682                 if (wret > 0)
 683                         break;
 684                 if (wret < 0)
 685                         ret = wret;
 686         }
 687         for (i = 0; i <= orig_level; i++) {
 688                 if (path->nodes[i]) {
 689                         btrfs_block_release(root, path->nodes[i]);
 690                 }
 691         }
 692         btrfs_free_path(path);
 693         return ret;
 694 }