03fbb8854a1bf11d7ab283e4cda875a3e6008116
[sfrench/cifs-2.6.git] / 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/slab.h>
21 #include <linux/sched.h>
22 #include <linux/writeback.h>
23 #include <linux/pagemap.h>
24 #include <linux/blkdev.h>
25 #include <linux/uuid.h>
26 #include "ctree.h"
27 #include "disk-io.h"
28 #include "transaction.h"
29 #include "locking.h"
30 #include "tree-log.h"
31 #include "inode-map.h"
32 #include "volumes.h"
33 #include "dev-replace.h"
34 #include "qgroup.h"
35
36 #define BTRFS_ROOT_TRANS_TAG 0
37
38 static const unsigned int btrfs_blocked_trans_types[TRANS_STATE_MAX] = {
39         [TRANS_STATE_RUNNING]           = 0U,
40         [TRANS_STATE_BLOCKED]           = (__TRANS_USERSPACE |
41                                            __TRANS_START),
42         [TRANS_STATE_COMMIT_START]      = (__TRANS_USERSPACE |
43                                            __TRANS_START |
44                                            __TRANS_ATTACH),
45         [TRANS_STATE_COMMIT_DOING]      = (__TRANS_USERSPACE |
46                                            __TRANS_START |
47                                            __TRANS_ATTACH |
48                                            __TRANS_JOIN),
49         [TRANS_STATE_UNBLOCKED]         = (__TRANS_USERSPACE |
50                                            __TRANS_START |
51                                            __TRANS_ATTACH |
52                                            __TRANS_JOIN |
53                                            __TRANS_JOIN_NOLOCK),
54         [TRANS_STATE_COMPLETED]         = (__TRANS_USERSPACE |
55                                            __TRANS_START |
56                                            __TRANS_ATTACH |
57                                            __TRANS_JOIN |
58                                            __TRANS_JOIN_NOLOCK),
59 };
60
61 void btrfs_put_transaction(struct btrfs_transaction *transaction)
62 {
63         WARN_ON(refcount_read(&transaction->use_count) == 0);
64         if (refcount_dec_and_test(&transaction->use_count)) {
65                 BUG_ON(!list_empty(&transaction->list));
66                 WARN_ON(!RB_EMPTY_ROOT(&transaction->delayed_refs.href_root));
67                 if (transaction->delayed_refs.pending_csums)
68                         btrfs_err(transaction->fs_info,
69                                   "pending csums is %llu",
70                                   transaction->delayed_refs.pending_csums);
71                 while (!list_empty(&transaction->pending_chunks)) {
72                         struct extent_map *em;
73
74                         em = list_first_entry(&transaction->pending_chunks,
75                                               struct extent_map, list);
76                         list_del_init(&em->list);
77                         free_extent_map(em);
78                 }
79                 /*
80                  * If any block groups are found in ->deleted_bgs then it's
81                  * because the transaction was aborted and a commit did not
82                  * happen (things failed before writing the new superblock
83                  * and calling btrfs_finish_extent_commit()), so we can not
84                  * discard the physical locations of the block groups.
85                  */
86                 while (!list_empty(&transaction->deleted_bgs)) {
87                         struct btrfs_block_group_cache *cache;
88
89                         cache = list_first_entry(&transaction->deleted_bgs,
90                                                  struct btrfs_block_group_cache,
91                                                  bg_list);
92                         list_del_init(&cache->bg_list);
93                         btrfs_put_block_group_trimming(cache);
94                         btrfs_put_block_group(cache);
95                 }
96                 kfree(transaction);
97         }
98 }
99
100 static void clear_btree_io_tree(struct extent_io_tree *tree)
101 {
102         spin_lock(&tree->lock);
103         /*
104          * Do a single barrier for the waitqueue_active check here, the state
105          * of the waitqueue should not change once clear_btree_io_tree is
106          * called.
107          */
108         smp_mb();
109         while (!RB_EMPTY_ROOT(&tree->state)) {
110                 struct rb_node *node;
111                 struct extent_state *state;
112
113                 node = rb_first(&tree->state);
114                 state = rb_entry(node, struct extent_state, rb_node);
115                 rb_erase(&state->rb_node, &tree->state);
116                 RB_CLEAR_NODE(&state->rb_node);
117                 /*
118                  * btree io trees aren't supposed to have tasks waiting for
119                  * changes in the flags of extent states ever.
120                  */
121                 ASSERT(!waitqueue_active(&state->wq));
122                 free_extent_state(state);
123
124                 cond_resched_lock(&tree->lock);
125         }
126         spin_unlock(&tree->lock);
127 }
128
129 static noinline void switch_commit_roots(struct btrfs_transaction *trans,
130                                          struct btrfs_fs_info *fs_info)
131 {
132         struct btrfs_root *root, *tmp;
133
134         down_write(&fs_info->commit_root_sem);
135         list_for_each_entry_safe(root, tmp, &trans->switch_commits,
136                                  dirty_list) {
137                 list_del_init(&root->dirty_list);
138                 free_extent_buffer(root->commit_root);
139                 root->commit_root = btrfs_root_node(root);
140                 if (is_fstree(root->objectid))
141                         btrfs_unpin_free_ino(root);
142                 clear_btree_io_tree(&root->dirty_log_pages);
143         }
144
145         /* We can free old roots now. */
146         spin_lock(&trans->dropped_roots_lock);
147         while (!list_empty(&trans->dropped_roots)) {
148                 root = list_first_entry(&trans->dropped_roots,
149                                         struct btrfs_root, root_list);
150                 list_del_init(&root->root_list);
151                 spin_unlock(&trans->dropped_roots_lock);
152                 btrfs_drop_and_free_fs_root(fs_info, root);
153                 spin_lock(&trans->dropped_roots_lock);
154         }
155         spin_unlock(&trans->dropped_roots_lock);
156         up_write(&fs_info->commit_root_sem);
157 }
158
159 static inline void extwriter_counter_inc(struct btrfs_transaction *trans,
160                                          unsigned int type)
161 {
162         if (type & TRANS_EXTWRITERS)
163                 atomic_inc(&trans->num_extwriters);
164 }
165
166 static inline void extwriter_counter_dec(struct btrfs_transaction *trans,
167                                          unsigned int type)
168 {
169         if (type & TRANS_EXTWRITERS)
170                 atomic_dec(&trans->num_extwriters);
171 }
172
173 static inline void extwriter_counter_init(struct btrfs_transaction *trans,
174                                           unsigned int type)
175 {
176         atomic_set(&trans->num_extwriters, ((type & TRANS_EXTWRITERS) ? 1 : 0));
177 }
178
179 static inline int extwriter_counter_read(struct btrfs_transaction *trans)
180 {
181         return atomic_read(&trans->num_extwriters);
182 }
183
184 /*
185  * either allocate a new transaction or hop into the existing one
186  */
187 static noinline int join_transaction(struct btrfs_fs_info *fs_info,
188                                      unsigned int type)
189 {
190         struct btrfs_transaction *cur_trans;
191
192         spin_lock(&fs_info->trans_lock);
193 loop:
194         /* The file system has been taken offline. No new transactions. */
195         if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) {
196                 spin_unlock(&fs_info->trans_lock);
197                 return -EROFS;
198         }
199
200         cur_trans = fs_info->running_transaction;
201         if (cur_trans) {
202                 if (cur_trans->aborted) {
203                         spin_unlock(&fs_info->trans_lock);
204                         return cur_trans->aborted;
205                 }
206                 if (btrfs_blocked_trans_types[cur_trans->state] & type) {
207                         spin_unlock(&fs_info->trans_lock);
208                         return -EBUSY;
209                 }
210                 refcount_inc(&cur_trans->use_count);
211                 atomic_inc(&cur_trans->num_writers);
212                 extwriter_counter_inc(cur_trans, type);
213                 spin_unlock(&fs_info->trans_lock);
214                 return 0;
215         }
216         spin_unlock(&fs_info->trans_lock);
217
218         /*
219          * If we are ATTACH, we just want to catch the current transaction,
220          * and commit it. If there is no transaction, just return ENOENT.
221          */
222         if (type == TRANS_ATTACH)
223                 return -ENOENT;
224
225         /*
226          * JOIN_NOLOCK only happens during the transaction commit, so
227          * it is impossible that ->running_transaction is NULL
228          */
229         BUG_ON(type == TRANS_JOIN_NOLOCK);
230
231         cur_trans = kmalloc(sizeof(*cur_trans), GFP_NOFS);
232         if (!cur_trans)
233                 return -ENOMEM;
234
235         spin_lock(&fs_info->trans_lock);
236         if (fs_info->running_transaction) {
237                 /*
238                  * someone started a transaction after we unlocked.  Make sure
239                  * to redo the checks above
240                  */
241                 kfree(cur_trans);
242                 goto loop;
243         } else if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) {
244                 spin_unlock(&fs_info->trans_lock);
245                 kfree(cur_trans);
246                 return -EROFS;
247         }
248
249         cur_trans->fs_info = fs_info;
250         atomic_set(&cur_trans->num_writers, 1);
251         extwriter_counter_init(cur_trans, type);
252         init_waitqueue_head(&cur_trans->writer_wait);
253         init_waitqueue_head(&cur_trans->commit_wait);
254         init_waitqueue_head(&cur_trans->pending_wait);
255         cur_trans->state = TRANS_STATE_RUNNING;
256         /*
257          * One for this trans handle, one so it will live on until we
258          * commit the transaction.
259          */
260         refcount_set(&cur_trans->use_count, 2);
261         atomic_set(&cur_trans->pending_ordered, 0);
262         cur_trans->flags = 0;
263         cur_trans->start_time = get_seconds();
264
265         memset(&cur_trans->delayed_refs, 0, sizeof(cur_trans->delayed_refs));
266
267         cur_trans->delayed_refs.href_root = RB_ROOT;
268         cur_trans->delayed_refs.dirty_extent_root = RB_ROOT;
269         atomic_set(&cur_trans->delayed_refs.num_entries, 0);
270
271         /*
272          * although the tree mod log is per file system and not per transaction,
273          * the log must never go across transaction boundaries.
274          */
275         smp_mb();
276         if (!list_empty(&fs_info->tree_mod_seq_list))
277                 WARN(1, KERN_ERR "BTRFS: tree_mod_seq_list not empty when creating a fresh transaction\n");
278         if (!RB_EMPTY_ROOT(&fs_info->tree_mod_log))
279                 WARN(1, KERN_ERR "BTRFS: tree_mod_log rb tree not empty when creating a fresh transaction\n");
280         atomic64_set(&fs_info->tree_mod_seq, 0);
281
282         spin_lock_init(&cur_trans->delayed_refs.lock);
283
284         INIT_LIST_HEAD(&cur_trans->pending_snapshots);
285         INIT_LIST_HEAD(&cur_trans->pending_chunks);
286         INIT_LIST_HEAD(&cur_trans->switch_commits);
287         INIT_LIST_HEAD(&cur_trans->dirty_bgs);
288         INIT_LIST_HEAD(&cur_trans->io_bgs);
289         INIT_LIST_HEAD(&cur_trans->dropped_roots);
290         mutex_init(&cur_trans->cache_write_mutex);
291         cur_trans->num_dirty_bgs = 0;
292         spin_lock_init(&cur_trans->dirty_bgs_lock);
293         INIT_LIST_HEAD(&cur_trans->deleted_bgs);
294         spin_lock_init(&cur_trans->dropped_roots_lock);
295         list_add_tail(&cur_trans->list, &fs_info->trans_list);
296         extent_io_tree_init(&cur_trans->dirty_pages,
297                              fs_info->btree_inode);
298         fs_info->generation++;
299         cur_trans->transid = fs_info->generation;
300         fs_info->running_transaction = cur_trans;
301         cur_trans->aborted = 0;
302         spin_unlock(&fs_info->trans_lock);
303
304         return 0;
305 }
306
307 /*
308  * this does all the record keeping required to make sure that a reference
309  * counted root is properly recorded in a given transaction.  This is required
310  * to make sure the old root from before we joined the transaction is deleted
311  * when the transaction commits
312  */
313 static int record_root_in_trans(struct btrfs_trans_handle *trans,
314                                struct btrfs_root *root,
315                                int force)
316 {
317         struct btrfs_fs_info *fs_info = root->fs_info;
318
319         if ((test_bit(BTRFS_ROOT_REF_COWS, &root->state) &&
320             root->last_trans < trans->transid) || force) {
321                 WARN_ON(root == fs_info->extent_root);
322                 WARN_ON(root->commit_root != root->node);
323
324                 /*
325                  * see below for IN_TRANS_SETUP usage rules
326                  * we have the reloc mutex held now, so there
327                  * is only one writer in this function
328                  */
329                 set_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state);
330
331                 /* make sure readers find IN_TRANS_SETUP before
332                  * they find our root->last_trans update
333                  */
334                 smp_wmb();
335
336                 spin_lock(&fs_info->fs_roots_radix_lock);
337                 if (root->last_trans == trans->transid && !force) {
338                         spin_unlock(&fs_info->fs_roots_radix_lock);
339                         return 0;
340                 }
341                 radix_tree_tag_set(&fs_info->fs_roots_radix,
342                                    (unsigned long)root->root_key.objectid,
343                                    BTRFS_ROOT_TRANS_TAG);
344                 spin_unlock(&fs_info->fs_roots_radix_lock);
345                 root->last_trans = trans->transid;
346
347                 /* this is pretty tricky.  We don't want to
348                  * take the relocation lock in btrfs_record_root_in_trans
349                  * unless we're really doing the first setup for this root in
350                  * this transaction.
351                  *
352                  * Normally we'd use root->last_trans as a flag to decide
353                  * if we want to take the expensive mutex.
354                  *
355                  * But, we have to set root->last_trans before we
356                  * init the relocation root, otherwise, we trip over warnings
357                  * in ctree.c.  The solution used here is to flag ourselves
358                  * with root IN_TRANS_SETUP.  When this is 1, we're still
359                  * fixing up the reloc trees and everyone must wait.
360                  *
361                  * When this is zero, they can trust root->last_trans and fly
362                  * through btrfs_record_root_in_trans without having to take the
363                  * lock.  smp_wmb() makes sure that all the writes above are
364                  * done before we pop in the zero below
365                  */
366                 btrfs_init_reloc_root(trans, root);
367                 smp_mb__before_atomic();
368                 clear_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state);
369         }
370         return 0;
371 }
372
373
374 void btrfs_add_dropped_root(struct btrfs_trans_handle *trans,
375                             struct btrfs_root *root)
376 {
377         struct btrfs_fs_info *fs_info = root->fs_info;
378         struct btrfs_transaction *cur_trans = trans->transaction;
379
380         /* Add ourselves to the transaction dropped list */
381         spin_lock(&cur_trans->dropped_roots_lock);
382         list_add_tail(&root->root_list, &cur_trans->dropped_roots);
383         spin_unlock(&cur_trans->dropped_roots_lock);
384
385         /* Make sure we don't try to update the root at commit time */
386         spin_lock(&fs_info->fs_roots_radix_lock);
387         radix_tree_tag_clear(&fs_info->fs_roots_radix,
388                              (unsigned long)root->root_key.objectid,
389                              BTRFS_ROOT_TRANS_TAG);
390         spin_unlock(&fs_info->fs_roots_radix_lock);
391 }
392
393 int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans,
394                                struct btrfs_root *root)
395 {
396         struct btrfs_fs_info *fs_info = root->fs_info;
397
398         if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state))
399                 return 0;
400
401         /*
402          * see record_root_in_trans for comments about IN_TRANS_SETUP usage
403          * and barriers
404          */
405         smp_rmb();
406         if (root->last_trans == trans->transid &&
407             !test_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state))
408                 return 0;
409
410         mutex_lock(&fs_info->reloc_mutex);
411         record_root_in_trans(trans, root, 0);
412         mutex_unlock(&fs_info->reloc_mutex);
413
414         return 0;
415 }
416
417 static inline int is_transaction_blocked(struct btrfs_transaction *trans)
418 {
419         return (trans->state >= TRANS_STATE_BLOCKED &&
420                 trans->state < TRANS_STATE_UNBLOCKED &&
421                 !trans->aborted);
422 }
423
424 /* wait for commit against the current transaction to become unblocked
425  * when this is done, it is safe to start a new transaction, but the current
426  * transaction might not be fully on disk.
427  */
428 static void wait_current_trans(struct btrfs_fs_info *fs_info)
429 {
430         struct btrfs_transaction *cur_trans;
431
432         spin_lock(&fs_info->trans_lock);
433         cur_trans = fs_info->running_transaction;
434         if (cur_trans && is_transaction_blocked(cur_trans)) {
435                 refcount_inc(&cur_trans->use_count);
436                 spin_unlock(&fs_info->trans_lock);
437
438                 wait_event(fs_info->transaction_wait,
439                            cur_trans->state >= TRANS_STATE_UNBLOCKED ||
440                            cur_trans->aborted);
441                 btrfs_put_transaction(cur_trans);
442         } else {
443                 spin_unlock(&fs_info->trans_lock);
444         }
445 }
446
447 static int may_wait_transaction(struct btrfs_fs_info *fs_info, int type)
448 {
449         if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags))
450                 return 0;
451
452         if (type == TRANS_USERSPACE)
453                 return 1;
454
455         if (type == TRANS_START &&
456             !atomic_read(&fs_info->open_ioctl_trans))
457                 return 1;
458
459         return 0;
460 }
461
462 static inline bool need_reserve_reloc_root(struct btrfs_root *root)
463 {
464         struct btrfs_fs_info *fs_info = root->fs_info;
465
466         if (!fs_info->reloc_ctl ||
467             !test_bit(BTRFS_ROOT_REF_COWS, &root->state) ||
468             root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID ||
469             root->reloc_root)
470                 return false;
471
472         return true;
473 }
474
475 static struct btrfs_trans_handle *
476 start_transaction(struct btrfs_root *root, unsigned int num_items,
477                   unsigned int type, enum btrfs_reserve_flush_enum flush,
478                   bool enforce_qgroups)
479 {
480         struct btrfs_fs_info *fs_info = root->fs_info;
481
482         struct btrfs_trans_handle *h;
483         struct btrfs_transaction *cur_trans;
484         u64 num_bytes = 0;
485         u64 qgroup_reserved = 0;
486         bool reloc_reserved = false;
487         int ret;
488
489         /* Send isn't supposed to start transactions. */
490         ASSERT(current->journal_info != BTRFS_SEND_TRANS_STUB);
491
492         if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
493                 return ERR_PTR(-EROFS);
494
495         if (current->journal_info) {
496                 WARN_ON(type & TRANS_EXTWRITERS);
497                 h = current->journal_info;
498                 refcount_inc(&h->use_count);
499                 WARN_ON(refcount_read(&h->use_count) > 2);
500                 h->orig_rsv = h->block_rsv;
501                 h->block_rsv = NULL;
502                 goto got_it;
503         }
504
505         /*
506          * Do the reservation before we join the transaction so we can do all
507          * the appropriate flushing if need be.
508          */
509         if (num_items && root != fs_info->chunk_root) {
510                 qgroup_reserved = num_items * fs_info->nodesize;
511                 ret = btrfs_qgroup_reserve_meta(root, qgroup_reserved,
512                                                 enforce_qgroups);
513                 if (ret)
514                         return ERR_PTR(ret);
515
516                 num_bytes = btrfs_calc_trans_metadata_size(fs_info, num_items);
517                 /*
518                  * Do the reservation for the relocation root creation
519                  */
520                 if (need_reserve_reloc_root(root)) {
521                         num_bytes += fs_info->nodesize;
522                         reloc_reserved = true;
523                 }
524
525                 ret = btrfs_block_rsv_add(root, &fs_info->trans_block_rsv,
526                                           num_bytes, flush);
527                 if (ret)
528                         goto reserve_fail;
529         }
530 again:
531         h = kmem_cache_zalloc(btrfs_trans_handle_cachep, GFP_NOFS);
532         if (!h) {
533                 ret = -ENOMEM;
534                 goto alloc_fail;
535         }
536
537         /*
538          * If we are JOIN_NOLOCK we're already committing a transaction and
539          * waiting on this guy, so we don't need to do the sb_start_intwrite
540          * because we're already holding a ref.  We need this because we could
541          * have raced in and did an fsync() on a file which can kick a commit
542          * and then we deadlock with somebody doing a freeze.
543          *
544          * If we are ATTACH, it means we just want to catch the current
545          * transaction and commit it, so we needn't do sb_start_intwrite(). 
546          */
547         if (type & __TRANS_FREEZABLE)
548                 sb_start_intwrite(fs_info->sb);
549
550         if (may_wait_transaction(fs_info, type))
551                 wait_current_trans(fs_info);
552
553         do {
554                 ret = join_transaction(fs_info, type);
555                 if (ret == -EBUSY) {
556                         wait_current_trans(fs_info);
557                         if (unlikely(type == TRANS_ATTACH))
558                                 ret = -ENOENT;
559                 }
560         } while (ret == -EBUSY);
561
562         if (ret < 0)
563                 goto join_fail;
564
565         cur_trans = fs_info->running_transaction;
566
567         h->transid = cur_trans->transid;
568         h->transaction = cur_trans;
569         h->root = root;
570         refcount_set(&h->use_count, 1);
571         h->fs_info = root->fs_info;
572
573         h->type = type;
574         h->can_flush_pending_bgs = true;
575         INIT_LIST_HEAD(&h->new_bgs);
576
577         smp_mb();
578         if (cur_trans->state >= TRANS_STATE_BLOCKED &&
579             may_wait_transaction(fs_info, type)) {
580                 current->journal_info = h;
581                 btrfs_commit_transaction(h);
582                 goto again;
583         }
584
585         if (num_bytes) {
586                 trace_btrfs_space_reservation(fs_info, "transaction",
587                                               h->transid, num_bytes, 1);
588                 h->block_rsv = &fs_info->trans_block_rsv;
589                 h->bytes_reserved = num_bytes;
590                 h->reloc_reserved = reloc_reserved;
591         }
592
593 got_it:
594         btrfs_record_root_in_trans(h, root);
595
596         if (!current->journal_info && type != TRANS_USERSPACE)
597                 current->journal_info = h;
598         return h;
599
600 join_fail:
601         if (type & __TRANS_FREEZABLE)
602                 sb_end_intwrite(fs_info->sb);
603         kmem_cache_free(btrfs_trans_handle_cachep, h);
604 alloc_fail:
605         if (num_bytes)
606                 btrfs_block_rsv_release(fs_info, &fs_info->trans_block_rsv,
607                                         num_bytes);
608 reserve_fail:
609         btrfs_qgroup_free_meta(root, qgroup_reserved);
610         return ERR_PTR(ret);
611 }
612
613 struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root,
614                                                    unsigned int num_items)
615 {
616         return start_transaction(root, num_items, TRANS_START,
617                                  BTRFS_RESERVE_FLUSH_ALL, true);
618 }
619
620 struct btrfs_trans_handle *btrfs_start_transaction_fallback_global_rsv(
621                                         struct btrfs_root *root,
622                                         unsigned int num_items,
623                                         int min_factor)
624 {
625         struct btrfs_fs_info *fs_info = root->fs_info;
626         struct btrfs_trans_handle *trans;
627         u64 num_bytes;
628         int ret;
629
630         /*
631          * We have two callers: unlink and block group removal.  The
632          * former should succeed even if we will temporarily exceed
633          * quota and the latter operates on the extent root so
634          * qgroup enforcement is ignored anyway.
635          */
636         trans = start_transaction(root, num_items, TRANS_START,
637                                   BTRFS_RESERVE_FLUSH_ALL, false);
638         if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC)
639                 return trans;
640
641         trans = btrfs_start_transaction(root, 0);
642         if (IS_ERR(trans))
643                 return trans;
644
645         num_bytes = btrfs_calc_trans_metadata_size(fs_info, num_items);
646         ret = btrfs_cond_migrate_bytes(fs_info, &fs_info->trans_block_rsv,
647                                        num_bytes, min_factor);
648         if (ret) {
649                 btrfs_end_transaction(trans);
650                 return ERR_PTR(ret);
651         }
652
653         trans->block_rsv = &fs_info->trans_block_rsv;
654         trans->bytes_reserved = num_bytes;
655         trace_btrfs_space_reservation(fs_info, "transaction",
656                                       trans->transid, num_bytes, 1);
657
658         return trans;
659 }
660
661 struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root)
662 {
663         return start_transaction(root, 0, TRANS_JOIN, BTRFS_RESERVE_NO_FLUSH,
664                                  true);
665 }
666
667 struct btrfs_trans_handle *btrfs_join_transaction_nolock(struct btrfs_root *root)
668 {
669         return start_transaction(root, 0, TRANS_JOIN_NOLOCK,
670                                  BTRFS_RESERVE_NO_FLUSH, true);
671 }
672
673 struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *root)
674 {
675         return start_transaction(root, 0, TRANS_USERSPACE,
676                                  BTRFS_RESERVE_NO_FLUSH, true);
677 }
678
679 /*
680  * btrfs_attach_transaction() - catch the running transaction
681  *
682  * It is used when we want to commit the current the transaction, but
683  * don't want to start a new one.
684  *
685  * Note: If this function return -ENOENT, it just means there is no
686  * running transaction. But it is possible that the inactive transaction
687  * is still in the memory, not fully on disk. If you hope there is no
688  * inactive transaction in the fs when -ENOENT is returned, you should
689  * invoke
690  *     btrfs_attach_transaction_barrier()
691  */
692 struct btrfs_trans_handle *btrfs_attach_transaction(struct btrfs_root *root)
693 {
694         return start_transaction(root, 0, TRANS_ATTACH,
695                                  BTRFS_RESERVE_NO_FLUSH, true);
696 }
697
698 /*
699  * btrfs_attach_transaction_barrier() - catch the running transaction
700  *
701  * It is similar to the above function, the differentia is this one
702  * will wait for all the inactive transactions until they fully
703  * complete.
704  */
705 struct btrfs_trans_handle *
706 btrfs_attach_transaction_barrier(struct btrfs_root *root)
707 {
708         struct btrfs_trans_handle *trans;
709
710         trans = start_transaction(root, 0, TRANS_ATTACH,
711                                   BTRFS_RESERVE_NO_FLUSH, true);
712         if (IS_ERR(trans) && PTR_ERR(trans) == -ENOENT)
713                 btrfs_wait_for_commit(root->fs_info, 0);
714
715         return trans;
716 }
717
718 /* wait for a transaction commit to be fully complete */
719 static noinline void wait_for_commit(struct btrfs_transaction *commit)
720 {
721         wait_event(commit->commit_wait, commit->state == TRANS_STATE_COMPLETED);
722 }
723
724 int btrfs_wait_for_commit(struct btrfs_fs_info *fs_info, u64 transid)
725 {
726         struct btrfs_transaction *cur_trans = NULL, *t;
727         int ret = 0;
728
729         if (transid) {
730                 if (transid <= fs_info->last_trans_committed)
731                         goto out;
732
733                 /* find specified transaction */
734                 spin_lock(&fs_info->trans_lock);
735                 list_for_each_entry(t, &fs_info->trans_list, list) {
736                         if (t->transid == transid) {
737                                 cur_trans = t;
738                                 refcount_inc(&cur_trans->use_count);
739                                 ret = 0;
740                                 break;
741                         }
742                         if (t->transid > transid) {
743                                 ret = 0;
744                                 break;
745                         }
746                 }
747                 spin_unlock(&fs_info->trans_lock);
748
749                 /*
750                  * The specified transaction doesn't exist, or we
751                  * raced with btrfs_commit_transaction
752                  */
753                 if (!cur_trans) {
754                         if (transid > fs_info->last_trans_committed)
755                                 ret = -EINVAL;
756                         goto out;
757                 }
758         } else {
759                 /* find newest transaction that is committing | committed */
760                 spin_lock(&fs_info->trans_lock);
761                 list_for_each_entry_reverse(t, &fs_info->trans_list,
762                                             list) {
763                         if (t->state >= TRANS_STATE_COMMIT_START) {
764                                 if (t->state == TRANS_STATE_COMPLETED)
765                                         break;
766                                 cur_trans = t;
767                                 refcount_inc(&cur_trans->use_count);
768                                 break;
769                         }
770                 }
771                 spin_unlock(&fs_info->trans_lock);
772                 if (!cur_trans)
773                         goto out;  /* nothing committing|committed */
774         }
775
776         wait_for_commit(cur_trans);
777         btrfs_put_transaction(cur_trans);
778 out:
779         return ret;
780 }
781
782 void btrfs_throttle(struct btrfs_fs_info *fs_info)
783 {
784         if (!atomic_read(&fs_info->open_ioctl_trans))
785                 wait_current_trans(fs_info);
786 }
787
788 static int should_end_transaction(struct btrfs_trans_handle *trans)
789 {
790         struct btrfs_fs_info *fs_info = trans->fs_info;
791
792         if (btrfs_check_space_for_delayed_refs(trans, fs_info))
793                 return 1;
794
795         return !!btrfs_block_rsv_check(&fs_info->global_block_rsv, 5);
796 }
797
798 int btrfs_should_end_transaction(struct btrfs_trans_handle *trans)
799 {
800         struct btrfs_transaction *cur_trans = trans->transaction;
801         struct btrfs_fs_info *fs_info = trans->fs_info;
802         int updates;
803         int err;
804
805         smp_mb();
806         if (cur_trans->state >= TRANS_STATE_BLOCKED ||
807             cur_trans->delayed_refs.flushing)
808                 return 1;
809
810         updates = trans->delayed_ref_updates;
811         trans->delayed_ref_updates = 0;
812         if (updates) {
813                 err = btrfs_run_delayed_refs(trans, fs_info, updates * 2);
814                 if (err) /* Error code will also eval true */
815                         return err;
816         }
817
818         return should_end_transaction(trans);
819 }
820
821 static void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans,
822                                   struct btrfs_fs_info *fs_info)
823 {
824         if (!trans->block_rsv) {
825                 ASSERT(!trans->bytes_reserved);
826                 return;
827         }
828
829         if (!trans->bytes_reserved)
830                 return;
831
832         ASSERT(trans->block_rsv == &fs_info->trans_block_rsv);
833         trace_btrfs_space_reservation(fs_info, "transaction",
834                                       trans->transid, trans->bytes_reserved, 0);
835         btrfs_block_rsv_release(fs_info, trans->block_rsv,
836                                 trans->bytes_reserved);
837         trans->bytes_reserved = 0;
838 }
839
840 static int __btrfs_end_transaction(struct btrfs_trans_handle *trans,
841                                    int throttle)
842 {
843         struct btrfs_fs_info *info = trans->fs_info;
844         struct btrfs_transaction *cur_trans = trans->transaction;
845         u64 transid = trans->transid;
846         unsigned long cur = trans->delayed_ref_updates;
847         int lock = (trans->type != TRANS_JOIN_NOLOCK);
848         int err = 0;
849         int must_run_delayed_refs = 0;
850
851         if (refcount_read(&trans->use_count) > 1) {
852                 refcount_dec(&trans->use_count);
853                 trans->block_rsv = trans->orig_rsv;
854                 return 0;
855         }
856
857         btrfs_trans_release_metadata(trans, info);
858         trans->block_rsv = NULL;
859
860         if (!list_empty(&trans->new_bgs))
861                 btrfs_create_pending_block_groups(trans, info);
862
863         trans->delayed_ref_updates = 0;
864         if (!trans->sync) {
865                 must_run_delayed_refs =
866                         btrfs_should_throttle_delayed_refs(trans, info);
867                 cur = max_t(unsigned long, cur, 32);
868
869                 /*
870                  * don't make the caller wait if they are from a NOLOCK
871                  * or ATTACH transaction, it will deadlock with commit
872                  */
873                 if (must_run_delayed_refs == 1 &&
874                     (trans->type & (__TRANS_JOIN_NOLOCK | __TRANS_ATTACH)))
875                         must_run_delayed_refs = 2;
876         }
877
878         btrfs_trans_release_metadata(trans, info);
879         trans->block_rsv = NULL;
880
881         if (!list_empty(&trans->new_bgs))
882                 btrfs_create_pending_block_groups(trans, info);
883
884         btrfs_trans_release_chunk_metadata(trans);
885
886         if (lock && !atomic_read(&info->open_ioctl_trans) &&
887             should_end_transaction(trans) &&
888             READ_ONCE(cur_trans->state) == TRANS_STATE_RUNNING) {
889                 spin_lock(&info->trans_lock);
890                 if (cur_trans->state == TRANS_STATE_RUNNING)
891                         cur_trans->state = TRANS_STATE_BLOCKED;
892                 spin_unlock(&info->trans_lock);
893         }
894
895         if (lock && READ_ONCE(cur_trans->state) == TRANS_STATE_BLOCKED) {
896                 if (throttle)
897                         return btrfs_commit_transaction(trans);
898                 else
899                         wake_up_process(info->transaction_kthread);
900         }
901
902         if (trans->type & __TRANS_FREEZABLE)
903                 sb_end_intwrite(info->sb);
904
905         WARN_ON(cur_trans != info->running_transaction);
906         WARN_ON(atomic_read(&cur_trans->num_writers) < 1);
907         atomic_dec(&cur_trans->num_writers);
908         extwriter_counter_dec(cur_trans, trans->type);
909
910         /*
911          * Make sure counter is updated before we wake up waiters.
912          */
913         smp_mb();
914         if (waitqueue_active(&cur_trans->writer_wait))
915                 wake_up(&cur_trans->writer_wait);
916         btrfs_put_transaction(cur_trans);
917
918         if (current->journal_info == trans)
919                 current->journal_info = NULL;
920
921         if (throttle)
922                 btrfs_run_delayed_iputs(info);
923
924         if (trans->aborted ||
925             test_bit(BTRFS_FS_STATE_ERROR, &info->fs_state)) {
926                 wake_up_process(info->transaction_kthread);
927                 err = -EIO;
928         }
929
930         kmem_cache_free(btrfs_trans_handle_cachep, trans);
931         if (must_run_delayed_refs) {
932                 btrfs_async_run_delayed_refs(info, cur, transid,
933                                              must_run_delayed_refs == 1);
934         }
935         return err;
936 }
937
938 int btrfs_end_transaction(struct btrfs_trans_handle *trans)
939 {
940         return __btrfs_end_transaction(trans, 0);
941 }
942
943 int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans)
944 {
945         return __btrfs_end_transaction(trans, 1);
946 }
947
948 /*
949  * when btree blocks are allocated, they have some corresponding bits set for
950  * them in one of two extent_io trees.  This is used to make sure all of
951  * those extents are sent to disk but does not wait on them
952  */
953 int btrfs_write_marked_extents(struct btrfs_fs_info *fs_info,
954                                struct extent_io_tree *dirty_pages, int mark)
955 {
956         int err = 0;
957         int werr = 0;
958         struct address_space *mapping = fs_info->btree_inode->i_mapping;
959         struct extent_state *cached_state = NULL;
960         u64 start = 0;
961         u64 end;
962
963         atomic_inc(&BTRFS_I(fs_info->btree_inode)->sync_writers);
964         while (!find_first_extent_bit(dirty_pages, start, &start, &end,
965                                       mark, &cached_state)) {
966                 bool wait_writeback = false;
967
968                 err = convert_extent_bit(dirty_pages, start, end,
969                                          EXTENT_NEED_WAIT,
970                                          mark, &cached_state);
971                 /*
972                  * convert_extent_bit can return -ENOMEM, which is most of the
973                  * time a temporary error. So when it happens, ignore the error
974                  * and wait for writeback of this range to finish - because we
975                  * failed to set the bit EXTENT_NEED_WAIT for the range, a call
976                  * to __btrfs_wait_marked_extents() would not know that
977                  * writeback for this range started and therefore wouldn't
978                  * wait for it to finish - we don't want to commit a
979                  * superblock that points to btree nodes/leafs for which
980                  * writeback hasn't finished yet (and without errors).
981                  * We cleanup any entries left in the io tree when committing
982                  * the transaction (through clear_btree_io_tree()).
983                  */
984                 if (err == -ENOMEM) {
985                         err = 0;
986                         wait_writeback = true;
987                 }
988                 if (!err)
989                         err = filemap_fdatawrite_range(mapping, start, end);
990                 if (err)
991                         werr = err;
992                 else if (wait_writeback)
993                         werr = filemap_fdatawait_range(mapping, start, end);
994                 free_extent_state(cached_state);
995                 cached_state = NULL;
996                 cond_resched();
997                 start = end + 1;
998         }
999         atomic_dec(&BTRFS_I(fs_info->btree_inode)->sync_writers);
1000         return werr;
1001 }
1002
1003 /*
1004  * when btree blocks are allocated, they have some corresponding bits set for
1005  * them in one of two extent_io trees.  This is used to make sure all of
1006  * those extents are on disk for transaction or log commit.  We wait
1007  * on all the pages and clear them from the dirty pages state tree
1008  */
1009 static int __btrfs_wait_marked_extents(struct btrfs_fs_info *fs_info,
1010                                        struct extent_io_tree *dirty_pages)
1011 {
1012         int err = 0;
1013         int werr = 0;
1014         struct address_space *mapping = fs_info->btree_inode->i_mapping;
1015         struct extent_state *cached_state = NULL;
1016         u64 start = 0;
1017         u64 end;
1018
1019         while (!find_first_extent_bit(dirty_pages, start, &start, &end,
1020                                       EXTENT_NEED_WAIT, &cached_state)) {
1021                 /*
1022                  * Ignore -ENOMEM errors returned by clear_extent_bit().
1023                  * When committing the transaction, we'll remove any entries
1024                  * left in the io tree. For a log commit, we don't remove them
1025                  * after committing the log because the tree can be accessed
1026                  * concurrently - we do it only at transaction commit time when
1027                  * it's safe to do it (through clear_btree_io_tree()).
1028                  */
1029                 err = clear_extent_bit(dirty_pages, start, end,
1030                                        EXTENT_NEED_WAIT, 0, 0, &cached_state);
1031                 if (err == -ENOMEM)
1032                         err = 0;
1033                 if (!err)
1034                         err = filemap_fdatawait_range(mapping, start, end);
1035                 if (err)
1036                         werr = err;
1037                 free_extent_state(cached_state);
1038                 cached_state = NULL;
1039                 cond_resched();
1040                 start = end + 1;
1041         }
1042         if (err)
1043                 werr = err;
1044         return werr;
1045 }
1046
1047 int btrfs_wait_extents(struct btrfs_fs_info *fs_info,
1048                        struct extent_io_tree *dirty_pages)
1049 {
1050         bool errors = false;
1051         int err;
1052
1053         err = __btrfs_wait_marked_extents(fs_info, dirty_pages);
1054         if (test_and_clear_bit(BTRFS_FS_BTREE_ERR, &fs_info->flags))
1055                 errors = true;
1056
1057         if (errors && !err)
1058                 err = -EIO;
1059         return err;
1060 }
1061
1062 int btrfs_wait_tree_log_extents(struct btrfs_root *log_root, int mark)
1063 {
1064         struct btrfs_fs_info *fs_info = log_root->fs_info;
1065         struct extent_io_tree *dirty_pages = &log_root->dirty_log_pages;
1066         bool errors = false;
1067         int err;
1068
1069         ASSERT(log_root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID);
1070
1071         err = __btrfs_wait_marked_extents(fs_info, dirty_pages);
1072         if ((mark & EXTENT_DIRTY) &&
1073             test_and_clear_bit(BTRFS_FS_LOG1_ERR, &fs_info->flags))
1074                 errors = true;
1075
1076         if ((mark & EXTENT_NEW) &&
1077             test_and_clear_bit(BTRFS_FS_LOG2_ERR, &fs_info->flags))
1078                 errors = true;
1079
1080         if (errors && !err)
1081                 err = -EIO;
1082         return err;
1083 }
1084
1085 /*
1086  * When btree blocks are allocated the corresponding extents are marked dirty.
1087  * This function ensures such extents are persisted on disk for transaction or
1088  * log commit.
1089  *
1090  * @trans: transaction whose dirty pages we'd like to write
1091  */
1092 static int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans,
1093                                             struct btrfs_fs_info *fs_info)
1094 {
1095         int ret;
1096         int ret2;
1097         struct extent_io_tree *dirty_pages = &trans->transaction->dirty_pages;
1098         struct blk_plug plug;
1099
1100         blk_start_plug(&plug);
1101         ret = btrfs_write_marked_extents(fs_info, dirty_pages, EXTENT_DIRTY);
1102         blk_finish_plug(&plug);
1103         ret2 = btrfs_wait_extents(fs_info, dirty_pages);
1104
1105         clear_btree_io_tree(&trans->transaction->dirty_pages);
1106
1107         if (ret)
1108                 return ret;
1109         else if (ret2)
1110                 return ret2;
1111         else
1112                 return 0;
1113 }
1114
1115 /*
1116  * this is used to update the root pointer in the tree of tree roots.
1117  *
1118  * But, in the case of the extent allocation tree, updating the root
1119  * pointer may allocate blocks which may change the root of the extent
1120  * allocation tree.
1121  *
1122  * So, this loops and repeats and makes sure the cowonly root didn't
1123  * change while the root pointer was being updated in the metadata.
1124  */
1125 static int update_cowonly_root(struct btrfs_trans_handle *trans,
1126                                struct btrfs_root *root)
1127 {
1128         int ret;
1129         u64 old_root_bytenr;
1130         u64 old_root_used;
1131         struct btrfs_fs_info *fs_info = root->fs_info;
1132         struct btrfs_root *tree_root = fs_info->tree_root;
1133
1134         old_root_used = btrfs_root_used(&root->root_item);
1135
1136         while (1) {
1137                 old_root_bytenr = btrfs_root_bytenr(&root->root_item);
1138                 if (old_root_bytenr == root->node->start &&
1139                     old_root_used == btrfs_root_used(&root->root_item))
1140                         break;
1141
1142                 btrfs_set_root_node(&root->root_item, root->node);
1143                 ret = btrfs_update_root(trans, tree_root,
1144                                         &root->root_key,
1145                                         &root->root_item);
1146                 if (ret)
1147                         return ret;
1148
1149                 old_root_used = btrfs_root_used(&root->root_item);
1150         }
1151
1152         return 0;
1153 }
1154
1155 /*
1156  * update all the cowonly tree roots on disk
1157  *
1158  * The error handling in this function may not be obvious. Any of the
1159  * failures will cause the file system to go offline. We still need
1160  * to clean up the delayed refs.
1161  */
1162 static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans,
1163                                          struct btrfs_fs_info *fs_info)
1164 {
1165         struct list_head *dirty_bgs = &trans->transaction->dirty_bgs;
1166         struct list_head *io_bgs = &trans->transaction->io_bgs;
1167         struct list_head *next;
1168         struct extent_buffer *eb;
1169         int ret;
1170
1171         eb = btrfs_lock_root_node(fs_info->tree_root);
1172         ret = btrfs_cow_block(trans, fs_info->tree_root, eb, NULL,
1173                               0, &eb);
1174         btrfs_tree_unlock(eb);
1175         free_extent_buffer(eb);
1176
1177         if (ret)
1178                 return ret;
1179
1180         ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
1181         if (ret)
1182                 return ret;
1183
1184         ret = btrfs_run_dev_stats(trans, fs_info);
1185         if (ret)
1186                 return ret;
1187         ret = btrfs_run_dev_replace(trans, fs_info);
1188         if (ret)
1189                 return ret;
1190         ret = btrfs_run_qgroups(trans, fs_info);
1191         if (ret)
1192                 return ret;
1193
1194         ret = btrfs_setup_space_cache(trans, fs_info);
1195         if (ret)
1196                 return ret;
1197
1198         /* run_qgroups might have added some more refs */
1199         ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
1200         if (ret)
1201                 return ret;
1202 again:
1203         while (!list_empty(&fs_info->dirty_cowonly_roots)) {
1204                 struct btrfs_root *root;
1205                 next = fs_info->dirty_cowonly_roots.next;
1206                 list_del_init(next);
1207                 root = list_entry(next, struct btrfs_root, dirty_list);
1208                 clear_bit(BTRFS_ROOT_DIRTY, &root->state);
1209
1210                 if (root != fs_info->extent_root)
1211                         list_add_tail(&root->dirty_list,
1212                                       &trans->transaction->switch_commits);
1213                 ret = update_cowonly_root(trans, root);
1214                 if (ret)
1215                         return ret;
1216                 ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
1217                 if (ret)
1218                         return ret;
1219         }
1220
1221         while (!list_empty(dirty_bgs) || !list_empty(io_bgs)) {
1222                 ret = btrfs_write_dirty_block_groups(trans, fs_info);
1223                 if (ret)
1224                         return ret;
1225                 ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
1226                 if (ret)
1227                         return ret;
1228         }
1229
1230         if (!list_empty(&fs_info->dirty_cowonly_roots))
1231                 goto again;
1232
1233         list_add_tail(&fs_info->extent_root->dirty_list,
1234                       &trans->transaction->switch_commits);
1235         btrfs_after_dev_replace_commit(fs_info);
1236
1237         return 0;
1238 }
1239
1240 /*
1241  * dead roots are old snapshots that need to be deleted.  This allocates
1242  * a dirty root struct and adds it into the list of dead roots that need to
1243  * be deleted
1244  */
1245 void btrfs_add_dead_root(struct btrfs_root *root)
1246 {
1247         struct btrfs_fs_info *fs_info = root->fs_info;
1248
1249         spin_lock(&fs_info->trans_lock);
1250         if (list_empty(&root->root_list))
1251                 list_add_tail(&root->root_list, &fs_info->dead_roots);
1252         spin_unlock(&fs_info->trans_lock);
1253 }
1254
1255 /*
1256  * update all the cowonly tree roots on disk
1257  */
1258 static noinline int commit_fs_roots(struct btrfs_trans_handle *trans,
1259                                     struct btrfs_fs_info *fs_info)
1260 {
1261         struct btrfs_root *gang[8];
1262         int i;
1263         int ret;
1264         int err = 0;
1265
1266         spin_lock(&fs_info->fs_roots_radix_lock);
1267         while (1) {
1268                 ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix,
1269                                                  (void **)gang, 0,
1270                                                  ARRAY_SIZE(gang),
1271                                                  BTRFS_ROOT_TRANS_TAG);
1272                 if (ret == 0)
1273                         break;
1274                 for (i = 0; i < ret; i++) {
1275                         struct btrfs_root *root = gang[i];
1276                         radix_tree_tag_clear(&fs_info->fs_roots_radix,
1277                                         (unsigned long)root->root_key.objectid,
1278                                         BTRFS_ROOT_TRANS_TAG);
1279                         spin_unlock(&fs_info->fs_roots_radix_lock);
1280
1281                         btrfs_free_log(trans, root);
1282                         btrfs_update_reloc_root(trans, root);
1283                         btrfs_orphan_commit_root(trans, root);
1284
1285                         btrfs_save_ino_cache(root, trans);
1286
1287                         /* see comments in should_cow_block() */
1288                         clear_bit(BTRFS_ROOT_FORCE_COW, &root->state);
1289                         smp_mb__after_atomic();
1290
1291                         if (root->commit_root != root->node) {
1292                                 list_add_tail(&root->dirty_list,
1293                                         &trans->transaction->switch_commits);
1294                                 btrfs_set_root_node(&root->root_item,
1295                                                     root->node);
1296                         }
1297
1298                         err = btrfs_update_root(trans, fs_info->tree_root,
1299                                                 &root->root_key,
1300                                                 &root->root_item);
1301                         spin_lock(&fs_info->fs_roots_radix_lock);
1302                         if (err)
1303                                 break;
1304                         btrfs_qgroup_free_meta_all(root);
1305                 }
1306         }
1307         spin_unlock(&fs_info->fs_roots_radix_lock);
1308         return err;
1309 }
1310
1311 /*
1312  * defrag a given btree.
1313  * Every leaf in the btree is read and defragged.
1314  */
1315 int btrfs_defrag_root(struct btrfs_root *root)
1316 {
1317         struct btrfs_fs_info *info = root->fs_info;
1318         struct btrfs_trans_handle *trans;
1319         int ret;
1320
1321         if (test_and_set_bit(BTRFS_ROOT_DEFRAG_RUNNING, &root->state))
1322                 return 0;
1323
1324         while (1) {
1325                 trans = btrfs_start_transaction(root, 0);
1326                 if (IS_ERR(trans))
1327                         return PTR_ERR(trans);
1328
1329                 ret = btrfs_defrag_leaves(trans, root);
1330
1331                 btrfs_end_transaction(trans);
1332                 btrfs_btree_balance_dirty(info);
1333                 cond_resched();
1334
1335                 if (btrfs_fs_closing(info) || ret != -EAGAIN)
1336                         break;
1337
1338                 if (btrfs_defrag_cancelled(info)) {
1339                         btrfs_debug(info, "defrag_root cancelled");
1340                         ret = -EAGAIN;
1341                         break;
1342                 }
1343         }
1344         clear_bit(BTRFS_ROOT_DEFRAG_RUNNING, &root->state);
1345         return ret;
1346 }
1347
1348 /*
1349  * Do all special snapshot related qgroup dirty hack.
1350  *
1351  * Will do all needed qgroup inherit and dirty hack like switch commit
1352  * roots inside one transaction and write all btree into disk, to make
1353  * qgroup works.
1354  */
1355 static int qgroup_account_snapshot(struct btrfs_trans_handle *trans,
1356                                    struct btrfs_root *src,
1357                                    struct btrfs_root *parent,
1358                                    struct btrfs_qgroup_inherit *inherit,
1359                                    u64 dst_objectid)
1360 {
1361         struct btrfs_fs_info *fs_info = src->fs_info;
1362         int ret;
1363
1364         /*
1365          * Save some performance in the case that qgroups are not
1366          * enabled. If this check races with the ioctl, rescan will
1367          * kick in anyway.
1368          */
1369         if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1370                 return 0;
1371
1372         /*
1373          * We are going to commit transaction, see btrfs_commit_transaction()
1374          * comment for reason locking tree_log_mutex
1375          */
1376         mutex_lock(&fs_info->tree_log_mutex);
1377
1378         ret = commit_fs_roots(trans, fs_info);
1379         if (ret)
1380                 goto out;
1381         ret = btrfs_qgroup_account_extents(trans, fs_info);
1382         if (ret < 0)
1383                 goto out;
1384
1385         /* Now qgroup are all updated, we can inherit it to new qgroups */
1386         ret = btrfs_qgroup_inherit(trans, fs_info,
1387                                    src->root_key.objectid, dst_objectid,
1388                                    inherit);
1389         if (ret < 0)
1390                 goto out;
1391
1392         /*
1393          * Now we do a simplified commit transaction, which will:
1394          * 1) commit all subvolume and extent tree
1395          *    To ensure all subvolume and extent tree have a valid
1396          *    commit_root to accounting later insert_dir_item()
1397          * 2) write all btree blocks onto disk
1398          *    This is to make sure later btree modification will be cowed
1399          *    Or commit_root can be populated and cause wrong qgroup numbers
1400          * In this simplified commit, we don't really care about other trees
1401          * like chunk and root tree, as they won't affect qgroup.
1402          * And we don't write super to avoid half committed status.
1403          */
1404         ret = commit_cowonly_roots(trans, fs_info);
1405         if (ret)
1406                 goto out;
1407         switch_commit_roots(trans->transaction, fs_info);
1408         ret = btrfs_write_and_wait_transaction(trans, fs_info);
1409         if (ret)
1410                 btrfs_handle_fs_error(fs_info, ret,
1411                         "Error while writing out transaction for qgroup");
1412
1413 out:
1414         mutex_unlock(&fs_info->tree_log_mutex);
1415
1416         /*
1417          * Force parent root to be updated, as we recorded it before so its
1418          * last_trans == cur_transid.
1419          * Or it won't be committed again onto disk after later
1420          * insert_dir_item()
1421          */
1422         if (!ret)
1423                 record_root_in_trans(trans, parent, 1);
1424         return ret;
1425 }
1426
1427 /*
1428  * new snapshots need to be created at a very specific time in the
1429  * transaction commit.  This does the actual creation.
1430  *
1431  * Note:
1432  * If the error which may affect the commitment of the current transaction
1433  * happens, we should return the error number. If the error which just affect
1434  * the creation of the pending snapshots, just return 0.
1435  */
1436 static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans,
1437                                    struct btrfs_fs_info *fs_info,
1438                                    struct btrfs_pending_snapshot *pending)
1439 {
1440         struct btrfs_key key;
1441         struct btrfs_root_item *new_root_item;
1442         struct btrfs_root *tree_root = fs_info->tree_root;
1443         struct btrfs_root *root = pending->root;
1444         struct btrfs_root *parent_root;
1445         struct btrfs_block_rsv *rsv;
1446         struct inode *parent_inode;
1447         struct btrfs_path *path;
1448         struct btrfs_dir_item *dir_item;
1449         struct dentry *dentry;
1450         struct extent_buffer *tmp;
1451         struct extent_buffer *old;
1452         struct timespec cur_time;
1453         int ret = 0;
1454         u64 to_reserve = 0;
1455         u64 index = 0;
1456         u64 objectid;
1457         u64 root_flags;
1458         uuid_le new_uuid;
1459
1460         ASSERT(pending->path);
1461         path = pending->path;
1462
1463         ASSERT(pending->root_item);
1464         new_root_item = pending->root_item;
1465
1466         pending->error = btrfs_find_free_objectid(tree_root, &objectid);
1467         if (pending->error)
1468                 goto no_free_objectid;
1469
1470         /*
1471          * Make qgroup to skip current new snapshot's qgroupid, as it is
1472          * accounted by later btrfs_qgroup_inherit().
1473          */
1474         btrfs_set_skip_qgroup(trans, objectid);
1475
1476         btrfs_reloc_pre_snapshot(pending, &to_reserve);
1477
1478         if (to_reserve > 0) {
1479                 pending->error = btrfs_block_rsv_add(root,
1480                                                      &pending->block_rsv,
1481                                                      to_reserve,
1482                                                      BTRFS_RESERVE_NO_FLUSH);
1483                 if (pending->error)
1484                         goto clear_skip_qgroup;
1485         }
1486
1487         key.objectid = objectid;
1488         key.offset = (u64)-1;
1489         key.type = BTRFS_ROOT_ITEM_KEY;
1490
1491         rsv = trans->block_rsv;
1492         trans->block_rsv = &pending->block_rsv;
1493         trans->bytes_reserved = trans->block_rsv->reserved;
1494         trace_btrfs_space_reservation(fs_info, "transaction",
1495                                       trans->transid,
1496                                       trans->bytes_reserved, 1);
1497         dentry = pending->dentry;
1498         parent_inode = pending->dir;
1499         parent_root = BTRFS_I(parent_inode)->root;
1500         record_root_in_trans(trans, parent_root, 0);
1501
1502         cur_time = current_time(parent_inode);
1503
1504         /*
1505          * insert the directory item
1506          */
1507         ret = btrfs_set_inode_index(BTRFS_I(parent_inode), &index);
1508         BUG_ON(ret); /* -ENOMEM */
1509
1510         /* check if there is a file/dir which has the same name. */
1511         dir_item = btrfs_lookup_dir_item(NULL, parent_root, path,
1512                                          btrfs_ino(BTRFS_I(parent_inode)),
1513                                          dentry->d_name.name,
1514                                          dentry->d_name.len, 0);
1515         if (dir_item != NULL && !IS_ERR(dir_item)) {
1516                 pending->error = -EEXIST;
1517                 goto dir_item_existed;
1518         } else if (IS_ERR(dir_item)) {
1519                 ret = PTR_ERR(dir_item);
1520                 btrfs_abort_transaction(trans, ret);
1521                 goto fail;
1522         }
1523         btrfs_release_path(path);
1524
1525         /*
1526          * pull in the delayed directory update
1527          * and the delayed inode item
1528          * otherwise we corrupt the FS during
1529          * snapshot
1530          */
1531         ret = btrfs_run_delayed_items(trans, fs_info);
1532         if (ret) {      /* Transaction aborted */
1533                 btrfs_abort_transaction(trans, ret);
1534                 goto fail;
1535         }
1536
1537         record_root_in_trans(trans, root, 0);
1538         btrfs_set_root_last_snapshot(&root->root_item, trans->transid);
1539         memcpy(new_root_item, &root->root_item, sizeof(*new_root_item));
1540         btrfs_check_and_init_root_item(new_root_item);
1541
1542         root_flags = btrfs_root_flags(new_root_item);
1543         if (pending->readonly)
1544                 root_flags |= BTRFS_ROOT_SUBVOL_RDONLY;
1545         else
1546                 root_flags &= ~BTRFS_ROOT_SUBVOL_RDONLY;
1547         btrfs_set_root_flags(new_root_item, root_flags);
1548
1549         btrfs_set_root_generation_v2(new_root_item,
1550                         trans->transid);
1551         uuid_le_gen(&new_uuid);
1552         memcpy(new_root_item->uuid, new_uuid.b, BTRFS_UUID_SIZE);
1553         memcpy(new_root_item->parent_uuid, root->root_item.uuid,
1554                         BTRFS_UUID_SIZE);
1555         if (!(root_flags & BTRFS_ROOT_SUBVOL_RDONLY)) {
1556                 memset(new_root_item->received_uuid, 0,
1557                        sizeof(new_root_item->received_uuid));
1558                 memset(&new_root_item->stime, 0, sizeof(new_root_item->stime));
1559                 memset(&new_root_item->rtime, 0, sizeof(new_root_item->rtime));
1560                 btrfs_set_root_stransid(new_root_item, 0);
1561                 btrfs_set_root_rtransid(new_root_item, 0);
1562         }
1563         btrfs_set_stack_timespec_sec(&new_root_item->otime, cur_time.tv_sec);
1564         btrfs_set_stack_timespec_nsec(&new_root_item->otime, cur_time.tv_nsec);
1565         btrfs_set_root_otransid(new_root_item, trans->transid);
1566
1567         old = btrfs_lock_root_node(root);
1568         ret = btrfs_cow_block(trans, root, old, NULL, 0, &old);
1569         if (ret) {
1570                 btrfs_tree_unlock(old);
1571                 free_extent_buffer(old);
1572                 btrfs_abort_transaction(trans, ret);
1573                 goto fail;
1574         }
1575
1576         btrfs_set_lock_blocking(old);
1577
1578         ret = btrfs_copy_root(trans, root, old, &tmp, objectid);
1579         /* clean up in any case */
1580         btrfs_tree_unlock(old);
1581         free_extent_buffer(old);
1582         if (ret) {
1583                 btrfs_abort_transaction(trans, ret);
1584                 goto fail;
1585         }
1586         /* see comments in should_cow_block() */
1587         set_bit(BTRFS_ROOT_FORCE_COW, &root->state);
1588         smp_wmb();
1589
1590         btrfs_set_root_node(new_root_item, tmp);
1591         /* record when the snapshot was created in key.offset */
1592         key.offset = trans->transid;
1593         ret = btrfs_insert_root(trans, tree_root, &key, new_root_item);
1594         btrfs_tree_unlock(tmp);
1595         free_extent_buffer(tmp);
1596         if (ret) {
1597                 btrfs_abort_transaction(trans, ret);
1598                 goto fail;
1599         }
1600
1601         /*
1602          * insert root back/forward references
1603          */
1604         ret = btrfs_add_root_ref(trans, fs_info, objectid,
1605                                  parent_root->root_key.objectid,
1606                                  btrfs_ino(BTRFS_I(parent_inode)), index,
1607                                  dentry->d_name.name, dentry->d_name.len);
1608         if (ret) {
1609                 btrfs_abort_transaction(trans, ret);
1610                 goto fail;
1611         }
1612
1613         key.offset = (u64)-1;
1614         pending->snap = btrfs_read_fs_root_no_name(fs_info, &key);
1615         if (IS_ERR(pending->snap)) {
1616                 ret = PTR_ERR(pending->snap);
1617                 btrfs_abort_transaction(trans, ret);
1618                 goto fail;
1619         }
1620
1621         ret = btrfs_reloc_post_snapshot(trans, pending);
1622         if (ret) {
1623                 btrfs_abort_transaction(trans, ret);
1624                 goto fail;
1625         }
1626
1627         ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
1628         if (ret) {
1629                 btrfs_abort_transaction(trans, ret);
1630                 goto fail;
1631         }
1632
1633         /*
1634          * Do special qgroup accounting for snapshot, as we do some qgroup
1635          * snapshot hack to do fast snapshot.
1636          * To co-operate with that hack, we do hack again.
1637          * Or snapshot will be greatly slowed down by a subtree qgroup rescan
1638          */
1639         ret = qgroup_account_snapshot(trans, root, parent_root,
1640                                       pending->inherit, objectid);
1641         if (ret < 0)
1642                 goto fail;
1643
1644         ret = btrfs_insert_dir_item(trans, parent_root,
1645                                     dentry->d_name.name, dentry->d_name.len,
1646                                     BTRFS_I(parent_inode), &key,
1647                                     BTRFS_FT_DIR, index);
1648         /* We have check then name at the beginning, so it is impossible. */
1649         BUG_ON(ret == -EEXIST || ret == -EOVERFLOW);
1650         if (ret) {
1651                 btrfs_abort_transaction(trans, ret);
1652                 goto fail;
1653         }
1654
1655         btrfs_i_size_write(BTRFS_I(parent_inode), parent_inode->i_size +
1656                                          dentry->d_name.len * 2);
1657         parent_inode->i_mtime = parent_inode->i_ctime =
1658                 current_time(parent_inode);
1659         ret = btrfs_update_inode_fallback(trans, parent_root, parent_inode);
1660         if (ret) {
1661                 btrfs_abort_transaction(trans, ret);
1662                 goto fail;
1663         }
1664         ret = btrfs_uuid_tree_add(trans, fs_info, new_uuid.b,
1665                                   BTRFS_UUID_KEY_SUBVOL, objectid);
1666         if (ret) {
1667                 btrfs_abort_transaction(trans, ret);
1668                 goto fail;
1669         }
1670         if (!btrfs_is_empty_uuid(new_root_item->received_uuid)) {
1671                 ret = btrfs_uuid_tree_add(trans, fs_info,
1672                                           new_root_item->received_uuid,
1673                                           BTRFS_UUID_KEY_RECEIVED_SUBVOL,
1674                                           objectid);
1675                 if (ret && ret != -EEXIST) {
1676                         btrfs_abort_transaction(trans, ret);
1677                         goto fail;
1678                 }
1679         }
1680
1681         ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
1682         if (ret) {
1683                 btrfs_abort_transaction(trans, ret);
1684                 goto fail;
1685         }
1686
1687 fail:
1688         pending->error = ret;
1689 dir_item_existed:
1690         trans->block_rsv = rsv;
1691         trans->bytes_reserved = 0;
1692 clear_skip_qgroup:
1693         btrfs_clear_skip_qgroup(trans);
1694 no_free_objectid:
1695         kfree(new_root_item);
1696         pending->root_item = NULL;
1697         btrfs_free_path(path);
1698         pending->path = NULL;
1699
1700         return ret;
1701 }
1702
1703 /*
1704  * create all the snapshots we've scheduled for creation
1705  */
1706 static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans,
1707                                              struct btrfs_fs_info *fs_info)
1708 {
1709         struct btrfs_pending_snapshot *pending, *next;
1710         struct list_head *head = &trans->transaction->pending_snapshots;
1711         int ret = 0;
1712
1713         list_for_each_entry_safe(pending, next, head, list) {
1714                 list_del(&pending->list);
1715                 ret = create_pending_snapshot(trans, fs_info, pending);
1716                 if (ret)
1717                         break;
1718         }
1719         return ret;
1720 }
1721
1722 static void update_super_roots(struct btrfs_fs_info *fs_info)
1723 {
1724         struct btrfs_root_item *root_item;
1725         struct btrfs_super_block *super;
1726
1727         super = fs_info->super_copy;
1728
1729         root_item = &fs_info->chunk_root->root_item;
1730         super->chunk_root = root_item->bytenr;
1731         super->chunk_root_generation = root_item->generation;
1732         super->chunk_root_level = root_item->level;
1733
1734         root_item = &fs_info->tree_root->root_item;
1735         super->root = root_item->bytenr;
1736         super->generation = root_item->generation;
1737         super->root_level = root_item->level;
1738         if (btrfs_test_opt(fs_info, SPACE_CACHE))
1739                 super->cache_generation = root_item->generation;
1740         if (test_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags))
1741                 super->uuid_tree_generation = root_item->generation;
1742 }
1743
1744 int btrfs_transaction_in_commit(struct btrfs_fs_info *info)
1745 {
1746         struct btrfs_transaction *trans;
1747         int ret = 0;
1748
1749         spin_lock(&info->trans_lock);
1750         trans = info->running_transaction;
1751         if (trans)
1752                 ret = (trans->state >= TRANS_STATE_COMMIT_START);
1753         spin_unlock(&info->trans_lock);
1754         return ret;
1755 }
1756
1757 int btrfs_transaction_blocked(struct btrfs_fs_info *info)
1758 {
1759         struct btrfs_transaction *trans;
1760         int ret = 0;
1761
1762         spin_lock(&info->trans_lock);
1763         trans = info->running_transaction;
1764         if (trans)
1765                 ret = is_transaction_blocked(trans);
1766         spin_unlock(&info->trans_lock);
1767         return ret;
1768 }
1769
1770 /*
1771  * wait for the current transaction commit to start and block subsequent
1772  * transaction joins
1773  */
1774 static void wait_current_trans_commit_start(struct btrfs_fs_info *fs_info,
1775                                             struct btrfs_transaction *trans)
1776 {
1777         wait_event(fs_info->transaction_blocked_wait,
1778                    trans->state >= TRANS_STATE_COMMIT_START || trans->aborted);
1779 }
1780
1781 /*
1782  * wait for the current transaction to start and then become unblocked.
1783  * caller holds ref.
1784  */
1785 static void wait_current_trans_commit_start_and_unblock(
1786                                         struct btrfs_fs_info *fs_info,
1787                                         struct btrfs_transaction *trans)
1788 {
1789         wait_event(fs_info->transaction_wait,
1790                    trans->state >= TRANS_STATE_UNBLOCKED || trans->aborted);
1791 }
1792
1793 /*
1794  * commit transactions asynchronously. once btrfs_commit_transaction_async
1795  * returns, any subsequent transaction will not be allowed to join.
1796  */
1797 struct btrfs_async_commit {
1798         struct btrfs_trans_handle *newtrans;
1799         struct work_struct work;
1800 };
1801
1802 static void do_async_commit(struct work_struct *work)
1803 {
1804         struct btrfs_async_commit *ac =
1805                 container_of(work, struct btrfs_async_commit, work);
1806
1807         /*
1808          * We've got freeze protection passed with the transaction.
1809          * Tell lockdep about it.
1810          */
1811         if (ac->newtrans->type & __TRANS_FREEZABLE)
1812                 __sb_writers_acquired(ac->newtrans->fs_info->sb, SB_FREEZE_FS);
1813
1814         current->journal_info = ac->newtrans;
1815
1816         btrfs_commit_transaction(ac->newtrans);
1817         kfree(ac);
1818 }
1819
1820 int btrfs_commit_transaction_async(struct btrfs_trans_handle *trans,
1821                                    int wait_for_unblock)
1822 {
1823         struct btrfs_fs_info *fs_info = trans->fs_info;
1824         struct btrfs_async_commit *ac;
1825         struct btrfs_transaction *cur_trans;
1826
1827         ac = kmalloc(sizeof(*ac), GFP_NOFS);
1828         if (!ac)
1829                 return -ENOMEM;
1830
1831         INIT_WORK(&ac->work, do_async_commit);
1832         ac->newtrans = btrfs_join_transaction(trans->root);
1833         if (IS_ERR(ac->newtrans)) {
1834                 int err = PTR_ERR(ac->newtrans);
1835                 kfree(ac);
1836                 return err;
1837         }
1838
1839         /* take transaction reference */
1840         cur_trans = trans->transaction;
1841         refcount_inc(&cur_trans->use_count);
1842
1843         btrfs_end_transaction(trans);
1844
1845         /*
1846          * Tell lockdep we've released the freeze rwsem, since the
1847          * async commit thread will be the one to unlock it.
1848          */
1849         if (ac->newtrans->type & __TRANS_FREEZABLE)
1850                 __sb_writers_release(fs_info->sb, SB_FREEZE_FS);
1851
1852         schedule_work(&ac->work);
1853
1854         /* wait for transaction to start and unblock */
1855         if (wait_for_unblock)
1856                 wait_current_trans_commit_start_and_unblock(fs_info, cur_trans);
1857         else
1858                 wait_current_trans_commit_start(fs_info, cur_trans);
1859
1860         if (current->journal_info == trans)
1861                 current->journal_info = NULL;
1862
1863         btrfs_put_transaction(cur_trans);
1864         return 0;
1865 }
1866
1867
1868 static void cleanup_transaction(struct btrfs_trans_handle *trans,
1869                                 struct btrfs_root *root, int err)
1870 {
1871         struct btrfs_fs_info *fs_info = root->fs_info;
1872         struct btrfs_transaction *cur_trans = trans->transaction;
1873         DEFINE_WAIT(wait);
1874
1875         WARN_ON(refcount_read(&trans->use_count) > 1);
1876
1877         btrfs_abort_transaction(trans, err);
1878
1879         spin_lock(&fs_info->trans_lock);
1880
1881         /*
1882          * If the transaction is removed from the list, it means this
1883          * transaction has been committed successfully, so it is impossible
1884          * to call the cleanup function.
1885          */
1886         BUG_ON(list_empty(&cur_trans->list));
1887
1888         list_del_init(&cur_trans->list);
1889         if (cur_trans == fs_info->running_transaction) {
1890                 cur_trans->state = TRANS_STATE_COMMIT_DOING;
1891                 spin_unlock(&fs_info->trans_lock);
1892                 wait_event(cur_trans->writer_wait,
1893                            atomic_read(&cur_trans->num_writers) == 1);
1894
1895                 spin_lock(&fs_info->trans_lock);
1896         }
1897         spin_unlock(&fs_info->trans_lock);
1898
1899         btrfs_cleanup_one_transaction(trans->transaction, fs_info);
1900
1901         spin_lock(&fs_info->trans_lock);
1902         if (cur_trans == fs_info->running_transaction)
1903                 fs_info->running_transaction = NULL;
1904         spin_unlock(&fs_info->trans_lock);
1905
1906         if (trans->type & __TRANS_FREEZABLE)
1907                 sb_end_intwrite(fs_info->sb);
1908         btrfs_put_transaction(cur_trans);
1909         btrfs_put_transaction(cur_trans);
1910
1911         trace_btrfs_transaction_commit(root);
1912
1913         if (current->journal_info == trans)
1914                 current->journal_info = NULL;
1915         btrfs_scrub_cancel(fs_info);
1916
1917         kmem_cache_free(btrfs_trans_handle_cachep, trans);
1918 }
1919
1920 static inline int btrfs_start_delalloc_flush(struct btrfs_fs_info *fs_info)
1921 {
1922         /*
1923          * We use writeback_inodes_sb here because if we used
1924          * btrfs_start_delalloc_roots we would deadlock with fs freeze.
1925          * Currently are holding the fs freeze lock, if we do an async flush
1926          * we'll do btrfs_join_transaction() and deadlock because we need to
1927          * wait for the fs freeze lock.  Using the direct flushing we benefit
1928          * from already being in a transaction and our join_transaction doesn't
1929          * have to re-take the fs freeze lock.
1930          */
1931         if (btrfs_test_opt(fs_info, FLUSHONCOMMIT))
1932                 writeback_inodes_sb(fs_info->sb, WB_REASON_SYNC);
1933         return 0;
1934 }
1935
1936 static inline void btrfs_wait_delalloc_flush(struct btrfs_fs_info *fs_info)
1937 {
1938         if (btrfs_test_opt(fs_info, FLUSHONCOMMIT))
1939                 btrfs_wait_ordered_roots(fs_info, U64_MAX, 0, (u64)-1);
1940 }
1941
1942 static inline void
1943 btrfs_wait_pending_ordered(struct btrfs_transaction *cur_trans)
1944 {
1945         wait_event(cur_trans->pending_wait,
1946                    atomic_read(&cur_trans->pending_ordered) == 0);
1947 }
1948
1949 int btrfs_commit_transaction(struct btrfs_trans_handle *trans)
1950 {
1951         struct btrfs_fs_info *fs_info = trans->fs_info;
1952         struct btrfs_transaction *cur_trans = trans->transaction;
1953         struct btrfs_transaction *prev_trans = NULL;
1954         int ret;
1955
1956         /* Stop the commit early if ->aborted is set */
1957         if (unlikely(READ_ONCE(cur_trans->aborted))) {
1958                 ret = cur_trans->aborted;
1959                 btrfs_end_transaction(trans);
1960                 return ret;
1961         }
1962
1963         /* make a pass through all the delayed refs we have so far
1964          * any runnings procs may add more while we are here
1965          */
1966         ret = btrfs_run_delayed_refs(trans, fs_info, 0);
1967         if (ret) {
1968                 btrfs_end_transaction(trans);
1969                 return ret;
1970         }
1971
1972         btrfs_trans_release_metadata(trans, fs_info);
1973         trans->block_rsv = NULL;
1974
1975         cur_trans = trans->transaction;
1976
1977         /*
1978          * set the flushing flag so procs in this transaction have to
1979          * start sending their work down.
1980          */
1981         cur_trans->delayed_refs.flushing = 1;
1982         smp_wmb();
1983
1984         if (!list_empty(&trans->new_bgs))
1985                 btrfs_create_pending_block_groups(trans, fs_info);
1986
1987         ret = btrfs_run_delayed_refs(trans, fs_info, 0);
1988         if (ret) {
1989                 btrfs_end_transaction(trans);
1990                 return ret;
1991         }
1992
1993         if (!test_bit(BTRFS_TRANS_DIRTY_BG_RUN, &cur_trans->flags)) {
1994                 int run_it = 0;
1995
1996                 /* this mutex is also taken before trying to set
1997                  * block groups readonly.  We need to make sure
1998                  * that nobody has set a block group readonly
1999                  * after a extents from that block group have been
2000                  * allocated for cache files.  btrfs_set_block_group_ro
2001                  * will wait for the transaction to commit if it
2002                  * finds BTRFS_TRANS_DIRTY_BG_RUN set.
2003                  *
2004                  * The BTRFS_TRANS_DIRTY_BG_RUN flag is also used to make sure
2005                  * only one process starts all the block group IO.  It wouldn't
2006                  * hurt to have more than one go through, but there's no
2007                  * real advantage to it either.
2008                  */
2009                 mutex_lock(&fs_info->ro_block_group_mutex);
2010                 if (!test_and_set_bit(BTRFS_TRANS_DIRTY_BG_RUN,
2011                                       &cur_trans->flags))
2012                         run_it = 1;
2013                 mutex_unlock(&fs_info->ro_block_group_mutex);
2014
2015                 if (run_it)
2016                         ret = btrfs_start_dirty_block_groups(trans, fs_info);
2017         }
2018         if (ret) {
2019                 btrfs_end_transaction(trans);
2020                 return ret;
2021         }
2022
2023         spin_lock(&fs_info->trans_lock);
2024         if (cur_trans->state >= TRANS_STATE_COMMIT_START) {
2025                 spin_unlock(&fs_info->trans_lock);
2026                 refcount_inc(&cur_trans->use_count);
2027                 ret = btrfs_end_transaction(trans);
2028
2029                 wait_for_commit(cur_trans);
2030
2031                 if (unlikely(cur_trans->aborted))
2032                         ret = cur_trans->aborted;
2033
2034                 btrfs_put_transaction(cur_trans);
2035
2036                 return ret;
2037         }
2038
2039         cur_trans->state = TRANS_STATE_COMMIT_START;
2040         wake_up(&fs_info->transaction_blocked_wait);
2041
2042         if (cur_trans->list.prev != &fs_info->trans_list) {
2043                 prev_trans = list_entry(cur_trans->list.prev,
2044                                         struct btrfs_transaction, list);
2045                 if (prev_trans->state != TRANS_STATE_COMPLETED) {
2046                         refcount_inc(&prev_trans->use_count);
2047                         spin_unlock(&fs_info->trans_lock);
2048
2049                         wait_for_commit(prev_trans);
2050                         ret = prev_trans->aborted;
2051
2052                         btrfs_put_transaction(prev_trans);
2053                         if (ret)
2054                                 goto cleanup_transaction;
2055                 } else {
2056                         spin_unlock(&fs_info->trans_lock);
2057                 }
2058         } else {
2059                 spin_unlock(&fs_info->trans_lock);
2060         }
2061
2062         extwriter_counter_dec(cur_trans, trans->type);
2063
2064         ret = btrfs_start_delalloc_flush(fs_info);
2065         if (ret)
2066                 goto cleanup_transaction;
2067
2068         ret = btrfs_run_delayed_items(trans, fs_info);
2069         if (ret)
2070                 goto cleanup_transaction;
2071
2072         wait_event(cur_trans->writer_wait,
2073                    extwriter_counter_read(cur_trans) == 0);
2074
2075         /* some pending stuffs might be added after the previous flush. */
2076         ret = btrfs_run_delayed_items(trans, fs_info);
2077         if (ret)
2078                 goto cleanup_transaction;
2079
2080         btrfs_wait_delalloc_flush(fs_info);
2081
2082         btrfs_wait_pending_ordered(cur_trans);
2083
2084         btrfs_scrub_pause(fs_info);
2085         /*
2086          * Ok now we need to make sure to block out any other joins while we
2087          * commit the transaction.  We could have started a join before setting
2088          * COMMIT_DOING so make sure to wait for num_writers to == 1 again.
2089          */
2090         spin_lock(&fs_info->trans_lock);
2091         cur_trans->state = TRANS_STATE_COMMIT_DOING;
2092         spin_unlock(&fs_info->trans_lock);
2093         wait_event(cur_trans->writer_wait,
2094                    atomic_read(&cur_trans->num_writers) == 1);
2095
2096         /* ->aborted might be set after the previous check, so check it */
2097         if (unlikely(READ_ONCE(cur_trans->aborted))) {
2098                 ret = cur_trans->aborted;
2099                 goto scrub_continue;
2100         }
2101         /*
2102          * the reloc mutex makes sure that we stop
2103          * the balancing code from coming in and moving
2104          * extents around in the middle of the commit
2105          */
2106         mutex_lock(&fs_info->reloc_mutex);
2107
2108         /*
2109          * We needn't worry about the delayed items because we will
2110          * deal with them in create_pending_snapshot(), which is the
2111          * core function of the snapshot creation.
2112          */
2113         ret = create_pending_snapshots(trans, fs_info);
2114         if (ret) {
2115                 mutex_unlock(&fs_info->reloc_mutex);
2116                 goto scrub_continue;
2117         }
2118
2119         /*
2120          * We insert the dir indexes of the snapshots and update the inode
2121          * of the snapshots' parents after the snapshot creation, so there
2122          * are some delayed items which are not dealt with. Now deal with
2123          * them.
2124          *
2125          * We needn't worry that this operation will corrupt the snapshots,
2126          * because all the tree which are snapshoted will be forced to COW
2127          * the nodes and leaves.
2128          */
2129         ret = btrfs_run_delayed_items(trans, fs_info);
2130         if (ret) {
2131                 mutex_unlock(&fs_info->reloc_mutex);
2132                 goto scrub_continue;
2133         }
2134
2135         ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
2136         if (ret) {
2137                 mutex_unlock(&fs_info->reloc_mutex);
2138                 goto scrub_continue;
2139         }
2140
2141         /*
2142          * make sure none of the code above managed to slip in a
2143          * delayed item
2144          */
2145         btrfs_assert_delayed_root_empty(fs_info);
2146
2147         WARN_ON(cur_trans != trans->transaction);
2148
2149         /* btrfs_commit_tree_roots is responsible for getting the
2150          * various roots consistent with each other.  Every pointer
2151          * in the tree of tree roots has to point to the most up to date
2152          * root for every subvolume and other tree.  So, we have to keep
2153          * the tree logging code from jumping in and changing any
2154          * of the trees.
2155          *
2156          * At this point in the commit, there can't be any tree-log
2157          * writers, but a little lower down we drop the trans mutex
2158          * and let new people in.  By holding the tree_log_mutex
2159          * from now until after the super is written, we avoid races
2160          * with the tree-log code.
2161          */
2162         mutex_lock(&fs_info->tree_log_mutex);
2163
2164         ret = commit_fs_roots(trans, fs_info);
2165         if (ret) {
2166                 mutex_unlock(&fs_info->tree_log_mutex);
2167                 mutex_unlock(&fs_info->reloc_mutex);
2168                 goto scrub_continue;
2169         }
2170
2171         /*
2172          * Since the transaction is done, we can apply the pending changes
2173          * before the next transaction.
2174          */
2175         btrfs_apply_pending_changes(fs_info);
2176
2177         /* commit_fs_roots gets rid of all the tree log roots, it is now
2178          * safe to free the root of tree log roots
2179          */
2180         btrfs_free_log_root_tree(trans, fs_info);
2181
2182         /*
2183          * commit_fs_roots() can call btrfs_save_ino_cache(), which generates
2184          * new delayed refs. Must handle them or qgroup can be wrong.
2185          */
2186         ret = btrfs_run_delayed_refs(trans, fs_info, (unsigned long)-1);
2187         if (ret) {
2188                 mutex_unlock(&fs_info->tree_log_mutex);
2189                 mutex_unlock(&fs_info->reloc_mutex);
2190                 goto scrub_continue;
2191         }
2192
2193         /*
2194          * Since fs roots are all committed, we can get a quite accurate
2195          * new_roots. So let's do quota accounting.
2196          */
2197         ret = btrfs_qgroup_account_extents(trans, fs_info);
2198         if (ret < 0) {
2199                 mutex_unlock(&fs_info->tree_log_mutex);
2200                 mutex_unlock(&fs_info->reloc_mutex);
2201                 goto scrub_continue;
2202         }
2203
2204         ret = commit_cowonly_roots(trans, fs_info);
2205         if (ret) {
2206                 mutex_unlock(&fs_info->tree_log_mutex);
2207                 mutex_unlock(&fs_info->reloc_mutex);
2208                 goto scrub_continue;
2209         }
2210
2211         /*
2212          * The tasks which save the space cache and inode cache may also
2213          * update ->aborted, check it.
2214          */
2215         if (unlikely(READ_ONCE(cur_trans->aborted))) {
2216                 ret = cur_trans->aborted;
2217                 mutex_unlock(&fs_info->tree_log_mutex);
2218                 mutex_unlock(&fs_info->reloc_mutex);
2219                 goto scrub_continue;
2220         }
2221
2222         btrfs_prepare_extent_commit(fs_info);
2223
2224         cur_trans = fs_info->running_transaction;
2225
2226         btrfs_set_root_node(&fs_info->tree_root->root_item,
2227                             fs_info->tree_root->node);
2228         list_add_tail(&fs_info->tree_root->dirty_list,
2229                       &cur_trans->switch_commits);
2230
2231         btrfs_set_root_node(&fs_info->chunk_root->root_item,
2232                             fs_info->chunk_root->node);
2233         list_add_tail(&fs_info->chunk_root->dirty_list,
2234                       &cur_trans->switch_commits);
2235
2236         switch_commit_roots(cur_trans, fs_info);
2237
2238         ASSERT(list_empty(&cur_trans->dirty_bgs));
2239         ASSERT(list_empty(&cur_trans->io_bgs));
2240         update_super_roots(fs_info);
2241
2242         btrfs_set_super_log_root(fs_info->super_copy, 0);
2243         btrfs_set_super_log_root_level(fs_info->super_copy, 0);
2244         memcpy(fs_info->super_for_commit, fs_info->super_copy,
2245                sizeof(*fs_info->super_copy));
2246
2247         btrfs_update_commit_device_size(fs_info);
2248         btrfs_update_commit_device_bytes_used(fs_info, cur_trans);
2249
2250         clear_bit(BTRFS_FS_LOG1_ERR, &fs_info->flags);
2251         clear_bit(BTRFS_FS_LOG2_ERR, &fs_info->flags);
2252
2253         btrfs_trans_release_chunk_metadata(trans);
2254
2255         spin_lock(&fs_info->trans_lock);
2256         cur_trans->state = TRANS_STATE_UNBLOCKED;
2257         fs_info->running_transaction = NULL;
2258         spin_unlock(&fs_info->trans_lock);
2259         mutex_unlock(&fs_info->reloc_mutex);
2260
2261         wake_up(&fs_info->transaction_wait);
2262
2263         ret = btrfs_write_and_wait_transaction(trans, fs_info);
2264         if (ret) {
2265                 btrfs_handle_fs_error(fs_info, ret,
2266                                       "Error while writing out transaction");
2267                 mutex_unlock(&fs_info->tree_log_mutex);
2268                 goto scrub_continue;
2269         }
2270
2271         ret = write_all_supers(fs_info, 0);
2272         /*
2273          * the super is written, we can safely allow the tree-loggers
2274          * to go about their business
2275          */
2276         mutex_unlock(&fs_info->tree_log_mutex);
2277         if (ret)
2278                 goto scrub_continue;
2279
2280         btrfs_finish_extent_commit(trans, fs_info);
2281
2282         if (test_bit(BTRFS_TRANS_HAVE_FREE_BGS, &cur_trans->flags))
2283                 btrfs_clear_space_info_full(fs_info);
2284
2285         fs_info->last_trans_committed = cur_trans->transid;
2286         /*
2287          * We needn't acquire the lock here because there is no other task
2288          * which can change it.
2289          */
2290         cur_trans->state = TRANS_STATE_COMPLETED;
2291         wake_up(&cur_trans->commit_wait);
2292
2293         spin_lock(&fs_info->trans_lock);
2294         list_del_init(&cur_trans->list);
2295         spin_unlock(&fs_info->trans_lock);
2296
2297         btrfs_put_transaction(cur_trans);
2298         btrfs_put_transaction(cur_trans);
2299
2300         if (trans->type & __TRANS_FREEZABLE)
2301                 sb_end_intwrite(fs_info->sb);
2302
2303         trace_btrfs_transaction_commit(trans->root);
2304
2305         btrfs_scrub_continue(fs_info);
2306
2307         if (current->journal_info == trans)
2308                 current->journal_info = NULL;
2309
2310         kmem_cache_free(btrfs_trans_handle_cachep, trans);
2311
2312         /*
2313          * If fs has been frozen, we can not handle delayed iputs, otherwise
2314          * it'll result in deadlock about SB_FREEZE_FS.
2315          */
2316         if (current != fs_info->transaction_kthread &&
2317             current != fs_info->cleaner_kthread &&
2318             !test_bit(BTRFS_FS_FROZEN, &fs_info->flags))
2319                 btrfs_run_delayed_iputs(fs_info);
2320
2321         return ret;
2322
2323 scrub_continue:
2324         btrfs_scrub_continue(fs_info);
2325 cleanup_transaction:
2326         btrfs_trans_release_metadata(trans, fs_info);
2327         btrfs_trans_release_chunk_metadata(trans);
2328         trans->block_rsv = NULL;
2329         btrfs_warn(fs_info, "Skipping commit of aborted transaction.");
2330         if (current->journal_info == trans)
2331                 current->journal_info = NULL;
2332         cleanup_transaction(trans, trans->root, ret);
2333
2334         return ret;
2335 }
2336
2337 /*
2338  * return < 0 if error
2339  * 0 if there are no more dead_roots at the time of call
2340  * 1 there are more to be processed, call me again
2341  *
2342  * The return value indicates there are certainly more snapshots to delete, but
2343  * if there comes a new one during processing, it may return 0. We don't mind,
2344  * because btrfs_commit_super will poke cleaner thread and it will process it a
2345  * few seconds later.
2346  */
2347 int btrfs_clean_one_deleted_snapshot(struct btrfs_root *root)
2348 {
2349         int ret;
2350         struct btrfs_fs_info *fs_info = root->fs_info;
2351
2352         spin_lock(&fs_info->trans_lock);
2353         if (list_empty(&fs_info->dead_roots)) {
2354                 spin_unlock(&fs_info->trans_lock);
2355                 return 0;
2356         }
2357         root = list_first_entry(&fs_info->dead_roots,
2358                         struct btrfs_root, root_list);
2359         list_del_init(&root->root_list);
2360         spin_unlock(&fs_info->trans_lock);
2361
2362         btrfs_debug(fs_info, "cleaner removing %llu", root->objectid);
2363
2364         btrfs_kill_all_delayed_nodes(root);
2365
2366         if (btrfs_header_backref_rev(root->node) <
2367                         BTRFS_MIXED_BACKREF_REV)
2368                 ret = btrfs_drop_snapshot(root, NULL, 0, 0);
2369         else
2370                 ret = btrfs_drop_snapshot(root, NULL, 1, 0);
2371
2372         return (ret < 0) ? 0 : 1;
2373 }
2374
2375 void btrfs_apply_pending_changes(struct btrfs_fs_info *fs_info)
2376 {
2377         unsigned long prev;
2378         unsigned long bit;
2379
2380         prev = xchg(&fs_info->pending_changes, 0);
2381         if (!prev)
2382                 return;
2383
2384         bit = 1 << BTRFS_PENDING_SET_INODE_MAP_CACHE;
2385         if (prev & bit)
2386                 btrfs_set_opt(fs_info->mount_opt, INODE_MAP_CACHE);
2387         prev &= ~bit;
2388
2389         bit = 1 << BTRFS_PENDING_CLEAR_INODE_MAP_CACHE;
2390         if (prev & bit)
2391                 btrfs_clear_opt(fs_info->mount_opt, INODE_MAP_CACHE);
2392         prev &= ~bit;
2393
2394         bit = 1 << BTRFS_PENDING_COMMIT;
2395         if (prev & bit)
2396                 btrfs_debug(fs_info, "pending commit done");
2397         prev &= ~bit;
2398
2399         if (prev)
2400                 btrfs_warn(fs_info,
2401                         "unknown pending changes left 0x%lx, ignoring", prev);
2402 }