2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
20 #include <linux/sched.h>
21 #include <linux/writeback.h>
22 #include <linux/pagemap.h>
25 #include "transaction.h"
27 #include "ref-cache.h"
29 static int total_trans = 0;
30 extern struct kmem_cache *btrfs_trans_handle_cachep;
31 extern struct kmem_cache *btrfs_transaction_cachep;
33 #define BTRFS_ROOT_TRANS_TAG 0
35 static noinline void put_transaction(struct btrfs_transaction *transaction)
37 WARN_ON(transaction->use_count == 0);
38 transaction->use_count--;
39 if (transaction->use_count == 0) {
40 WARN_ON(total_trans == 0);
42 list_del_init(&transaction->list);
43 memset(transaction, 0, sizeof(*transaction));
44 kmem_cache_free(btrfs_transaction_cachep, transaction);
48 static noinline int join_transaction(struct btrfs_root *root)
50 struct btrfs_transaction *cur_trans;
51 cur_trans = root->fs_info->running_transaction;
53 cur_trans = kmem_cache_alloc(btrfs_transaction_cachep,
57 root->fs_info->generation++;
58 root->fs_info->last_alloc = 0;
59 root->fs_info->last_data_alloc = 0;
60 cur_trans->num_writers = 1;
61 cur_trans->num_joined = 0;
62 cur_trans->transid = root->fs_info->generation;
63 init_waitqueue_head(&cur_trans->writer_wait);
64 init_waitqueue_head(&cur_trans->commit_wait);
65 cur_trans->in_commit = 0;
66 cur_trans->blocked = 0;
67 cur_trans->use_count = 1;
68 cur_trans->commit_done = 0;
69 cur_trans->start_time = get_seconds();
70 INIT_LIST_HEAD(&cur_trans->pending_snapshots);
71 list_add_tail(&cur_trans->list, &root->fs_info->trans_list);
72 extent_io_tree_init(&cur_trans->dirty_pages,
73 root->fs_info->btree_inode->i_mapping,
75 spin_lock(&root->fs_info->new_trans_lock);
76 root->fs_info->running_transaction = cur_trans;
77 spin_unlock(&root->fs_info->new_trans_lock);
79 cur_trans->num_writers++;
80 cur_trans->num_joined++;
86 static noinline int record_root_in_trans(struct btrfs_root *root)
88 struct btrfs_dirty_root *dirty;
89 u64 running_trans_id = root->fs_info->running_transaction->transid;
90 if (root->ref_cows && root->last_trans < running_trans_id) {
91 WARN_ON(root == root->fs_info->extent_root);
92 if (root->root_item.refs != 0) {
93 radix_tree_tag_set(&root->fs_info->fs_roots_radix,
94 (unsigned long)root->root_key.objectid,
95 BTRFS_ROOT_TRANS_TAG);
97 dirty = kmalloc(sizeof(*dirty), GFP_NOFS);
99 dirty->root = kmalloc(sizeof(*dirty->root), GFP_NOFS);
100 BUG_ON(!dirty->root);
101 dirty->latest_root = root;
102 INIT_LIST_HEAD(&dirty->list);
104 root->commit_root = btrfs_root_node(root);
106 memcpy(dirty->root, root, sizeof(*root));
107 spin_lock_init(&dirty->root->node_lock);
108 spin_lock_init(&dirty->root->list_lock);
109 mutex_init(&dirty->root->objectid_mutex);
110 INIT_LIST_HEAD(&dirty->root->dead_list);
111 dirty->root->node = root->commit_root;
112 dirty->root->commit_root = NULL;
114 spin_lock(&root->list_lock);
115 list_add(&dirty->root->dead_list, &root->dead_list);
116 spin_unlock(&root->list_lock);
118 root->dirty_root = dirty;
122 root->last_trans = running_trans_id;
127 static void wait_current_trans(struct btrfs_root *root)
129 struct btrfs_transaction *cur_trans;
131 cur_trans = root->fs_info->running_transaction;
132 if (cur_trans && cur_trans->blocked) {
134 cur_trans->use_count++;
136 prepare_to_wait(&root->fs_info->transaction_wait, &wait,
137 TASK_UNINTERRUPTIBLE);
138 if (cur_trans->blocked) {
139 mutex_unlock(&root->fs_info->trans_mutex);
141 mutex_lock(&root->fs_info->trans_mutex);
142 finish_wait(&root->fs_info->transaction_wait,
145 finish_wait(&root->fs_info->transaction_wait,
150 put_transaction(cur_trans);
154 struct btrfs_trans_handle *start_transaction(struct btrfs_root *root,
155 int num_blocks, int wait)
157 struct btrfs_trans_handle *h =
158 kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS);
161 mutex_lock(&root->fs_info->trans_mutex);
162 if ((wait == 1 && !root->fs_info->open_ioctl_trans) || wait == 2)
163 wait_current_trans(root);
164 ret = join_transaction(root);
167 record_root_in_trans(root);
168 h->transid = root->fs_info->running_transaction->transid;
169 h->transaction = root->fs_info->running_transaction;
170 h->blocks_reserved = num_blocks;
172 h->block_group = NULL;
173 h->alloc_exclude_nr = 0;
174 h->alloc_exclude_start = 0;
175 root->fs_info->running_transaction->use_count++;
176 mutex_unlock(&root->fs_info->trans_mutex);
180 struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root,
183 return start_transaction(root, num_blocks, 1);
185 struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root,
188 return start_transaction(root, num_blocks, 0);
191 struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *r,
194 return start_transaction(r, num_blocks, 2);
198 static noinline int wait_for_commit(struct btrfs_root *root,
199 struct btrfs_transaction *commit)
202 mutex_lock(&root->fs_info->trans_mutex);
203 while(!commit->commit_done) {
204 prepare_to_wait(&commit->commit_wait, &wait,
205 TASK_UNINTERRUPTIBLE);
206 if (commit->commit_done)
208 mutex_unlock(&root->fs_info->trans_mutex);
210 mutex_lock(&root->fs_info->trans_mutex);
212 mutex_unlock(&root->fs_info->trans_mutex);
213 finish_wait(&commit->commit_wait, &wait);
217 static void throttle_on_drops(struct btrfs_root *root)
219 struct btrfs_fs_info *info = root->fs_info;
220 int harder_count = 0;
223 if (atomic_read(&info->throttles)) {
226 thr = atomic_read(&info->throttle_gen);
229 prepare_to_wait(&info->transaction_throttle,
230 &wait, TASK_UNINTERRUPTIBLE);
231 if (!atomic_read(&info->throttles)) {
232 finish_wait(&info->transaction_throttle, &wait);
236 finish_wait(&info->transaction_throttle, &wait);
237 } while (thr == atomic_read(&info->throttle_gen));
240 if (root->fs_info->total_ref_cache_size > 1 * 1024 * 1024 &&
244 if (root->fs_info->total_ref_cache_size > 5 * 1024 * 1024 &&
248 if (root->fs_info->total_ref_cache_size > 10 * 1024 * 1024 &&
254 void btrfs_throttle(struct btrfs_root *root)
256 mutex_lock(&root->fs_info->trans_mutex);
257 if (!root->fs_info->open_ioctl_trans)
258 wait_current_trans(root);
259 mutex_unlock(&root->fs_info->trans_mutex);
261 throttle_on_drops(root);
264 static int __btrfs_end_transaction(struct btrfs_trans_handle *trans,
265 struct btrfs_root *root, int throttle)
267 struct btrfs_transaction *cur_trans;
268 struct btrfs_fs_info *info = root->fs_info;
270 mutex_lock(&info->trans_mutex);
271 cur_trans = info->running_transaction;
272 WARN_ON(cur_trans != trans->transaction);
273 WARN_ON(cur_trans->num_writers < 1);
274 cur_trans->num_writers--;
276 if (waitqueue_active(&cur_trans->writer_wait))
277 wake_up(&cur_trans->writer_wait);
278 put_transaction(cur_trans);
279 mutex_unlock(&info->trans_mutex);
280 memset(trans, 0, sizeof(*trans));
281 kmem_cache_free(btrfs_trans_handle_cachep, trans);
284 throttle_on_drops(root);
289 int btrfs_end_transaction(struct btrfs_trans_handle *trans,
290 struct btrfs_root *root)
292 return __btrfs_end_transaction(trans, root, 0);
295 int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans,
296 struct btrfs_root *root)
298 return __btrfs_end_transaction(trans, root, 1);
302 int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans,
303 struct btrfs_root *root)
308 struct extent_io_tree *dirty_pages;
310 struct inode *btree_inode = root->fs_info->btree_inode;
315 if (!trans || !trans->transaction) {
316 return filemap_write_and_wait(btree_inode->i_mapping);
318 dirty_pages = &trans->transaction->dirty_pages;
320 ret = find_first_extent_bit(dirty_pages, 0, &start, &end,
324 clear_extent_dirty(dirty_pages, start, end, GFP_NOFS);
325 while(start <= end) {
326 index = start >> PAGE_CACHE_SHIFT;
327 start = (u64)(index + 1) << PAGE_CACHE_SHIFT;
328 page = find_lock_page(btree_inode->i_mapping, index);
331 if (PageWriteback(page)) {
333 wait_on_page_writeback(page);
336 page_cache_release(page);
340 err = write_one_page(page, 0);
343 page_cache_release(page);
346 err = filemap_fdatawait(btree_inode->i_mapping);
352 static int update_cowonly_root(struct btrfs_trans_handle *trans,
353 struct btrfs_root *root)
357 struct btrfs_root *tree_root = root->fs_info->tree_root;
359 btrfs_write_dirty_block_groups(trans, root);
361 old_root_bytenr = btrfs_root_bytenr(&root->root_item);
362 if (old_root_bytenr == root->node->start)
364 btrfs_set_root_bytenr(&root->root_item,
366 btrfs_set_root_level(&root->root_item,
367 btrfs_header_level(root->node));
368 ret = btrfs_update_root(trans, tree_root,
372 btrfs_write_dirty_block_groups(trans, root);
377 int btrfs_commit_tree_roots(struct btrfs_trans_handle *trans,
378 struct btrfs_root *root)
380 struct btrfs_fs_info *fs_info = root->fs_info;
381 struct list_head *next;
383 while(!list_empty(&fs_info->dirty_cowonly_roots)) {
384 next = fs_info->dirty_cowonly_roots.next;
386 root = list_entry(next, struct btrfs_root, dirty_list);
387 update_cowonly_root(trans, root);
392 int btrfs_add_dead_root(struct btrfs_root *root, struct btrfs_root *latest)
394 struct btrfs_dirty_root *dirty;
396 dirty = kmalloc(sizeof(*dirty), GFP_NOFS);
400 dirty->latest_root = latest;
402 mutex_lock(&root->fs_info->trans_mutex);
403 list_add(&dirty->list, &latest->fs_info->dead_roots);
404 mutex_unlock(&root->fs_info->trans_mutex);
408 static noinline int add_dirty_roots(struct btrfs_trans_handle *trans,
409 struct radix_tree_root *radix,
410 struct list_head *list)
412 struct btrfs_dirty_root *dirty;
413 struct btrfs_root *gang[8];
414 struct btrfs_root *root;
421 ret = radix_tree_gang_lookup_tag(radix, (void **)gang, 0,
423 BTRFS_ROOT_TRANS_TAG);
426 for (i = 0; i < ret; i++) {
428 radix_tree_tag_clear(radix,
429 (unsigned long)root->root_key.objectid,
430 BTRFS_ROOT_TRANS_TAG);
432 BUG_ON(!root->ref_tree);
433 dirty = root->dirty_root;
435 if (root->commit_root == root->node) {
436 WARN_ON(root->node->start !=
437 btrfs_root_bytenr(&root->root_item));
439 free_extent_buffer(root->commit_root);
440 root->commit_root = NULL;
442 spin_lock(&root->list_lock);
443 list_del_init(&dirty->root->dead_list);
444 spin_unlock(&root->list_lock);
449 /* make sure to update the root on disk
450 * so we get any updates to the block used
453 err = btrfs_update_root(trans,
454 root->fs_info->tree_root,
460 memset(&root->root_item.drop_progress, 0,
461 sizeof(struct btrfs_disk_key));
462 root->root_item.drop_level = 0;
463 root->commit_root = NULL;
464 root->root_key.offset = root->fs_info->generation;
465 btrfs_set_root_bytenr(&root->root_item,
467 btrfs_set_root_level(&root->root_item,
468 btrfs_header_level(root->node));
469 err = btrfs_insert_root(trans, root->fs_info->tree_root,
475 refs = btrfs_root_refs(&dirty->root->root_item);
476 btrfs_set_root_refs(&dirty->root->root_item, refs - 1);
477 err = btrfs_update_root(trans, root->fs_info->tree_root,
478 &dirty->root->root_key,
479 &dirty->root->root_item);
483 list_add(&dirty->list, list);
486 free_extent_buffer(dirty->root->node);
495 int btrfs_defrag_root(struct btrfs_root *root, int cacheonly)
497 struct btrfs_fs_info *info = root->fs_info;
499 struct btrfs_trans_handle *trans;
503 if (root->defrag_running)
505 trans = btrfs_start_transaction(root, 1);
507 root->defrag_running = 1;
508 ret = btrfs_defrag_leaves(trans, root, cacheonly);
509 nr = trans->blocks_used;
510 btrfs_end_transaction(trans, root);
511 btrfs_btree_balance_dirty(info->tree_root, nr);
514 trans = btrfs_start_transaction(root, 1);
515 if (root->fs_info->closing || ret != -EAGAIN)
518 root->defrag_running = 0;
520 btrfs_end_transaction(trans, root);
524 static noinline int drop_dirty_roots(struct btrfs_root *tree_root,
525 struct list_head *list)
527 struct btrfs_dirty_root *dirty;
528 struct btrfs_trans_handle *trans;
536 while(!list_empty(list)) {
537 struct btrfs_root *root;
539 dirty = list_entry(list->prev, struct btrfs_dirty_root, list);
540 list_del_init(&dirty->list);
542 num_bytes = btrfs_root_used(&dirty->root->root_item);
543 root = dirty->latest_root;
544 atomic_inc(&root->fs_info->throttles);
546 mutex_lock(&root->fs_info->drop_mutex);
548 trans = btrfs_start_transaction(tree_root, 1);
549 ret = btrfs_drop_snapshot(trans, dirty->root);
550 if (ret != -EAGAIN) {
554 err = btrfs_update_root(trans,
556 &dirty->root->root_key,
557 &dirty->root->root_item);
560 nr = trans->blocks_used;
561 ret = btrfs_end_transaction(trans, tree_root);
564 mutex_unlock(&root->fs_info->drop_mutex);
565 btrfs_btree_balance_dirty(tree_root, nr);
567 mutex_lock(&root->fs_info->drop_mutex);
570 atomic_dec(&root->fs_info->throttles);
571 wake_up(&root->fs_info->transaction_throttle);
573 mutex_lock(&root->fs_info->alloc_mutex);
574 num_bytes -= btrfs_root_used(&dirty->root->root_item);
575 bytes_used = btrfs_root_used(&root->root_item);
577 record_root_in_trans(root);
578 btrfs_set_root_used(&root->root_item,
579 bytes_used - num_bytes);
581 mutex_unlock(&root->fs_info->alloc_mutex);
583 ret = btrfs_del_root(trans, tree_root, &dirty->root->root_key);
588 mutex_unlock(&root->fs_info->drop_mutex);
590 spin_lock(&root->list_lock);
591 list_del_init(&dirty->root->dead_list);
592 if (!list_empty(&root->dead_list)) {
593 struct btrfs_root *oldest;
594 oldest = list_entry(root->dead_list.prev,
595 struct btrfs_root, dead_list);
596 max_useless = oldest->root_key.offset - 1;
598 max_useless = root->root_key.offset - 1;
600 spin_unlock(&root->list_lock);
602 nr = trans->blocks_used;
603 ret = btrfs_end_transaction(trans, tree_root);
606 ret = btrfs_remove_leaf_refs(root, max_useless);
609 free_extent_buffer(dirty->root->node);
613 btrfs_btree_balance_dirty(tree_root, nr);
619 static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans,
620 struct btrfs_fs_info *fs_info,
621 struct btrfs_pending_snapshot *pending)
623 struct btrfs_key key;
624 struct btrfs_root_item *new_root_item;
625 struct btrfs_root *tree_root = fs_info->tree_root;
626 struct btrfs_root *root = pending->root;
627 struct extent_buffer *tmp;
628 struct extent_buffer *old;
633 new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS);
634 if (!new_root_item) {
638 ret = btrfs_find_free_objectid(trans, tree_root, 0, &objectid);
642 memcpy(new_root_item, &root->root_item, sizeof(*new_root_item));
644 key.objectid = objectid;
646 btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
648 old = btrfs_lock_root_node(root);
649 btrfs_cow_block(trans, root, old, NULL, 0, &old, 0);
651 btrfs_copy_root(trans, root, old, &tmp, objectid);
652 btrfs_tree_unlock(old);
653 free_extent_buffer(old);
655 btrfs_set_root_bytenr(new_root_item, tmp->start);
656 btrfs_set_root_level(new_root_item, btrfs_header_level(tmp));
657 ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key,
659 btrfs_tree_unlock(tmp);
660 free_extent_buffer(tmp);
665 * insert the directory item
667 key.offset = (u64)-1;
668 namelen = strlen(pending->name);
669 ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root,
670 pending->name, namelen,
671 root->fs_info->sb->s_root->d_inode->i_ino,
672 &key, BTRFS_FT_DIR, 0);
677 ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root,
678 pending->name, strlen(pending->name), objectid,
679 root->fs_info->sb->s_root->d_inode->i_ino, 0);
681 /* Invalidate existing dcache entry for new snapshot. */
682 btrfs_invalidate_dcache_root(root, pending->name, namelen);
685 kfree(new_root_item);
689 static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans,
690 struct btrfs_fs_info *fs_info)
692 struct btrfs_pending_snapshot *pending;
693 struct list_head *head = &trans->transaction->pending_snapshots;
696 while(!list_empty(head)) {
697 pending = list_entry(head->next,
698 struct btrfs_pending_snapshot, list);
699 ret = create_pending_snapshot(trans, fs_info, pending);
701 list_del(&pending->list);
702 kfree(pending->name);
708 int btrfs_commit_transaction(struct btrfs_trans_handle *trans,
709 struct btrfs_root *root)
711 unsigned long joined = 0;
712 unsigned long timeout = 1;
713 struct btrfs_transaction *cur_trans;
714 struct btrfs_transaction *prev_trans = NULL;
715 struct btrfs_root *chunk_root = root->fs_info->chunk_root;
716 struct list_head dirty_fs_roots;
717 struct extent_io_tree *pinned_copy;
721 INIT_LIST_HEAD(&dirty_fs_roots);
723 mutex_lock(&root->fs_info->trans_mutex);
724 if (trans->transaction->in_commit) {
725 cur_trans = trans->transaction;
726 trans->transaction->use_count++;
727 mutex_unlock(&root->fs_info->trans_mutex);
728 btrfs_end_transaction(trans, root);
730 ret = wait_for_commit(root, cur_trans);
733 mutex_lock(&root->fs_info->trans_mutex);
734 put_transaction(cur_trans);
735 mutex_unlock(&root->fs_info->trans_mutex);
740 pinned_copy = kmalloc(sizeof(*pinned_copy), GFP_NOFS);
744 extent_io_tree_init(pinned_copy,
745 root->fs_info->btree_inode->i_mapping, GFP_NOFS);
747 trans->transaction->in_commit = 1;
748 trans->transaction->blocked = 1;
749 cur_trans = trans->transaction;
750 if (cur_trans->list.prev != &root->fs_info->trans_list) {
751 prev_trans = list_entry(cur_trans->list.prev,
752 struct btrfs_transaction, list);
753 if (!prev_trans->commit_done) {
754 prev_trans->use_count++;
755 mutex_unlock(&root->fs_info->trans_mutex);
757 wait_for_commit(root, prev_trans);
759 mutex_lock(&root->fs_info->trans_mutex);
760 put_transaction(prev_trans);
765 joined = cur_trans->num_joined;
766 WARN_ON(cur_trans != trans->transaction);
767 prepare_to_wait(&cur_trans->writer_wait, &wait,
768 TASK_UNINTERRUPTIBLE);
770 if (cur_trans->num_writers > 1)
771 timeout = MAX_SCHEDULE_TIMEOUT;
775 mutex_unlock(&root->fs_info->trans_mutex);
777 schedule_timeout(timeout);
779 mutex_lock(&root->fs_info->trans_mutex);
780 finish_wait(&cur_trans->writer_wait, &wait);
781 } while (cur_trans->num_writers > 1 ||
782 (cur_trans->num_joined != joined));
784 ret = create_pending_snapshots(trans, root->fs_info);
787 WARN_ON(cur_trans != trans->transaction);
789 ret = add_dirty_roots(trans, &root->fs_info->fs_roots_radix,
793 ret = btrfs_commit_tree_roots(trans, root);
796 cur_trans = root->fs_info->running_transaction;
797 spin_lock(&root->fs_info->new_trans_lock);
798 root->fs_info->running_transaction = NULL;
799 spin_unlock(&root->fs_info->new_trans_lock);
800 btrfs_set_super_generation(&root->fs_info->super_copy,
802 btrfs_set_super_root(&root->fs_info->super_copy,
803 root->fs_info->tree_root->node->start);
804 btrfs_set_super_root_level(&root->fs_info->super_copy,
805 btrfs_header_level(root->fs_info->tree_root->node));
807 btrfs_set_super_chunk_root(&root->fs_info->super_copy,
808 chunk_root->node->start);
809 btrfs_set_super_chunk_root_level(&root->fs_info->super_copy,
810 btrfs_header_level(chunk_root->node));
811 memcpy(&root->fs_info->super_for_commit, &root->fs_info->super_copy,
812 sizeof(root->fs_info->super_copy));
814 btrfs_copy_pinned(root, pinned_copy);
816 trans->transaction->blocked = 0;
817 wake_up(&root->fs_info->transaction_throttle);
818 wake_up(&root->fs_info->transaction_wait);
820 mutex_unlock(&root->fs_info->trans_mutex);
821 ret = btrfs_write_and_wait_transaction(trans, root);
823 write_ctree_super(trans, root);
825 btrfs_finish_extent_commit(trans, root, pinned_copy);
826 mutex_lock(&root->fs_info->trans_mutex);
830 cur_trans->commit_done = 1;
831 root->fs_info->last_trans_committed = cur_trans->transid;
832 wake_up(&cur_trans->commit_wait);
833 put_transaction(cur_trans);
834 put_transaction(cur_trans);
836 list_splice_init(&dirty_fs_roots, &root->fs_info->dead_roots);
837 if (root->fs_info->closing)
838 list_splice_init(&root->fs_info->dead_roots, &dirty_fs_roots);
840 mutex_unlock(&root->fs_info->trans_mutex);
841 kmem_cache_free(btrfs_trans_handle_cachep, trans);
843 if (root->fs_info->closing) {
844 drop_dirty_roots(root->fs_info->tree_root, &dirty_fs_roots);
849 int btrfs_clean_old_snapshots(struct btrfs_root *root)
851 struct list_head dirty_roots;
852 INIT_LIST_HEAD(&dirty_roots);
854 mutex_lock(&root->fs_info->trans_mutex);
855 list_splice_init(&root->fs_info->dead_roots, &dirty_roots);
856 mutex_unlock(&root->fs_info->trans_mutex);
858 if (!list_empty(&dirty_roots)) {
859 drop_dirty_roots(root, &dirty_roots);