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