Commit | Line | Data |
---|---|---|
6cbd5570 CM |
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 | ||
79154b1b | 19 | #include <linux/fs.h> |
34088780 | 20 | #include <linux/sched.h> |
d3c2fdcf | 21 | #include <linux/writeback.h> |
5f39d397 | 22 | #include <linux/pagemap.h> |
5f2cc086 | 23 | #include <linux/blkdev.h> |
79154b1b CM |
24 | #include "ctree.h" |
25 | #include "disk-io.h" | |
26 | #include "transaction.h" | |
925baedd | 27 | #include "locking.h" |
e02119d5 | 28 | #include "tree-log.h" |
79154b1b | 29 | |
0f7d52f4 CM |
30 | #define BTRFS_ROOT_TRANS_TAG 0 |
31 | ||
80b6794d | 32 | static noinline void put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 33 | { |
2c90e5d6 | 34 | WARN_ON(transaction->use_count == 0); |
79154b1b | 35 | transaction->use_count--; |
78fae27e | 36 | if (transaction->use_count == 0) { |
8fd17795 | 37 | list_del_init(&transaction->list); |
2c90e5d6 CM |
38 | memset(transaction, 0, sizeof(*transaction)); |
39 | kmem_cache_free(btrfs_transaction_cachep, transaction); | |
78fae27e | 40 | } |
79154b1b CM |
41 | } |
42 | ||
817d52f8 JB |
43 | static noinline void switch_commit_root(struct btrfs_root *root) |
44 | { | |
817d52f8 JB |
45 | free_extent_buffer(root->commit_root); |
46 | root->commit_root = btrfs_root_node(root); | |
817d52f8 JB |
47 | } |
48 | ||
d352ac68 CM |
49 | /* |
50 | * either allocate a new transaction or hop into the existing one | |
51 | */ | |
80b6794d | 52 | static noinline int join_transaction(struct btrfs_root *root) |
79154b1b CM |
53 | { |
54 | struct btrfs_transaction *cur_trans; | |
55 | cur_trans = root->fs_info->running_transaction; | |
56 | if (!cur_trans) { | |
2c90e5d6 CM |
57 | cur_trans = kmem_cache_alloc(btrfs_transaction_cachep, |
58 | GFP_NOFS); | |
79154b1b | 59 | BUG_ON(!cur_trans); |
0f7d52f4 | 60 | root->fs_info->generation++; |
15ee9bc7 JB |
61 | cur_trans->num_writers = 1; |
62 | cur_trans->num_joined = 0; | |
0f7d52f4 | 63 | cur_trans->transid = root->fs_info->generation; |
79154b1b CM |
64 | init_waitqueue_head(&cur_trans->writer_wait); |
65 | init_waitqueue_head(&cur_trans->commit_wait); | |
66 | cur_trans->in_commit = 0; | |
f9295749 | 67 | cur_trans->blocked = 0; |
d5719762 | 68 | cur_trans->use_count = 1; |
79154b1b | 69 | cur_trans->commit_done = 0; |
08607c1b | 70 | cur_trans->start_time = get_seconds(); |
56bec294 CM |
71 | |
72 | cur_trans->delayed_refs.root.rb_node = NULL; | |
73 | cur_trans->delayed_refs.num_entries = 0; | |
c3e69d58 CM |
74 | cur_trans->delayed_refs.num_heads_ready = 0; |
75 | cur_trans->delayed_refs.num_heads = 0; | |
56bec294 | 76 | cur_trans->delayed_refs.flushing = 0; |
c3e69d58 | 77 | cur_trans->delayed_refs.run_delayed_start = 0; |
56bec294 CM |
78 | spin_lock_init(&cur_trans->delayed_refs.lock); |
79 | ||
3063d29f | 80 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); |
8fd17795 | 81 | list_add_tail(&cur_trans->list, &root->fs_info->trans_list); |
d1310b2e | 82 | extent_io_tree_init(&cur_trans->dirty_pages, |
5f39d397 CM |
83 | root->fs_info->btree_inode->i_mapping, |
84 | GFP_NOFS); | |
48ec2cf8 CM |
85 | spin_lock(&root->fs_info->new_trans_lock); |
86 | root->fs_info->running_transaction = cur_trans; | |
87 | spin_unlock(&root->fs_info->new_trans_lock); | |
15ee9bc7 JB |
88 | } else { |
89 | cur_trans->num_writers++; | |
90 | cur_trans->num_joined++; | |
79154b1b | 91 | } |
15ee9bc7 | 92 | |
79154b1b CM |
93 | return 0; |
94 | } | |
95 | ||
d352ac68 | 96 | /* |
d397712b CM |
97 | * this does all the record keeping required to make sure that a reference |
98 | * counted root is properly recorded in a given transaction. This is required | |
99 | * to make sure the old root from before we joined the transaction is deleted | |
100 | * when the transaction commits | |
d352ac68 | 101 | */ |
5d4f98a2 YZ |
102 | static noinline int record_root_in_trans(struct btrfs_trans_handle *trans, |
103 | struct btrfs_root *root) | |
6702ed49 | 104 | { |
5d4f98a2 | 105 | if (root->ref_cows && root->last_trans < trans->transid) { |
6702ed49 | 106 | WARN_ON(root == root->fs_info->extent_root); |
5d4f98a2 YZ |
107 | WARN_ON(root->commit_root != root->node); |
108 | ||
109 | radix_tree_tag_set(&root->fs_info->fs_roots_radix, | |
110 | (unsigned long)root->root_key.objectid, | |
111 | BTRFS_ROOT_TRANS_TAG); | |
112 | root->last_trans = trans->transid; | |
113 | btrfs_init_reloc_root(trans, root); | |
114 | } | |
115 | return 0; | |
116 | } | |
bcc63abb | 117 | |
5d4f98a2 YZ |
118 | int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, |
119 | struct btrfs_root *root) | |
120 | { | |
121 | if (!root->ref_cows) | |
122 | return 0; | |
bcc63abb | 123 | |
5d4f98a2 YZ |
124 | mutex_lock(&root->fs_info->trans_mutex); |
125 | if (root->last_trans == trans->transid) { | |
126 | mutex_unlock(&root->fs_info->trans_mutex); | |
127 | return 0; | |
6702ed49 | 128 | } |
5d4f98a2 YZ |
129 | |
130 | record_root_in_trans(trans, root); | |
131 | mutex_unlock(&root->fs_info->trans_mutex); | |
6702ed49 CM |
132 | return 0; |
133 | } | |
134 | ||
d352ac68 CM |
135 | /* wait for commit against the current transaction to become unblocked |
136 | * when this is done, it is safe to start a new transaction, but the current | |
137 | * transaction might not be fully on disk. | |
138 | */ | |
37d1aeee | 139 | static void wait_current_trans(struct btrfs_root *root) |
79154b1b | 140 | { |
f9295749 | 141 | struct btrfs_transaction *cur_trans; |
79154b1b | 142 | |
f9295749 | 143 | cur_trans = root->fs_info->running_transaction; |
37d1aeee | 144 | if (cur_trans && cur_trans->blocked) { |
f9295749 CM |
145 | DEFINE_WAIT(wait); |
146 | cur_trans->use_count++; | |
d397712b | 147 | while (1) { |
f9295749 CM |
148 | prepare_to_wait(&root->fs_info->transaction_wait, &wait, |
149 | TASK_UNINTERRUPTIBLE); | |
150 | if (cur_trans->blocked) { | |
151 | mutex_unlock(&root->fs_info->trans_mutex); | |
152 | schedule(); | |
153 | mutex_lock(&root->fs_info->trans_mutex); | |
154 | finish_wait(&root->fs_info->transaction_wait, | |
155 | &wait); | |
156 | } else { | |
157 | finish_wait(&root->fs_info->transaction_wait, | |
158 | &wait); | |
159 | break; | |
160 | } | |
161 | } | |
162 | put_transaction(cur_trans); | |
163 | } | |
37d1aeee CM |
164 | } |
165 | ||
e02119d5 | 166 | static struct btrfs_trans_handle *start_transaction(struct btrfs_root *root, |
9ca9ee09 | 167 | int num_blocks, int wait) |
37d1aeee CM |
168 | { |
169 | struct btrfs_trans_handle *h = | |
170 | kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); | |
171 | int ret; | |
172 | ||
173 | mutex_lock(&root->fs_info->trans_mutex); | |
4bef0848 CM |
174 | if (!root->fs_info->log_root_recovering && |
175 | ((wait == 1 && !root->fs_info->open_ioctl_trans) || wait == 2)) | |
37d1aeee | 176 | wait_current_trans(root); |
79154b1b CM |
177 | ret = join_transaction(root); |
178 | BUG_ON(ret); | |
0f7d52f4 | 179 | |
6702ed49 | 180 | h->transid = root->fs_info->running_transaction->transid; |
79154b1b CM |
181 | h->transaction = root->fs_info->running_transaction; |
182 | h->blocks_reserved = num_blocks; | |
183 | h->blocks_used = 0; | |
d2fb3437 | 184 | h->block_group = 0; |
26b8003f CM |
185 | h->alloc_exclude_nr = 0; |
186 | h->alloc_exclude_start = 0; | |
56bec294 | 187 | h->delayed_ref_updates = 0; |
b7ec40d7 | 188 | |
9ed74f2d JB |
189 | if (!current->journal_info) |
190 | current->journal_info = h; | |
191 | ||
79154b1b | 192 | root->fs_info->running_transaction->use_count++; |
5d4f98a2 | 193 | record_root_in_trans(h, root); |
79154b1b CM |
194 | mutex_unlock(&root->fs_info->trans_mutex); |
195 | return h; | |
196 | } | |
197 | ||
f9295749 CM |
198 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
199 | int num_blocks) | |
200 | { | |
9ca9ee09 | 201 | return start_transaction(root, num_blocks, 1); |
f9295749 CM |
202 | } |
203 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root, | |
204 | int num_blocks) | |
205 | { | |
9ca9ee09 | 206 | return start_transaction(root, num_blocks, 0); |
f9295749 CM |
207 | } |
208 | ||
9ca9ee09 SW |
209 | struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *r, |
210 | int num_blocks) | |
211 | { | |
212 | return start_transaction(r, num_blocks, 2); | |
213 | } | |
214 | ||
d352ac68 | 215 | /* wait for a transaction commit to be fully complete */ |
89ce8a63 CM |
216 | static noinline int wait_for_commit(struct btrfs_root *root, |
217 | struct btrfs_transaction *commit) | |
218 | { | |
219 | DEFINE_WAIT(wait); | |
220 | mutex_lock(&root->fs_info->trans_mutex); | |
d397712b | 221 | while (!commit->commit_done) { |
89ce8a63 CM |
222 | prepare_to_wait(&commit->commit_wait, &wait, |
223 | TASK_UNINTERRUPTIBLE); | |
224 | if (commit->commit_done) | |
225 | break; | |
226 | mutex_unlock(&root->fs_info->trans_mutex); | |
227 | schedule(); | |
228 | mutex_lock(&root->fs_info->trans_mutex); | |
229 | } | |
230 | mutex_unlock(&root->fs_info->trans_mutex); | |
231 | finish_wait(&commit->commit_wait, &wait); | |
232 | return 0; | |
233 | } | |
234 | ||
5d4f98a2 | 235 | #if 0 |
d352ac68 | 236 | /* |
d397712b CM |
237 | * rate limit against the drop_snapshot code. This helps to slow down new |
238 | * operations if the drop_snapshot code isn't able to keep up. | |
d352ac68 | 239 | */ |
37d1aeee | 240 | static void throttle_on_drops(struct btrfs_root *root) |
ab78c84d CM |
241 | { |
242 | struct btrfs_fs_info *info = root->fs_info; | |
2dd3e67b | 243 | int harder_count = 0; |
ab78c84d | 244 | |
2dd3e67b | 245 | harder: |
ab78c84d CM |
246 | if (atomic_read(&info->throttles)) { |
247 | DEFINE_WAIT(wait); | |
248 | int thr; | |
ab78c84d CM |
249 | thr = atomic_read(&info->throttle_gen); |
250 | ||
251 | do { | |
252 | prepare_to_wait(&info->transaction_throttle, | |
253 | &wait, TASK_UNINTERRUPTIBLE); | |
254 | if (!atomic_read(&info->throttles)) { | |
255 | finish_wait(&info->transaction_throttle, &wait); | |
256 | break; | |
257 | } | |
258 | schedule(); | |
259 | finish_wait(&info->transaction_throttle, &wait); | |
260 | } while (thr == atomic_read(&info->throttle_gen)); | |
2dd3e67b CM |
261 | harder_count++; |
262 | ||
263 | if (root->fs_info->total_ref_cache_size > 1 * 1024 * 1024 && | |
264 | harder_count < 2) | |
265 | goto harder; | |
266 | ||
267 | if (root->fs_info->total_ref_cache_size > 5 * 1024 * 1024 && | |
268 | harder_count < 10) | |
269 | goto harder; | |
270 | ||
271 | if (root->fs_info->total_ref_cache_size > 10 * 1024 * 1024 && | |
272 | harder_count < 20) | |
273 | goto harder; | |
ab78c84d CM |
274 | } |
275 | } | |
5d4f98a2 | 276 | #endif |
ab78c84d | 277 | |
37d1aeee CM |
278 | void btrfs_throttle(struct btrfs_root *root) |
279 | { | |
280 | mutex_lock(&root->fs_info->trans_mutex); | |
9ca9ee09 SW |
281 | if (!root->fs_info->open_ioctl_trans) |
282 | wait_current_trans(root); | |
37d1aeee | 283 | mutex_unlock(&root->fs_info->trans_mutex); |
37d1aeee CM |
284 | } |
285 | ||
89ce8a63 CM |
286 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
287 | struct btrfs_root *root, int throttle) | |
79154b1b CM |
288 | { |
289 | struct btrfs_transaction *cur_trans; | |
ab78c84d | 290 | struct btrfs_fs_info *info = root->fs_info; |
c3e69d58 CM |
291 | int count = 0; |
292 | ||
293 | while (count < 4) { | |
294 | unsigned long cur = trans->delayed_ref_updates; | |
295 | trans->delayed_ref_updates = 0; | |
296 | if (cur && | |
297 | trans->transaction->delayed_refs.num_heads_ready > 64) { | |
298 | trans->delayed_ref_updates = 0; | |
b7ec40d7 CM |
299 | |
300 | /* | |
301 | * do a full flush if the transaction is trying | |
302 | * to close | |
303 | */ | |
304 | if (trans->transaction->delayed_refs.flushing) | |
305 | cur = 0; | |
c3e69d58 CM |
306 | btrfs_run_delayed_refs(trans, root, cur); |
307 | } else { | |
308 | break; | |
309 | } | |
310 | count++; | |
56bec294 CM |
311 | } |
312 | ||
ab78c84d CM |
313 | mutex_lock(&info->trans_mutex); |
314 | cur_trans = info->running_transaction; | |
ccd467d6 | 315 | WARN_ON(cur_trans != trans->transaction); |
d5719762 | 316 | WARN_ON(cur_trans->num_writers < 1); |
ccd467d6 | 317 | cur_trans->num_writers--; |
89ce8a63 | 318 | |
79154b1b CM |
319 | if (waitqueue_active(&cur_trans->writer_wait)) |
320 | wake_up(&cur_trans->writer_wait); | |
79154b1b | 321 | put_transaction(cur_trans); |
ab78c84d | 322 | mutex_unlock(&info->trans_mutex); |
9ed74f2d JB |
323 | |
324 | if (current->journal_info == trans) | |
325 | current->journal_info = NULL; | |
d6025579 | 326 | memset(trans, 0, sizeof(*trans)); |
2c90e5d6 | 327 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
ab78c84d | 328 | |
79154b1b CM |
329 | return 0; |
330 | } | |
331 | ||
89ce8a63 CM |
332 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, |
333 | struct btrfs_root *root) | |
334 | { | |
335 | return __btrfs_end_transaction(trans, root, 0); | |
336 | } | |
337 | ||
338 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans, | |
339 | struct btrfs_root *root) | |
340 | { | |
341 | return __btrfs_end_transaction(trans, root, 1); | |
342 | } | |
343 | ||
d352ac68 CM |
344 | /* |
345 | * when btree blocks are allocated, they have some corresponding bits set for | |
346 | * them in one of two extent_io trees. This is used to make sure all of | |
347 | * those extents are on disk for transaction or log commit | |
348 | */ | |
d0c803c4 CM |
349 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, |
350 | struct extent_io_tree *dirty_pages) | |
79154b1b | 351 | { |
7c4452b9 | 352 | int ret; |
777e6bd7 | 353 | int err = 0; |
7c4452b9 CM |
354 | int werr = 0; |
355 | struct page *page; | |
7c4452b9 | 356 | struct inode *btree_inode = root->fs_info->btree_inode; |
777e6bd7 | 357 | u64 start = 0; |
5f39d397 CM |
358 | u64 end; |
359 | unsigned long index; | |
7c4452b9 | 360 | |
d397712b | 361 | while (1) { |
777e6bd7 | 362 | ret = find_first_extent_bit(dirty_pages, start, &start, &end, |
5f39d397 CM |
363 | EXTENT_DIRTY); |
364 | if (ret) | |
7c4452b9 | 365 | break; |
d397712b | 366 | while (start <= end) { |
777e6bd7 CM |
367 | cond_resched(); |
368 | ||
5f39d397 | 369 | index = start >> PAGE_CACHE_SHIFT; |
35ebb934 | 370 | start = (u64)(index + 1) << PAGE_CACHE_SHIFT; |
4bef0848 | 371 | page = find_get_page(btree_inode->i_mapping, index); |
7c4452b9 CM |
372 | if (!page) |
373 | continue; | |
4bef0848 CM |
374 | |
375 | btree_lock_page_hook(page); | |
376 | if (!page->mapping) { | |
377 | unlock_page(page); | |
378 | page_cache_release(page); | |
379 | continue; | |
380 | } | |
381 | ||
6702ed49 CM |
382 | if (PageWriteback(page)) { |
383 | if (PageDirty(page)) | |
384 | wait_on_page_writeback(page); | |
385 | else { | |
386 | unlock_page(page); | |
387 | page_cache_release(page); | |
388 | continue; | |
389 | } | |
390 | } | |
7c4452b9 CM |
391 | err = write_one_page(page, 0); |
392 | if (err) | |
393 | werr = err; | |
394 | page_cache_release(page); | |
395 | } | |
396 | } | |
d397712b | 397 | while (1) { |
777e6bd7 CM |
398 | ret = find_first_extent_bit(dirty_pages, 0, &start, &end, |
399 | EXTENT_DIRTY); | |
400 | if (ret) | |
401 | break; | |
402 | ||
403 | clear_extent_dirty(dirty_pages, start, end, GFP_NOFS); | |
d397712b | 404 | while (start <= end) { |
777e6bd7 CM |
405 | index = start >> PAGE_CACHE_SHIFT; |
406 | start = (u64)(index + 1) << PAGE_CACHE_SHIFT; | |
407 | page = find_get_page(btree_inode->i_mapping, index); | |
408 | if (!page) | |
409 | continue; | |
410 | if (PageDirty(page)) { | |
4bef0848 CM |
411 | btree_lock_page_hook(page); |
412 | wait_on_page_writeback(page); | |
777e6bd7 CM |
413 | err = write_one_page(page, 0); |
414 | if (err) | |
415 | werr = err; | |
416 | } | |
105d931d | 417 | wait_on_page_writeback(page); |
777e6bd7 CM |
418 | page_cache_release(page); |
419 | cond_resched(); | |
420 | } | |
421 | } | |
7c4452b9 CM |
422 | if (err) |
423 | werr = err; | |
424 | return werr; | |
79154b1b CM |
425 | } |
426 | ||
d0c803c4 CM |
427 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, |
428 | struct btrfs_root *root) | |
429 | { | |
430 | if (!trans || !trans->transaction) { | |
431 | struct inode *btree_inode; | |
432 | btree_inode = root->fs_info->btree_inode; | |
433 | return filemap_write_and_wait(btree_inode->i_mapping); | |
434 | } | |
435 | return btrfs_write_and_wait_marked_extents(root, | |
436 | &trans->transaction->dirty_pages); | |
437 | } | |
438 | ||
d352ac68 CM |
439 | /* |
440 | * this is used to update the root pointer in the tree of tree roots. | |
441 | * | |
442 | * But, in the case of the extent allocation tree, updating the root | |
443 | * pointer may allocate blocks which may change the root of the extent | |
444 | * allocation tree. | |
445 | * | |
446 | * So, this loops and repeats and makes sure the cowonly root didn't | |
447 | * change while the root pointer was being updated in the metadata. | |
448 | */ | |
0b86a832 CM |
449 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
450 | struct btrfs_root *root) | |
79154b1b CM |
451 | { |
452 | int ret; | |
0b86a832 CM |
453 | u64 old_root_bytenr; |
454 | struct btrfs_root *tree_root = root->fs_info->tree_root; | |
79154b1b | 455 | |
0b86a832 | 456 | btrfs_write_dirty_block_groups(trans, root); |
56bec294 | 457 | |
d397712b | 458 | while (1) { |
0b86a832 CM |
459 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
460 | if (old_root_bytenr == root->node->start) | |
79154b1b | 461 | break; |
87ef2bb4 | 462 | |
5d4f98a2 | 463 | btrfs_set_root_node(&root->root_item, root->node); |
79154b1b | 464 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
465 | &root->root_key, |
466 | &root->root_item); | |
79154b1b | 467 | BUG_ON(ret); |
56bec294 | 468 | |
4a8c9a62 | 469 | ret = btrfs_write_dirty_block_groups(trans, root); |
56bec294 | 470 | BUG_ON(ret); |
0b86a832 | 471 | } |
276e680d YZ |
472 | |
473 | if (root != root->fs_info->extent_root) | |
474 | switch_commit_root(root); | |
475 | ||
0b86a832 CM |
476 | return 0; |
477 | } | |
478 | ||
d352ac68 CM |
479 | /* |
480 | * update all the cowonly tree roots on disk | |
481 | */ | |
5d4f98a2 YZ |
482 | static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans, |
483 | struct btrfs_root *root) | |
0b86a832 CM |
484 | { |
485 | struct btrfs_fs_info *fs_info = root->fs_info; | |
486 | struct list_head *next; | |
84234f3a | 487 | struct extent_buffer *eb; |
56bec294 | 488 | int ret; |
84234f3a | 489 | |
56bec294 CM |
490 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
491 | BUG_ON(ret); | |
87ef2bb4 | 492 | |
84234f3a | 493 | eb = btrfs_lock_root_node(fs_info->tree_root); |
9fa8cfe7 | 494 | btrfs_cow_block(trans, fs_info->tree_root, eb, NULL, 0, &eb); |
84234f3a YZ |
495 | btrfs_tree_unlock(eb); |
496 | free_extent_buffer(eb); | |
0b86a832 | 497 | |
56bec294 CM |
498 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
499 | BUG_ON(ret); | |
87ef2bb4 | 500 | |
d397712b | 501 | while (!list_empty(&fs_info->dirty_cowonly_roots)) { |
0b86a832 CM |
502 | next = fs_info->dirty_cowonly_roots.next; |
503 | list_del_init(next); | |
504 | root = list_entry(next, struct btrfs_root, dirty_list); | |
87ef2bb4 | 505 | |
0b86a832 | 506 | update_cowonly_root(trans, root); |
79154b1b | 507 | } |
276e680d YZ |
508 | |
509 | down_write(&fs_info->extent_commit_sem); | |
510 | switch_commit_root(fs_info->extent_root); | |
511 | up_write(&fs_info->extent_commit_sem); | |
512 | ||
79154b1b CM |
513 | return 0; |
514 | } | |
515 | ||
d352ac68 CM |
516 | /* |
517 | * dead roots are old snapshots that need to be deleted. This allocates | |
518 | * a dirty root struct and adds it into the list of dead roots that need to | |
519 | * be deleted | |
520 | */ | |
5d4f98a2 | 521 | int btrfs_add_dead_root(struct btrfs_root *root) |
5eda7b5e | 522 | { |
b48652c1 | 523 | mutex_lock(&root->fs_info->trans_mutex); |
5d4f98a2 | 524 | list_add(&root->root_list, &root->fs_info->dead_roots); |
b48652c1 | 525 | mutex_unlock(&root->fs_info->trans_mutex); |
5eda7b5e CM |
526 | return 0; |
527 | } | |
528 | ||
d352ac68 | 529 | /* |
5d4f98a2 | 530 | * update all the cowonly tree roots on disk |
d352ac68 | 531 | */ |
5d4f98a2 YZ |
532 | static noinline int commit_fs_roots(struct btrfs_trans_handle *trans, |
533 | struct btrfs_root *root) | |
0f7d52f4 | 534 | { |
0f7d52f4 | 535 | struct btrfs_root *gang[8]; |
5d4f98a2 | 536 | struct btrfs_fs_info *fs_info = root->fs_info; |
0f7d52f4 CM |
537 | int i; |
538 | int ret; | |
54aa1f4d CM |
539 | int err = 0; |
540 | ||
d397712b | 541 | while (1) { |
5d4f98a2 YZ |
542 | ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix, |
543 | (void **)gang, 0, | |
0f7d52f4 CM |
544 | ARRAY_SIZE(gang), |
545 | BTRFS_ROOT_TRANS_TAG); | |
546 | if (ret == 0) | |
547 | break; | |
548 | for (i = 0; i < ret; i++) { | |
549 | root = gang[i]; | |
5d4f98a2 YZ |
550 | radix_tree_tag_clear(&fs_info->fs_roots_radix, |
551 | (unsigned long)root->root_key.objectid, | |
552 | BTRFS_ROOT_TRANS_TAG); | |
31153d81 | 553 | |
e02119d5 | 554 | btrfs_free_log(trans, root); |
5d4f98a2 | 555 | btrfs_update_reloc_root(trans, root); |
bcc63abb | 556 | |
978d910d | 557 | if (root->commit_root != root->node) { |
817d52f8 | 558 | switch_commit_root(root); |
978d910d YZ |
559 | btrfs_set_root_node(&root->root_item, |
560 | root->node); | |
561 | } | |
5d4f98a2 | 562 | |
5d4f98a2 | 563 | err = btrfs_update_root(trans, fs_info->tree_root, |
0f7d52f4 CM |
564 | &root->root_key, |
565 | &root->root_item); | |
54aa1f4d CM |
566 | if (err) |
567 | break; | |
0f7d52f4 CM |
568 | } |
569 | } | |
54aa1f4d | 570 | return err; |
0f7d52f4 CM |
571 | } |
572 | ||
d352ac68 CM |
573 | /* |
574 | * defrag a given btree. If cacheonly == 1, this won't read from the disk, | |
575 | * otherwise every leaf in the btree is read and defragged. | |
576 | */ | |
e9d0b13b CM |
577 | int btrfs_defrag_root(struct btrfs_root *root, int cacheonly) |
578 | { | |
579 | struct btrfs_fs_info *info = root->fs_info; | |
580 | int ret; | |
581 | struct btrfs_trans_handle *trans; | |
d3c2fdcf | 582 | unsigned long nr; |
e9d0b13b | 583 | |
a2135011 | 584 | smp_mb(); |
e9d0b13b CM |
585 | if (root->defrag_running) |
586 | return 0; | |
e9d0b13b | 587 | trans = btrfs_start_transaction(root, 1); |
6b80053d | 588 | while (1) { |
e9d0b13b CM |
589 | root->defrag_running = 1; |
590 | ret = btrfs_defrag_leaves(trans, root, cacheonly); | |
d3c2fdcf | 591 | nr = trans->blocks_used; |
e9d0b13b | 592 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 593 | btrfs_btree_balance_dirty(info->tree_root, nr); |
e9d0b13b CM |
594 | cond_resched(); |
595 | ||
e9d0b13b | 596 | trans = btrfs_start_transaction(root, 1); |
3f157a2f | 597 | if (root->fs_info->closing || ret != -EAGAIN) |
e9d0b13b CM |
598 | break; |
599 | } | |
600 | root->defrag_running = 0; | |
a2135011 | 601 | smp_mb(); |
e9d0b13b CM |
602 | btrfs_end_transaction(trans, root); |
603 | return 0; | |
604 | } | |
605 | ||
2c47e605 | 606 | #if 0 |
b7ec40d7 CM |
607 | /* |
608 | * when dropping snapshots, we generate a ton of delayed refs, and it makes | |
609 | * sense not to join the transaction while it is trying to flush the current | |
610 | * queue of delayed refs out. | |
611 | * | |
612 | * This is used by the drop snapshot code only | |
613 | */ | |
614 | static noinline int wait_transaction_pre_flush(struct btrfs_fs_info *info) | |
615 | { | |
616 | DEFINE_WAIT(wait); | |
617 | ||
618 | mutex_lock(&info->trans_mutex); | |
619 | while (info->running_transaction && | |
620 | info->running_transaction->delayed_refs.flushing) { | |
621 | prepare_to_wait(&info->transaction_wait, &wait, | |
622 | TASK_UNINTERRUPTIBLE); | |
623 | mutex_unlock(&info->trans_mutex); | |
59bc5c75 | 624 | |
b7ec40d7 | 625 | schedule(); |
59bc5c75 | 626 | |
b7ec40d7 CM |
627 | mutex_lock(&info->trans_mutex); |
628 | finish_wait(&info->transaction_wait, &wait); | |
629 | } | |
630 | mutex_unlock(&info->trans_mutex); | |
631 | return 0; | |
632 | } | |
633 | ||
d352ac68 CM |
634 | /* |
635 | * Given a list of roots that need to be deleted, call btrfs_drop_snapshot on | |
636 | * all of them | |
637 | */ | |
5d4f98a2 | 638 | int btrfs_drop_dead_root(struct btrfs_root *root) |
0f7d52f4 | 639 | { |
0f7d52f4 | 640 | struct btrfs_trans_handle *trans; |
5d4f98a2 | 641 | struct btrfs_root *tree_root = root->fs_info->tree_root; |
d3c2fdcf | 642 | unsigned long nr; |
5d4f98a2 | 643 | int ret; |
58176a96 | 644 | |
5d4f98a2 YZ |
645 | while (1) { |
646 | /* | |
647 | * we don't want to jump in and create a bunch of | |
648 | * delayed refs if the transaction is starting to close | |
649 | */ | |
650 | wait_transaction_pre_flush(tree_root->fs_info); | |
651 | trans = btrfs_start_transaction(tree_root, 1); | |
a2135011 | 652 | |
5d4f98a2 YZ |
653 | /* |
654 | * we've joined a transaction, make sure it isn't | |
655 | * closing right now | |
656 | */ | |
657 | if (trans->transaction->delayed_refs.flushing) { | |
658 | btrfs_end_transaction(trans, tree_root); | |
659 | continue; | |
9f3a7427 | 660 | } |
58176a96 | 661 | |
5d4f98a2 YZ |
662 | ret = btrfs_drop_snapshot(trans, root); |
663 | if (ret != -EAGAIN) | |
664 | break; | |
a2135011 | 665 | |
5d4f98a2 YZ |
666 | ret = btrfs_update_root(trans, tree_root, |
667 | &root->root_key, | |
668 | &root->root_item); | |
669 | if (ret) | |
54aa1f4d | 670 | break; |
bcc63abb | 671 | |
d3c2fdcf | 672 | nr = trans->blocks_used; |
0f7d52f4 CM |
673 | ret = btrfs_end_transaction(trans, tree_root); |
674 | BUG_ON(ret); | |
5eda7b5e | 675 | |
d3c2fdcf | 676 | btrfs_btree_balance_dirty(tree_root, nr); |
4dc11904 | 677 | cond_resched(); |
0f7d52f4 | 678 | } |
5d4f98a2 YZ |
679 | BUG_ON(ret); |
680 | ||
681 | ret = btrfs_del_root(trans, tree_root, &root->root_key); | |
682 | BUG_ON(ret); | |
683 | ||
684 | nr = trans->blocks_used; | |
685 | ret = btrfs_end_transaction(trans, tree_root); | |
686 | BUG_ON(ret); | |
687 | ||
688 | free_extent_buffer(root->node); | |
689 | free_extent_buffer(root->commit_root); | |
690 | kfree(root); | |
691 | ||
692 | btrfs_btree_balance_dirty(tree_root, nr); | |
54aa1f4d | 693 | return ret; |
0f7d52f4 | 694 | } |
2c47e605 | 695 | #endif |
0f7d52f4 | 696 | |
d352ac68 CM |
697 | /* |
698 | * new snapshots need to be created at a very specific time in the | |
699 | * transaction commit. This does the actual creation | |
700 | */ | |
80b6794d | 701 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
702 | struct btrfs_fs_info *fs_info, |
703 | struct btrfs_pending_snapshot *pending) | |
704 | { | |
705 | struct btrfs_key key; | |
80b6794d | 706 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
707 | struct btrfs_root *tree_root = fs_info->tree_root; |
708 | struct btrfs_root *root = pending->root; | |
709 | struct extent_buffer *tmp; | |
925baedd | 710 | struct extent_buffer *old; |
3063d29f CM |
711 | int ret; |
712 | u64 objectid; | |
713 | ||
80b6794d CM |
714 | new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS); |
715 | if (!new_root_item) { | |
716 | ret = -ENOMEM; | |
717 | goto fail; | |
718 | } | |
3063d29f CM |
719 | ret = btrfs_find_free_objectid(trans, tree_root, 0, &objectid); |
720 | if (ret) | |
721 | goto fail; | |
722 | ||
5d4f98a2 | 723 | record_root_in_trans(trans, root); |
80ff3856 | 724 | btrfs_set_root_last_snapshot(&root->root_item, trans->transid); |
80b6794d | 725 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); |
3063d29f CM |
726 | |
727 | key.objectid = objectid; | |
1c4850e2 YZ |
728 | /* record when the snapshot was created in key.offset */ |
729 | key.offset = trans->transid; | |
3063d29f CM |
730 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); |
731 | ||
925baedd | 732 | old = btrfs_lock_root_node(root); |
9fa8cfe7 | 733 | btrfs_cow_block(trans, root, old, NULL, 0, &old); |
5d4f98a2 | 734 | btrfs_set_lock_blocking(old); |
3063d29f | 735 | |
925baedd CM |
736 | btrfs_copy_root(trans, root, old, &tmp, objectid); |
737 | btrfs_tree_unlock(old); | |
738 | free_extent_buffer(old); | |
3063d29f | 739 | |
5d4f98a2 | 740 | btrfs_set_root_node(new_root_item, tmp); |
3063d29f | 741 | ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key, |
80b6794d | 742 | new_root_item); |
925baedd | 743 | btrfs_tree_unlock(tmp); |
3063d29f CM |
744 | free_extent_buffer(tmp); |
745 | if (ret) | |
746 | goto fail; | |
747 | ||
3de4586c CM |
748 | key.offset = (u64)-1; |
749 | memcpy(&pending->root_key, &key, sizeof(key)); | |
750 | fail: | |
751 | kfree(new_root_item); | |
9ed74f2d | 752 | btrfs_unreserve_metadata_space(root, 6); |
3de4586c CM |
753 | return ret; |
754 | } | |
755 | ||
756 | static noinline int finish_pending_snapshot(struct btrfs_fs_info *fs_info, | |
757 | struct btrfs_pending_snapshot *pending) | |
758 | { | |
759 | int ret; | |
760 | int namelen; | |
761 | u64 index = 0; | |
762 | struct btrfs_trans_handle *trans; | |
763 | struct inode *parent_inode; | |
764 | struct inode *inode; | |
0660b5af | 765 | struct btrfs_root *parent_root; |
3de4586c | 766 | |
3394e160 | 767 | parent_inode = pending->dentry->d_parent->d_inode; |
0660b5af | 768 | parent_root = BTRFS_I(parent_inode)->root; |
180591bc | 769 | trans = btrfs_join_transaction(parent_root, 1); |
3de4586c | 770 | |
3063d29f CM |
771 | /* |
772 | * insert the directory item | |
773 | */ | |
3b96362c | 774 | namelen = strlen(pending->name); |
3de4586c | 775 | ret = btrfs_set_inode_index(parent_inode, &index); |
0660b5af | 776 | ret = btrfs_insert_dir_item(trans, parent_root, |
3de4586c CM |
777 | pending->name, namelen, |
778 | parent_inode->i_ino, | |
779 | &pending->root_key, BTRFS_FT_DIR, index); | |
3063d29f CM |
780 | |
781 | if (ret) | |
782 | goto fail; | |
0660b5af | 783 | |
52c26179 YZ |
784 | btrfs_i_size_write(parent_inode, parent_inode->i_size + namelen * 2); |
785 | ret = btrfs_update_inode(trans, parent_root, parent_inode); | |
786 | BUG_ON(ret); | |
787 | ||
0660b5af CM |
788 | ret = btrfs_add_root_ref(trans, parent_root->fs_info->tree_root, |
789 | pending->root_key.objectid, | |
0660b5af CM |
790 | parent_root->root_key.objectid, |
791 | parent_inode->i_ino, index, pending->name, | |
792 | namelen); | |
793 | ||
794 | BUG_ON(ret); | |
795 | ||
3de4586c CM |
796 | inode = btrfs_lookup_dentry(parent_inode, pending->dentry); |
797 | d_instantiate(pending->dentry, inode); | |
3063d29f | 798 | fail: |
3de4586c | 799 | btrfs_end_transaction(trans, fs_info->fs_root); |
3063d29f CM |
800 | return ret; |
801 | } | |
802 | ||
d352ac68 CM |
803 | /* |
804 | * create all the snapshots we've scheduled for creation | |
805 | */ | |
80b6794d CM |
806 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans, |
807 | struct btrfs_fs_info *fs_info) | |
3de4586c CM |
808 | { |
809 | struct btrfs_pending_snapshot *pending; | |
810 | struct list_head *head = &trans->transaction->pending_snapshots; | |
3de4586c CM |
811 | int ret; |
812 | ||
c6e30871 | 813 | list_for_each_entry(pending, head, list) { |
3de4586c CM |
814 | ret = create_pending_snapshot(trans, fs_info, pending); |
815 | BUG_ON(ret); | |
816 | } | |
817 | return 0; | |
818 | } | |
819 | ||
820 | static noinline int finish_pending_snapshots(struct btrfs_trans_handle *trans, | |
821 | struct btrfs_fs_info *fs_info) | |
3063d29f CM |
822 | { |
823 | struct btrfs_pending_snapshot *pending; | |
824 | struct list_head *head = &trans->transaction->pending_snapshots; | |
825 | int ret; | |
826 | ||
d397712b | 827 | while (!list_empty(head)) { |
3063d29f CM |
828 | pending = list_entry(head->next, |
829 | struct btrfs_pending_snapshot, list); | |
3de4586c | 830 | ret = finish_pending_snapshot(fs_info, pending); |
3063d29f CM |
831 | BUG_ON(ret); |
832 | list_del(&pending->list); | |
833 | kfree(pending->name); | |
834 | kfree(pending); | |
835 | } | |
dc17ff8f CM |
836 | return 0; |
837 | } | |
838 | ||
5d4f98a2 YZ |
839 | static void update_super_roots(struct btrfs_root *root) |
840 | { | |
841 | struct btrfs_root_item *root_item; | |
842 | struct btrfs_super_block *super; | |
843 | ||
844 | super = &root->fs_info->super_copy; | |
845 | ||
846 | root_item = &root->fs_info->chunk_root->root_item; | |
847 | super->chunk_root = root_item->bytenr; | |
848 | super->chunk_root_generation = root_item->generation; | |
849 | super->chunk_root_level = root_item->level; | |
850 | ||
851 | root_item = &root->fs_info->tree_root->root_item; | |
852 | super->root = root_item->bytenr; | |
853 | super->generation = root_item->generation; | |
854 | super->root_level = root_item->level; | |
855 | } | |
856 | ||
f36f3042 CM |
857 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info) |
858 | { | |
859 | int ret = 0; | |
860 | spin_lock(&info->new_trans_lock); | |
861 | if (info->running_transaction) | |
862 | ret = info->running_transaction->in_commit; | |
863 | spin_unlock(&info->new_trans_lock); | |
864 | return ret; | |
865 | } | |
866 | ||
79154b1b CM |
867 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans, |
868 | struct btrfs_root *root) | |
869 | { | |
15ee9bc7 JB |
870 | unsigned long joined = 0; |
871 | unsigned long timeout = 1; | |
79154b1b | 872 | struct btrfs_transaction *cur_trans; |
8fd17795 | 873 | struct btrfs_transaction *prev_trans = NULL; |
79154b1b | 874 | DEFINE_WAIT(wait); |
15ee9bc7 | 875 | int ret; |
89573b9c CM |
876 | int should_grow = 0; |
877 | unsigned long now = get_seconds(); | |
dccae999 | 878 | int flush_on_commit = btrfs_test_opt(root, FLUSHONCOMMIT); |
79154b1b | 879 | |
5a3f23d5 CM |
880 | btrfs_run_ordered_operations(root, 0); |
881 | ||
56bec294 CM |
882 | /* make a pass through all the delayed refs we have so far |
883 | * any runnings procs may add more while we are here | |
884 | */ | |
885 | ret = btrfs_run_delayed_refs(trans, root, 0); | |
886 | BUG_ON(ret); | |
887 | ||
b7ec40d7 | 888 | cur_trans = trans->transaction; |
56bec294 CM |
889 | /* |
890 | * set the flushing flag so procs in this transaction have to | |
891 | * start sending their work down. | |
892 | */ | |
b7ec40d7 | 893 | cur_trans->delayed_refs.flushing = 1; |
56bec294 | 894 | |
c3e69d58 | 895 | ret = btrfs_run_delayed_refs(trans, root, 0); |
56bec294 CM |
896 | BUG_ON(ret); |
897 | ||
79154b1b | 898 | mutex_lock(&root->fs_info->trans_mutex); |
b7ec40d7 CM |
899 | if (cur_trans->in_commit) { |
900 | cur_trans->use_count++; | |
ccd467d6 | 901 | mutex_unlock(&root->fs_info->trans_mutex); |
79154b1b | 902 | btrfs_end_transaction(trans, root); |
ccd467d6 | 903 | |
79154b1b CM |
904 | ret = wait_for_commit(root, cur_trans); |
905 | BUG_ON(ret); | |
15ee9bc7 JB |
906 | |
907 | mutex_lock(&root->fs_info->trans_mutex); | |
79154b1b | 908 | put_transaction(cur_trans); |
15ee9bc7 JB |
909 | mutex_unlock(&root->fs_info->trans_mutex); |
910 | ||
79154b1b CM |
911 | return 0; |
912 | } | |
4313b399 | 913 | |
2c90e5d6 | 914 | trans->transaction->in_commit = 1; |
f9295749 | 915 | trans->transaction->blocked = 1; |
ccd467d6 CM |
916 | if (cur_trans->list.prev != &root->fs_info->trans_list) { |
917 | prev_trans = list_entry(cur_trans->list.prev, | |
918 | struct btrfs_transaction, list); | |
919 | if (!prev_trans->commit_done) { | |
920 | prev_trans->use_count++; | |
ccd467d6 CM |
921 | mutex_unlock(&root->fs_info->trans_mutex); |
922 | ||
923 | wait_for_commit(root, prev_trans); | |
ccd467d6 | 924 | |
ccd467d6 | 925 | mutex_lock(&root->fs_info->trans_mutex); |
15ee9bc7 | 926 | put_transaction(prev_trans); |
ccd467d6 CM |
927 | } |
928 | } | |
15ee9bc7 | 929 | |
89573b9c CM |
930 | if (now < cur_trans->start_time || now - cur_trans->start_time < 1) |
931 | should_grow = 1; | |
932 | ||
15ee9bc7 | 933 | do { |
7ea394f1 | 934 | int snap_pending = 0; |
15ee9bc7 | 935 | joined = cur_trans->num_joined; |
7ea394f1 YZ |
936 | if (!list_empty(&trans->transaction->pending_snapshots)) |
937 | snap_pending = 1; | |
938 | ||
2c90e5d6 | 939 | WARN_ON(cur_trans != trans->transaction); |
15ee9bc7 | 940 | prepare_to_wait(&cur_trans->writer_wait, &wait, |
79154b1b | 941 | TASK_UNINTERRUPTIBLE); |
15ee9bc7 JB |
942 | |
943 | if (cur_trans->num_writers > 1) | |
944 | timeout = MAX_SCHEDULE_TIMEOUT; | |
89573b9c | 945 | else if (should_grow) |
15ee9bc7 JB |
946 | timeout = 1; |
947 | ||
79154b1b | 948 | mutex_unlock(&root->fs_info->trans_mutex); |
15ee9bc7 | 949 | |
ebecd3d9 SW |
950 | if (flush_on_commit) { |
951 | btrfs_start_delalloc_inodes(root); | |
952 | ret = btrfs_wait_ordered_extents(root, 0); | |
953 | BUG_ON(ret); | |
954 | } else if (snap_pending) { | |
7ea394f1 YZ |
955 | ret = btrfs_wait_ordered_extents(root, 1); |
956 | BUG_ON(ret); | |
957 | } | |
958 | ||
5a3f23d5 CM |
959 | /* |
960 | * rename don't use btrfs_join_transaction, so, once we | |
961 | * set the transaction to blocked above, we aren't going | |
962 | * to get any new ordered operations. We can safely run | |
963 | * it here and no for sure that nothing new will be added | |
964 | * to the list | |
965 | */ | |
966 | btrfs_run_ordered_operations(root, 1); | |
967 | ||
89573b9c CM |
968 | smp_mb(); |
969 | if (cur_trans->num_writers > 1 || should_grow) | |
970 | schedule_timeout(timeout); | |
15ee9bc7 | 971 | |
79154b1b | 972 | mutex_lock(&root->fs_info->trans_mutex); |
15ee9bc7 JB |
973 | finish_wait(&cur_trans->writer_wait, &wait); |
974 | } while (cur_trans->num_writers > 1 || | |
89573b9c | 975 | (should_grow && cur_trans->num_joined != joined)); |
15ee9bc7 | 976 | |
3063d29f CM |
977 | ret = create_pending_snapshots(trans, root->fs_info); |
978 | BUG_ON(ret); | |
979 | ||
56bec294 CM |
980 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
981 | BUG_ON(ret); | |
982 | ||
2c90e5d6 | 983 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 984 | |
e02119d5 CM |
985 | /* btrfs_commit_tree_roots is responsible for getting the |
986 | * various roots consistent with each other. Every pointer | |
987 | * in the tree of tree roots has to point to the most up to date | |
988 | * root for every subvolume and other tree. So, we have to keep | |
989 | * the tree logging code from jumping in and changing any | |
990 | * of the trees. | |
991 | * | |
992 | * At this point in the commit, there can't be any tree-log | |
993 | * writers, but a little lower down we drop the trans mutex | |
994 | * and let new people in. By holding the tree_log_mutex | |
995 | * from now until after the super is written, we avoid races | |
996 | * with the tree-log code. | |
997 | */ | |
998 | mutex_lock(&root->fs_info->tree_log_mutex); | |
999 | ||
5d4f98a2 | 1000 | ret = commit_fs_roots(trans, root); |
54aa1f4d CM |
1001 | BUG_ON(ret); |
1002 | ||
5d4f98a2 | 1003 | /* commit_fs_roots gets rid of all the tree log roots, it is now |
e02119d5 CM |
1004 | * safe to free the root of tree log roots |
1005 | */ | |
1006 | btrfs_free_log_root_tree(trans, root->fs_info); | |
1007 | ||
5d4f98a2 | 1008 | ret = commit_cowonly_roots(trans, root); |
79154b1b | 1009 | BUG_ON(ret); |
54aa1f4d | 1010 | |
11833d66 YZ |
1011 | btrfs_prepare_extent_commit(trans, root); |
1012 | ||
78fae27e | 1013 | cur_trans = root->fs_info->running_transaction; |
cee36a03 | 1014 | spin_lock(&root->fs_info->new_trans_lock); |
78fae27e | 1015 | root->fs_info->running_transaction = NULL; |
cee36a03 | 1016 | spin_unlock(&root->fs_info->new_trans_lock); |
5d4f98a2 YZ |
1017 | |
1018 | btrfs_set_root_node(&root->fs_info->tree_root->root_item, | |
1019 | root->fs_info->tree_root->node); | |
817d52f8 | 1020 | switch_commit_root(root->fs_info->tree_root); |
5d4f98a2 YZ |
1021 | |
1022 | btrfs_set_root_node(&root->fs_info->chunk_root->root_item, | |
1023 | root->fs_info->chunk_root->node); | |
817d52f8 | 1024 | switch_commit_root(root->fs_info->chunk_root); |
5d4f98a2 YZ |
1025 | |
1026 | update_super_roots(root); | |
e02119d5 CM |
1027 | |
1028 | if (!root->fs_info->log_root_recovering) { | |
1029 | btrfs_set_super_log_root(&root->fs_info->super_copy, 0); | |
1030 | btrfs_set_super_log_root_level(&root->fs_info->super_copy, 0); | |
1031 | } | |
1032 | ||
a061fc8d CM |
1033 | memcpy(&root->fs_info->super_for_commit, &root->fs_info->super_copy, |
1034 | sizeof(root->fs_info->super_copy)); | |
ccd467d6 | 1035 | |
f9295749 | 1036 | trans->transaction->blocked = 0; |
b7ec40d7 | 1037 | |
f9295749 | 1038 | wake_up(&root->fs_info->transaction_wait); |
e6dcd2dc | 1039 | |
78fae27e | 1040 | mutex_unlock(&root->fs_info->trans_mutex); |
79154b1b CM |
1041 | ret = btrfs_write_and_wait_transaction(trans, root); |
1042 | BUG_ON(ret); | |
a512bbf8 | 1043 | write_ctree_super(trans, root, 0); |
4313b399 | 1044 | |
e02119d5 CM |
1045 | /* |
1046 | * the super is written, we can safely allow the tree-loggers | |
1047 | * to go about their business | |
1048 | */ | |
1049 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1050 | ||
11833d66 | 1051 | btrfs_finish_extent_commit(trans, root); |
4313b399 | 1052 | |
3de4586c CM |
1053 | /* do the directory inserts of any pending snapshot creations */ |
1054 | finish_pending_snapshots(trans, root->fs_info); | |
1055 | ||
1a40e23b ZY |
1056 | mutex_lock(&root->fs_info->trans_mutex); |
1057 | ||
2c90e5d6 | 1058 | cur_trans->commit_done = 1; |
b7ec40d7 | 1059 | |
15ee9bc7 | 1060 | root->fs_info->last_trans_committed = cur_trans->transid; |
817d52f8 | 1061 | |
2c90e5d6 | 1062 | wake_up(&cur_trans->commit_wait); |
3de4586c | 1063 | |
78fae27e | 1064 | put_transaction(cur_trans); |
79154b1b | 1065 | put_transaction(cur_trans); |
58176a96 | 1066 | |
78fae27e | 1067 | mutex_unlock(&root->fs_info->trans_mutex); |
3de4586c | 1068 | |
9ed74f2d JB |
1069 | if (current->journal_info == trans) |
1070 | current->journal_info = NULL; | |
1071 | ||
2c90e5d6 | 1072 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
79154b1b CM |
1073 | return ret; |
1074 | } | |
1075 | ||
d352ac68 CM |
1076 | /* |
1077 | * interface function to delete all the snapshots we have scheduled for deletion | |
1078 | */ | |
e9d0b13b CM |
1079 | int btrfs_clean_old_snapshots(struct btrfs_root *root) |
1080 | { | |
5d4f98a2 YZ |
1081 | LIST_HEAD(list); |
1082 | struct btrfs_fs_info *fs_info = root->fs_info; | |
1083 | ||
1084 | mutex_lock(&fs_info->trans_mutex); | |
1085 | list_splice_init(&fs_info->dead_roots, &list); | |
1086 | mutex_unlock(&fs_info->trans_mutex); | |
e9d0b13b | 1087 | |
5d4f98a2 YZ |
1088 | while (!list_empty(&list)) { |
1089 | root = list_entry(list.next, struct btrfs_root, root_list); | |
76dda93c YZ |
1090 | list_del(&root->root_list); |
1091 | ||
1092 | if (btrfs_header_backref_rev(root->node) < | |
1093 | BTRFS_MIXED_BACKREF_REV) | |
1094 | btrfs_drop_snapshot(root, 0); | |
1095 | else | |
1096 | btrfs_drop_snapshot(root, 1); | |
e9d0b13b CM |
1097 | } |
1098 | return 0; | |
1099 | } |