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> |
5a0e3ad6 | 20 | #include <linux/slab.h> |
34088780 | 21 | #include <linux/sched.h> |
d3c2fdcf | 22 | #include <linux/writeback.h> |
5f39d397 | 23 | #include <linux/pagemap.h> |
5f2cc086 | 24 | #include <linux/blkdev.h> |
79154b1b CM |
25 | #include "ctree.h" |
26 | #include "disk-io.h" | |
27 | #include "transaction.h" | |
925baedd | 28 | #include "locking.h" |
e02119d5 | 29 | #include "tree-log.h" |
581bb050 | 30 | #include "inode-map.h" |
79154b1b | 31 | |
0f7d52f4 CM |
32 | #define BTRFS_ROOT_TRANS_TAG 0 |
33 | ||
49b25e05 | 34 | void put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 35 | { |
13c5a93e JB |
36 | WARN_ON(atomic_read(&transaction->use_count) == 0); |
37 | if (atomic_dec_and_test(&transaction->use_count)) { | |
a4abeea4 | 38 | BUG_ON(!list_empty(&transaction->list)); |
00f04b88 AJ |
39 | WARN_ON(transaction->delayed_refs.root.rb_node); |
40 | WARN_ON(!list_empty(&transaction->delayed_refs.seq_head)); | |
2c90e5d6 CM |
41 | memset(transaction, 0, sizeof(*transaction)); |
42 | kmem_cache_free(btrfs_transaction_cachep, transaction); | |
78fae27e | 43 | } |
79154b1b CM |
44 | } |
45 | ||
817d52f8 JB |
46 | static noinline void switch_commit_root(struct btrfs_root *root) |
47 | { | |
817d52f8 JB |
48 | free_extent_buffer(root->commit_root); |
49 | root->commit_root = btrfs_root_node(root); | |
817d52f8 JB |
50 | } |
51 | ||
d352ac68 CM |
52 | /* |
53 | * either allocate a new transaction or hop into the existing one | |
54 | */ | |
a4abeea4 | 55 | static noinline int join_transaction(struct btrfs_root *root, int nofail) |
79154b1b CM |
56 | { |
57 | struct btrfs_transaction *cur_trans; | |
a4abeea4 JB |
58 | |
59 | spin_lock(&root->fs_info->trans_lock); | |
d43317dc | 60 | loop: |
49b25e05 JM |
61 | /* The file system has been taken offline. No new transactions. */ |
62 | if (root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) { | |
63 | spin_unlock(&root->fs_info->trans_lock); | |
64 | return -EROFS; | |
65 | } | |
66 | ||
a4abeea4 JB |
67 | if (root->fs_info->trans_no_join) { |
68 | if (!nofail) { | |
69 | spin_unlock(&root->fs_info->trans_lock); | |
70 | return -EBUSY; | |
71 | } | |
72 | } | |
73 | ||
79154b1b | 74 | cur_trans = root->fs_info->running_transaction; |
a4abeea4 | 75 | if (cur_trans) { |
49b25e05 JM |
76 | if (cur_trans->aborted) |
77 | return cur_trans->aborted; | |
a4abeea4 | 78 | atomic_inc(&cur_trans->use_count); |
13c5a93e | 79 | atomic_inc(&cur_trans->num_writers); |
15ee9bc7 | 80 | cur_trans->num_joined++; |
a4abeea4 JB |
81 | spin_unlock(&root->fs_info->trans_lock); |
82 | return 0; | |
79154b1b | 83 | } |
a4abeea4 JB |
84 | spin_unlock(&root->fs_info->trans_lock); |
85 | ||
86 | cur_trans = kmem_cache_alloc(btrfs_transaction_cachep, GFP_NOFS); | |
87 | if (!cur_trans) | |
88 | return -ENOMEM; | |
d43317dc | 89 | |
a4abeea4 JB |
90 | spin_lock(&root->fs_info->trans_lock); |
91 | if (root->fs_info->running_transaction) { | |
d43317dc CM |
92 | /* |
93 | * someone started a transaction after we unlocked. Make sure | |
94 | * to redo the trans_no_join checks above | |
95 | */ | |
a4abeea4 JB |
96 | kmem_cache_free(btrfs_transaction_cachep, cur_trans); |
97 | cur_trans = root->fs_info->running_transaction; | |
d43317dc | 98 | goto loop; |
79154b1b | 99 | } |
d43317dc | 100 | |
a4abeea4 JB |
101 | atomic_set(&cur_trans->num_writers, 1); |
102 | cur_trans->num_joined = 0; | |
103 | init_waitqueue_head(&cur_trans->writer_wait); | |
104 | init_waitqueue_head(&cur_trans->commit_wait); | |
105 | cur_trans->in_commit = 0; | |
106 | cur_trans->blocked = 0; | |
107 | /* | |
108 | * One for this trans handle, one so it will live on until we | |
109 | * commit the transaction. | |
110 | */ | |
111 | atomic_set(&cur_trans->use_count, 2); | |
112 | cur_trans->commit_done = 0; | |
113 | cur_trans->start_time = get_seconds(); | |
114 | ||
115 | cur_trans->delayed_refs.root = RB_ROOT; | |
116 | cur_trans->delayed_refs.num_entries = 0; | |
117 | cur_trans->delayed_refs.num_heads_ready = 0; | |
118 | cur_trans->delayed_refs.num_heads = 0; | |
119 | cur_trans->delayed_refs.flushing = 0; | |
120 | cur_trans->delayed_refs.run_delayed_start = 0; | |
00f04b88 | 121 | cur_trans->delayed_refs.seq = 1; |
a168650c | 122 | init_waitqueue_head(&cur_trans->delayed_refs.seq_wait); |
a4abeea4 JB |
123 | spin_lock_init(&cur_trans->commit_lock); |
124 | spin_lock_init(&cur_trans->delayed_refs.lock); | |
00f04b88 | 125 | INIT_LIST_HEAD(&cur_trans->delayed_refs.seq_head); |
a4abeea4 JB |
126 | |
127 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); | |
128 | list_add_tail(&cur_trans->list, &root->fs_info->trans_list); | |
129 | extent_io_tree_init(&cur_trans->dirty_pages, | |
ff5714cc | 130 | root->fs_info->btree_inode->i_mapping); |
a4abeea4 JB |
131 | root->fs_info->generation++; |
132 | cur_trans->transid = root->fs_info->generation; | |
133 | root->fs_info->running_transaction = cur_trans; | |
49b25e05 | 134 | cur_trans->aborted = 0; |
a4abeea4 | 135 | spin_unlock(&root->fs_info->trans_lock); |
15ee9bc7 | 136 | |
79154b1b CM |
137 | return 0; |
138 | } | |
139 | ||
d352ac68 | 140 | /* |
d397712b CM |
141 | * this does all the record keeping required to make sure that a reference |
142 | * counted root is properly recorded in a given transaction. This is required | |
143 | * to make sure the old root from before we joined the transaction is deleted | |
144 | * when the transaction commits | |
d352ac68 | 145 | */ |
7585717f | 146 | static int record_root_in_trans(struct btrfs_trans_handle *trans, |
a4abeea4 | 147 | struct btrfs_root *root) |
6702ed49 | 148 | { |
5d4f98a2 | 149 | if (root->ref_cows && root->last_trans < trans->transid) { |
6702ed49 | 150 | WARN_ON(root == root->fs_info->extent_root); |
5d4f98a2 YZ |
151 | WARN_ON(root->commit_root != root->node); |
152 | ||
7585717f CM |
153 | /* |
154 | * see below for in_trans_setup usage rules | |
155 | * we have the reloc mutex held now, so there | |
156 | * is only one writer in this function | |
157 | */ | |
158 | root->in_trans_setup = 1; | |
159 | ||
160 | /* make sure readers find in_trans_setup before | |
161 | * they find our root->last_trans update | |
162 | */ | |
163 | smp_wmb(); | |
164 | ||
a4abeea4 JB |
165 | spin_lock(&root->fs_info->fs_roots_radix_lock); |
166 | if (root->last_trans == trans->transid) { | |
167 | spin_unlock(&root->fs_info->fs_roots_radix_lock); | |
168 | return 0; | |
169 | } | |
5d4f98a2 YZ |
170 | radix_tree_tag_set(&root->fs_info->fs_roots_radix, |
171 | (unsigned long)root->root_key.objectid, | |
172 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 173 | spin_unlock(&root->fs_info->fs_roots_radix_lock); |
7585717f CM |
174 | root->last_trans = trans->transid; |
175 | ||
176 | /* this is pretty tricky. We don't want to | |
177 | * take the relocation lock in btrfs_record_root_in_trans | |
178 | * unless we're really doing the first setup for this root in | |
179 | * this transaction. | |
180 | * | |
181 | * Normally we'd use root->last_trans as a flag to decide | |
182 | * if we want to take the expensive mutex. | |
183 | * | |
184 | * But, we have to set root->last_trans before we | |
185 | * init the relocation root, otherwise, we trip over warnings | |
186 | * in ctree.c. The solution used here is to flag ourselves | |
187 | * with root->in_trans_setup. When this is 1, we're still | |
188 | * fixing up the reloc trees and everyone must wait. | |
189 | * | |
190 | * When this is zero, they can trust root->last_trans and fly | |
191 | * through btrfs_record_root_in_trans without having to take the | |
192 | * lock. smp_wmb() makes sure that all the writes above are | |
193 | * done before we pop in the zero below | |
194 | */ | |
5d4f98a2 | 195 | btrfs_init_reloc_root(trans, root); |
7585717f CM |
196 | smp_wmb(); |
197 | root->in_trans_setup = 0; | |
5d4f98a2 YZ |
198 | } |
199 | return 0; | |
200 | } | |
bcc63abb | 201 | |
7585717f CM |
202 | |
203 | int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, | |
204 | struct btrfs_root *root) | |
205 | { | |
206 | if (!root->ref_cows) | |
207 | return 0; | |
208 | ||
209 | /* | |
210 | * see record_root_in_trans for comments about in_trans_setup usage | |
211 | * and barriers | |
212 | */ | |
213 | smp_rmb(); | |
214 | if (root->last_trans == trans->transid && | |
215 | !root->in_trans_setup) | |
216 | return 0; | |
217 | ||
218 | mutex_lock(&root->fs_info->reloc_mutex); | |
219 | record_root_in_trans(trans, root); | |
220 | mutex_unlock(&root->fs_info->reloc_mutex); | |
221 | ||
222 | return 0; | |
223 | } | |
224 | ||
d352ac68 CM |
225 | /* wait for commit against the current transaction to become unblocked |
226 | * when this is done, it is safe to start a new transaction, but the current | |
227 | * transaction might not be fully on disk. | |
228 | */ | |
37d1aeee | 229 | static void wait_current_trans(struct btrfs_root *root) |
79154b1b | 230 | { |
f9295749 | 231 | struct btrfs_transaction *cur_trans; |
79154b1b | 232 | |
a4abeea4 | 233 | spin_lock(&root->fs_info->trans_lock); |
f9295749 | 234 | cur_trans = root->fs_info->running_transaction; |
37d1aeee | 235 | if (cur_trans && cur_trans->blocked) { |
13c5a93e | 236 | atomic_inc(&cur_trans->use_count); |
a4abeea4 | 237 | spin_unlock(&root->fs_info->trans_lock); |
72d63ed6 LZ |
238 | |
239 | wait_event(root->fs_info->transaction_wait, | |
240 | !cur_trans->blocked); | |
f9295749 | 241 | put_transaction(cur_trans); |
a4abeea4 JB |
242 | } else { |
243 | spin_unlock(&root->fs_info->trans_lock); | |
f9295749 | 244 | } |
37d1aeee CM |
245 | } |
246 | ||
249ac1e5 JB |
247 | enum btrfs_trans_type { |
248 | TRANS_START, | |
249 | TRANS_JOIN, | |
250 | TRANS_USERSPACE, | |
0af3d00b | 251 | TRANS_JOIN_NOLOCK, |
249ac1e5 JB |
252 | }; |
253 | ||
a22285a6 YZ |
254 | static int may_wait_transaction(struct btrfs_root *root, int type) |
255 | { | |
a4abeea4 JB |
256 | if (root->fs_info->log_root_recovering) |
257 | return 0; | |
258 | ||
259 | if (type == TRANS_USERSPACE) | |
260 | return 1; | |
261 | ||
262 | if (type == TRANS_START && | |
263 | !atomic_read(&root->fs_info->open_ioctl_trans)) | |
a22285a6 | 264 | return 1; |
a4abeea4 | 265 | |
a22285a6 YZ |
266 | return 0; |
267 | } | |
268 | ||
e02119d5 | 269 | static struct btrfs_trans_handle *start_transaction(struct btrfs_root *root, |
a22285a6 | 270 | u64 num_items, int type) |
37d1aeee | 271 | { |
a22285a6 YZ |
272 | struct btrfs_trans_handle *h; |
273 | struct btrfs_transaction *cur_trans; | |
b5009945 | 274 | u64 num_bytes = 0; |
37d1aeee | 275 | int ret; |
acce952b | 276 | |
277 | if (root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) | |
278 | return ERR_PTR(-EROFS); | |
2a1eb461 JB |
279 | |
280 | if (current->journal_info) { | |
281 | WARN_ON(type != TRANS_JOIN && type != TRANS_JOIN_NOLOCK); | |
282 | h = current->journal_info; | |
283 | h->use_count++; | |
284 | h->orig_rsv = h->block_rsv; | |
285 | h->block_rsv = NULL; | |
286 | goto got_it; | |
287 | } | |
b5009945 JB |
288 | |
289 | /* | |
290 | * Do the reservation before we join the transaction so we can do all | |
291 | * the appropriate flushing if need be. | |
292 | */ | |
293 | if (num_items > 0 && root != root->fs_info->chunk_root) { | |
294 | num_bytes = btrfs_calc_trans_metadata_size(root, num_items); | |
4a92b1b8 | 295 | ret = btrfs_block_rsv_add(root, |
b5009945 JB |
296 | &root->fs_info->trans_block_rsv, |
297 | num_bytes); | |
298 | if (ret) | |
299 | return ERR_PTR(ret); | |
300 | } | |
a22285a6 YZ |
301 | again: |
302 | h = kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); | |
303 | if (!h) | |
304 | return ERR_PTR(-ENOMEM); | |
37d1aeee | 305 | |
a22285a6 | 306 | if (may_wait_transaction(root, type)) |
37d1aeee | 307 | wait_current_trans(root); |
a22285a6 | 308 | |
a4abeea4 JB |
309 | do { |
310 | ret = join_transaction(root, type == TRANS_JOIN_NOLOCK); | |
311 | if (ret == -EBUSY) | |
312 | wait_current_trans(root); | |
313 | } while (ret == -EBUSY); | |
314 | ||
db5b493a | 315 | if (ret < 0) { |
6e8df2ae | 316 | kmem_cache_free(btrfs_trans_handle_cachep, h); |
db5b493a TI |
317 | return ERR_PTR(ret); |
318 | } | |
0f7d52f4 | 319 | |
a22285a6 | 320 | cur_trans = root->fs_info->running_transaction; |
a22285a6 YZ |
321 | |
322 | h->transid = cur_trans->transid; | |
323 | h->transaction = cur_trans; | |
79154b1b | 324 | h->blocks_used = 0; |
a22285a6 | 325 | h->bytes_reserved = 0; |
56bec294 | 326 | h->delayed_ref_updates = 0; |
2a1eb461 | 327 | h->use_count = 1; |
f0486c68 | 328 | h->block_rsv = NULL; |
2a1eb461 | 329 | h->orig_rsv = NULL; |
49b25e05 | 330 | h->aborted = 0; |
b7ec40d7 | 331 | |
a22285a6 YZ |
332 | smp_mb(); |
333 | if (cur_trans->blocked && may_wait_transaction(root, type)) { | |
334 | btrfs_commit_transaction(h, root); | |
335 | goto again; | |
336 | } | |
337 | ||
b5009945 | 338 | if (num_bytes) { |
8c2a3ca2 | 339 | trace_btrfs_space_reservation(root->fs_info, "transaction", |
e77266e4 CM |
340 | (u64)(unsigned long)h, |
341 | num_bytes, 1); | |
b5009945 JB |
342 | h->block_rsv = &root->fs_info->trans_block_rsv; |
343 | h->bytes_reserved = num_bytes; | |
a22285a6 | 344 | } |
9ed74f2d | 345 | |
2a1eb461 | 346 | got_it: |
a4abeea4 | 347 | btrfs_record_root_in_trans(h, root); |
a22285a6 YZ |
348 | |
349 | if (!current->journal_info && type != TRANS_USERSPACE) | |
350 | current->journal_info = h; | |
79154b1b CM |
351 | return h; |
352 | } | |
353 | ||
f9295749 | 354 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
a22285a6 | 355 | int num_items) |
f9295749 | 356 | { |
a22285a6 | 357 | return start_transaction(root, num_items, TRANS_START); |
f9295749 | 358 | } |
7a7eaa40 | 359 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root) |
f9295749 | 360 | { |
a22285a6 | 361 | return start_transaction(root, 0, TRANS_JOIN); |
f9295749 CM |
362 | } |
363 | ||
7a7eaa40 | 364 | struct btrfs_trans_handle *btrfs_join_transaction_nolock(struct btrfs_root *root) |
0af3d00b JB |
365 | { |
366 | return start_transaction(root, 0, TRANS_JOIN_NOLOCK); | |
367 | } | |
368 | ||
7a7eaa40 | 369 | struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *root) |
9ca9ee09 | 370 | { |
7a7eaa40 | 371 | return start_transaction(root, 0, TRANS_USERSPACE); |
9ca9ee09 SW |
372 | } |
373 | ||
d352ac68 | 374 | /* wait for a transaction commit to be fully complete */ |
b9c8300c | 375 | static noinline void wait_for_commit(struct btrfs_root *root, |
89ce8a63 CM |
376 | struct btrfs_transaction *commit) |
377 | { | |
72d63ed6 | 378 | wait_event(commit->commit_wait, commit->commit_done); |
89ce8a63 CM |
379 | } |
380 | ||
46204592 SW |
381 | int btrfs_wait_for_commit(struct btrfs_root *root, u64 transid) |
382 | { | |
383 | struct btrfs_transaction *cur_trans = NULL, *t; | |
384 | int ret; | |
385 | ||
46204592 SW |
386 | ret = 0; |
387 | if (transid) { | |
388 | if (transid <= root->fs_info->last_trans_committed) | |
a4abeea4 | 389 | goto out; |
46204592 SW |
390 | |
391 | /* find specified transaction */ | |
a4abeea4 | 392 | spin_lock(&root->fs_info->trans_lock); |
46204592 SW |
393 | list_for_each_entry(t, &root->fs_info->trans_list, list) { |
394 | if (t->transid == transid) { | |
395 | cur_trans = t; | |
a4abeea4 | 396 | atomic_inc(&cur_trans->use_count); |
46204592 SW |
397 | break; |
398 | } | |
399 | if (t->transid > transid) | |
400 | break; | |
401 | } | |
a4abeea4 | 402 | spin_unlock(&root->fs_info->trans_lock); |
46204592 SW |
403 | ret = -EINVAL; |
404 | if (!cur_trans) | |
a4abeea4 | 405 | goto out; /* bad transid */ |
46204592 SW |
406 | } else { |
407 | /* find newest transaction that is committing | committed */ | |
a4abeea4 | 408 | spin_lock(&root->fs_info->trans_lock); |
46204592 SW |
409 | list_for_each_entry_reverse(t, &root->fs_info->trans_list, |
410 | list) { | |
411 | if (t->in_commit) { | |
412 | if (t->commit_done) | |
3473f3c0 | 413 | break; |
46204592 | 414 | cur_trans = t; |
a4abeea4 | 415 | atomic_inc(&cur_trans->use_count); |
46204592 SW |
416 | break; |
417 | } | |
418 | } | |
a4abeea4 | 419 | spin_unlock(&root->fs_info->trans_lock); |
46204592 | 420 | if (!cur_trans) |
a4abeea4 | 421 | goto out; /* nothing committing|committed */ |
46204592 SW |
422 | } |
423 | ||
46204592 SW |
424 | wait_for_commit(root, cur_trans); |
425 | ||
46204592 SW |
426 | put_transaction(cur_trans); |
427 | ret = 0; | |
a4abeea4 | 428 | out: |
46204592 SW |
429 | return ret; |
430 | } | |
431 | ||
37d1aeee CM |
432 | void btrfs_throttle(struct btrfs_root *root) |
433 | { | |
a4abeea4 | 434 | if (!atomic_read(&root->fs_info->open_ioctl_trans)) |
9ca9ee09 | 435 | wait_current_trans(root); |
37d1aeee CM |
436 | } |
437 | ||
8929ecfa YZ |
438 | static int should_end_transaction(struct btrfs_trans_handle *trans, |
439 | struct btrfs_root *root) | |
440 | { | |
441 | int ret; | |
36ba022a JB |
442 | |
443 | ret = btrfs_block_rsv_check(root, &root->fs_info->global_block_rsv, 5); | |
8929ecfa YZ |
444 | return ret ? 1 : 0; |
445 | } | |
446 | ||
447 | int btrfs_should_end_transaction(struct btrfs_trans_handle *trans, | |
448 | struct btrfs_root *root) | |
449 | { | |
450 | struct btrfs_transaction *cur_trans = trans->transaction; | |
9c8d86db | 451 | struct btrfs_block_rsv *rsv = trans->block_rsv; |
8929ecfa | 452 | int updates; |
49b25e05 | 453 | int err; |
8929ecfa | 454 | |
a4abeea4 | 455 | smp_mb(); |
8929ecfa YZ |
456 | if (cur_trans->blocked || cur_trans->delayed_refs.flushing) |
457 | return 1; | |
458 | ||
9c8d86db JB |
459 | /* |
460 | * We need to do this in case we're deleting csums so the global block | |
461 | * rsv get's used instead of the csum block rsv. | |
462 | */ | |
463 | trans->block_rsv = NULL; | |
464 | ||
8929ecfa YZ |
465 | updates = trans->delayed_ref_updates; |
466 | trans->delayed_ref_updates = 0; | |
49b25e05 JM |
467 | if (updates) { |
468 | err = btrfs_run_delayed_refs(trans, root, updates); | |
469 | if (err) /* Error code will also eval true */ | |
470 | return err; | |
471 | } | |
8929ecfa | 472 | |
9c8d86db JB |
473 | trans->block_rsv = rsv; |
474 | ||
8929ecfa YZ |
475 | return should_end_transaction(trans, root); |
476 | } | |
477 | ||
89ce8a63 | 478 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
0af3d00b | 479 | struct btrfs_root *root, int throttle, int lock) |
79154b1b | 480 | { |
8929ecfa | 481 | struct btrfs_transaction *cur_trans = trans->transaction; |
ab78c84d | 482 | struct btrfs_fs_info *info = root->fs_info; |
c3e69d58 CM |
483 | int count = 0; |
484 | ||
2a1eb461 JB |
485 | if (--trans->use_count) { |
486 | trans->block_rsv = trans->orig_rsv; | |
487 | return 0; | |
488 | } | |
489 | ||
b24e03db | 490 | btrfs_trans_release_metadata(trans, root); |
4c13d758 | 491 | trans->block_rsv = NULL; |
203bf287 | 492 | while (count < 2) { |
c3e69d58 CM |
493 | unsigned long cur = trans->delayed_ref_updates; |
494 | trans->delayed_ref_updates = 0; | |
495 | if (cur && | |
496 | trans->transaction->delayed_refs.num_heads_ready > 64) { | |
497 | trans->delayed_ref_updates = 0; | |
498 | btrfs_run_delayed_refs(trans, root, cur); | |
499 | } else { | |
500 | break; | |
501 | } | |
502 | count++; | |
56bec294 CM |
503 | } |
504 | ||
a4abeea4 JB |
505 | if (lock && !atomic_read(&root->fs_info->open_ioctl_trans) && |
506 | should_end_transaction(trans, root)) { | |
8929ecfa | 507 | trans->transaction->blocked = 1; |
a4abeea4 JB |
508 | smp_wmb(); |
509 | } | |
8929ecfa | 510 | |
0af3d00b | 511 | if (lock && cur_trans->blocked && !cur_trans->in_commit) { |
81317fde JB |
512 | if (throttle) { |
513 | /* | |
514 | * We may race with somebody else here so end up having | |
515 | * to call end_transaction on ourselves again, so inc | |
516 | * our use_count. | |
517 | */ | |
518 | trans->use_count++; | |
8929ecfa | 519 | return btrfs_commit_transaction(trans, root); |
81317fde | 520 | } else { |
8929ecfa | 521 | wake_up_process(info->transaction_kthread); |
81317fde | 522 | } |
8929ecfa YZ |
523 | } |
524 | ||
8929ecfa | 525 | WARN_ON(cur_trans != info->running_transaction); |
13c5a93e JB |
526 | WARN_ON(atomic_read(&cur_trans->num_writers) < 1); |
527 | atomic_dec(&cur_trans->num_writers); | |
89ce8a63 | 528 | |
99d16cbc | 529 | smp_mb(); |
79154b1b CM |
530 | if (waitqueue_active(&cur_trans->writer_wait)) |
531 | wake_up(&cur_trans->writer_wait); | |
79154b1b | 532 | put_transaction(cur_trans); |
9ed74f2d JB |
533 | |
534 | if (current->journal_info == trans) | |
535 | current->journal_info = NULL; | |
d6025579 | 536 | memset(trans, 0, sizeof(*trans)); |
2c90e5d6 | 537 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
ab78c84d | 538 | |
24bbcf04 YZ |
539 | if (throttle) |
540 | btrfs_run_delayed_iputs(root); | |
541 | ||
49b25e05 JM |
542 | if (trans->aborted || |
543 | root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) { | |
544 | return -EIO; | |
545 | } | |
546 | ||
79154b1b CM |
547 | return 0; |
548 | } | |
549 | ||
89ce8a63 CM |
550 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, |
551 | struct btrfs_root *root) | |
552 | { | |
16cdcec7 MX |
553 | int ret; |
554 | ||
555 | ret = __btrfs_end_transaction(trans, root, 0, 1); | |
556 | if (ret) | |
557 | return ret; | |
558 | return 0; | |
89ce8a63 CM |
559 | } |
560 | ||
561 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans, | |
562 | struct btrfs_root *root) | |
563 | { | |
16cdcec7 MX |
564 | int ret; |
565 | ||
566 | ret = __btrfs_end_transaction(trans, root, 1, 1); | |
567 | if (ret) | |
568 | return ret; | |
569 | return 0; | |
0af3d00b JB |
570 | } |
571 | ||
572 | int btrfs_end_transaction_nolock(struct btrfs_trans_handle *trans, | |
573 | struct btrfs_root *root) | |
574 | { | |
16cdcec7 MX |
575 | int ret; |
576 | ||
577 | ret = __btrfs_end_transaction(trans, root, 0, 0); | |
578 | if (ret) | |
579 | return ret; | |
580 | return 0; | |
581 | } | |
582 | ||
583 | int btrfs_end_transaction_dmeta(struct btrfs_trans_handle *trans, | |
584 | struct btrfs_root *root) | |
585 | { | |
586 | return __btrfs_end_transaction(trans, root, 1, 1); | |
89ce8a63 CM |
587 | } |
588 | ||
d352ac68 CM |
589 | /* |
590 | * when btree blocks are allocated, they have some corresponding bits set for | |
591 | * them in one of two extent_io trees. This is used to make sure all of | |
690587d1 | 592 | * those extents are sent to disk but does not wait on them |
d352ac68 | 593 | */ |
690587d1 | 594 | int btrfs_write_marked_extents(struct btrfs_root *root, |
8cef4e16 | 595 | struct extent_io_tree *dirty_pages, int mark) |
79154b1b | 596 | { |
777e6bd7 | 597 | int err = 0; |
7c4452b9 | 598 | int werr = 0; |
1728366e | 599 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; |
777e6bd7 | 600 | u64 start = 0; |
5f39d397 | 601 | u64 end; |
7c4452b9 | 602 | |
1728366e JB |
603 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
604 | mark)) { | |
605 | convert_extent_bit(dirty_pages, start, end, EXTENT_NEED_WAIT, mark, | |
606 | GFP_NOFS); | |
607 | err = filemap_fdatawrite_range(mapping, start, end); | |
608 | if (err) | |
609 | werr = err; | |
610 | cond_resched(); | |
611 | start = end + 1; | |
7c4452b9 | 612 | } |
690587d1 CM |
613 | if (err) |
614 | werr = err; | |
615 | return werr; | |
616 | } | |
617 | ||
618 | /* | |
619 | * when btree blocks are allocated, they have some corresponding bits set for | |
620 | * them in one of two extent_io trees. This is used to make sure all of | |
621 | * those extents are on disk for transaction or log commit. We wait | |
622 | * on all the pages and clear them from the dirty pages state tree | |
623 | */ | |
624 | int btrfs_wait_marked_extents(struct btrfs_root *root, | |
8cef4e16 | 625 | struct extent_io_tree *dirty_pages, int mark) |
690587d1 | 626 | { |
690587d1 CM |
627 | int err = 0; |
628 | int werr = 0; | |
1728366e | 629 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; |
690587d1 CM |
630 | u64 start = 0; |
631 | u64 end; | |
777e6bd7 | 632 | |
1728366e JB |
633 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
634 | EXTENT_NEED_WAIT)) { | |
635 | clear_extent_bits(dirty_pages, start, end, EXTENT_NEED_WAIT, GFP_NOFS); | |
636 | err = filemap_fdatawait_range(mapping, start, end); | |
637 | if (err) | |
638 | werr = err; | |
639 | cond_resched(); | |
640 | start = end + 1; | |
777e6bd7 | 641 | } |
7c4452b9 CM |
642 | if (err) |
643 | werr = err; | |
644 | return werr; | |
79154b1b CM |
645 | } |
646 | ||
690587d1 CM |
647 | /* |
648 | * when btree blocks are allocated, they have some corresponding bits set for | |
649 | * them in one of two extent_io trees. This is used to make sure all of | |
650 | * those extents are on disk for transaction or log commit | |
651 | */ | |
652 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | |
8cef4e16 | 653 | struct extent_io_tree *dirty_pages, int mark) |
690587d1 CM |
654 | { |
655 | int ret; | |
656 | int ret2; | |
657 | ||
8cef4e16 YZ |
658 | ret = btrfs_write_marked_extents(root, dirty_pages, mark); |
659 | ret2 = btrfs_wait_marked_extents(root, dirty_pages, mark); | |
bf0da8c1 CM |
660 | |
661 | if (ret) | |
662 | return ret; | |
663 | if (ret2) | |
664 | return ret2; | |
665 | return 0; | |
690587d1 CM |
666 | } |
667 | ||
d0c803c4 CM |
668 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, |
669 | struct btrfs_root *root) | |
670 | { | |
671 | if (!trans || !trans->transaction) { | |
672 | struct inode *btree_inode; | |
673 | btree_inode = root->fs_info->btree_inode; | |
674 | return filemap_write_and_wait(btree_inode->i_mapping); | |
675 | } | |
676 | return btrfs_write_and_wait_marked_extents(root, | |
8cef4e16 YZ |
677 | &trans->transaction->dirty_pages, |
678 | EXTENT_DIRTY); | |
d0c803c4 CM |
679 | } |
680 | ||
d352ac68 CM |
681 | /* |
682 | * this is used to update the root pointer in the tree of tree roots. | |
683 | * | |
684 | * But, in the case of the extent allocation tree, updating the root | |
685 | * pointer may allocate blocks which may change the root of the extent | |
686 | * allocation tree. | |
687 | * | |
688 | * So, this loops and repeats and makes sure the cowonly root didn't | |
689 | * change while the root pointer was being updated in the metadata. | |
690 | */ | |
0b86a832 CM |
691 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
692 | struct btrfs_root *root) | |
79154b1b CM |
693 | { |
694 | int ret; | |
0b86a832 | 695 | u64 old_root_bytenr; |
86b9f2ec | 696 | u64 old_root_used; |
0b86a832 | 697 | struct btrfs_root *tree_root = root->fs_info->tree_root; |
79154b1b | 698 | |
86b9f2ec | 699 | old_root_used = btrfs_root_used(&root->root_item); |
0b86a832 | 700 | btrfs_write_dirty_block_groups(trans, root); |
56bec294 | 701 | |
d397712b | 702 | while (1) { |
0b86a832 | 703 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
86b9f2ec YZ |
704 | if (old_root_bytenr == root->node->start && |
705 | old_root_used == btrfs_root_used(&root->root_item)) | |
79154b1b | 706 | break; |
87ef2bb4 | 707 | |
5d4f98a2 | 708 | btrfs_set_root_node(&root->root_item, root->node); |
79154b1b | 709 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
710 | &root->root_key, |
711 | &root->root_item); | |
49b25e05 JM |
712 | if (ret) |
713 | return ret; | |
56bec294 | 714 | |
86b9f2ec | 715 | old_root_used = btrfs_root_used(&root->root_item); |
4a8c9a62 | 716 | ret = btrfs_write_dirty_block_groups(trans, root); |
49b25e05 JM |
717 | if (ret) |
718 | return ret; | |
0b86a832 | 719 | } |
276e680d YZ |
720 | |
721 | if (root != root->fs_info->extent_root) | |
722 | switch_commit_root(root); | |
723 | ||
0b86a832 CM |
724 | return 0; |
725 | } | |
726 | ||
d352ac68 CM |
727 | /* |
728 | * update all the cowonly tree roots on disk | |
49b25e05 JM |
729 | * |
730 | * The error handling in this function may not be obvious. Any of the | |
731 | * failures will cause the file system to go offline. We still need | |
732 | * to clean up the delayed refs. | |
d352ac68 | 733 | */ |
5d4f98a2 YZ |
734 | static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans, |
735 | struct btrfs_root *root) | |
0b86a832 CM |
736 | { |
737 | struct btrfs_fs_info *fs_info = root->fs_info; | |
738 | struct list_head *next; | |
84234f3a | 739 | struct extent_buffer *eb; |
56bec294 | 740 | int ret; |
84234f3a | 741 | |
56bec294 | 742 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
743 | if (ret) |
744 | return ret; | |
87ef2bb4 | 745 | |
84234f3a | 746 | eb = btrfs_lock_root_node(fs_info->tree_root); |
49b25e05 JM |
747 | ret = btrfs_cow_block(trans, fs_info->tree_root, eb, NULL, |
748 | 0, &eb); | |
84234f3a YZ |
749 | btrfs_tree_unlock(eb); |
750 | free_extent_buffer(eb); | |
0b86a832 | 751 | |
49b25e05 JM |
752 | if (ret) |
753 | return ret; | |
754 | ||
56bec294 | 755 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
756 | if (ret) |
757 | return ret; | |
87ef2bb4 | 758 | |
d397712b | 759 | while (!list_empty(&fs_info->dirty_cowonly_roots)) { |
0b86a832 CM |
760 | next = fs_info->dirty_cowonly_roots.next; |
761 | list_del_init(next); | |
762 | root = list_entry(next, struct btrfs_root, dirty_list); | |
87ef2bb4 | 763 | |
49b25e05 JM |
764 | ret = update_cowonly_root(trans, root); |
765 | if (ret) | |
766 | return ret; | |
79154b1b | 767 | } |
276e680d YZ |
768 | |
769 | down_write(&fs_info->extent_commit_sem); | |
770 | switch_commit_root(fs_info->extent_root); | |
771 | up_write(&fs_info->extent_commit_sem); | |
772 | ||
79154b1b CM |
773 | return 0; |
774 | } | |
775 | ||
d352ac68 CM |
776 | /* |
777 | * dead roots are old snapshots that need to be deleted. This allocates | |
778 | * a dirty root struct and adds it into the list of dead roots that need to | |
779 | * be deleted | |
780 | */ | |
5d4f98a2 | 781 | int btrfs_add_dead_root(struct btrfs_root *root) |
5eda7b5e | 782 | { |
a4abeea4 | 783 | spin_lock(&root->fs_info->trans_lock); |
5d4f98a2 | 784 | list_add(&root->root_list, &root->fs_info->dead_roots); |
a4abeea4 | 785 | spin_unlock(&root->fs_info->trans_lock); |
5eda7b5e CM |
786 | return 0; |
787 | } | |
788 | ||
d352ac68 | 789 | /* |
5d4f98a2 | 790 | * update all the cowonly tree roots on disk |
d352ac68 | 791 | */ |
5d4f98a2 YZ |
792 | static noinline int commit_fs_roots(struct btrfs_trans_handle *trans, |
793 | struct btrfs_root *root) | |
0f7d52f4 | 794 | { |
0f7d52f4 | 795 | struct btrfs_root *gang[8]; |
5d4f98a2 | 796 | struct btrfs_fs_info *fs_info = root->fs_info; |
0f7d52f4 CM |
797 | int i; |
798 | int ret; | |
54aa1f4d CM |
799 | int err = 0; |
800 | ||
a4abeea4 | 801 | spin_lock(&fs_info->fs_roots_radix_lock); |
d397712b | 802 | while (1) { |
5d4f98a2 YZ |
803 | ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix, |
804 | (void **)gang, 0, | |
0f7d52f4 CM |
805 | ARRAY_SIZE(gang), |
806 | BTRFS_ROOT_TRANS_TAG); | |
807 | if (ret == 0) | |
808 | break; | |
809 | for (i = 0; i < ret; i++) { | |
810 | root = gang[i]; | |
5d4f98a2 YZ |
811 | radix_tree_tag_clear(&fs_info->fs_roots_radix, |
812 | (unsigned long)root->root_key.objectid, | |
813 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 814 | spin_unlock(&fs_info->fs_roots_radix_lock); |
31153d81 | 815 | |
e02119d5 | 816 | btrfs_free_log(trans, root); |
5d4f98a2 | 817 | btrfs_update_reloc_root(trans, root); |
d68fc57b | 818 | btrfs_orphan_commit_root(trans, root); |
bcc63abb | 819 | |
82d5902d LZ |
820 | btrfs_save_ino_cache(root, trans); |
821 | ||
f1ebcc74 LB |
822 | /* see comments in should_cow_block() */ |
823 | root->force_cow = 0; | |
824 | smp_wmb(); | |
825 | ||
978d910d | 826 | if (root->commit_root != root->node) { |
581bb050 | 827 | mutex_lock(&root->fs_commit_mutex); |
817d52f8 | 828 | switch_commit_root(root); |
581bb050 LZ |
829 | btrfs_unpin_free_ino(root); |
830 | mutex_unlock(&root->fs_commit_mutex); | |
831 | ||
978d910d YZ |
832 | btrfs_set_root_node(&root->root_item, |
833 | root->node); | |
834 | } | |
5d4f98a2 | 835 | |
5d4f98a2 | 836 | err = btrfs_update_root(trans, fs_info->tree_root, |
0f7d52f4 CM |
837 | &root->root_key, |
838 | &root->root_item); | |
a4abeea4 | 839 | spin_lock(&fs_info->fs_roots_radix_lock); |
54aa1f4d CM |
840 | if (err) |
841 | break; | |
0f7d52f4 CM |
842 | } |
843 | } | |
a4abeea4 | 844 | spin_unlock(&fs_info->fs_roots_radix_lock); |
54aa1f4d | 845 | return err; |
0f7d52f4 CM |
846 | } |
847 | ||
d352ac68 CM |
848 | /* |
849 | * defrag a given btree. If cacheonly == 1, this won't read from the disk, | |
850 | * otherwise every leaf in the btree is read and defragged. | |
851 | */ | |
e9d0b13b CM |
852 | int btrfs_defrag_root(struct btrfs_root *root, int cacheonly) |
853 | { | |
854 | struct btrfs_fs_info *info = root->fs_info; | |
e9d0b13b | 855 | struct btrfs_trans_handle *trans; |
8929ecfa | 856 | int ret; |
d3c2fdcf | 857 | unsigned long nr; |
e9d0b13b | 858 | |
8929ecfa | 859 | if (xchg(&root->defrag_running, 1)) |
e9d0b13b | 860 | return 0; |
8929ecfa | 861 | |
6b80053d | 862 | while (1) { |
8929ecfa YZ |
863 | trans = btrfs_start_transaction(root, 0); |
864 | if (IS_ERR(trans)) | |
865 | return PTR_ERR(trans); | |
866 | ||
e9d0b13b | 867 | ret = btrfs_defrag_leaves(trans, root, cacheonly); |
8929ecfa | 868 | |
d3c2fdcf | 869 | nr = trans->blocks_used; |
e9d0b13b | 870 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 871 | btrfs_btree_balance_dirty(info->tree_root, nr); |
e9d0b13b CM |
872 | cond_resched(); |
873 | ||
7841cb28 | 874 | if (btrfs_fs_closing(root->fs_info) || ret != -EAGAIN) |
e9d0b13b CM |
875 | break; |
876 | } | |
877 | root->defrag_running = 0; | |
8929ecfa | 878 | return ret; |
e9d0b13b CM |
879 | } |
880 | ||
d352ac68 CM |
881 | /* |
882 | * new snapshots need to be created at a very specific time in the | |
883 | * transaction commit. This does the actual creation | |
884 | */ | |
80b6794d | 885 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
886 | struct btrfs_fs_info *fs_info, |
887 | struct btrfs_pending_snapshot *pending) | |
888 | { | |
889 | struct btrfs_key key; | |
80b6794d | 890 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
891 | struct btrfs_root *tree_root = fs_info->tree_root; |
892 | struct btrfs_root *root = pending->root; | |
6bdb72de | 893 | struct btrfs_root *parent_root; |
98c9942a | 894 | struct btrfs_block_rsv *rsv; |
6bdb72de | 895 | struct inode *parent_inode; |
6a912213 | 896 | struct dentry *parent; |
a22285a6 | 897 | struct dentry *dentry; |
3063d29f | 898 | struct extent_buffer *tmp; |
925baedd | 899 | struct extent_buffer *old; |
3063d29f | 900 | int ret; |
d68fc57b | 901 | u64 to_reserve = 0; |
6bdb72de | 902 | u64 index = 0; |
a22285a6 | 903 | u64 objectid; |
b83cc969 | 904 | u64 root_flags; |
3063d29f | 905 | |
98c9942a LB |
906 | rsv = trans->block_rsv; |
907 | ||
80b6794d CM |
908 | new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS); |
909 | if (!new_root_item) { | |
49b25e05 | 910 | ret = pending->error = -ENOMEM; |
80b6794d CM |
911 | goto fail; |
912 | } | |
a22285a6 | 913 | |
581bb050 | 914 | ret = btrfs_find_free_objectid(tree_root, &objectid); |
a22285a6 YZ |
915 | if (ret) { |
916 | pending->error = ret; | |
3063d29f | 917 | goto fail; |
a22285a6 | 918 | } |
3063d29f | 919 | |
3fd0a558 | 920 | btrfs_reloc_pre_snapshot(trans, pending, &to_reserve); |
d68fc57b YZ |
921 | |
922 | if (to_reserve > 0) { | |
62f30c54 MX |
923 | ret = btrfs_block_rsv_add_noflush(root, &pending->block_rsv, |
924 | to_reserve); | |
d68fc57b YZ |
925 | if (ret) { |
926 | pending->error = ret; | |
927 | goto fail; | |
928 | } | |
929 | } | |
930 | ||
3063d29f | 931 | key.objectid = objectid; |
a22285a6 YZ |
932 | key.offset = (u64)-1; |
933 | key.type = BTRFS_ROOT_ITEM_KEY; | |
3063d29f | 934 | |
a22285a6 | 935 | trans->block_rsv = &pending->block_rsv; |
3de4586c | 936 | |
a22285a6 | 937 | dentry = pending->dentry; |
6a912213 JB |
938 | parent = dget_parent(dentry); |
939 | parent_inode = parent->d_inode; | |
a22285a6 | 940 | parent_root = BTRFS_I(parent_inode)->root; |
7585717f | 941 | record_root_in_trans(trans, parent_root); |
a22285a6 | 942 | |
3063d29f CM |
943 | /* |
944 | * insert the directory item | |
945 | */ | |
3de4586c | 946 | ret = btrfs_set_inode_index(parent_inode, &index); |
49b25e05 | 947 | BUG_ON(ret); /* -ENOMEM */ |
0660b5af | 948 | ret = btrfs_insert_dir_item(trans, parent_root, |
a22285a6 | 949 | dentry->d_name.name, dentry->d_name.len, |
16cdcec7 | 950 | parent_inode, &key, |
a22285a6 | 951 | BTRFS_FT_DIR, index); |
fe66a05a CM |
952 | if (ret) { |
953 | pending->error = -EEXIST; | |
954 | dput(parent); | |
955 | goto fail; | |
49b25e05 JM |
956 | } else if (ret) |
957 | goto abort_trans; | |
0660b5af | 958 | |
a22285a6 YZ |
959 | btrfs_i_size_write(parent_inode, parent_inode->i_size + |
960 | dentry->d_name.len * 2); | |
52c26179 | 961 | ret = btrfs_update_inode(trans, parent_root, parent_inode); |
49b25e05 JM |
962 | if (ret) |
963 | goto abort_trans; | |
52c26179 | 964 | |
e999376f CM |
965 | /* |
966 | * pull in the delayed directory update | |
967 | * and the delayed inode item | |
968 | * otherwise we corrupt the FS during | |
969 | * snapshot | |
970 | */ | |
971 | ret = btrfs_run_delayed_items(trans, root); | |
49b25e05 JM |
972 | if (ret) /* Transaction aborted */ |
973 | goto fail; | |
e999376f | 974 | |
7585717f | 975 | record_root_in_trans(trans, root); |
6bdb72de SW |
976 | btrfs_set_root_last_snapshot(&root->root_item, trans->transid); |
977 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); | |
08fe4db1 | 978 | btrfs_check_and_init_root_item(new_root_item); |
6bdb72de | 979 | |
b83cc969 LZ |
980 | root_flags = btrfs_root_flags(new_root_item); |
981 | if (pending->readonly) | |
982 | root_flags |= BTRFS_ROOT_SUBVOL_RDONLY; | |
983 | else | |
984 | root_flags &= ~BTRFS_ROOT_SUBVOL_RDONLY; | |
985 | btrfs_set_root_flags(new_root_item, root_flags); | |
986 | ||
6bdb72de | 987 | old = btrfs_lock_root_node(root); |
49b25e05 JM |
988 | ret = btrfs_cow_block(trans, root, old, NULL, 0, &old); |
989 | if (ret) | |
990 | goto abort_trans; | |
991 | ||
6bdb72de SW |
992 | btrfs_set_lock_blocking(old); |
993 | ||
49b25e05 JM |
994 | ret = btrfs_copy_root(trans, root, old, &tmp, objectid); |
995 | if (ret) | |
996 | goto abort_trans; | |
997 | ||
6bdb72de SW |
998 | btrfs_tree_unlock(old); |
999 | free_extent_buffer(old); | |
1000 | ||
f1ebcc74 LB |
1001 | /* see comments in should_cow_block() */ |
1002 | root->force_cow = 1; | |
1003 | smp_wmb(); | |
1004 | ||
6bdb72de | 1005 | btrfs_set_root_node(new_root_item, tmp); |
a22285a6 YZ |
1006 | /* record when the snapshot was created in key.offset */ |
1007 | key.offset = trans->transid; | |
1008 | ret = btrfs_insert_root(trans, tree_root, &key, new_root_item); | |
6bdb72de SW |
1009 | btrfs_tree_unlock(tmp); |
1010 | free_extent_buffer(tmp); | |
49b25e05 JM |
1011 | if (ret) |
1012 | goto abort_trans; | |
6bdb72de | 1013 | |
a22285a6 YZ |
1014 | /* |
1015 | * insert root back/forward references | |
1016 | */ | |
1017 | ret = btrfs_add_root_ref(trans, tree_root, objectid, | |
0660b5af | 1018 | parent_root->root_key.objectid, |
33345d01 | 1019 | btrfs_ino(parent_inode), index, |
a22285a6 | 1020 | dentry->d_name.name, dentry->d_name.len); |
49b25e05 JM |
1021 | if (ret) |
1022 | goto fail; | |
6a912213 | 1023 | dput(parent); |
0660b5af | 1024 | |
a22285a6 YZ |
1025 | key.offset = (u64)-1; |
1026 | pending->snap = btrfs_read_fs_root_no_name(root->fs_info, &key); | |
49b25e05 JM |
1027 | if (IS_ERR(pending->snap)) |
1028 | goto abort_trans; | |
d68fc57b | 1029 | |
49b25e05 JM |
1030 | ret = btrfs_reloc_post_snapshot(trans, pending); |
1031 | if (ret) | |
1032 | goto abort_trans; | |
1033 | ret = 0; | |
3063d29f | 1034 | fail: |
6bdb72de | 1035 | kfree(new_root_item); |
98c9942a | 1036 | trans->block_rsv = rsv; |
a22285a6 | 1037 | btrfs_block_rsv_release(root, &pending->block_rsv, (u64)-1); |
49b25e05 JM |
1038 | return ret; |
1039 | ||
1040 | abort_trans: | |
1041 | btrfs_abort_transaction(trans, root, ret); | |
1042 | goto fail; | |
3063d29f CM |
1043 | } |
1044 | ||
d352ac68 CM |
1045 | /* |
1046 | * create all the snapshots we've scheduled for creation | |
1047 | */ | |
80b6794d CM |
1048 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans, |
1049 | struct btrfs_fs_info *fs_info) | |
3de4586c CM |
1050 | { |
1051 | struct btrfs_pending_snapshot *pending; | |
1052 | struct list_head *head = &trans->transaction->pending_snapshots; | |
3de4586c | 1053 | |
fe66a05a CM |
1054 | list_for_each_entry(pending, head, list) |
1055 | create_pending_snapshot(trans, fs_info, pending); | |
3de4586c CM |
1056 | return 0; |
1057 | } | |
1058 | ||
5d4f98a2 YZ |
1059 | static void update_super_roots(struct btrfs_root *root) |
1060 | { | |
1061 | struct btrfs_root_item *root_item; | |
1062 | struct btrfs_super_block *super; | |
1063 | ||
6c41761f | 1064 | super = root->fs_info->super_copy; |
5d4f98a2 YZ |
1065 | |
1066 | root_item = &root->fs_info->chunk_root->root_item; | |
1067 | super->chunk_root = root_item->bytenr; | |
1068 | super->chunk_root_generation = root_item->generation; | |
1069 | super->chunk_root_level = root_item->level; | |
1070 | ||
1071 | root_item = &root->fs_info->tree_root->root_item; | |
1072 | super->root = root_item->bytenr; | |
1073 | super->generation = root_item->generation; | |
1074 | super->root_level = root_item->level; | |
73bc1876 | 1075 | if (btrfs_test_opt(root, SPACE_CACHE)) |
0af3d00b | 1076 | super->cache_generation = root_item->generation; |
5d4f98a2 YZ |
1077 | } |
1078 | ||
f36f3042 CM |
1079 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info) |
1080 | { | |
1081 | int ret = 0; | |
a4abeea4 | 1082 | spin_lock(&info->trans_lock); |
f36f3042 CM |
1083 | if (info->running_transaction) |
1084 | ret = info->running_transaction->in_commit; | |
a4abeea4 | 1085 | spin_unlock(&info->trans_lock); |
f36f3042 CM |
1086 | return ret; |
1087 | } | |
1088 | ||
8929ecfa YZ |
1089 | int btrfs_transaction_blocked(struct btrfs_fs_info *info) |
1090 | { | |
1091 | int ret = 0; | |
a4abeea4 | 1092 | spin_lock(&info->trans_lock); |
8929ecfa YZ |
1093 | if (info->running_transaction) |
1094 | ret = info->running_transaction->blocked; | |
a4abeea4 | 1095 | spin_unlock(&info->trans_lock); |
8929ecfa YZ |
1096 | return ret; |
1097 | } | |
1098 | ||
bb9c12c9 SW |
1099 | /* |
1100 | * wait for the current transaction commit to start and block subsequent | |
1101 | * transaction joins | |
1102 | */ | |
1103 | static void wait_current_trans_commit_start(struct btrfs_root *root, | |
1104 | struct btrfs_transaction *trans) | |
1105 | { | |
72d63ed6 | 1106 | wait_event(root->fs_info->transaction_blocked_wait, trans->in_commit); |
bb9c12c9 SW |
1107 | } |
1108 | ||
1109 | /* | |
1110 | * wait for the current transaction to start and then become unblocked. | |
1111 | * caller holds ref. | |
1112 | */ | |
1113 | static void wait_current_trans_commit_start_and_unblock(struct btrfs_root *root, | |
1114 | struct btrfs_transaction *trans) | |
1115 | { | |
72d63ed6 LZ |
1116 | wait_event(root->fs_info->transaction_wait, |
1117 | trans->commit_done || (trans->in_commit && !trans->blocked)); | |
bb9c12c9 SW |
1118 | } |
1119 | ||
1120 | /* | |
1121 | * commit transactions asynchronously. once btrfs_commit_transaction_async | |
1122 | * returns, any subsequent transaction will not be allowed to join. | |
1123 | */ | |
1124 | struct btrfs_async_commit { | |
1125 | struct btrfs_trans_handle *newtrans; | |
1126 | struct btrfs_root *root; | |
1127 | struct delayed_work work; | |
1128 | }; | |
1129 | ||
1130 | static void do_async_commit(struct work_struct *work) | |
1131 | { | |
1132 | struct btrfs_async_commit *ac = | |
1133 | container_of(work, struct btrfs_async_commit, work.work); | |
1134 | ||
1135 | btrfs_commit_transaction(ac->newtrans, ac->root); | |
1136 | kfree(ac); | |
1137 | } | |
1138 | ||
1139 | int btrfs_commit_transaction_async(struct btrfs_trans_handle *trans, | |
1140 | struct btrfs_root *root, | |
1141 | int wait_for_unblock) | |
1142 | { | |
1143 | struct btrfs_async_commit *ac; | |
1144 | struct btrfs_transaction *cur_trans; | |
1145 | ||
1146 | ac = kmalloc(sizeof(*ac), GFP_NOFS); | |
db5b493a TI |
1147 | if (!ac) |
1148 | return -ENOMEM; | |
bb9c12c9 SW |
1149 | |
1150 | INIT_DELAYED_WORK(&ac->work, do_async_commit); | |
1151 | ac->root = root; | |
7a7eaa40 | 1152 | ac->newtrans = btrfs_join_transaction(root); |
3612b495 TI |
1153 | if (IS_ERR(ac->newtrans)) { |
1154 | int err = PTR_ERR(ac->newtrans); | |
1155 | kfree(ac); | |
1156 | return err; | |
1157 | } | |
bb9c12c9 SW |
1158 | |
1159 | /* take transaction reference */ | |
bb9c12c9 | 1160 | cur_trans = trans->transaction; |
13c5a93e | 1161 | atomic_inc(&cur_trans->use_count); |
bb9c12c9 SW |
1162 | |
1163 | btrfs_end_transaction(trans, root); | |
1164 | schedule_delayed_work(&ac->work, 0); | |
1165 | ||
1166 | /* wait for transaction to start and unblock */ | |
bb9c12c9 SW |
1167 | if (wait_for_unblock) |
1168 | wait_current_trans_commit_start_and_unblock(root, cur_trans); | |
1169 | else | |
1170 | wait_current_trans_commit_start(root, cur_trans); | |
bb9c12c9 | 1171 | |
38e88054 SW |
1172 | if (current->journal_info == trans) |
1173 | current->journal_info = NULL; | |
1174 | ||
1175 | put_transaction(cur_trans); | |
bb9c12c9 SW |
1176 | return 0; |
1177 | } | |
1178 | ||
49b25e05 JM |
1179 | |
1180 | static void cleanup_transaction(struct btrfs_trans_handle *trans, | |
1181 | struct btrfs_root *root) | |
1182 | { | |
1183 | struct btrfs_transaction *cur_trans = trans->transaction; | |
1184 | ||
1185 | WARN_ON(trans->use_count > 1); | |
1186 | ||
1187 | spin_lock(&root->fs_info->trans_lock); | |
1188 | list_del_init(&cur_trans->list); | |
1189 | spin_unlock(&root->fs_info->trans_lock); | |
1190 | ||
1191 | btrfs_cleanup_one_transaction(trans->transaction, root); | |
1192 | ||
1193 | put_transaction(cur_trans); | |
1194 | put_transaction(cur_trans); | |
1195 | ||
1196 | trace_btrfs_transaction_commit(root); | |
1197 | ||
1198 | btrfs_scrub_continue(root); | |
1199 | ||
1200 | if (current->journal_info == trans) | |
1201 | current->journal_info = NULL; | |
1202 | ||
1203 | kmem_cache_free(btrfs_trans_handle_cachep, trans); | |
1204 | } | |
1205 | ||
bb9c12c9 SW |
1206 | /* |
1207 | * btrfs_transaction state sequence: | |
1208 | * in_commit = 0, blocked = 0 (initial) | |
1209 | * in_commit = 1, blocked = 1 | |
1210 | * blocked = 0 | |
1211 | * commit_done = 1 | |
1212 | */ | |
79154b1b CM |
1213 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans, |
1214 | struct btrfs_root *root) | |
1215 | { | |
15ee9bc7 | 1216 | unsigned long joined = 0; |
49b25e05 | 1217 | struct btrfs_transaction *cur_trans = trans->transaction; |
8fd17795 | 1218 | struct btrfs_transaction *prev_trans = NULL; |
79154b1b | 1219 | DEFINE_WAIT(wait); |
49b25e05 | 1220 | int ret = -EIO; |
89573b9c CM |
1221 | int should_grow = 0; |
1222 | unsigned long now = get_seconds(); | |
dccae999 | 1223 | int flush_on_commit = btrfs_test_opt(root, FLUSHONCOMMIT); |
79154b1b | 1224 | |
5a3f23d5 CM |
1225 | btrfs_run_ordered_operations(root, 0); |
1226 | ||
b24e03db | 1227 | btrfs_trans_release_metadata(trans, root); |
9c8d86db JB |
1228 | trans->block_rsv = NULL; |
1229 | ||
49b25e05 JM |
1230 | if (cur_trans->aborted) |
1231 | goto cleanup_transaction; | |
1232 | ||
56bec294 CM |
1233 | /* make a pass through all the delayed refs we have so far |
1234 | * any runnings procs may add more while we are here | |
1235 | */ | |
1236 | ret = btrfs_run_delayed_refs(trans, root, 0); | |
49b25e05 JM |
1237 | if (ret) |
1238 | goto cleanup_transaction; | |
56bec294 | 1239 | |
b7ec40d7 | 1240 | cur_trans = trans->transaction; |
49b25e05 | 1241 | |
56bec294 CM |
1242 | /* |
1243 | * set the flushing flag so procs in this transaction have to | |
1244 | * start sending their work down. | |
1245 | */ | |
b7ec40d7 | 1246 | cur_trans->delayed_refs.flushing = 1; |
56bec294 | 1247 | |
c3e69d58 | 1248 | ret = btrfs_run_delayed_refs(trans, root, 0); |
49b25e05 JM |
1249 | if (ret) |
1250 | goto cleanup_transaction; | |
56bec294 | 1251 | |
a4abeea4 | 1252 | spin_lock(&cur_trans->commit_lock); |
b7ec40d7 | 1253 | if (cur_trans->in_commit) { |
a4abeea4 | 1254 | spin_unlock(&cur_trans->commit_lock); |
13c5a93e | 1255 | atomic_inc(&cur_trans->use_count); |
49b25e05 | 1256 | ret = btrfs_end_transaction(trans, root); |
ccd467d6 | 1257 | |
b9c8300c | 1258 | wait_for_commit(root, cur_trans); |
15ee9bc7 | 1259 | |
79154b1b | 1260 | put_transaction(cur_trans); |
15ee9bc7 | 1261 | |
49b25e05 | 1262 | return ret; |
79154b1b | 1263 | } |
4313b399 | 1264 | |
2c90e5d6 | 1265 | trans->transaction->in_commit = 1; |
f9295749 | 1266 | trans->transaction->blocked = 1; |
a4abeea4 | 1267 | spin_unlock(&cur_trans->commit_lock); |
bb9c12c9 SW |
1268 | wake_up(&root->fs_info->transaction_blocked_wait); |
1269 | ||
a4abeea4 | 1270 | spin_lock(&root->fs_info->trans_lock); |
ccd467d6 CM |
1271 | if (cur_trans->list.prev != &root->fs_info->trans_list) { |
1272 | prev_trans = list_entry(cur_trans->list.prev, | |
1273 | struct btrfs_transaction, list); | |
1274 | if (!prev_trans->commit_done) { | |
13c5a93e | 1275 | atomic_inc(&prev_trans->use_count); |
a4abeea4 | 1276 | spin_unlock(&root->fs_info->trans_lock); |
ccd467d6 CM |
1277 | |
1278 | wait_for_commit(root, prev_trans); | |
ccd467d6 | 1279 | |
15ee9bc7 | 1280 | put_transaction(prev_trans); |
a4abeea4 JB |
1281 | } else { |
1282 | spin_unlock(&root->fs_info->trans_lock); | |
ccd467d6 | 1283 | } |
a4abeea4 JB |
1284 | } else { |
1285 | spin_unlock(&root->fs_info->trans_lock); | |
ccd467d6 | 1286 | } |
15ee9bc7 | 1287 | |
89573b9c CM |
1288 | if (now < cur_trans->start_time || now - cur_trans->start_time < 1) |
1289 | should_grow = 1; | |
1290 | ||
15ee9bc7 | 1291 | do { |
7ea394f1 | 1292 | int snap_pending = 0; |
a4abeea4 | 1293 | |
15ee9bc7 | 1294 | joined = cur_trans->num_joined; |
7ea394f1 YZ |
1295 | if (!list_empty(&trans->transaction->pending_snapshots)) |
1296 | snap_pending = 1; | |
1297 | ||
2c90e5d6 | 1298 | WARN_ON(cur_trans != trans->transaction); |
15ee9bc7 | 1299 | |
0bdb1db2 | 1300 | if (flush_on_commit || snap_pending) { |
24bbcf04 | 1301 | btrfs_start_delalloc_inodes(root, 1); |
143bede5 | 1302 | btrfs_wait_ordered_extents(root, 0, 1); |
7ea394f1 YZ |
1303 | } |
1304 | ||
16cdcec7 | 1305 | ret = btrfs_run_delayed_items(trans, root); |
49b25e05 JM |
1306 | if (ret) |
1307 | goto cleanup_transaction; | |
16cdcec7 | 1308 | |
5a3f23d5 CM |
1309 | /* |
1310 | * rename don't use btrfs_join_transaction, so, once we | |
1311 | * set the transaction to blocked above, we aren't going | |
1312 | * to get any new ordered operations. We can safely run | |
1313 | * it here and no for sure that nothing new will be added | |
1314 | * to the list | |
1315 | */ | |
1316 | btrfs_run_ordered_operations(root, 1); | |
1317 | ||
ed3b3d31 CM |
1318 | prepare_to_wait(&cur_trans->writer_wait, &wait, |
1319 | TASK_UNINTERRUPTIBLE); | |
1320 | ||
13c5a93e | 1321 | if (atomic_read(&cur_trans->num_writers) > 1) |
99d16cbc SW |
1322 | schedule_timeout(MAX_SCHEDULE_TIMEOUT); |
1323 | else if (should_grow) | |
1324 | schedule_timeout(1); | |
15ee9bc7 | 1325 | |
15ee9bc7 | 1326 | finish_wait(&cur_trans->writer_wait, &wait); |
13c5a93e | 1327 | } while (atomic_read(&cur_trans->num_writers) > 1 || |
89573b9c | 1328 | (should_grow && cur_trans->num_joined != joined)); |
15ee9bc7 | 1329 | |
ed0ca140 JB |
1330 | /* |
1331 | * Ok now we need to make sure to block out any other joins while we | |
1332 | * commit the transaction. We could have started a join before setting | |
1333 | * no_join so make sure to wait for num_writers to == 1 again. | |
1334 | */ | |
1335 | spin_lock(&root->fs_info->trans_lock); | |
1336 | root->fs_info->trans_no_join = 1; | |
1337 | spin_unlock(&root->fs_info->trans_lock); | |
1338 | wait_event(cur_trans->writer_wait, | |
1339 | atomic_read(&cur_trans->num_writers) == 1); | |
1340 | ||
7585717f CM |
1341 | /* |
1342 | * the reloc mutex makes sure that we stop | |
1343 | * the balancing code from coming in and moving | |
1344 | * extents around in the middle of the commit | |
1345 | */ | |
1346 | mutex_lock(&root->fs_info->reloc_mutex); | |
1347 | ||
e999376f | 1348 | ret = btrfs_run_delayed_items(trans, root); |
49b25e05 JM |
1349 | if (ret) { |
1350 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1351 | goto cleanup_transaction; | |
1352 | } | |
3063d29f | 1353 | |
e999376f | 1354 | ret = create_pending_snapshots(trans, root->fs_info); |
49b25e05 JM |
1355 | if (ret) { |
1356 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1357 | goto cleanup_transaction; | |
1358 | } | |
16cdcec7 | 1359 | |
56bec294 | 1360 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
1361 | if (ret) { |
1362 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1363 | goto cleanup_transaction; | |
1364 | } | |
56bec294 | 1365 | |
e999376f CM |
1366 | /* |
1367 | * make sure none of the code above managed to slip in a | |
1368 | * delayed item | |
1369 | */ | |
1370 | btrfs_assert_delayed_root_empty(root); | |
1371 | ||
2c90e5d6 | 1372 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 1373 | |
a2de733c | 1374 | btrfs_scrub_pause(root); |
e02119d5 CM |
1375 | /* btrfs_commit_tree_roots is responsible for getting the |
1376 | * various roots consistent with each other. Every pointer | |
1377 | * in the tree of tree roots has to point to the most up to date | |
1378 | * root for every subvolume and other tree. So, we have to keep | |
1379 | * the tree logging code from jumping in and changing any | |
1380 | * of the trees. | |
1381 | * | |
1382 | * At this point in the commit, there can't be any tree-log | |
1383 | * writers, but a little lower down we drop the trans mutex | |
1384 | * and let new people in. By holding the tree_log_mutex | |
1385 | * from now until after the super is written, we avoid races | |
1386 | * with the tree-log code. | |
1387 | */ | |
1388 | mutex_lock(&root->fs_info->tree_log_mutex); | |
1389 | ||
5d4f98a2 | 1390 | ret = commit_fs_roots(trans, root); |
49b25e05 JM |
1391 | if (ret) { |
1392 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1393 | goto cleanup_transaction; | |
1394 | } | |
54aa1f4d | 1395 | |
5d4f98a2 | 1396 | /* commit_fs_roots gets rid of all the tree log roots, it is now |
e02119d5 CM |
1397 | * safe to free the root of tree log roots |
1398 | */ | |
1399 | btrfs_free_log_root_tree(trans, root->fs_info); | |
1400 | ||
5d4f98a2 | 1401 | ret = commit_cowonly_roots(trans, root); |
49b25e05 JM |
1402 | if (ret) { |
1403 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1404 | goto cleanup_transaction; | |
1405 | } | |
54aa1f4d | 1406 | |
11833d66 YZ |
1407 | btrfs_prepare_extent_commit(trans, root); |
1408 | ||
78fae27e | 1409 | cur_trans = root->fs_info->running_transaction; |
5d4f98a2 YZ |
1410 | |
1411 | btrfs_set_root_node(&root->fs_info->tree_root->root_item, | |
1412 | root->fs_info->tree_root->node); | |
817d52f8 | 1413 | switch_commit_root(root->fs_info->tree_root); |
5d4f98a2 YZ |
1414 | |
1415 | btrfs_set_root_node(&root->fs_info->chunk_root->root_item, | |
1416 | root->fs_info->chunk_root->node); | |
817d52f8 | 1417 | switch_commit_root(root->fs_info->chunk_root); |
5d4f98a2 YZ |
1418 | |
1419 | update_super_roots(root); | |
e02119d5 CM |
1420 | |
1421 | if (!root->fs_info->log_root_recovering) { | |
6c41761f DS |
1422 | btrfs_set_super_log_root(root->fs_info->super_copy, 0); |
1423 | btrfs_set_super_log_root_level(root->fs_info->super_copy, 0); | |
e02119d5 CM |
1424 | } |
1425 | ||
6c41761f DS |
1426 | memcpy(root->fs_info->super_for_commit, root->fs_info->super_copy, |
1427 | sizeof(*root->fs_info->super_copy)); | |
ccd467d6 | 1428 | |
f9295749 | 1429 | trans->transaction->blocked = 0; |
a4abeea4 JB |
1430 | spin_lock(&root->fs_info->trans_lock); |
1431 | root->fs_info->running_transaction = NULL; | |
1432 | root->fs_info->trans_no_join = 0; | |
1433 | spin_unlock(&root->fs_info->trans_lock); | |
7585717f | 1434 | mutex_unlock(&root->fs_info->reloc_mutex); |
b7ec40d7 | 1435 | |
f9295749 | 1436 | wake_up(&root->fs_info->transaction_wait); |
e6dcd2dc | 1437 | |
79154b1b | 1438 | ret = btrfs_write_and_wait_transaction(trans, root); |
49b25e05 JM |
1439 | if (ret) { |
1440 | btrfs_error(root->fs_info, ret, | |
1441 | "Error while writing out transaction."); | |
1442 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1443 | goto cleanup_transaction; | |
1444 | } | |
1445 | ||
1446 | ret = write_ctree_super(trans, root, 0); | |
1447 | if (ret) { | |
1448 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1449 | goto cleanup_transaction; | |
1450 | } | |
4313b399 | 1451 | |
e02119d5 CM |
1452 | /* |
1453 | * the super is written, we can safely allow the tree-loggers | |
1454 | * to go about their business | |
1455 | */ | |
1456 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1457 | ||
11833d66 | 1458 | btrfs_finish_extent_commit(trans, root); |
4313b399 | 1459 | |
2c90e5d6 | 1460 | cur_trans->commit_done = 1; |
b7ec40d7 | 1461 | |
15ee9bc7 | 1462 | root->fs_info->last_trans_committed = cur_trans->transid; |
817d52f8 | 1463 | |
2c90e5d6 | 1464 | wake_up(&cur_trans->commit_wait); |
3de4586c | 1465 | |
a4abeea4 | 1466 | spin_lock(&root->fs_info->trans_lock); |
13c5a93e | 1467 | list_del_init(&cur_trans->list); |
a4abeea4 JB |
1468 | spin_unlock(&root->fs_info->trans_lock); |
1469 | ||
78fae27e | 1470 | put_transaction(cur_trans); |
79154b1b | 1471 | put_transaction(cur_trans); |
58176a96 | 1472 | |
1abe9b8a | 1473 | trace_btrfs_transaction_commit(root); |
1474 | ||
a2de733c AJ |
1475 | btrfs_scrub_continue(root); |
1476 | ||
9ed74f2d JB |
1477 | if (current->journal_info == trans) |
1478 | current->journal_info = NULL; | |
1479 | ||
2c90e5d6 | 1480 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
24bbcf04 YZ |
1481 | |
1482 | if (current != root->fs_info->transaction_kthread) | |
1483 | btrfs_run_delayed_iputs(root); | |
1484 | ||
79154b1b | 1485 | return ret; |
49b25e05 JM |
1486 | |
1487 | cleanup_transaction: | |
1488 | btrfs_printk(root->fs_info, "Skipping commit of aborted transaction.\n"); | |
1489 | // WARN_ON(1); | |
1490 | if (current->journal_info == trans) | |
1491 | current->journal_info = NULL; | |
1492 | cleanup_transaction(trans, root); | |
1493 | ||
1494 | return ret; | |
79154b1b CM |
1495 | } |
1496 | ||
d352ac68 CM |
1497 | /* |
1498 | * interface function to delete all the snapshots we have scheduled for deletion | |
1499 | */ | |
e9d0b13b CM |
1500 | int btrfs_clean_old_snapshots(struct btrfs_root *root) |
1501 | { | |
5d4f98a2 YZ |
1502 | LIST_HEAD(list); |
1503 | struct btrfs_fs_info *fs_info = root->fs_info; | |
1504 | ||
a4abeea4 | 1505 | spin_lock(&fs_info->trans_lock); |
5d4f98a2 | 1506 | list_splice_init(&fs_info->dead_roots, &list); |
a4abeea4 | 1507 | spin_unlock(&fs_info->trans_lock); |
e9d0b13b | 1508 | |
5d4f98a2 | 1509 | while (!list_empty(&list)) { |
2c536799 JM |
1510 | int ret; |
1511 | ||
5d4f98a2 | 1512 | root = list_entry(list.next, struct btrfs_root, root_list); |
76dda93c YZ |
1513 | list_del(&root->root_list); |
1514 | ||
16cdcec7 MX |
1515 | btrfs_kill_all_delayed_nodes(root); |
1516 | ||
76dda93c YZ |
1517 | if (btrfs_header_backref_rev(root->node) < |
1518 | BTRFS_MIXED_BACKREF_REV) | |
2c536799 | 1519 | ret = btrfs_drop_snapshot(root, NULL, 0, 0); |
76dda93c | 1520 | else |
2c536799 JM |
1521 | ret =btrfs_drop_snapshot(root, NULL, 1, 0); |
1522 | BUG_ON(ret < 0); | |
e9d0b13b CM |
1523 | } |
1524 | return 0; | |
1525 | } |