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