fs/btrfs/transaction.c

   1 /*
   2  * Copyright (C) 2007 Oracle.  All rights reserved.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public
   6  * License v2 as published by the Free Software Foundation.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11  * General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public
  14  * License along with this program; if not, write to the
  15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16  * Boston, MA 021110-1307, USA.
  17  */
  18
  19 #include <linux/fs.h>
  20 #include <linux/sched.h>
  21 #include <linux/writeback.h>
  22 #include <linux/pagemap.h>
  23 #include "ctree.h"
  24 #include "disk-io.h"
  25 #include "transaction.h"
  26 #include "locking.h"
  27
  28 static int total_trans = 0;
  29 extern struct kmem_cache *btrfs_trans_handle_cachep;
  30 extern struct kmem_cache *btrfs_transaction_cachep;
  31
  32 static struct workqueue_struct *trans_wq;
  33
  34 #define BTRFS_ROOT_TRANS_TAG 0
  35 #define BTRFS_ROOT_DEFRAG_TAG 1
  36
  37 static noinline void put_transaction(struct btrfs_transaction *transaction)
  38 {
  39         WARN_ON(transaction->use_count == 0);
  40         transaction->use_count--;
  41         if (transaction->use_count == 0) {
  42                 WARN_ON(total_trans == 0);
  43                 total_trans--;
  44                 list_del_init(&transaction->list);
  45                 memset(transaction, 0, sizeof(*transaction));
  46                 kmem_cache_free(btrfs_transaction_cachep, transaction);
  47         }
  48 }
  49
  50 static noinline int join_transaction(struct btrfs_root *root)
  51 {
  52         struct btrfs_transaction *cur_trans;
  53         cur_trans = root->fs_info->running_transaction;
  54         if (!cur_trans) {
  55                 cur_trans = kmem_cache_alloc(btrfs_transaction_cachep,
  56                                              GFP_NOFS);
  57                 total_trans++;
  58                 BUG_ON(!cur_trans);
  59                 root->fs_info->generation++;
  60                 root->fs_info->last_alloc = 0;
  61                 root->fs_info->last_data_alloc = 0;
  62                 cur_trans->num_writers = 1;
  63                 cur_trans->num_joined = 0;
  64                 cur_trans->transid = root->fs_info->generation;
  65                 init_waitqueue_head(&cur_trans->writer_wait);
  66                 init_waitqueue_head(&cur_trans->commit_wait);
  67                 cur_trans->in_commit = 0;
  68                 cur_trans->use_count = 1;
  69                 cur_trans->commit_done = 0;
  70                 cur_trans->start_time = get_seconds();
  71                 INIT_LIST_HEAD(&cur_trans->pending_snapshots);
  72                 list_add_tail(&cur_trans->list, &root->fs_info->trans_list);
  73                 btrfs_ordered_inode_tree_init(&cur_trans->ordered_inode_tree);
  74                 extent_io_tree_init(&cur_trans->dirty_pages,
  75                                      root->fs_info->btree_inode->i_mapping,
  76                                      GFP_NOFS);
  77                 spin_lock(&root->fs_info->new_trans_lock);
  78                 root->fs_info->running_transaction = cur_trans;
  79                 spin_unlock(&root->fs_info->new_trans_lock);
  80         } else {
  81                 cur_trans->num_writers++;
  82                 cur_trans->num_joined++;
  83         }
  84
  85         return 0;
  86 }
  87
  88 static noinline int record_root_in_trans(struct btrfs_root *root)
  89 {
  90         u64 running_trans_id = root->fs_info->running_transaction->transid;
  91         if (root->ref_cows && root->last_trans < running_trans_id) {
  92                 WARN_ON(root == root->fs_info->extent_root);
  93                 if (root->root_item.refs != 0) {
  94                         radix_tree_tag_set(&root->fs_info->fs_roots_radix,
  95                                    (unsigned long)root->root_key.objectid,
  96                                    BTRFS_ROOT_TRANS_TAG);
  97                         radix_tree_tag_set(&root->fs_info->fs_roots_radix,
  98                                    (unsigned long)root->root_key.objectid,
  99                                    BTRFS_ROOT_DEFRAG_TAG);
 100                         root->commit_root = btrfs_root_node(root);
 101                 } else {
 102                         WARN_ON(1);
 103                 }
 104                 root->last_trans = running_trans_id;
 105         }
 106         return 0;
 107 }
 108
 109 struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root,
 110                                                    int num_blocks)
 111 {
 112         struct btrfs_trans_handle *h =
 113                 kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS);
 114         int ret;
 115
 116         mutex_lock(&root->fs_info->trans_mutex);
 117         ret = join_transaction(root);
 118         BUG_ON(ret);
 119
 120         record_root_in_trans(root);
 121         h->transid = root->fs_info->running_transaction->transid;
 122         h->transaction = root->fs_info->running_transaction;
 123         h->blocks_reserved = num_blocks;
 124         h->blocks_used = 0;
 125         h->block_group = NULL;
 126         h->alloc_exclude_nr = 0;
 127         h->alloc_exclude_start = 0;
 128         root->fs_info->running_transaction->use_count++;
 129         mutex_unlock(&root->fs_info->trans_mutex);
 130         return h;
 131 }
 132
 133 int btrfs_end_transaction(struct btrfs_trans_handle *trans,
 134                           struct btrfs_root *root)
 135 {
 136         struct btrfs_transaction *cur_trans;
 137
 138         mutex_lock(&root->fs_info->trans_mutex);
 139         cur_trans = root->fs_info->running_transaction;
 140         WARN_ON(cur_trans != trans->transaction);
 141         WARN_ON(cur_trans->num_writers < 1);
 142         cur_trans->num_writers--;
 143         if (waitqueue_active(&cur_trans->writer_wait))
 144                 wake_up(&cur_trans->writer_wait);
 145         put_transaction(cur_trans);
 146         mutex_unlock(&root->fs_info->trans_mutex);
 147         memset(trans, 0, sizeof(*trans));
 148         kmem_cache_free(btrfs_trans_handle_cachep, trans);
 149         return 0;
 150 }
 151
 152
 153 int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans,
 154                                      struct btrfs_root *root)
 155 {
 156         int ret;
 157         int err;
 158         int werr = 0;
 159         struct extent_io_tree *dirty_pages;
 160         struct page *page;
 161         struct inode *btree_inode = root->fs_info->btree_inode;
 162         u64 start;
 163         u64 end;
 164         unsigned long index;
 165
 166         if (!trans || !trans->transaction) {
 167                 return filemap_write_and_wait(btree_inode->i_mapping);
 168         }
 169         dirty_pages = &trans->transaction->dirty_pages;
 170         while(1) {
 171                 ret = find_first_extent_bit(dirty_pages, 0, &start, &end,
 172                                             EXTENT_DIRTY);
 173                 if (ret)
 174                         break;
 175                 clear_extent_dirty(dirty_pages, start, end, GFP_NOFS);
 176                 while(start <= end) {
 177                         index = start >> PAGE_CACHE_SHIFT;
 178                         start = (u64)(index + 1) << PAGE_CACHE_SHIFT;
 179                         page = find_lock_page(btree_inode->i_mapping, index);
 180                         if (!page)
 181                                 continue;
 182                         if (PageWriteback(page)) {
 183                                 if (PageDirty(page))
 184                                         wait_on_page_writeback(page);
 185                                 else {
 186                                         unlock_page(page);
 187                                         page_cache_release(page);
 188                                         continue;
 189                                 }
 190                         }
 191                         err = write_one_page(page, 0);
 192                         if (err)
 193                                 werr = err;
 194                         page_cache_release(page);
 195                 }
 196         }
 197         err = filemap_fdatawait(btree_inode->i_mapping);
 198         if (err)
 199                 werr = err;
 200         return werr;
 201 }
 202
 203 static int update_cowonly_root(struct btrfs_trans_handle *trans,
 204                                struct btrfs_root *root)
 205 {
 206         int ret;
 207         u64 old_root_bytenr;
 208         struct btrfs_root *tree_root = root->fs_info->tree_root;
 209
 210         btrfs_write_dirty_block_groups(trans, root);
 211         while(1) {
 212                 old_root_bytenr = btrfs_root_bytenr(&root->root_item);
 213                 if (old_root_bytenr == root->node->start)
 214                         break;
 215                 btrfs_set_root_bytenr(&root->root_item,
 216                                        root->node->start);
 217                 btrfs_set_root_level(&root->root_item,
 218                                      btrfs_header_level(root->node));
 219                 ret = btrfs_update_root(trans, tree_root,
 220                                         &root->root_key,
 221                                         &root->root_item);
 222                 BUG_ON(ret);
 223                 btrfs_write_dirty_block_groups(trans, root);
 224         }
 225         return 0;
 226 }
 227
 228 int btrfs_commit_tree_roots(struct btrfs_trans_handle *trans,
 229                             struct btrfs_root *root)
 230 {
 231         struct btrfs_fs_info *fs_info = root->fs_info;
 232         struct list_head *next;
 233
 234         while(!list_empty(&fs_info->dirty_cowonly_roots)) {
 235                 next = fs_info->dirty_cowonly_roots.next;
 236                 list_del_init(next);
 237                 root = list_entry(next, struct btrfs_root, dirty_list);
 238                 update_cowonly_root(trans, root);
 239         }
 240         return 0;
 241 }
 242
 243 static noinline int wait_for_commit(struct btrfs_root *root,
 244                                     struct btrfs_transaction *commit)
 245 {
 246         DEFINE_WAIT(wait);
 247         mutex_lock(&root->fs_info->trans_mutex);
 248         while(!commit->commit_done) {
 249                 prepare_to_wait(&commit->commit_wait, &wait,
 250                                 TASK_UNINTERRUPTIBLE);
 251                 if (commit->commit_done)
 252                         break;
 253                 mutex_unlock(&root->fs_info->trans_mutex);
 254                 schedule();
 255                 mutex_lock(&root->fs_info->trans_mutex);
 256         }
 257         mutex_unlock(&root->fs_info->trans_mutex);
 258         finish_wait(&commit->commit_wait, &wait);
 259         return 0;
 260 }
 261
 262 struct dirty_root {
 263         struct list_head list;
 264         struct btrfs_root *root;
 265         struct btrfs_root *latest_root;
 266 };
 267
 268 int btrfs_add_dead_root(struct btrfs_root *root,
 269                         struct btrfs_root *latest,
 270                         struct list_head *dead_list)
 271 {
 272         struct dirty_root *dirty;
 273
 274         dirty = kmalloc(sizeof(*dirty), GFP_NOFS);
 275         if (!dirty)
 276                 return -ENOMEM;
 277         dirty->root = root;
 278         dirty->latest_root = latest;
 279         list_add(&dirty->list, dead_list);
 280         return 0;
 281 }
 282
 283 static noinline int add_dirty_roots(struct btrfs_trans_handle *trans,
 284                                     struct radix_tree_root *radix,
 285                                     struct list_head *list)
 286 {
 287         struct dirty_root *dirty;
 288         struct btrfs_root *gang[8];
 289         struct btrfs_root *root;
 290         int i;
 291         int ret;
 292         int err = 0;
 293         u32 refs;
 294
 295         while(1) {
 296                 ret = radix_tree_gang_lookup_tag(radix, (void **)gang, 0,
 297                                                  ARRAY_SIZE(gang),
 298                                                  BTRFS_ROOT_TRANS_TAG);
 299                 if (ret == 0)
 300                         break;
 301                 for (i = 0; i < ret; i++) {
 302                         root = gang[i];
 303                         radix_tree_tag_clear(radix,
 304                                      (unsigned long)root->root_key.objectid,
 305                                      BTRFS_ROOT_TRANS_TAG);
 306                         if (root->commit_root == root->node) {
 307                                 WARN_ON(root->node->start !=
 308                                         btrfs_root_bytenr(&root->root_item));
 309                                 free_extent_buffer(root->commit_root);
 310                                 root->commit_root = NULL;
 311
 312                                 /* make sure to update the root on disk
 313                                  * so we get any updates to the block used
 314                                  * counts
 315                                  */
 316                                 err = btrfs_update_root(trans,
 317                                                 root->fs_info->tree_root,
 318                                                 &root->root_key,
 319                                                 &root->root_item);
 320                                 continue;
 321                         }
 322                         dirty = kmalloc(sizeof(*dirty), GFP_NOFS);
 323                         BUG_ON(!dirty);
 324                         dirty->root = kmalloc(sizeof(*dirty->root), GFP_NOFS);
 325                         BUG_ON(!dirty->root);
 326
 327                         memset(&root->root_item.drop_progress, 0,
 328                                sizeof(struct btrfs_disk_key));
 329                         root->root_item.drop_level = 0;
 330
 331                         memcpy(dirty->root, root, sizeof(*root));
 332                         dirty->root->node = root->commit_root;
 333                         dirty->latest_root = root;
 334                         root->commit_root = NULL;
 335
 336                         root->root_key.offset = root->fs_info->generation;
 337                         btrfs_set_root_bytenr(&root->root_item,
 338                                               root->node->start);
 339                         btrfs_set_root_level(&root->root_item,
 340                                              btrfs_header_level(root->node));
 341                         err = btrfs_insert_root(trans, root->fs_info->tree_root,
 342                                                 &root->root_key,
 343                                                 &root->root_item);
 344                         if (err)
 345                                 break;
 346
 347                         refs = btrfs_root_refs(&dirty->root->root_item);
 348                         btrfs_set_root_refs(&dirty->root->root_item, refs - 1);
 349                         err = btrfs_update_root(trans, root->fs_info->tree_root,
 350                                                 &dirty->root->root_key,
 351                                                 &dirty->root->root_item);
 352
 353                         BUG_ON(err);
 354                         if (refs == 1) {
 355                                 list_add(&dirty->list, list);
 356                         } else {
 357                                 WARN_ON(1);
 358                                 kfree(dirty->root);
 359                                 kfree(dirty);
 360                         }
 361                 }
 362         }
 363         return err;
 364 }
 365
 366 int btrfs_defrag_root(struct btrfs_root *root, int cacheonly)
 367 {
 368         struct btrfs_fs_info *info = root->fs_info;
 369         int ret;
 370         struct btrfs_trans_handle *trans;
 371         unsigned long nr;
 372
 373         smp_mb();
 374         if (root->defrag_running)
 375                 return 0;
 376         trans = btrfs_start_transaction(root, 1);
 377         while (1) {
 378                 root->defrag_running = 1;
 379                 ret = btrfs_defrag_leaves(trans, root, cacheonly);
 380                 nr = trans->blocks_used;
 381                 btrfs_end_transaction(trans, root);
 382                 btrfs_btree_balance_dirty(info->tree_root, nr);
 383                 cond_resched();
 384
 385                 trans = btrfs_start_transaction(root, 1);
 386                 if (ret != -EAGAIN)
 387                         break;
 388         }
 389         root->defrag_running = 0;
 390         smp_mb();
 391         radix_tree_tag_clear(&info->fs_roots_radix,
 392                      (unsigned long)root->root_key.objectid,
 393                      BTRFS_ROOT_DEFRAG_TAG);
 394         btrfs_end_transaction(trans, root);
 395         return 0;
 396 }
 397
 398 int btrfs_defrag_dirty_roots(struct btrfs_fs_info *info)
 399 {
 400         struct btrfs_root *gang[1];
 401         struct btrfs_root *root;
 402         int i;
 403         int ret;
 404         int err = 0;
 405         u64 last = 0;
 406
 407         while(1) {
 408                 ret = radix_tree_gang_lookup_tag(&info->fs_roots_radix,
 409                                                  (void **)gang, last,
 410                                                  ARRAY_SIZE(gang),
 411                                                  BTRFS_ROOT_DEFRAG_TAG);
 412                 if (ret == 0)
 413                         break;
 414                 for (i = 0; i < ret; i++) {
 415                         root = gang[i];
 416                         last = root->root_key.objectid + 1;
 417                         btrfs_defrag_root(root, 1);
 418                 }
 419         }
 420         btrfs_defrag_root(info->extent_root, 1);
 421         return err;
 422 }
 423
 424 static noinline int drop_dirty_roots(struct btrfs_root *tree_root,
 425                                      struct list_head *list)
 426 {
 427         struct dirty_root *dirty;
 428         struct btrfs_trans_handle *trans;
 429         unsigned long nr;
 430         u64 num_bytes;
 431         u64 bytes_used;
 432         int ret = 0;
 433         int err;
 434
 435         while(!list_empty(list)) {
 436                 struct btrfs_root *root;
 437
 438                 dirty = list_entry(list->next, struct dirty_root, list);
 439                 list_del_init(&dirty->list);
 440
 441                 num_bytes = btrfs_root_used(&dirty->root->root_item);
 442                 root = dirty->latest_root;
 443                 atomic_inc(&root->fs_info->throttles);
 444
 445                 mutex_lock(&root->fs_info->drop_mutex);
 446                 while(1) {
 447                         trans = btrfs_start_transaction(tree_root, 1);
 448                         ret = btrfs_drop_snapshot(trans, dirty->root);
 449                         if (ret != -EAGAIN) {
 450                                 break;
 451                         }
 452
 453                         err = btrfs_update_root(trans,
 454                                         tree_root,
 455                                         &dirty->root->root_key,
 456                                         &dirty->root->root_item);
 457                         if (err)
 458                                 ret = err;
 459                         nr = trans->blocks_used;
 460                         ret = btrfs_end_transaction(trans, tree_root);
 461                         BUG_ON(ret);
 462
 463                         mutex_unlock(&root->fs_info->drop_mutex);
 464                         btrfs_btree_balance_dirty(tree_root, nr);
 465                         cond_resched();
 466                         mutex_lock(&root->fs_info->drop_mutex);
 467                 }
 468                 BUG_ON(ret);
 469                 atomic_dec(&root->fs_info->throttles);
 470
 471                 mutex_lock(&root->fs_info->alloc_mutex);
 472                 num_bytes -= btrfs_root_used(&dirty->root->root_item);
 473                 bytes_used = btrfs_root_used(&root->root_item);
 474                 if (num_bytes) {
 475                         record_root_in_trans(root);
 476                         btrfs_set_root_used(&root->root_item,
 477                                             bytes_used - num_bytes);
 478                 }
 479                 mutex_unlock(&root->fs_info->alloc_mutex);
 480
 481                 ret = btrfs_del_root(trans, tree_root, &dirty->root->root_key);
 482                 if (ret) {
 483                         BUG();
 484                         break;
 485                 }
 486                 mutex_unlock(&root->fs_info->drop_mutex);
 487
 488                 nr = trans->blocks_used;
 489                 ret = btrfs_end_transaction(trans, tree_root);
 490                 BUG_ON(ret);
 491
 492                 free_extent_buffer(dirty->root->node);
 493                 kfree(dirty->root);
 494                 kfree(dirty);
 495
 496                 btrfs_btree_balance_dirty(tree_root, nr);
 497                 cond_resched();
 498         }
 499         return ret;
 500 }
 501
 502 int btrfs_write_ordered_inodes(struct btrfs_trans_handle *trans,
 503                                 struct btrfs_root *root)
 504 {
 505         struct btrfs_transaction *cur_trans = trans->transaction;
 506         struct inode *inode;
 507         u64 root_objectid = 0;
 508         u64 objectid = 0;
 509         int ret;
 510
 511         atomic_inc(&root->fs_info->throttles);
 512         while(1) {
 513                 ret = btrfs_find_first_ordered_inode(
 514                                 &cur_trans->ordered_inode_tree,
 515                                 &root_objectid, &objectid, &inode);
 516                 if (!ret)
 517                         break;
 518
 519                 mutex_unlock(&root->fs_info->trans_mutex);
 520
 521                 if (S_ISREG(inode->i_mode)) {
 522                         atomic_inc(&BTRFS_I(inode)->ordered_writeback);
 523                         filemap_fdatawrite(inode->i_mapping);
 524                         atomic_dec(&BTRFS_I(inode)->ordered_writeback);
 525                 }
 526                 iput(inode);
 527
 528                 mutex_lock(&root->fs_info->trans_mutex);
 529         }
 530         while(1) {
 531                 root_objectid = 0;
 532                 objectid = 0;
 533                 ret = btrfs_find_del_first_ordered_inode(
 534                                 &cur_trans->ordered_inode_tree,
 535                                 &root_objectid, &objectid, &inode);
 536                 if (!ret)
 537                         break;
 538                 mutex_unlock(&root->fs_info->trans_mutex);
 539
 540                 if (S_ISREG(inode->i_mode)) {
 541                         atomic_inc(&BTRFS_I(inode)->ordered_writeback);
 542                         filemap_write_and_wait(inode->i_mapping);
 543                         atomic_dec(&BTRFS_I(inode)->ordered_writeback);
 544                 }
 545                 atomic_dec(&inode->i_count);
 546                 iput(inode);
 547
 548                 mutex_lock(&root->fs_info->trans_mutex);
 549         }
 550         atomic_dec(&root->fs_info->throttles);
 551         return 0;
 552 }
 553
 554 static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans,
 555                                    struct btrfs_fs_info *fs_info,
 556                                    struct btrfs_pending_snapshot *pending)
 557 {
 558         struct btrfs_key key;
 559         struct btrfs_root_item *new_root_item;
 560         struct btrfs_root *tree_root = fs_info->tree_root;
 561         struct btrfs_root *root = pending->root;
 562         struct extent_buffer *tmp;
 563         struct extent_buffer *old;
 564         int ret;
 565         int namelen;
 566         u64 objectid;
 567
 568         new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS);
 569         if (!new_root_item) {
 570                 ret = -ENOMEM;
 571                 goto fail;
 572         }
 573         ret = btrfs_find_free_objectid(trans, tree_root, 0, &objectid);
 574         if (ret)
 575                 goto fail;
 576
 577         memcpy(new_root_item, &root->root_item, sizeof(*new_root_item));
 578
 579         key.objectid = objectid;
 580         key.offset = 1;
 581         btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
 582
 583         old = btrfs_lock_root_node(root);
 584         btrfs_cow_block(trans, root, old, NULL, 0, &old);
 585
 586         btrfs_copy_root(trans, root, old, &tmp, objectid);
 587         btrfs_tree_unlock(old);
 588         free_extent_buffer(old);
 589
 590         btrfs_set_root_bytenr(new_root_item, tmp->start);
 591         btrfs_set_root_level(new_root_item, btrfs_header_level(tmp));
 592         ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key,
 593                                 new_root_item);
 594         btrfs_tree_unlock(tmp);
 595         free_extent_buffer(tmp);
 596         if (ret)
 597                 goto fail;
 598
 599         /*
 600          * insert the directory item
 601          */
 602         key.offset = (u64)-1;
 603         namelen = strlen(pending->name);
 604         ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
 605                                     pending->name, namelen,
 606                                     root->fs_info->sb->s_root->d_inode->i_ino,
 607                                     &key, BTRFS_FT_DIR);
 608
 609         if (ret)
 610                 goto fail;
 611
 612         ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root,
 613                              pending->name, strlen(pending->name), objectid,
 614                              root->fs_info->sb->s_root->d_inode->i_ino);
 615
 616         /* Invalidate existing dcache entry for new snapshot. */
 617         btrfs_invalidate_dcache_root(root, pending->name, namelen);
 618
 619 fail:
 620         kfree(new_root_item);
 621         return ret;
 622 }
 623
 624 static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans,
 625                                              struct btrfs_fs_info *fs_info)
 626 {
 627         struct btrfs_pending_snapshot *pending;
 628         struct list_head *head = &trans->transaction->pending_snapshots;
 629         int ret;
 630
 631         while(!list_empty(head)) {
 632                 pending = list_entry(head->next,
 633                                      struct btrfs_pending_snapshot, list);
 634                 ret = create_pending_snapshot(trans, fs_info, pending);
 635                 BUG_ON(ret);
 636                 list_del(&pending->list);
 637                 kfree(pending->name);
 638                 kfree(pending);
 639         }
 640         return 0;
 641 }
 642
 643 int btrfs_commit_transaction(struct btrfs_trans_handle *trans,
 644                              struct btrfs_root *root)
 645 {
 646         unsigned long joined = 0;
 647         unsigned long timeout = 1;
 648         struct btrfs_transaction *cur_trans;
 649         struct btrfs_transaction *prev_trans = NULL;
 650         struct btrfs_root *chunk_root = root->fs_info->chunk_root;
 651         struct list_head dirty_fs_roots;
 652         struct extent_io_tree *pinned_copy;
 653         DEFINE_WAIT(wait);
 654         int ret;
 655
 656         INIT_LIST_HEAD(&dirty_fs_roots);
 657
 658         mutex_lock(&root->fs_info->trans_mutex);
 659         if (trans->transaction->in_commit) {
 660                 cur_trans = trans->transaction;
 661                 trans->transaction->use_count++;
 662                 mutex_unlock(&root->fs_info->trans_mutex);
 663                 btrfs_end_transaction(trans, root);
 664
 665                 ret = wait_for_commit(root, cur_trans);
 666                 BUG_ON(ret);
 667
 668                 mutex_lock(&root->fs_info->trans_mutex);
 669                 put_transaction(cur_trans);
 670                 mutex_unlock(&root->fs_info->trans_mutex);
 671
 672                 return 0;
 673         }
 674
 675         pinned_copy = kmalloc(sizeof(*pinned_copy), GFP_NOFS);
 676         if (!pinned_copy)
 677                 return -ENOMEM;
 678
 679         extent_io_tree_init(pinned_copy,
 680                              root->fs_info->btree_inode->i_mapping, GFP_NOFS);
 681
 682         trans->transaction->in_commit = 1;
 683         cur_trans = trans->transaction;
 684         if (cur_trans->list.prev != &root->fs_info->trans_list) {
 685                 prev_trans = list_entry(cur_trans->list.prev,
 686                                         struct btrfs_transaction, list);
 687                 if (!prev_trans->commit_done) {
 688                         prev_trans->use_count++;
 689                         mutex_unlock(&root->fs_info->trans_mutex);
 690
 691                         wait_for_commit(root, prev_trans);
 692
 693                         mutex_lock(&root->fs_info->trans_mutex);
 694                         put_transaction(prev_trans);
 695                 }
 696         }
 697
 698         do {
 699                 joined = cur_trans->num_joined;
 700                 WARN_ON(cur_trans != trans->transaction);
 701                 prepare_to_wait(&cur_trans->writer_wait, &wait,
 702                                 TASK_UNINTERRUPTIBLE);
 703
 704                 if (cur_trans->num_writers > 1)
 705                         timeout = MAX_SCHEDULE_TIMEOUT;
 706                 else
 707                         timeout = 1;
 708
 709                 mutex_unlock(&root->fs_info->trans_mutex);
 710
 711                 schedule_timeout(timeout);
 712
 713                 mutex_lock(&root->fs_info->trans_mutex);
 714                 finish_wait(&cur_trans->writer_wait, &wait);
 715                 ret = btrfs_write_ordered_inodes(trans, root);
 716
 717         } while (cur_trans->num_writers > 1 ||
 718                  (cur_trans->num_joined != joined));
 719
 720         ret = create_pending_snapshots(trans, root->fs_info);
 721         BUG_ON(ret);
 722
 723         WARN_ON(cur_trans != trans->transaction);
 724
 725         ret = add_dirty_roots(trans, &root->fs_info->fs_roots_radix,
 726                               &dirty_fs_roots);
 727         BUG_ON(ret);
 728
 729         ret = btrfs_commit_tree_roots(trans, root);
 730         BUG_ON(ret);
 731
 732         cur_trans = root->fs_info->running_transaction;
 733         spin_lock(&root->fs_info->new_trans_lock);
 734         root->fs_info->running_transaction = NULL;
 735         spin_unlock(&root->fs_info->new_trans_lock);
 736         btrfs_set_super_generation(&root->fs_info->super_copy,
 737                                    cur_trans->transid);
 738         btrfs_set_super_root(&root->fs_info->super_copy,
 739                              root->fs_info->tree_root->node->start);
 740         btrfs_set_super_root_level(&root->fs_info->super_copy,
 741                            btrfs_header_level(root->fs_info->tree_root->node));
 742
 743         btrfs_set_super_chunk_root(&root->fs_info->super_copy,
 744                                    chunk_root->node->start);
 745         btrfs_set_super_chunk_root_level(&root->fs_info->super_copy,
 746                                          btrfs_header_level(chunk_root->node));
 747         memcpy(&root->fs_info->super_for_commit, &root->fs_info->super_copy,
 748                sizeof(root->fs_info->super_copy));
 749
 750         btrfs_copy_pinned(root, pinned_copy);
 751
 752         mutex_unlock(&root->fs_info->trans_mutex);
 753         ret = btrfs_write_and_wait_transaction(trans, root);
 754         BUG_ON(ret);
 755         write_ctree_super(trans, root);
 756
 757         btrfs_finish_extent_commit(trans, root, pinned_copy);
 758         mutex_lock(&root->fs_info->trans_mutex);
 759
 760         kfree(pinned_copy);
 761
 762         cur_trans->commit_done = 1;
 763         root->fs_info->last_trans_committed = cur_trans->transid;
 764         wake_up(&cur_trans->commit_wait);
 765         put_transaction(cur_trans);
 766         put_transaction(cur_trans);
 767
 768         if (root->fs_info->closing)
 769                 list_splice_init(&root->fs_info->dead_roots, &dirty_fs_roots);
 770         else
 771                 list_splice_init(&dirty_fs_roots, &root->fs_info->dead_roots);
 772
 773         mutex_unlock(&root->fs_info->trans_mutex);
 774         kmem_cache_free(btrfs_trans_handle_cachep, trans);
 775
 776         if (root->fs_info->closing) {
 777                 drop_dirty_roots(root->fs_info->tree_root, &dirty_fs_roots);
 778         }
 779         return ret;
 780 }
 781
 782 int btrfs_clean_old_snapshots(struct btrfs_root *root)
 783 {
 784         struct list_head dirty_roots;
 785         INIT_LIST_HEAD(&dirty_roots);
 786
 787         mutex_lock(&root->fs_info->trans_mutex);
 788         list_splice_init(&root->fs_info->dead_roots, &dirty_roots);
 789         mutex_unlock(&root->fs_info->trans_mutex);
 790
 791         if (!list_empty(&dirty_roots)) {
 792                 drop_dirty_roots(root, &dirty_roots);
 793         }
 794         return 0;
 795 }
 796 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
 797 void btrfs_transaction_cleaner(void *p)
 798 #else
 799 void btrfs_transaction_cleaner(struct work_struct *work)
 800 #endif
 801 {
 802 #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18)
 803         struct btrfs_fs_info *fs_info = p;
 804 #else
 805         struct btrfs_fs_info *fs_info = container_of(work,
 806                                                      struct btrfs_fs_info,
 807                                                      trans_work.work);
 808
 809 #endif
 810         struct btrfs_root *root = fs_info->tree_root;
 811         struct btrfs_transaction *cur;
 812         struct btrfs_trans_handle *trans;
 813         unsigned long now;
 814         unsigned long delay = HZ * 30;
 815         int ret;
 816
 817         smp_mb();
 818         if (root->fs_info->closing)
 819                 goto out;
 820
 821         mutex_lock(&root->fs_info->trans_mutex);
 822         cur = root->fs_info->running_transaction;
 823         if (!cur) {
 824                 mutex_unlock(&root->fs_info->trans_mutex);
 825                 goto out;
 826         }
 827         now = get_seconds();
 828         if (now < cur->start_time || now - cur->start_time < 30) {
 829                 mutex_unlock(&root->fs_info->trans_mutex);
 830                 delay = HZ * 5;
 831                 goto out;
 832         }
 833         mutex_unlock(&root->fs_info->trans_mutex);
 834         btrfs_defrag_dirty_roots(root->fs_info);
 835         trans = btrfs_start_transaction(root, 1);
 836         ret = btrfs_commit_transaction(trans, root);
 837 out:
 838         btrfs_clean_old_snapshots(root);
 839         btrfs_transaction_queue_work(root, delay);
 840 }
 841
 842 void btrfs_transaction_queue_work(struct btrfs_root *root, int delay)
 843 {
 844         if (!root->fs_info->closing)
 845                 queue_delayed_work(trans_wq, &root->fs_info->trans_work, delay);
 846 }
 847
 848 void btrfs_transaction_flush_work(struct btrfs_root *root)
 849 {
 850         cancel_delayed_work(&root->fs_info->trans_work);
 851         flush_workqueue(trans_wq);
 852 }
 853
 854 void __init btrfs_init_transaction_sys(void)
 855 {
 856         trans_wq = create_workqueue("btrfs-transaction");
 857 }
 858
 859 void btrfs_exit_transaction_sys(void)
 860 {
 861         destroy_workqueue(trans_wq);
 862 }
 863