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> |
8ea05e3a | 25 | #include <linux/uuid.h> |
79154b1b CM |
26 | #include "ctree.h" |
27 | #include "disk-io.h" | |
28 | #include "transaction.h" | |
925baedd | 29 | #include "locking.h" |
e02119d5 | 30 | #include "tree-log.h" |
581bb050 | 31 | #include "inode-map.h" |
733f4fbb | 32 | #include "volumes.h" |
8dabb742 | 33 | #include "dev-replace.h" |
79154b1b | 34 | |
0f7d52f4 CM |
35 | #define BTRFS_ROOT_TRANS_TAG 0 |
36 | ||
4a9d8bde MX |
37 | static unsigned int btrfs_blocked_trans_types[TRANS_STATE_MAX] = { |
38 | [TRANS_STATE_RUNNING] = 0U, | |
39 | [TRANS_STATE_BLOCKED] = (__TRANS_USERSPACE | | |
40 | __TRANS_START), | |
41 | [TRANS_STATE_COMMIT_START] = (__TRANS_USERSPACE | | |
42 | __TRANS_START | | |
43 | __TRANS_ATTACH), | |
44 | [TRANS_STATE_COMMIT_DOING] = (__TRANS_USERSPACE | | |
45 | __TRANS_START | | |
46 | __TRANS_ATTACH | | |
47 | __TRANS_JOIN), | |
48 | [TRANS_STATE_UNBLOCKED] = (__TRANS_USERSPACE | | |
49 | __TRANS_START | | |
50 | __TRANS_ATTACH | | |
51 | __TRANS_JOIN | | |
52 | __TRANS_JOIN_NOLOCK), | |
53 | [TRANS_STATE_COMPLETED] = (__TRANS_USERSPACE | | |
54 | __TRANS_START | | |
55 | __TRANS_ATTACH | | |
56 | __TRANS_JOIN | | |
57 | __TRANS_JOIN_NOLOCK), | |
58 | }; | |
59 | ||
48a3b636 | 60 | static void put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 61 | { |
13c5a93e JB |
62 | WARN_ON(atomic_read(&transaction->use_count) == 0); |
63 | if (atomic_dec_and_test(&transaction->use_count)) { | |
a4abeea4 | 64 | BUG_ON(!list_empty(&transaction->list)); |
00f04b88 | 65 | WARN_ON(transaction->delayed_refs.root.rb_node); |
6df9a95e JB |
66 | while (!list_empty(&transaction->pending_chunks)) { |
67 | struct extent_map *em; | |
68 | ||
69 | em = list_first_entry(&transaction->pending_chunks, | |
70 | struct extent_map, list); | |
71 | list_del_init(&em->list); | |
72 | free_extent_map(em); | |
73 | } | |
2c90e5d6 | 74 | kmem_cache_free(btrfs_transaction_cachep, transaction); |
78fae27e | 75 | } |
79154b1b CM |
76 | } |
77 | ||
817d52f8 JB |
78 | static noinline void switch_commit_root(struct btrfs_root *root) |
79 | { | |
817d52f8 JB |
80 | free_extent_buffer(root->commit_root); |
81 | root->commit_root = btrfs_root_node(root); | |
817d52f8 JB |
82 | } |
83 | ||
0860adfd MX |
84 | static inline void extwriter_counter_inc(struct btrfs_transaction *trans, |
85 | unsigned int type) | |
86 | { | |
87 | if (type & TRANS_EXTWRITERS) | |
88 | atomic_inc(&trans->num_extwriters); | |
89 | } | |
90 | ||
91 | static inline void extwriter_counter_dec(struct btrfs_transaction *trans, | |
92 | unsigned int type) | |
93 | { | |
94 | if (type & TRANS_EXTWRITERS) | |
95 | atomic_dec(&trans->num_extwriters); | |
96 | } | |
97 | ||
98 | static inline void extwriter_counter_init(struct btrfs_transaction *trans, | |
99 | unsigned int type) | |
100 | { | |
101 | atomic_set(&trans->num_extwriters, ((type & TRANS_EXTWRITERS) ? 1 : 0)); | |
102 | } | |
103 | ||
104 | static inline int extwriter_counter_read(struct btrfs_transaction *trans) | |
105 | { | |
106 | return atomic_read(&trans->num_extwriters); | |
178260b2 MX |
107 | } |
108 | ||
d352ac68 CM |
109 | /* |
110 | * either allocate a new transaction or hop into the existing one | |
111 | */ | |
0860adfd | 112 | static noinline int join_transaction(struct btrfs_root *root, unsigned int type) |
79154b1b CM |
113 | { |
114 | struct btrfs_transaction *cur_trans; | |
19ae4e81 | 115 | struct btrfs_fs_info *fs_info = root->fs_info; |
a4abeea4 | 116 | |
19ae4e81 | 117 | spin_lock(&fs_info->trans_lock); |
d43317dc | 118 | loop: |
49b25e05 | 119 | /* The file system has been taken offline. No new transactions. */ |
87533c47 | 120 | if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) { |
19ae4e81 | 121 | spin_unlock(&fs_info->trans_lock); |
49b25e05 JM |
122 | return -EROFS; |
123 | } | |
124 | ||
19ae4e81 | 125 | cur_trans = fs_info->running_transaction; |
a4abeea4 | 126 | if (cur_trans) { |
871383be | 127 | if (cur_trans->aborted) { |
19ae4e81 | 128 | spin_unlock(&fs_info->trans_lock); |
49b25e05 | 129 | return cur_trans->aborted; |
871383be | 130 | } |
4a9d8bde | 131 | if (btrfs_blocked_trans_types[cur_trans->state] & type) { |
178260b2 MX |
132 | spin_unlock(&fs_info->trans_lock); |
133 | return -EBUSY; | |
134 | } | |
a4abeea4 | 135 | atomic_inc(&cur_trans->use_count); |
13c5a93e | 136 | atomic_inc(&cur_trans->num_writers); |
0860adfd | 137 | extwriter_counter_inc(cur_trans, type); |
19ae4e81 | 138 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 139 | return 0; |
79154b1b | 140 | } |
19ae4e81 | 141 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 142 | |
354aa0fb MX |
143 | /* |
144 | * If we are ATTACH, we just want to catch the current transaction, | |
145 | * and commit it. If there is no transaction, just return ENOENT. | |
146 | */ | |
147 | if (type == TRANS_ATTACH) | |
148 | return -ENOENT; | |
149 | ||
4a9d8bde MX |
150 | /* |
151 | * JOIN_NOLOCK only happens during the transaction commit, so | |
152 | * it is impossible that ->running_transaction is NULL | |
153 | */ | |
154 | BUG_ON(type == TRANS_JOIN_NOLOCK); | |
155 | ||
a4abeea4 JB |
156 | cur_trans = kmem_cache_alloc(btrfs_transaction_cachep, GFP_NOFS); |
157 | if (!cur_trans) | |
158 | return -ENOMEM; | |
d43317dc | 159 | |
19ae4e81 JS |
160 | spin_lock(&fs_info->trans_lock); |
161 | if (fs_info->running_transaction) { | |
d43317dc CM |
162 | /* |
163 | * someone started a transaction after we unlocked. Make sure | |
4a9d8bde | 164 | * to redo the checks above |
d43317dc | 165 | */ |
a4abeea4 | 166 | kmem_cache_free(btrfs_transaction_cachep, cur_trans); |
d43317dc | 167 | goto loop; |
87533c47 | 168 | } else if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) { |
e4b50e14 | 169 | spin_unlock(&fs_info->trans_lock); |
7b8b92af JB |
170 | kmem_cache_free(btrfs_transaction_cachep, cur_trans); |
171 | return -EROFS; | |
79154b1b | 172 | } |
d43317dc | 173 | |
a4abeea4 | 174 | atomic_set(&cur_trans->num_writers, 1); |
0860adfd | 175 | extwriter_counter_init(cur_trans, type); |
a4abeea4 JB |
176 | init_waitqueue_head(&cur_trans->writer_wait); |
177 | init_waitqueue_head(&cur_trans->commit_wait); | |
4a9d8bde | 178 | cur_trans->state = TRANS_STATE_RUNNING; |
a4abeea4 JB |
179 | /* |
180 | * One for this trans handle, one so it will live on until we | |
181 | * commit the transaction. | |
182 | */ | |
183 | atomic_set(&cur_trans->use_count, 2); | |
a4abeea4 JB |
184 | cur_trans->start_time = get_seconds(); |
185 | ||
186 | cur_trans->delayed_refs.root = RB_ROOT; | |
187 | cur_trans->delayed_refs.num_entries = 0; | |
188 | cur_trans->delayed_refs.num_heads_ready = 0; | |
189 | cur_trans->delayed_refs.num_heads = 0; | |
190 | cur_trans->delayed_refs.flushing = 0; | |
191 | cur_trans->delayed_refs.run_delayed_start = 0; | |
20b297d6 JS |
192 | |
193 | /* | |
194 | * although the tree mod log is per file system and not per transaction, | |
195 | * the log must never go across transaction boundaries. | |
196 | */ | |
197 | smp_mb(); | |
31b1a2bd JL |
198 | if (!list_empty(&fs_info->tree_mod_seq_list)) |
199 | WARN(1, KERN_ERR "btrfs: tree_mod_seq_list not empty when " | |
20b297d6 | 200 | "creating a fresh transaction\n"); |
31b1a2bd JL |
201 | if (!RB_EMPTY_ROOT(&fs_info->tree_mod_log)) |
202 | WARN(1, KERN_ERR "btrfs: tree_mod_log rb tree not empty when " | |
20b297d6 | 203 | "creating a fresh transaction\n"); |
fc36ed7e | 204 | atomic64_set(&fs_info->tree_mod_seq, 0); |
20b297d6 | 205 | |
a4abeea4 | 206 | spin_lock_init(&cur_trans->delayed_refs.lock); |
bb721703 CM |
207 | atomic_set(&cur_trans->delayed_refs.procs_running_refs, 0); |
208 | atomic_set(&cur_trans->delayed_refs.ref_seq, 0); | |
209 | init_waitqueue_head(&cur_trans->delayed_refs.wait); | |
a4abeea4 JB |
210 | |
211 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); | |
569e0f35 | 212 | INIT_LIST_HEAD(&cur_trans->ordered_operations); |
6df9a95e | 213 | INIT_LIST_HEAD(&cur_trans->pending_chunks); |
19ae4e81 | 214 | list_add_tail(&cur_trans->list, &fs_info->trans_list); |
a4abeea4 | 215 | extent_io_tree_init(&cur_trans->dirty_pages, |
19ae4e81 JS |
216 | fs_info->btree_inode->i_mapping); |
217 | fs_info->generation++; | |
218 | cur_trans->transid = fs_info->generation; | |
219 | fs_info->running_transaction = cur_trans; | |
49b25e05 | 220 | cur_trans->aborted = 0; |
19ae4e81 | 221 | spin_unlock(&fs_info->trans_lock); |
15ee9bc7 | 222 | |
79154b1b CM |
223 | return 0; |
224 | } | |
225 | ||
d352ac68 | 226 | /* |
d397712b CM |
227 | * this does all the record keeping required to make sure that a reference |
228 | * counted root is properly recorded in a given transaction. This is required | |
229 | * to make sure the old root from before we joined the transaction is deleted | |
230 | * when the transaction commits | |
d352ac68 | 231 | */ |
7585717f | 232 | static int record_root_in_trans(struct btrfs_trans_handle *trans, |
a4abeea4 | 233 | struct btrfs_root *root) |
6702ed49 | 234 | { |
5d4f98a2 | 235 | if (root->ref_cows && root->last_trans < trans->transid) { |
6702ed49 | 236 | WARN_ON(root == root->fs_info->extent_root); |
5d4f98a2 YZ |
237 | WARN_ON(root->commit_root != root->node); |
238 | ||
7585717f CM |
239 | /* |
240 | * see below for in_trans_setup usage rules | |
241 | * we have the reloc mutex held now, so there | |
242 | * is only one writer in this function | |
243 | */ | |
244 | root->in_trans_setup = 1; | |
245 | ||
246 | /* make sure readers find in_trans_setup before | |
247 | * they find our root->last_trans update | |
248 | */ | |
249 | smp_wmb(); | |
250 | ||
a4abeea4 JB |
251 | spin_lock(&root->fs_info->fs_roots_radix_lock); |
252 | if (root->last_trans == trans->transid) { | |
253 | spin_unlock(&root->fs_info->fs_roots_radix_lock); | |
254 | return 0; | |
255 | } | |
5d4f98a2 YZ |
256 | radix_tree_tag_set(&root->fs_info->fs_roots_radix, |
257 | (unsigned long)root->root_key.objectid, | |
258 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 259 | spin_unlock(&root->fs_info->fs_roots_radix_lock); |
7585717f CM |
260 | root->last_trans = trans->transid; |
261 | ||
262 | /* this is pretty tricky. We don't want to | |
263 | * take the relocation lock in btrfs_record_root_in_trans | |
264 | * unless we're really doing the first setup for this root in | |
265 | * this transaction. | |
266 | * | |
267 | * Normally we'd use root->last_trans as a flag to decide | |
268 | * if we want to take the expensive mutex. | |
269 | * | |
270 | * But, we have to set root->last_trans before we | |
271 | * init the relocation root, otherwise, we trip over warnings | |
272 | * in ctree.c. The solution used here is to flag ourselves | |
273 | * with root->in_trans_setup. When this is 1, we're still | |
274 | * fixing up the reloc trees and everyone must wait. | |
275 | * | |
276 | * When this is zero, they can trust root->last_trans and fly | |
277 | * through btrfs_record_root_in_trans without having to take the | |
278 | * lock. smp_wmb() makes sure that all the writes above are | |
279 | * done before we pop in the zero below | |
280 | */ | |
5d4f98a2 | 281 | btrfs_init_reloc_root(trans, root); |
7585717f CM |
282 | smp_wmb(); |
283 | root->in_trans_setup = 0; | |
5d4f98a2 YZ |
284 | } |
285 | return 0; | |
286 | } | |
bcc63abb | 287 | |
7585717f CM |
288 | |
289 | int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, | |
290 | struct btrfs_root *root) | |
291 | { | |
292 | if (!root->ref_cows) | |
293 | return 0; | |
294 | ||
295 | /* | |
296 | * see record_root_in_trans for comments about in_trans_setup usage | |
297 | * and barriers | |
298 | */ | |
299 | smp_rmb(); | |
300 | if (root->last_trans == trans->transid && | |
301 | !root->in_trans_setup) | |
302 | return 0; | |
303 | ||
304 | mutex_lock(&root->fs_info->reloc_mutex); | |
305 | record_root_in_trans(trans, root); | |
306 | mutex_unlock(&root->fs_info->reloc_mutex); | |
307 | ||
308 | return 0; | |
309 | } | |
310 | ||
4a9d8bde MX |
311 | static inline int is_transaction_blocked(struct btrfs_transaction *trans) |
312 | { | |
313 | return (trans->state >= TRANS_STATE_BLOCKED && | |
501407aa JB |
314 | trans->state < TRANS_STATE_UNBLOCKED && |
315 | !trans->aborted); | |
4a9d8bde MX |
316 | } |
317 | ||
d352ac68 CM |
318 | /* wait for commit against the current transaction to become unblocked |
319 | * when this is done, it is safe to start a new transaction, but the current | |
320 | * transaction might not be fully on disk. | |
321 | */ | |
37d1aeee | 322 | static void wait_current_trans(struct btrfs_root *root) |
79154b1b | 323 | { |
f9295749 | 324 | struct btrfs_transaction *cur_trans; |
79154b1b | 325 | |
a4abeea4 | 326 | spin_lock(&root->fs_info->trans_lock); |
f9295749 | 327 | cur_trans = root->fs_info->running_transaction; |
4a9d8bde | 328 | if (cur_trans && is_transaction_blocked(cur_trans)) { |
13c5a93e | 329 | atomic_inc(&cur_trans->use_count); |
a4abeea4 | 330 | spin_unlock(&root->fs_info->trans_lock); |
72d63ed6 LZ |
331 | |
332 | wait_event(root->fs_info->transaction_wait, | |
501407aa JB |
333 | cur_trans->state >= TRANS_STATE_UNBLOCKED || |
334 | cur_trans->aborted); | |
f9295749 | 335 | put_transaction(cur_trans); |
a4abeea4 JB |
336 | } else { |
337 | spin_unlock(&root->fs_info->trans_lock); | |
f9295749 | 338 | } |
37d1aeee CM |
339 | } |
340 | ||
a22285a6 YZ |
341 | static int may_wait_transaction(struct btrfs_root *root, int type) |
342 | { | |
a4abeea4 JB |
343 | if (root->fs_info->log_root_recovering) |
344 | return 0; | |
345 | ||
346 | if (type == TRANS_USERSPACE) | |
347 | return 1; | |
348 | ||
349 | if (type == TRANS_START && | |
350 | !atomic_read(&root->fs_info->open_ioctl_trans)) | |
a22285a6 | 351 | return 1; |
a4abeea4 | 352 | |
a22285a6 YZ |
353 | return 0; |
354 | } | |
355 | ||
08e007d2 | 356 | static struct btrfs_trans_handle * |
0860adfd | 357 | start_transaction(struct btrfs_root *root, u64 num_items, unsigned int type, |
08e007d2 | 358 | enum btrfs_reserve_flush_enum flush) |
37d1aeee | 359 | { |
a22285a6 YZ |
360 | struct btrfs_trans_handle *h; |
361 | struct btrfs_transaction *cur_trans; | |
b5009945 | 362 | u64 num_bytes = 0; |
37d1aeee | 363 | int ret; |
c5567237 | 364 | u64 qgroup_reserved = 0; |
acce952b | 365 | |
87533c47 | 366 | if (test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state)) |
acce952b | 367 | return ERR_PTR(-EROFS); |
2a1eb461 JB |
368 | |
369 | if (current->journal_info) { | |
0860adfd | 370 | WARN_ON(type & TRANS_EXTWRITERS); |
2a1eb461 JB |
371 | h = current->journal_info; |
372 | h->use_count++; | |
b7d5b0a8 | 373 | WARN_ON(h->use_count > 2); |
2a1eb461 JB |
374 | h->orig_rsv = h->block_rsv; |
375 | h->block_rsv = NULL; | |
376 | goto got_it; | |
377 | } | |
b5009945 JB |
378 | |
379 | /* | |
380 | * Do the reservation before we join the transaction so we can do all | |
381 | * the appropriate flushing if need be. | |
382 | */ | |
383 | if (num_items > 0 && root != root->fs_info->chunk_root) { | |
c5567237 AJ |
384 | if (root->fs_info->quota_enabled && |
385 | is_fstree(root->root_key.objectid)) { | |
386 | qgroup_reserved = num_items * root->leafsize; | |
387 | ret = btrfs_qgroup_reserve(root, qgroup_reserved); | |
388 | if (ret) | |
389 | return ERR_PTR(ret); | |
390 | } | |
391 | ||
b5009945 | 392 | num_bytes = btrfs_calc_trans_metadata_size(root, num_items); |
08e007d2 MX |
393 | ret = btrfs_block_rsv_add(root, |
394 | &root->fs_info->trans_block_rsv, | |
395 | num_bytes, flush); | |
b5009945 | 396 | if (ret) |
843fcf35 | 397 | goto reserve_fail; |
b5009945 | 398 | } |
a22285a6 YZ |
399 | again: |
400 | h = kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); | |
843fcf35 MX |
401 | if (!h) { |
402 | ret = -ENOMEM; | |
403 | goto alloc_fail; | |
404 | } | |
37d1aeee | 405 | |
98114659 JB |
406 | /* |
407 | * If we are JOIN_NOLOCK we're already committing a transaction and | |
408 | * waiting on this guy, so we don't need to do the sb_start_intwrite | |
409 | * because we're already holding a ref. We need this because we could | |
410 | * have raced in and did an fsync() on a file which can kick a commit | |
411 | * and then we deadlock with somebody doing a freeze. | |
354aa0fb MX |
412 | * |
413 | * If we are ATTACH, it means we just want to catch the current | |
414 | * transaction and commit it, so we needn't do sb_start_intwrite(). | |
98114659 | 415 | */ |
0860adfd | 416 | if (type & __TRANS_FREEZABLE) |
60376ce4 | 417 | sb_start_intwrite(root->fs_info->sb); |
b2b5ef5c | 418 | |
a22285a6 | 419 | if (may_wait_transaction(root, type)) |
37d1aeee | 420 | wait_current_trans(root); |
a22285a6 | 421 | |
a4abeea4 | 422 | do { |
354aa0fb | 423 | ret = join_transaction(root, type); |
178260b2 | 424 | if (ret == -EBUSY) { |
a4abeea4 | 425 | wait_current_trans(root); |
178260b2 MX |
426 | if (unlikely(type == TRANS_ATTACH)) |
427 | ret = -ENOENT; | |
428 | } | |
a4abeea4 JB |
429 | } while (ret == -EBUSY); |
430 | ||
db5b493a | 431 | if (ret < 0) { |
354aa0fb MX |
432 | /* We must get the transaction if we are JOIN_NOLOCK. */ |
433 | BUG_ON(type == TRANS_JOIN_NOLOCK); | |
843fcf35 | 434 | goto join_fail; |
db5b493a | 435 | } |
0f7d52f4 | 436 | |
a22285a6 | 437 | cur_trans = root->fs_info->running_transaction; |
a22285a6 YZ |
438 | |
439 | h->transid = cur_trans->transid; | |
440 | h->transaction = cur_trans; | |
79154b1b | 441 | h->blocks_used = 0; |
a22285a6 | 442 | h->bytes_reserved = 0; |
d13603ef | 443 | h->root = root; |
56bec294 | 444 | h->delayed_ref_updates = 0; |
2a1eb461 | 445 | h->use_count = 1; |
0e721106 | 446 | h->adding_csums = 0; |
f0486c68 | 447 | h->block_rsv = NULL; |
2a1eb461 | 448 | h->orig_rsv = NULL; |
49b25e05 | 449 | h->aborted = 0; |
4b824906 | 450 | h->qgroup_reserved = 0; |
bed92eae | 451 | h->delayed_ref_elem.seq = 0; |
a698d075 | 452 | h->type = type; |
c6b305a8 | 453 | h->allocating_chunk = false; |
bed92eae | 454 | INIT_LIST_HEAD(&h->qgroup_ref_list); |
ea658bad | 455 | INIT_LIST_HEAD(&h->new_bgs); |
b7ec40d7 | 456 | |
a22285a6 | 457 | smp_mb(); |
4a9d8bde MX |
458 | if (cur_trans->state >= TRANS_STATE_BLOCKED && |
459 | may_wait_transaction(root, type)) { | |
a22285a6 YZ |
460 | btrfs_commit_transaction(h, root); |
461 | goto again; | |
462 | } | |
463 | ||
b5009945 | 464 | if (num_bytes) { |
8c2a3ca2 | 465 | trace_btrfs_space_reservation(root->fs_info, "transaction", |
2bcc0328 | 466 | h->transid, num_bytes, 1); |
b5009945 JB |
467 | h->block_rsv = &root->fs_info->trans_block_rsv; |
468 | h->bytes_reserved = num_bytes; | |
a22285a6 | 469 | } |
4b824906 | 470 | h->qgroup_reserved = qgroup_reserved; |
9ed74f2d | 471 | |
2a1eb461 | 472 | got_it: |
a4abeea4 | 473 | btrfs_record_root_in_trans(h, root); |
a22285a6 YZ |
474 | |
475 | if (!current->journal_info && type != TRANS_USERSPACE) | |
476 | current->journal_info = h; | |
79154b1b | 477 | return h; |
843fcf35 MX |
478 | |
479 | join_fail: | |
0860adfd | 480 | if (type & __TRANS_FREEZABLE) |
843fcf35 MX |
481 | sb_end_intwrite(root->fs_info->sb); |
482 | kmem_cache_free(btrfs_trans_handle_cachep, h); | |
483 | alloc_fail: | |
484 | if (num_bytes) | |
485 | btrfs_block_rsv_release(root, &root->fs_info->trans_block_rsv, | |
486 | num_bytes); | |
487 | reserve_fail: | |
488 | if (qgroup_reserved) | |
489 | btrfs_qgroup_free(root, qgroup_reserved); | |
490 | return ERR_PTR(ret); | |
79154b1b CM |
491 | } |
492 | ||
f9295749 | 493 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
a22285a6 | 494 | int num_items) |
f9295749 | 495 | { |
08e007d2 MX |
496 | return start_transaction(root, num_items, TRANS_START, |
497 | BTRFS_RESERVE_FLUSH_ALL); | |
f9295749 | 498 | } |
8407aa46 | 499 | |
08e007d2 | 500 | struct btrfs_trans_handle *btrfs_start_transaction_lflush( |
8407aa46 MX |
501 | struct btrfs_root *root, int num_items) |
502 | { | |
08e007d2 MX |
503 | return start_transaction(root, num_items, TRANS_START, |
504 | BTRFS_RESERVE_FLUSH_LIMIT); | |
8407aa46 MX |
505 | } |
506 | ||
7a7eaa40 | 507 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root) |
f9295749 | 508 | { |
8407aa46 | 509 | return start_transaction(root, 0, TRANS_JOIN, 0); |
f9295749 CM |
510 | } |
511 | ||
7a7eaa40 | 512 | struct btrfs_trans_handle *btrfs_join_transaction_nolock(struct btrfs_root *root) |
0af3d00b | 513 | { |
8407aa46 | 514 | return start_transaction(root, 0, TRANS_JOIN_NOLOCK, 0); |
0af3d00b JB |
515 | } |
516 | ||
7a7eaa40 | 517 | struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *root) |
9ca9ee09 | 518 | { |
8407aa46 | 519 | return start_transaction(root, 0, TRANS_USERSPACE, 0); |
9ca9ee09 SW |
520 | } |
521 | ||
d4edf39b MX |
522 | /* |
523 | * btrfs_attach_transaction() - catch the running transaction | |
524 | * | |
525 | * It is used when we want to commit the current the transaction, but | |
526 | * don't want to start a new one. | |
527 | * | |
528 | * Note: If this function return -ENOENT, it just means there is no | |
529 | * running transaction. But it is possible that the inactive transaction | |
530 | * is still in the memory, not fully on disk. If you hope there is no | |
531 | * inactive transaction in the fs when -ENOENT is returned, you should | |
532 | * invoke | |
533 | * btrfs_attach_transaction_barrier() | |
534 | */ | |
354aa0fb | 535 | struct btrfs_trans_handle *btrfs_attach_transaction(struct btrfs_root *root) |
60376ce4 | 536 | { |
354aa0fb | 537 | return start_transaction(root, 0, TRANS_ATTACH, 0); |
60376ce4 JB |
538 | } |
539 | ||
d4edf39b | 540 | /* |
90b6d283 | 541 | * btrfs_attach_transaction_barrier() - catch the running transaction |
d4edf39b MX |
542 | * |
543 | * It is similar to the above function, the differentia is this one | |
544 | * will wait for all the inactive transactions until they fully | |
545 | * complete. | |
546 | */ | |
547 | struct btrfs_trans_handle * | |
548 | btrfs_attach_transaction_barrier(struct btrfs_root *root) | |
549 | { | |
550 | struct btrfs_trans_handle *trans; | |
551 | ||
552 | trans = start_transaction(root, 0, TRANS_ATTACH, 0); | |
553 | if (IS_ERR(trans) && PTR_ERR(trans) == -ENOENT) | |
554 | btrfs_wait_for_commit(root, 0); | |
555 | ||
556 | return trans; | |
557 | } | |
558 | ||
d352ac68 | 559 | /* wait for a transaction commit to be fully complete */ |
b9c8300c | 560 | static noinline void wait_for_commit(struct btrfs_root *root, |
89ce8a63 CM |
561 | struct btrfs_transaction *commit) |
562 | { | |
4a9d8bde | 563 | wait_event(commit->commit_wait, commit->state == TRANS_STATE_COMPLETED); |
89ce8a63 CM |
564 | } |
565 | ||
46204592 SW |
566 | int btrfs_wait_for_commit(struct btrfs_root *root, u64 transid) |
567 | { | |
568 | struct btrfs_transaction *cur_trans = NULL, *t; | |
8cd2807f | 569 | int ret = 0; |
46204592 | 570 | |
46204592 SW |
571 | if (transid) { |
572 | if (transid <= root->fs_info->last_trans_committed) | |
a4abeea4 | 573 | goto out; |
46204592 | 574 | |
8cd2807f | 575 | ret = -EINVAL; |
46204592 | 576 | /* find specified transaction */ |
a4abeea4 | 577 | spin_lock(&root->fs_info->trans_lock); |
46204592 SW |
578 | list_for_each_entry(t, &root->fs_info->trans_list, list) { |
579 | if (t->transid == transid) { | |
580 | cur_trans = t; | |
a4abeea4 | 581 | atomic_inc(&cur_trans->use_count); |
8cd2807f | 582 | ret = 0; |
46204592 SW |
583 | break; |
584 | } | |
8cd2807f MX |
585 | if (t->transid > transid) { |
586 | ret = 0; | |
46204592 | 587 | break; |
8cd2807f | 588 | } |
46204592 | 589 | } |
a4abeea4 | 590 | spin_unlock(&root->fs_info->trans_lock); |
8cd2807f | 591 | /* The specified transaction doesn't exist */ |
46204592 | 592 | if (!cur_trans) |
8cd2807f | 593 | goto out; |
46204592 SW |
594 | } else { |
595 | /* find newest transaction that is committing | committed */ | |
a4abeea4 | 596 | spin_lock(&root->fs_info->trans_lock); |
46204592 SW |
597 | list_for_each_entry_reverse(t, &root->fs_info->trans_list, |
598 | list) { | |
4a9d8bde MX |
599 | if (t->state >= TRANS_STATE_COMMIT_START) { |
600 | if (t->state == TRANS_STATE_COMPLETED) | |
3473f3c0 | 601 | break; |
46204592 | 602 | cur_trans = t; |
a4abeea4 | 603 | atomic_inc(&cur_trans->use_count); |
46204592 SW |
604 | break; |
605 | } | |
606 | } | |
a4abeea4 | 607 | spin_unlock(&root->fs_info->trans_lock); |
46204592 | 608 | if (!cur_trans) |
a4abeea4 | 609 | goto out; /* nothing committing|committed */ |
46204592 SW |
610 | } |
611 | ||
46204592 | 612 | wait_for_commit(root, cur_trans); |
46204592 | 613 | put_transaction(cur_trans); |
a4abeea4 | 614 | out: |
46204592 SW |
615 | return ret; |
616 | } | |
617 | ||
37d1aeee CM |
618 | void btrfs_throttle(struct btrfs_root *root) |
619 | { | |
a4abeea4 | 620 | if (!atomic_read(&root->fs_info->open_ioctl_trans)) |
9ca9ee09 | 621 | wait_current_trans(root); |
37d1aeee CM |
622 | } |
623 | ||
8929ecfa YZ |
624 | static int should_end_transaction(struct btrfs_trans_handle *trans, |
625 | struct btrfs_root *root) | |
626 | { | |
1be41b78 JB |
627 | if (root->fs_info->global_block_rsv.space_info->full && |
628 | btrfs_should_throttle_delayed_refs(trans, root)) | |
629 | return 1; | |
36ba022a | 630 | |
1be41b78 | 631 | return !!btrfs_block_rsv_check(root, &root->fs_info->global_block_rsv, 5); |
8929ecfa YZ |
632 | } |
633 | ||
634 | int btrfs_should_end_transaction(struct btrfs_trans_handle *trans, | |
635 | struct btrfs_root *root) | |
636 | { | |
637 | struct btrfs_transaction *cur_trans = trans->transaction; | |
638 | int updates; | |
49b25e05 | 639 | int err; |
8929ecfa | 640 | |
a4abeea4 | 641 | smp_mb(); |
4a9d8bde MX |
642 | if (cur_trans->state >= TRANS_STATE_BLOCKED || |
643 | cur_trans->delayed_refs.flushing) | |
8929ecfa YZ |
644 | return 1; |
645 | ||
646 | updates = trans->delayed_ref_updates; | |
647 | trans->delayed_ref_updates = 0; | |
49b25e05 JM |
648 | if (updates) { |
649 | err = btrfs_run_delayed_refs(trans, root, updates); | |
650 | if (err) /* Error code will also eval true */ | |
651 | return err; | |
652 | } | |
8929ecfa YZ |
653 | |
654 | return should_end_transaction(trans, root); | |
655 | } | |
656 | ||
89ce8a63 | 657 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
a698d075 | 658 | struct btrfs_root *root, int throttle) |
79154b1b | 659 | { |
8929ecfa | 660 | struct btrfs_transaction *cur_trans = trans->transaction; |
ab78c84d | 661 | struct btrfs_fs_info *info = root->fs_info; |
1be41b78 | 662 | unsigned long cur = trans->delayed_ref_updates; |
a698d075 | 663 | int lock = (trans->type != TRANS_JOIN_NOLOCK); |
4edc2ca3 | 664 | int err = 0; |
c3e69d58 | 665 | |
2a1eb461 JB |
666 | if (--trans->use_count) { |
667 | trans->block_rsv = trans->orig_rsv; | |
668 | return 0; | |
669 | } | |
670 | ||
edf39272 JS |
671 | /* |
672 | * do the qgroup accounting as early as possible | |
673 | */ | |
674 | err = btrfs_delayed_refs_qgroup_accounting(trans, info); | |
675 | ||
b24e03db | 676 | btrfs_trans_release_metadata(trans, root); |
4c13d758 | 677 | trans->block_rsv = NULL; |
c5567237 AJ |
678 | |
679 | if (trans->qgroup_reserved) { | |
7c2ec3f0 LB |
680 | /* |
681 | * the same root has to be passed here between start_transaction | |
682 | * and end_transaction. Subvolume quota depends on this. | |
683 | */ | |
684 | btrfs_qgroup_free(trans->root, trans->qgroup_reserved); | |
c5567237 AJ |
685 | trans->qgroup_reserved = 0; |
686 | } | |
687 | ||
ea658bad JB |
688 | if (!list_empty(&trans->new_bgs)) |
689 | btrfs_create_pending_block_groups(trans, root); | |
690 | ||
1be41b78 JB |
691 | trans->delayed_ref_updates = 0; |
692 | if (btrfs_should_throttle_delayed_refs(trans, root)) { | |
693 | cur = max_t(unsigned long, cur, 1); | |
c3e69d58 | 694 | trans->delayed_ref_updates = 0; |
1be41b78 | 695 | btrfs_run_delayed_refs(trans, root, cur); |
56bec294 | 696 | } |
bb721703 | 697 | |
0e721106 JB |
698 | btrfs_trans_release_metadata(trans, root); |
699 | trans->block_rsv = NULL; | |
56bec294 | 700 | |
ea658bad JB |
701 | if (!list_empty(&trans->new_bgs)) |
702 | btrfs_create_pending_block_groups(trans, root); | |
703 | ||
a4abeea4 | 704 | if (lock && !atomic_read(&root->fs_info->open_ioctl_trans) && |
4a9d8bde MX |
705 | should_end_transaction(trans, root) && |
706 | ACCESS_ONCE(cur_trans->state) == TRANS_STATE_RUNNING) { | |
707 | spin_lock(&info->trans_lock); | |
708 | if (cur_trans->state == TRANS_STATE_RUNNING) | |
709 | cur_trans->state = TRANS_STATE_BLOCKED; | |
710 | spin_unlock(&info->trans_lock); | |
a4abeea4 | 711 | } |
8929ecfa | 712 | |
4a9d8bde | 713 | if (lock && ACCESS_ONCE(cur_trans->state) == TRANS_STATE_BLOCKED) { |
81317fde JB |
714 | if (throttle) { |
715 | /* | |
716 | * We may race with somebody else here so end up having | |
717 | * to call end_transaction on ourselves again, so inc | |
718 | * our use_count. | |
719 | */ | |
720 | trans->use_count++; | |
8929ecfa | 721 | return btrfs_commit_transaction(trans, root); |
81317fde | 722 | } else { |
8929ecfa | 723 | wake_up_process(info->transaction_kthread); |
81317fde | 724 | } |
8929ecfa YZ |
725 | } |
726 | ||
0860adfd | 727 | if (trans->type & __TRANS_FREEZABLE) |
98114659 | 728 | sb_end_intwrite(root->fs_info->sb); |
6df7881a | 729 | |
8929ecfa | 730 | WARN_ON(cur_trans != info->running_transaction); |
13c5a93e JB |
731 | WARN_ON(atomic_read(&cur_trans->num_writers) < 1); |
732 | atomic_dec(&cur_trans->num_writers); | |
0860adfd | 733 | extwriter_counter_dec(cur_trans, trans->type); |
89ce8a63 | 734 | |
99d16cbc | 735 | smp_mb(); |
79154b1b CM |
736 | if (waitqueue_active(&cur_trans->writer_wait)) |
737 | wake_up(&cur_trans->writer_wait); | |
79154b1b | 738 | put_transaction(cur_trans); |
9ed74f2d JB |
739 | |
740 | if (current->journal_info == trans) | |
741 | current->journal_info = NULL; | |
ab78c84d | 742 | |
24bbcf04 YZ |
743 | if (throttle) |
744 | btrfs_run_delayed_iputs(root); | |
745 | ||
49b25e05 | 746 | if (trans->aborted || |
87533c47 | 747 | test_bit(BTRFS_FS_STATE_ERROR, &root->fs_info->fs_state)) |
4edc2ca3 | 748 | err = -EIO; |
edf39272 | 749 | assert_qgroups_uptodate(trans); |
49b25e05 | 750 | |
4edc2ca3 DJ |
751 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
752 | return err; | |
79154b1b CM |
753 | } |
754 | ||
89ce8a63 CM |
755 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, |
756 | struct btrfs_root *root) | |
757 | { | |
98ad43be | 758 | return __btrfs_end_transaction(trans, root, 0); |
89ce8a63 CM |
759 | } |
760 | ||
761 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans, | |
762 | struct btrfs_root *root) | |
763 | { | |
98ad43be | 764 | return __btrfs_end_transaction(trans, root, 1); |
16cdcec7 MX |
765 | } |
766 | ||
767 | int btrfs_end_transaction_dmeta(struct btrfs_trans_handle *trans, | |
768 | struct btrfs_root *root) | |
769 | { | |
a698d075 | 770 | return __btrfs_end_transaction(trans, root, 1); |
89ce8a63 CM |
771 | } |
772 | ||
d352ac68 CM |
773 | /* |
774 | * when btree blocks are allocated, they have some corresponding bits set for | |
775 | * them in one of two extent_io trees. This is used to make sure all of | |
690587d1 | 776 | * those extents are sent to disk but does not wait on them |
d352ac68 | 777 | */ |
690587d1 | 778 | int btrfs_write_marked_extents(struct btrfs_root *root, |
8cef4e16 | 779 | struct extent_io_tree *dirty_pages, int mark) |
79154b1b | 780 | { |
777e6bd7 | 781 | int err = 0; |
7c4452b9 | 782 | int werr = 0; |
1728366e | 783 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; |
e6138876 | 784 | struct extent_state *cached_state = NULL; |
777e6bd7 | 785 | u64 start = 0; |
5f39d397 | 786 | u64 end; |
7c4452b9 | 787 | |
1728366e | 788 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
e6138876 JB |
789 | mark, &cached_state)) { |
790 | convert_extent_bit(dirty_pages, start, end, EXTENT_NEED_WAIT, | |
791 | mark, &cached_state, GFP_NOFS); | |
792 | cached_state = NULL; | |
1728366e JB |
793 | err = filemap_fdatawrite_range(mapping, start, end); |
794 | if (err) | |
795 | werr = err; | |
796 | cond_resched(); | |
797 | start = end + 1; | |
7c4452b9 | 798 | } |
690587d1 CM |
799 | if (err) |
800 | werr = err; | |
801 | return werr; | |
802 | } | |
803 | ||
804 | /* | |
805 | * when btree blocks are allocated, they have some corresponding bits set for | |
806 | * them in one of two extent_io trees. This is used to make sure all of | |
807 | * those extents are on disk for transaction or log commit. We wait | |
808 | * on all the pages and clear them from the dirty pages state tree | |
809 | */ | |
810 | int btrfs_wait_marked_extents(struct btrfs_root *root, | |
8cef4e16 | 811 | struct extent_io_tree *dirty_pages, int mark) |
690587d1 | 812 | { |
690587d1 CM |
813 | int err = 0; |
814 | int werr = 0; | |
1728366e | 815 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; |
e6138876 | 816 | struct extent_state *cached_state = NULL; |
690587d1 CM |
817 | u64 start = 0; |
818 | u64 end; | |
777e6bd7 | 819 | |
1728366e | 820 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
e6138876 JB |
821 | EXTENT_NEED_WAIT, &cached_state)) { |
822 | clear_extent_bit(dirty_pages, start, end, EXTENT_NEED_WAIT, | |
823 | 0, 0, &cached_state, GFP_NOFS); | |
1728366e JB |
824 | err = filemap_fdatawait_range(mapping, start, end); |
825 | if (err) | |
826 | werr = err; | |
827 | cond_resched(); | |
828 | start = end + 1; | |
777e6bd7 | 829 | } |
7c4452b9 CM |
830 | if (err) |
831 | werr = err; | |
832 | return werr; | |
79154b1b CM |
833 | } |
834 | ||
690587d1 CM |
835 | /* |
836 | * when btree blocks are allocated, they have some corresponding bits set for | |
837 | * them in one of two extent_io trees. This is used to make sure all of | |
838 | * those extents are on disk for transaction or log commit | |
839 | */ | |
840 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | |
8cef4e16 | 841 | struct extent_io_tree *dirty_pages, int mark) |
690587d1 CM |
842 | { |
843 | int ret; | |
844 | int ret2; | |
c6adc9cc | 845 | struct blk_plug plug; |
690587d1 | 846 | |
c6adc9cc | 847 | blk_start_plug(&plug); |
8cef4e16 | 848 | ret = btrfs_write_marked_extents(root, dirty_pages, mark); |
c6adc9cc | 849 | blk_finish_plug(&plug); |
8cef4e16 | 850 | ret2 = btrfs_wait_marked_extents(root, dirty_pages, mark); |
bf0da8c1 CM |
851 | |
852 | if (ret) | |
853 | return ret; | |
854 | if (ret2) | |
855 | return ret2; | |
856 | return 0; | |
690587d1 CM |
857 | } |
858 | ||
d0c803c4 CM |
859 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, |
860 | struct btrfs_root *root) | |
861 | { | |
862 | if (!trans || !trans->transaction) { | |
863 | struct inode *btree_inode; | |
864 | btree_inode = root->fs_info->btree_inode; | |
865 | return filemap_write_and_wait(btree_inode->i_mapping); | |
866 | } | |
867 | return btrfs_write_and_wait_marked_extents(root, | |
8cef4e16 YZ |
868 | &trans->transaction->dirty_pages, |
869 | EXTENT_DIRTY); | |
d0c803c4 CM |
870 | } |
871 | ||
d352ac68 CM |
872 | /* |
873 | * this is used to update the root pointer in the tree of tree roots. | |
874 | * | |
875 | * But, in the case of the extent allocation tree, updating the root | |
876 | * pointer may allocate blocks which may change the root of the extent | |
877 | * allocation tree. | |
878 | * | |
879 | * So, this loops and repeats and makes sure the cowonly root didn't | |
880 | * change while the root pointer was being updated in the metadata. | |
881 | */ | |
0b86a832 CM |
882 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
883 | struct btrfs_root *root) | |
79154b1b CM |
884 | { |
885 | int ret; | |
0b86a832 | 886 | u64 old_root_bytenr; |
86b9f2ec | 887 | u64 old_root_used; |
0b86a832 | 888 | struct btrfs_root *tree_root = root->fs_info->tree_root; |
79154b1b | 889 | |
86b9f2ec | 890 | old_root_used = btrfs_root_used(&root->root_item); |
0b86a832 | 891 | btrfs_write_dirty_block_groups(trans, root); |
56bec294 | 892 | |
d397712b | 893 | while (1) { |
0b86a832 | 894 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
86b9f2ec YZ |
895 | if (old_root_bytenr == root->node->start && |
896 | old_root_used == btrfs_root_used(&root->root_item)) | |
79154b1b | 897 | break; |
87ef2bb4 | 898 | |
5d4f98a2 | 899 | btrfs_set_root_node(&root->root_item, root->node); |
79154b1b | 900 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
901 | &root->root_key, |
902 | &root->root_item); | |
49b25e05 JM |
903 | if (ret) |
904 | return ret; | |
56bec294 | 905 | |
86b9f2ec | 906 | old_root_used = btrfs_root_used(&root->root_item); |
4a8c9a62 | 907 | ret = btrfs_write_dirty_block_groups(trans, root); |
49b25e05 JM |
908 | if (ret) |
909 | return ret; | |
0b86a832 | 910 | } |
276e680d YZ |
911 | |
912 | if (root != root->fs_info->extent_root) | |
913 | switch_commit_root(root); | |
914 | ||
0b86a832 CM |
915 | return 0; |
916 | } | |
917 | ||
d352ac68 CM |
918 | /* |
919 | * update all the cowonly tree roots on disk | |
49b25e05 JM |
920 | * |
921 | * The error handling in this function may not be obvious. Any of the | |
922 | * failures will cause the file system to go offline. We still need | |
923 | * to clean up the delayed refs. | |
d352ac68 | 924 | */ |
5d4f98a2 YZ |
925 | static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans, |
926 | struct btrfs_root *root) | |
0b86a832 CM |
927 | { |
928 | struct btrfs_fs_info *fs_info = root->fs_info; | |
929 | struct list_head *next; | |
84234f3a | 930 | struct extent_buffer *eb; |
56bec294 | 931 | int ret; |
84234f3a | 932 | |
56bec294 | 933 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
934 | if (ret) |
935 | return ret; | |
87ef2bb4 | 936 | |
84234f3a | 937 | eb = btrfs_lock_root_node(fs_info->tree_root); |
49b25e05 JM |
938 | ret = btrfs_cow_block(trans, fs_info->tree_root, eb, NULL, |
939 | 0, &eb); | |
84234f3a YZ |
940 | btrfs_tree_unlock(eb); |
941 | free_extent_buffer(eb); | |
0b86a832 | 942 | |
49b25e05 JM |
943 | if (ret) |
944 | return ret; | |
945 | ||
56bec294 | 946 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
947 | if (ret) |
948 | return ret; | |
87ef2bb4 | 949 | |
733f4fbb | 950 | ret = btrfs_run_dev_stats(trans, root->fs_info); |
8dabb742 SB |
951 | WARN_ON(ret); |
952 | ret = btrfs_run_dev_replace(trans, root->fs_info); | |
953 | WARN_ON(ret); | |
733f4fbb | 954 | |
546adb0d JS |
955 | ret = btrfs_run_qgroups(trans, root->fs_info); |
956 | BUG_ON(ret); | |
957 | ||
958 | /* run_qgroups might have added some more refs */ | |
959 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); | |
960 | BUG_ON(ret); | |
961 | ||
d397712b | 962 | while (!list_empty(&fs_info->dirty_cowonly_roots)) { |
0b86a832 CM |
963 | next = fs_info->dirty_cowonly_roots.next; |
964 | list_del_init(next); | |
965 | root = list_entry(next, struct btrfs_root, dirty_list); | |
87ef2bb4 | 966 | |
49b25e05 JM |
967 | ret = update_cowonly_root(trans, root); |
968 | if (ret) | |
969 | return ret; | |
79154b1b | 970 | } |
276e680d YZ |
971 | |
972 | down_write(&fs_info->extent_commit_sem); | |
973 | switch_commit_root(fs_info->extent_root); | |
974 | up_write(&fs_info->extent_commit_sem); | |
975 | ||
8dabb742 SB |
976 | btrfs_after_dev_replace_commit(fs_info); |
977 | ||
79154b1b CM |
978 | return 0; |
979 | } | |
980 | ||
d352ac68 CM |
981 | /* |
982 | * dead roots are old snapshots that need to be deleted. This allocates | |
983 | * a dirty root struct and adds it into the list of dead roots that need to | |
984 | * be deleted | |
985 | */ | |
5d4f98a2 | 986 | int btrfs_add_dead_root(struct btrfs_root *root) |
5eda7b5e | 987 | { |
a4abeea4 | 988 | spin_lock(&root->fs_info->trans_lock); |
9d1a2a3a | 989 | list_add_tail(&root->root_list, &root->fs_info->dead_roots); |
a4abeea4 | 990 | spin_unlock(&root->fs_info->trans_lock); |
5eda7b5e CM |
991 | return 0; |
992 | } | |
993 | ||
d352ac68 | 994 | /* |
5d4f98a2 | 995 | * update all the cowonly tree roots on disk |
d352ac68 | 996 | */ |
5d4f98a2 YZ |
997 | static noinline int commit_fs_roots(struct btrfs_trans_handle *trans, |
998 | struct btrfs_root *root) | |
0f7d52f4 | 999 | { |
0f7d52f4 | 1000 | struct btrfs_root *gang[8]; |
5d4f98a2 | 1001 | struct btrfs_fs_info *fs_info = root->fs_info; |
0f7d52f4 CM |
1002 | int i; |
1003 | int ret; | |
54aa1f4d CM |
1004 | int err = 0; |
1005 | ||
a4abeea4 | 1006 | spin_lock(&fs_info->fs_roots_radix_lock); |
d397712b | 1007 | while (1) { |
5d4f98a2 YZ |
1008 | ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix, |
1009 | (void **)gang, 0, | |
0f7d52f4 CM |
1010 | ARRAY_SIZE(gang), |
1011 | BTRFS_ROOT_TRANS_TAG); | |
1012 | if (ret == 0) | |
1013 | break; | |
1014 | for (i = 0; i < ret; i++) { | |
1015 | root = gang[i]; | |
5d4f98a2 YZ |
1016 | radix_tree_tag_clear(&fs_info->fs_roots_radix, |
1017 | (unsigned long)root->root_key.objectid, | |
1018 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 1019 | spin_unlock(&fs_info->fs_roots_radix_lock); |
31153d81 | 1020 | |
e02119d5 | 1021 | btrfs_free_log(trans, root); |
5d4f98a2 | 1022 | btrfs_update_reloc_root(trans, root); |
d68fc57b | 1023 | btrfs_orphan_commit_root(trans, root); |
bcc63abb | 1024 | |
82d5902d LZ |
1025 | btrfs_save_ino_cache(root, trans); |
1026 | ||
f1ebcc74 LB |
1027 | /* see comments in should_cow_block() */ |
1028 | root->force_cow = 0; | |
1029 | smp_wmb(); | |
1030 | ||
978d910d | 1031 | if (root->commit_root != root->node) { |
581bb050 | 1032 | mutex_lock(&root->fs_commit_mutex); |
817d52f8 | 1033 | switch_commit_root(root); |
581bb050 LZ |
1034 | btrfs_unpin_free_ino(root); |
1035 | mutex_unlock(&root->fs_commit_mutex); | |
1036 | ||
978d910d YZ |
1037 | btrfs_set_root_node(&root->root_item, |
1038 | root->node); | |
1039 | } | |
5d4f98a2 | 1040 | |
5d4f98a2 | 1041 | err = btrfs_update_root(trans, fs_info->tree_root, |
0f7d52f4 CM |
1042 | &root->root_key, |
1043 | &root->root_item); | |
a4abeea4 | 1044 | spin_lock(&fs_info->fs_roots_radix_lock); |
54aa1f4d CM |
1045 | if (err) |
1046 | break; | |
0f7d52f4 CM |
1047 | } |
1048 | } | |
a4abeea4 | 1049 | spin_unlock(&fs_info->fs_roots_radix_lock); |
54aa1f4d | 1050 | return err; |
0f7d52f4 CM |
1051 | } |
1052 | ||
d352ac68 | 1053 | /* |
de78b51a ES |
1054 | * defrag a given btree. |
1055 | * Every leaf in the btree is read and defragged. | |
d352ac68 | 1056 | */ |
de78b51a | 1057 | int btrfs_defrag_root(struct btrfs_root *root) |
e9d0b13b CM |
1058 | { |
1059 | struct btrfs_fs_info *info = root->fs_info; | |
e9d0b13b | 1060 | struct btrfs_trans_handle *trans; |
8929ecfa | 1061 | int ret; |
e9d0b13b | 1062 | |
8929ecfa | 1063 | if (xchg(&root->defrag_running, 1)) |
e9d0b13b | 1064 | return 0; |
8929ecfa | 1065 | |
6b80053d | 1066 | while (1) { |
8929ecfa YZ |
1067 | trans = btrfs_start_transaction(root, 0); |
1068 | if (IS_ERR(trans)) | |
1069 | return PTR_ERR(trans); | |
1070 | ||
de78b51a | 1071 | ret = btrfs_defrag_leaves(trans, root); |
8929ecfa | 1072 | |
e9d0b13b | 1073 | btrfs_end_transaction(trans, root); |
b53d3f5d | 1074 | btrfs_btree_balance_dirty(info->tree_root); |
e9d0b13b CM |
1075 | cond_resched(); |
1076 | ||
7841cb28 | 1077 | if (btrfs_fs_closing(root->fs_info) || ret != -EAGAIN) |
e9d0b13b | 1078 | break; |
210549eb DS |
1079 | |
1080 | if (btrfs_defrag_cancelled(root->fs_info)) { | |
1081 | printk(KERN_DEBUG "btrfs: defrag_root cancelled\n"); | |
1082 | ret = -EAGAIN; | |
1083 | break; | |
1084 | } | |
e9d0b13b CM |
1085 | } |
1086 | root->defrag_running = 0; | |
8929ecfa | 1087 | return ret; |
e9d0b13b CM |
1088 | } |
1089 | ||
d352ac68 CM |
1090 | /* |
1091 | * new snapshots need to be created at a very specific time in the | |
aec8030a MX |
1092 | * transaction commit. This does the actual creation. |
1093 | * | |
1094 | * Note: | |
1095 | * If the error which may affect the commitment of the current transaction | |
1096 | * happens, we should return the error number. If the error which just affect | |
1097 | * the creation of the pending snapshots, just return 0. | |
d352ac68 | 1098 | */ |
80b6794d | 1099 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
1100 | struct btrfs_fs_info *fs_info, |
1101 | struct btrfs_pending_snapshot *pending) | |
1102 | { | |
1103 | struct btrfs_key key; | |
80b6794d | 1104 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
1105 | struct btrfs_root *tree_root = fs_info->tree_root; |
1106 | struct btrfs_root *root = pending->root; | |
6bdb72de | 1107 | struct btrfs_root *parent_root; |
98c9942a | 1108 | struct btrfs_block_rsv *rsv; |
6bdb72de | 1109 | struct inode *parent_inode; |
42874b3d MX |
1110 | struct btrfs_path *path; |
1111 | struct btrfs_dir_item *dir_item; | |
a22285a6 | 1112 | struct dentry *dentry; |
3063d29f | 1113 | struct extent_buffer *tmp; |
925baedd | 1114 | struct extent_buffer *old; |
8ea05e3a | 1115 | struct timespec cur_time = CURRENT_TIME; |
aec8030a | 1116 | int ret = 0; |
d68fc57b | 1117 | u64 to_reserve = 0; |
6bdb72de | 1118 | u64 index = 0; |
a22285a6 | 1119 | u64 objectid; |
b83cc969 | 1120 | u64 root_flags; |
8ea05e3a | 1121 | uuid_le new_uuid; |
3063d29f | 1122 | |
42874b3d MX |
1123 | path = btrfs_alloc_path(); |
1124 | if (!path) { | |
aec8030a MX |
1125 | pending->error = -ENOMEM; |
1126 | return 0; | |
42874b3d MX |
1127 | } |
1128 | ||
80b6794d CM |
1129 | new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS); |
1130 | if (!new_root_item) { | |
aec8030a | 1131 | pending->error = -ENOMEM; |
6fa9700e | 1132 | goto root_item_alloc_fail; |
80b6794d | 1133 | } |
a22285a6 | 1134 | |
aec8030a MX |
1135 | pending->error = btrfs_find_free_objectid(tree_root, &objectid); |
1136 | if (pending->error) | |
6fa9700e | 1137 | goto no_free_objectid; |
3063d29f | 1138 | |
3fd0a558 | 1139 | btrfs_reloc_pre_snapshot(trans, pending, &to_reserve); |
d68fc57b YZ |
1140 | |
1141 | if (to_reserve > 0) { | |
aec8030a MX |
1142 | pending->error = btrfs_block_rsv_add(root, |
1143 | &pending->block_rsv, | |
1144 | to_reserve, | |
1145 | BTRFS_RESERVE_NO_FLUSH); | |
1146 | if (pending->error) | |
6fa9700e | 1147 | goto no_free_objectid; |
d68fc57b YZ |
1148 | } |
1149 | ||
aec8030a MX |
1150 | pending->error = btrfs_qgroup_inherit(trans, fs_info, |
1151 | root->root_key.objectid, | |
1152 | objectid, pending->inherit); | |
1153 | if (pending->error) | |
6fa9700e | 1154 | goto no_free_objectid; |
6f72c7e2 | 1155 | |
3063d29f | 1156 | key.objectid = objectid; |
a22285a6 YZ |
1157 | key.offset = (u64)-1; |
1158 | key.type = BTRFS_ROOT_ITEM_KEY; | |
3063d29f | 1159 | |
6fa9700e | 1160 | rsv = trans->block_rsv; |
a22285a6 | 1161 | trans->block_rsv = &pending->block_rsv; |
2382c5cc | 1162 | trans->bytes_reserved = trans->block_rsv->reserved; |
3de4586c | 1163 | |
a22285a6 | 1164 | dentry = pending->dentry; |
e9662f70 | 1165 | parent_inode = pending->dir; |
a22285a6 | 1166 | parent_root = BTRFS_I(parent_inode)->root; |
7585717f | 1167 | record_root_in_trans(trans, parent_root); |
a22285a6 | 1168 | |
3063d29f CM |
1169 | /* |
1170 | * insert the directory item | |
1171 | */ | |
3de4586c | 1172 | ret = btrfs_set_inode_index(parent_inode, &index); |
49b25e05 | 1173 | BUG_ON(ret); /* -ENOMEM */ |
42874b3d MX |
1174 | |
1175 | /* check if there is a file/dir which has the same name. */ | |
1176 | dir_item = btrfs_lookup_dir_item(NULL, parent_root, path, | |
1177 | btrfs_ino(parent_inode), | |
1178 | dentry->d_name.name, | |
1179 | dentry->d_name.len, 0); | |
1180 | if (dir_item != NULL && !IS_ERR(dir_item)) { | |
fe66a05a | 1181 | pending->error = -EEXIST; |
aec8030a | 1182 | goto dir_item_existed; |
42874b3d MX |
1183 | } else if (IS_ERR(dir_item)) { |
1184 | ret = PTR_ERR(dir_item); | |
8732d44f MX |
1185 | btrfs_abort_transaction(trans, root, ret); |
1186 | goto fail; | |
79787eaa | 1187 | } |
42874b3d | 1188 | btrfs_release_path(path); |
52c26179 | 1189 | |
e999376f CM |
1190 | /* |
1191 | * pull in the delayed directory update | |
1192 | * and the delayed inode item | |
1193 | * otherwise we corrupt the FS during | |
1194 | * snapshot | |
1195 | */ | |
1196 | ret = btrfs_run_delayed_items(trans, root); | |
8732d44f MX |
1197 | if (ret) { /* Transaction aborted */ |
1198 | btrfs_abort_transaction(trans, root, ret); | |
1199 | goto fail; | |
1200 | } | |
e999376f | 1201 | |
7585717f | 1202 | record_root_in_trans(trans, root); |
6bdb72de SW |
1203 | btrfs_set_root_last_snapshot(&root->root_item, trans->transid); |
1204 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); | |
08fe4db1 | 1205 | btrfs_check_and_init_root_item(new_root_item); |
6bdb72de | 1206 | |
b83cc969 LZ |
1207 | root_flags = btrfs_root_flags(new_root_item); |
1208 | if (pending->readonly) | |
1209 | root_flags |= BTRFS_ROOT_SUBVOL_RDONLY; | |
1210 | else | |
1211 | root_flags &= ~BTRFS_ROOT_SUBVOL_RDONLY; | |
1212 | btrfs_set_root_flags(new_root_item, root_flags); | |
1213 | ||
8ea05e3a AB |
1214 | btrfs_set_root_generation_v2(new_root_item, |
1215 | trans->transid); | |
1216 | uuid_le_gen(&new_uuid); | |
1217 | memcpy(new_root_item->uuid, new_uuid.b, BTRFS_UUID_SIZE); | |
1218 | memcpy(new_root_item->parent_uuid, root->root_item.uuid, | |
1219 | BTRFS_UUID_SIZE); | |
70023da2 SB |
1220 | if (!(root_flags & BTRFS_ROOT_SUBVOL_RDONLY)) { |
1221 | memset(new_root_item->received_uuid, 0, | |
1222 | sizeof(new_root_item->received_uuid)); | |
1223 | memset(&new_root_item->stime, 0, sizeof(new_root_item->stime)); | |
1224 | memset(&new_root_item->rtime, 0, sizeof(new_root_item->rtime)); | |
1225 | btrfs_set_root_stransid(new_root_item, 0); | |
1226 | btrfs_set_root_rtransid(new_root_item, 0); | |
1227 | } | |
8ea05e3a | 1228 | new_root_item->otime.sec = cpu_to_le64(cur_time.tv_sec); |
dadd1105 | 1229 | new_root_item->otime.nsec = cpu_to_le32(cur_time.tv_nsec); |
8ea05e3a | 1230 | btrfs_set_root_otransid(new_root_item, trans->transid); |
8ea05e3a | 1231 | |
6bdb72de | 1232 | old = btrfs_lock_root_node(root); |
49b25e05 | 1233 | ret = btrfs_cow_block(trans, root, old, NULL, 0, &old); |
79787eaa JM |
1234 | if (ret) { |
1235 | btrfs_tree_unlock(old); | |
1236 | free_extent_buffer(old); | |
8732d44f MX |
1237 | btrfs_abort_transaction(trans, root, ret); |
1238 | goto fail; | |
79787eaa | 1239 | } |
49b25e05 | 1240 | |
6bdb72de SW |
1241 | btrfs_set_lock_blocking(old); |
1242 | ||
49b25e05 | 1243 | ret = btrfs_copy_root(trans, root, old, &tmp, objectid); |
79787eaa | 1244 | /* clean up in any case */ |
6bdb72de SW |
1245 | btrfs_tree_unlock(old); |
1246 | free_extent_buffer(old); | |
8732d44f MX |
1247 | if (ret) { |
1248 | btrfs_abort_transaction(trans, root, ret); | |
1249 | goto fail; | |
1250 | } | |
6bdb72de | 1251 | |
f1ebcc74 LB |
1252 | /* see comments in should_cow_block() */ |
1253 | root->force_cow = 1; | |
1254 | smp_wmb(); | |
1255 | ||
6bdb72de | 1256 | btrfs_set_root_node(new_root_item, tmp); |
a22285a6 YZ |
1257 | /* record when the snapshot was created in key.offset */ |
1258 | key.offset = trans->transid; | |
1259 | ret = btrfs_insert_root(trans, tree_root, &key, new_root_item); | |
6bdb72de SW |
1260 | btrfs_tree_unlock(tmp); |
1261 | free_extent_buffer(tmp); | |
8732d44f MX |
1262 | if (ret) { |
1263 | btrfs_abort_transaction(trans, root, ret); | |
1264 | goto fail; | |
1265 | } | |
6bdb72de | 1266 | |
a22285a6 YZ |
1267 | /* |
1268 | * insert root back/forward references | |
1269 | */ | |
1270 | ret = btrfs_add_root_ref(trans, tree_root, objectid, | |
0660b5af | 1271 | parent_root->root_key.objectid, |
33345d01 | 1272 | btrfs_ino(parent_inode), index, |
a22285a6 | 1273 | dentry->d_name.name, dentry->d_name.len); |
8732d44f MX |
1274 | if (ret) { |
1275 | btrfs_abort_transaction(trans, root, ret); | |
1276 | goto fail; | |
1277 | } | |
0660b5af | 1278 | |
a22285a6 YZ |
1279 | key.offset = (u64)-1; |
1280 | pending->snap = btrfs_read_fs_root_no_name(root->fs_info, &key); | |
79787eaa JM |
1281 | if (IS_ERR(pending->snap)) { |
1282 | ret = PTR_ERR(pending->snap); | |
8732d44f MX |
1283 | btrfs_abort_transaction(trans, root, ret); |
1284 | goto fail; | |
79787eaa | 1285 | } |
d68fc57b | 1286 | |
49b25e05 | 1287 | ret = btrfs_reloc_post_snapshot(trans, pending); |
8732d44f MX |
1288 | if (ret) { |
1289 | btrfs_abort_transaction(trans, root, ret); | |
1290 | goto fail; | |
1291 | } | |
361048f5 MX |
1292 | |
1293 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); | |
8732d44f MX |
1294 | if (ret) { |
1295 | btrfs_abort_transaction(trans, root, ret); | |
1296 | goto fail; | |
1297 | } | |
42874b3d MX |
1298 | |
1299 | ret = btrfs_insert_dir_item(trans, parent_root, | |
1300 | dentry->d_name.name, dentry->d_name.len, | |
1301 | parent_inode, &key, | |
1302 | BTRFS_FT_DIR, index); | |
1303 | /* We have check then name at the beginning, so it is impossible. */ | |
9c52057c | 1304 | BUG_ON(ret == -EEXIST || ret == -EOVERFLOW); |
8732d44f MX |
1305 | if (ret) { |
1306 | btrfs_abort_transaction(trans, root, ret); | |
1307 | goto fail; | |
1308 | } | |
42874b3d MX |
1309 | |
1310 | btrfs_i_size_write(parent_inode, parent_inode->i_size + | |
1311 | dentry->d_name.len * 2); | |
1312 | parent_inode->i_mtime = parent_inode->i_ctime = CURRENT_TIME; | |
be6aef60 | 1313 | ret = btrfs_update_inode_fallback(trans, parent_root, parent_inode); |
42874b3d | 1314 | if (ret) |
8732d44f | 1315 | btrfs_abort_transaction(trans, root, ret); |
3063d29f | 1316 | fail: |
aec8030a MX |
1317 | pending->error = ret; |
1318 | dir_item_existed: | |
98c9942a | 1319 | trans->block_rsv = rsv; |
2382c5cc | 1320 | trans->bytes_reserved = 0; |
6fa9700e MX |
1321 | no_free_objectid: |
1322 | kfree(new_root_item); | |
1323 | root_item_alloc_fail: | |
42874b3d | 1324 | btrfs_free_path(path); |
49b25e05 | 1325 | return ret; |
3063d29f CM |
1326 | } |
1327 | ||
d352ac68 CM |
1328 | /* |
1329 | * create all the snapshots we've scheduled for creation | |
1330 | */ | |
80b6794d CM |
1331 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans, |
1332 | struct btrfs_fs_info *fs_info) | |
3de4586c | 1333 | { |
aec8030a | 1334 | struct btrfs_pending_snapshot *pending, *next; |
3de4586c | 1335 | struct list_head *head = &trans->transaction->pending_snapshots; |
aec8030a | 1336 | int ret = 0; |
3de4586c | 1337 | |
aec8030a MX |
1338 | list_for_each_entry_safe(pending, next, head, list) { |
1339 | list_del(&pending->list); | |
1340 | ret = create_pending_snapshot(trans, fs_info, pending); | |
1341 | if (ret) | |
1342 | break; | |
1343 | } | |
1344 | return ret; | |
3de4586c CM |
1345 | } |
1346 | ||
5d4f98a2 YZ |
1347 | static void update_super_roots(struct btrfs_root *root) |
1348 | { | |
1349 | struct btrfs_root_item *root_item; | |
1350 | struct btrfs_super_block *super; | |
1351 | ||
6c41761f | 1352 | super = root->fs_info->super_copy; |
5d4f98a2 YZ |
1353 | |
1354 | root_item = &root->fs_info->chunk_root->root_item; | |
1355 | super->chunk_root = root_item->bytenr; | |
1356 | super->chunk_root_generation = root_item->generation; | |
1357 | super->chunk_root_level = root_item->level; | |
1358 | ||
1359 | root_item = &root->fs_info->tree_root->root_item; | |
1360 | super->root = root_item->bytenr; | |
1361 | super->generation = root_item->generation; | |
1362 | super->root_level = root_item->level; | |
73bc1876 | 1363 | if (btrfs_test_opt(root, SPACE_CACHE)) |
0af3d00b | 1364 | super->cache_generation = root_item->generation; |
5d4f98a2 YZ |
1365 | } |
1366 | ||
f36f3042 CM |
1367 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info) |
1368 | { | |
4a9d8bde | 1369 | struct btrfs_transaction *trans; |
f36f3042 | 1370 | int ret = 0; |
4a9d8bde | 1371 | |
a4abeea4 | 1372 | spin_lock(&info->trans_lock); |
4a9d8bde MX |
1373 | trans = info->running_transaction; |
1374 | if (trans) | |
1375 | ret = (trans->state >= TRANS_STATE_COMMIT_START); | |
a4abeea4 | 1376 | spin_unlock(&info->trans_lock); |
f36f3042 CM |
1377 | return ret; |
1378 | } | |
1379 | ||
8929ecfa YZ |
1380 | int btrfs_transaction_blocked(struct btrfs_fs_info *info) |
1381 | { | |
4a9d8bde | 1382 | struct btrfs_transaction *trans; |
8929ecfa | 1383 | int ret = 0; |
4a9d8bde | 1384 | |
a4abeea4 | 1385 | spin_lock(&info->trans_lock); |
4a9d8bde MX |
1386 | trans = info->running_transaction; |
1387 | if (trans) | |
1388 | ret = is_transaction_blocked(trans); | |
a4abeea4 | 1389 | spin_unlock(&info->trans_lock); |
8929ecfa YZ |
1390 | return ret; |
1391 | } | |
1392 | ||
bb9c12c9 SW |
1393 | /* |
1394 | * wait for the current transaction commit to start and block subsequent | |
1395 | * transaction joins | |
1396 | */ | |
1397 | static void wait_current_trans_commit_start(struct btrfs_root *root, | |
1398 | struct btrfs_transaction *trans) | |
1399 | { | |
4a9d8bde | 1400 | wait_event(root->fs_info->transaction_blocked_wait, |
501407aa JB |
1401 | trans->state >= TRANS_STATE_COMMIT_START || |
1402 | trans->aborted); | |
bb9c12c9 SW |
1403 | } |
1404 | ||
1405 | /* | |
1406 | * wait for the current transaction to start and then become unblocked. | |
1407 | * caller holds ref. | |
1408 | */ | |
1409 | static void wait_current_trans_commit_start_and_unblock(struct btrfs_root *root, | |
1410 | struct btrfs_transaction *trans) | |
1411 | { | |
72d63ed6 | 1412 | wait_event(root->fs_info->transaction_wait, |
501407aa JB |
1413 | trans->state >= TRANS_STATE_UNBLOCKED || |
1414 | trans->aborted); | |
bb9c12c9 SW |
1415 | } |
1416 | ||
1417 | /* | |
1418 | * commit transactions asynchronously. once btrfs_commit_transaction_async | |
1419 | * returns, any subsequent transaction will not be allowed to join. | |
1420 | */ | |
1421 | struct btrfs_async_commit { | |
1422 | struct btrfs_trans_handle *newtrans; | |
1423 | struct btrfs_root *root; | |
7892b5af | 1424 | struct work_struct work; |
bb9c12c9 SW |
1425 | }; |
1426 | ||
1427 | static void do_async_commit(struct work_struct *work) | |
1428 | { | |
1429 | struct btrfs_async_commit *ac = | |
7892b5af | 1430 | container_of(work, struct btrfs_async_commit, work); |
bb9c12c9 | 1431 | |
6fc4e354 SW |
1432 | /* |
1433 | * We've got freeze protection passed with the transaction. | |
1434 | * Tell lockdep about it. | |
1435 | */ | |
ff7c1d33 MX |
1436 | if (ac->newtrans->type < TRANS_JOIN_NOLOCK) |
1437 | rwsem_acquire_read( | |
1438 | &ac->root->fs_info->sb->s_writers.lock_map[SB_FREEZE_FS-1], | |
1439 | 0, 1, _THIS_IP_); | |
6fc4e354 | 1440 | |
e209db7a SW |
1441 | current->journal_info = ac->newtrans; |
1442 | ||
bb9c12c9 SW |
1443 | btrfs_commit_transaction(ac->newtrans, ac->root); |
1444 | kfree(ac); | |
1445 | } | |
1446 | ||
1447 | int btrfs_commit_transaction_async(struct btrfs_trans_handle *trans, | |
1448 | struct btrfs_root *root, | |
1449 | int wait_for_unblock) | |
1450 | { | |
1451 | struct btrfs_async_commit *ac; | |
1452 | struct btrfs_transaction *cur_trans; | |
1453 | ||
1454 | ac = kmalloc(sizeof(*ac), GFP_NOFS); | |
db5b493a TI |
1455 | if (!ac) |
1456 | return -ENOMEM; | |
bb9c12c9 | 1457 | |
7892b5af | 1458 | INIT_WORK(&ac->work, do_async_commit); |
bb9c12c9 | 1459 | ac->root = root; |
7a7eaa40 | 1460 | ac->newtrans = btrfs_join_transaction(root); |
3612b495 TI |
1461 | if (IS_ERR(ac->newtrans)) { |
1462 | int err = PTR_ERR(ac->newtrans); | |
1463 | kfree(ac); | |
1464 | return err; | |
1465 | } | |
bb9c12c9 SW |
1466 | |
1467 | /* take transaction reference */ | |
bb9c12c9 | 1468 | cur_trans = trans->transaction; |
13c5a93e | 1469 | atomic_inc(&cur_trans->use_count); |
bb9c12c9 SW |
1470 | |
1471 | btrfs_end_transaction(trans, root); | |
6fc4e354 SW |
1472 | |
1473 | /* | |
1474 | * Tell lockdep we've released the freeze rwsem, since the | |
1475 | * async commit thread will be the one to unlock it. | |
1476 | */ | |
ff7c1d33 MX |
1477 | if (trans->type < TRANS_JOIN_NOLOCK) |
1478 | rwsem_release( | |
1479 | &root->fs_info->sb->s_writers.lock_map[SB_FREEZE_FS-1], | |
1480 | 1, _THIS_IP_); | |
6fc4e354 | 1481 | |
7892b5af | 1482 | schedule_work(&ac->work); |
bb9c12c9 SW |
1483 | |
1484 | /* wait for transaction to start and unblock */ | |
bb9c12c9 SW |
1485 | if (wait_for_unblock) |
1486 | wait_current_trans_commit_start_and_unblock(root, cur_trans); | |
1487 | else | |
1488 | wait_current_trans_commit_start(root, cur_trans); | |
bb9c12c9 | 1489 | |
38e88054 SW |
1490 | if (current->journal_info == trans) |
1491 | current->journal_info = NULL; | |
1492 | ||
1493 | put_transaction(cur_trans); | |
bb9c12c9 SW |
1494 | return 0; |
1495 | } | |
1496 | ||
49b25e05 JM |
1497 | |
1498 | static void cleanup_transaction(struct btrfs_trans_handle *trans, | |
7b8b92af | 1499 | struct btrfs_root *root, int err) |
49b25e05 JM |
1500 | { |
1501 | struct btrfs_transaction *cur_trans = trans->transaction; | |
f094ac32 | 1502 | DEFINE_WAIT(wait); |
49b25e05 JM |
1503 | |
1504 | WARN_ON(trans->use_count > 1); | |
1505 | ||
7b8b92af JB |
1506 | btrfs_abort_transaction(trans, root, err); |
1507 | ||
49b25e05 | 1508 | spin_lock(&root->fs_info->trans_lock); |
66b6135b | 1509 | |
25d8c284 MX |
1510 | /* |
1511 | * If the transaction is removed from the list, it means this | |
1512 | * transaction has been committed successfully, so it is impossible | |
1513 | * to call the cleanup function. | |
1514 | */ | |
1515 | BUG_ON(list_empty(&cur_trans->list)); | |
66b6135b | 1516 | |
49b25e05 | 1517 | list_del_init(&cur_trans->list); |
d7096fc3 | 1518 | if (cur_trans == root->fs_info->running_transaction) { |
4a9d8bde | 1519 | cur_trans->state = TRANS_STATE_COMMIT_DOING; |
f094ac32 LB |
1520 | spin_unlock(&root->fs_info->trans_lock); |
1521 | wait_event(cur_trans->writer_wait, | |
1522 | atomic_read(&cur_trans->num_writers) == 1); | |
1523 | ||
1524 | spin_lock(&root->fs_info->trans_lock); | |
d7096fc3 | 1525 | } |
49b25e05 JM |
1526 | spin_unlock(&root->fs_info->trans_lock); |
1527 | ||
1528 | btrfs_cleanup_one_transaction(trans->transaction, root); | |
1529 | ||
4a9d8bde MX |
1530 | spin_lock(&root->fs_info->trans_lock); |
1531 | if (cur_trans == root->fs_info->running_transaction) | |
1532 | root->fs_info->running_transaction = NULL; | |
1533 | spin_unlock(&root->fs_info->trans_lock); | |
1534 | ||
49b25e05 JM |
1535 | put_transaction(cur_trans); |
1536 | put_transaction(cur_trans); | |
1537 | ||
1538 | trace_btrfs_transaction_commit(root); | |
1539 | ||
1540 | btrfs_scrub_continue(root); | |
1541 | ||
1542 | if (current->journal_info == trans) | |
1543 | current->journal_info = NULL; | |
1544 | ||
1545 | kmem_cache_free(btrfs_trans_handle_cachep, trans); | |
1546 | } | |
1547 | ||
ca469637 MX |
1548 | static int btrfs_flush_all_pending_stuffs(struct btrfs_trans_handle *trans, |
1549 | struct btrfs_root *root) | |
1550 | { | |
ca469637 MX |
1551 | int ret; |
1552 | ||
ca469637 MX |
1553 | ret = btrfs_run_delayed_items(trans, root); |
1554 | if (ret) | |
1555 | return ret; | |
1556 | ||
1557 | /* | |
1558 | * running the delayed items may have added new refs. account | |
1559 | * them now so that they hinder processing of more delayed refs | |
1560 | * as little as possible. | |
1561 | */ | |
1562 | btrfs_delayed_refs_qgroup_accounting(trans, root->fs_info); | |
1563 | ||
1564 | /* | |
1565 | * rename don't use btrfs_join_transaction, so, once we | |
1566 | * set the transaction to blocked above, we aren't going | |
1567 | * to get any new ordered operations. We can safely run | |
1568 | * it here and no for sure that nothing new will be added | |
1569 | * to the list | |
1570 | */ | |
569e0f35 | 1571 | ret = btrfs_run_ordered_operations(trans, root, 1); |
ca469637 | 1572 | |
eebc6084 | 1573 | return ret; |
ca469637 MX |
1574 | } |
1575 | ||
82436617 MX |
1576 | static inline int btrfs_start_delalloc_flush(struct btrfs_fs_info *fs_info) |
1577 | { | |
1578 | if (btrfs_test_opt(fs_info->tree_root, FLUSHONCOMMIT)) | |
1579 | return btrfs_start_all_delalloc_inodes(fs_info, 1); | |
1580 | return 0; | |
1581 | } | |
1582 | ||
1583 | static inline void btrfs_wait_delalloc_flush(struct btrfs_fs_info *fs_info) | |
1584 | { | |
1585 | if (btrfs_test_opt(fs_info->tree_root, FLUSHONCOMMIT)) | |
1586 | btrfs_wait_all_ordered_extents(fs_info, 1); | |
1587 | } | |
1588 | ||
79154b1b CM |
1589 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans, |
1590 | struct btrfs_root *root) | |
1591 | { | |
49b25e05 | 1592 | struct btrfs_transaction *cur_trans = trans->transaction; |
8fd17795 | 1593 | struct btrfs_transaction *prev_trans = NULL; |
25287e0a | 1594 | int ret; |
79154b1b | 1595 | |
569e0f35 | 1596 | ret = btrfs_run_ordered_operations(trans, root, 0); |
25287e0a MX |
1597 | if (ret) { |
1598 | btrfs_abort_transaction(trans, root, ret); | |
e4a2bcac JB |
1599 | btrfs_end_transaction(trans, root); |
1600 | return ret; | |
25287e0a | 1601 | } |
5a3f23d5 | 1602 | |
8d25a086 MX |
1603 | /* Stop the commit early if ->aborted is set */ |
1604 | if (unlikely(ACCESS_ONCE(cur_trans->aborted))) { | |
25287e0a | 1605 | ret = cur_trans->aborted; |
e4a2bcac JB |
1606 | btrfs_end_transaction(trans, root); |
1607 | return ret; | |
25287e0a | 1608 | } |
49b25e05 | 1609 | |
56bec294 CM |
1610 | /* make a pass through all the delayed refs we have so far |
1611 | * any runnings procs may add more while we are here | |
1612 | */ | |
1613 | ret = btrfs_run_delayed_refs(trans, root, 0); | |
e4a2bcac JB |
1614 | if (ret) { |
1615 | btrfs_end_transaction(trans, root); | |
1616 | return ret; | |
1617 | } | |
56bec294 | 1618 | |
0e721106 JB |
1619 | btrfs_trans_release_metadata(trans, root); |
1620 | trans->block_rsv = NULL; | |
272d26d0 MX |
1621 | if (trans->qgroup_reserved) { |
1622 | btrfs_qgroup_free(root, trans->qgroup_reserved); | |
1623 | trans->qgroup_reserved = 0; | |
1624 | } | |
0e721106 | 1625 | |
b7ec40d7 | 1626 | cur_trans = trans->transaction; |
49b25e05 | 1627 | |
56bec294 CM |
1628 | /* |
1629 | * set the flushing flag so procs in this transaction have to | |
1630 | * start sending their work down. | |
1631 | */ | |
b7ec40d7 | 1632 | cur_trans->delayed_refs.flushing = 1; |
1be41b78 | 1633 | smp_wmb(); |
56bec294 | 1634 | |
ea658bad JB |
1635 | if (!list_empty(&trans->new_bgs)) |
1636 | btrfs_create_pending_block_groups(trans, root); | |
1637 | ||
c3e69d58 | 1638 | ret = btrfs_run_delayed_refs(trans, root, 0); |
e4a2bcac JB |
1639 | if (ret) { |
1640 | btrfs_end_transaction(trans, root); | |
1641 | return ret; | |
1642 | } | |
56bec294 | 1643 | |
4a9d8bde MX |
1644 | spin_lock(&root->fs_info->trans_lock); |
1645 | if (cur_trans->state >= TRANS_STATE_COMMIT_START) { | |
1646 | spin_unlock(&root->fs_info->trans_lock); | |
13c5a93e | 1647 | atomic_inc(&cur_trans->use_count); |
49b25e05 | 1648 | ret = btrfs_end_transaction(trans, root); |
ccd467d6 | 1649 | |
b9c8300c | 1650 | wait_for_commit(root, cur_trans); |
15ee9bc7 | 1651 | |
79154b1b | 1652 | put_transaction(cur_trans); |
15ee9bc7 | 1653 | |
49b25e05 | 1654 | return ret; |
79154b1b | 1655 | } |
4313b399 | 1656 | |
4a9d8bde | 1657 | cur_trans->state = TRANS_STATE_COMMIT_START; |
bb9c12c9 SW |
1658 | wake_up(&root->fs_info->transaction_blocked_wait); |
1659 | ||
ccd467d6 CM |
1660 | if (cur_trans->list.prev != &root->fs_info->trans_list) { |
1661 | prev_trans = list_entry(cur_trans->list.prev, | |
1662 | struct btrfs_transaction, list); | |
4a9d8bde | 1663 | if (prev_trans->state != TRANS_STATE_COMPLETED) { |
13c5a93e | 1664 | atomic_inc(&prev_trans->use_count); |
a4abeea4 | 1665 | spin_unlock(&root->fs_info->trans_lock); |
ccd467d6 CM |
1666 | |
1667 | wait_for_commit(root, prev_trans); | |
ccd467d6 | 1668 | |
15ee9bc7 | 1669 | put_transaction(prev_trans); |
a4abeea4 JB |
1670 | } else { |
1671 | spin_unlock(&root->fs_info->trans_lock); | |
ccd467d6 | 1672 | } |
a4abeea4 JB |
1673 | } else { |
1674 | spin_unlock(&root->fs_info->trans_lock); | |
ccd467d6 | 1675 | } |
15ee9bc7 | 1676 | |
0860adfd MX |
1677 | extwriter_counter_dec(cur_trans, trans->type); |
1678 | ||
82436617 MX |
1679 | ret = btrfs_start_delalloc_flush(root->fs_info); |
1680 | if (ret) | |
1681 | goto cleanup_transaction; | |
1682 | ||
581227d0 MX |
1683 | ret = btrfs_flush_all_pending_stuffs(trans, root); |
1684 | if (ret) | |
1685 | goto cleanup_transaction; | |
15ee9bc7 | 1686 | |
581227d0 MX |
1687 | wait_event(cur_trans->writer_wait, |
1688 | extwriter_counter_read(cur_trans) == 0); | |
15ee9bc7 | 1689 | |
581227d0 | 1690 | /* some pending stuffs might be added after the previous flush. */ |
ca469637 MX |
1691 | ret = btrfs_flush_all_pending_stuffs(trans, root); |
1692 | if (ret) | |
1693 | goto cleanup_transaction; | |
1694 | ||
82436617 | 1695 | btrfs_wait_delalloc_flush(root->fs_info); |
ed0ca140 JB |
1696 | /* |
1697 | * Ok now we need to make sure to block out any other joins while we | |
1698 | * commit the transaction. We could have started a join before setting | |
4a9d8bde | 1699 | * COMMIT_DOING so make sure to wait for num_writers to == 1 again. |
ed0ca140 JB |
1700 | */ |
1701 | spin_lock(&root->fs_info->trans_lock); | |
4a9d8bde | 1702 | cur_trans->state = TRANS_STATE_COMMIT_DOING; |
ed0ca140 JB |
1703 | spin_unlock(&root->fs_info->trans_lock); |
1704 | wait_event(cur_trans->writer_wait, | |
1705 | atomic_read(&cur_trans->num_writers) == 1); | |
1706 | ||
2cba30f1 MX |
1707 | /* ->aborted might be set after the previous check, so check it */ |
1708 | if (unlikely(ACCESS_ONCE(cur_trans->aborted))) { | |
1709 | ret = cur_trans->aborted; | |
1710 | goto cleanup_transaction; | |
1711 | } | |
7585717f CM |
1712 | /* |
1713 | * the reloc mutex makes sure that we stop | |
1714 | * the balancing code from coming in and moving | |
1715 | * extents around in the middle of the commit | |
1716 | */ | |
1717 | mutex_lock(&root->fs_info->reloc_mutex); | |
1718 | ||
42874b3d MX |
1719 | /* |
1720 | * We needn't worry about the delayed items because we will | |
1721 | * deal with them in create_pending_snapshot(), which is the | |
1722 | * core function of the snapshot creation. | |
1723 | */ | |
1724 | ret = create_pending_snapshots(trans, root->fs_info); | |
49b25e05 JM |
1725 | if (ret) { |
1726 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1727 | goto cleanup_transaction; | |
1728 | } | |
3063d29f | 1729 | |
42874b3d MX |
1730 | /* |
1731 | * We insert the dir indexes of the snapshots and update the inode | |
1732 | * of the snapshots' parents after the snapshot creation, so there | |
1733 | * are some delayed items which are not dealt with. Now deal with | |
1734 | * them. | |
1735 | * | |
1736 | * We needn't worry that this operation will corrupt the snapshots, | |
1737 | * because all the tree which are snapshoted will be forced to COW | |
1738 | * the nodes and leaves. | |
1739 | */ | |
1740 | ret = btrfs_run_delayed_items(trans, root); | |
49b25e05 JM |
1741 | if (ret) { |
1742 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1743 | goto cleanup_transaction; | |
1744 | } | |
16cdcec7 | 1745 | |
56bec294 | 1746 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
1747 | if (ret) { |
1748 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1749 | goto cleanup_transaction; | |
1750 | } | |
56bec294 | 1751 | |
e999376f CM |
1752 | /* |
1753 | * make sure none of the code above managed to slip in a | |
1754 | * delayed item | |
1755 | */ | |
1756 | btrfs_assert_delayed_root_empty(root); | |
1757 | ||
2c90e5d6 | 1758 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 1759 | |
a2de733c | 1760 | btrfs_scrub_pause(root); |
e02119d5 CM |
1761 | /* btrfs_commit_tree_roots is responsible for getting the |
1762 | * various roots consistent with each other. Every pointer | |
1763 | * in the tree of tree roots has to point to the most up to date | |
1764 | * root for every subvolume and other tree. So, we have to keep | |
1765 | * the tree logging code from jumping in and changing any | |
1766 | * of the trees. | |
1767 | * | |
1768 | * At this point in the commit, there can't be any tree-log | |
1769 | * writers, but a little lower down we drop the trans mutex | |
1770 | * and let new people in. By holding the tree_log_mutex | |
1771 | * from now until after the super is written, we avoid races | |
1772 | * with the tree-log code. | |
1773 | */ | |
1774 | mutex_lock(&root->fs_info->tree_log_mutex); | |
1775 | ||
5d4f98a2 | 1776 | ret = commit_fs_roots(trans, root); |
49b25e05 JM |
1777 | if (ret) { |
1778 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
871383be | 1779 | mutex_unlock(&root->fs_info->reloc_mutex); |
49b25e05 JM |
1780 | goto cleanup_transaction; |
1781 | } | |
54aa1f4d | 1782 | |
5d4f98a2 | 1783 | /* commit_fs_roots gets rid of all the tree log roots, it is now |
e02119d5 CM |
1784 | * safe to free the root of tree log roots |
1785 | */ | |
1786 | btrfs_free_log_root_tree(trans, root->fs_info); | |
1787 | ||
5d4f98a2 | 1788 | ret = commit_cowonly_roots(trans, root); |
49b25e05 JM |
1789 | if (ret) { |
1790 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
871383be | 1791 | mutex_unlock(&root->fs_info->reloc_mutex); |
49b25e05 JM |
1792 | goto cleanup_transaction; |
1793 | } | |
54aa1f4d | 1794 | |
2cba30f1 MX |
1795 | /* |
1796 | * The tasks which save the space cache and inode cache may also | |
1797 | * update ->aborted, check it. | |
1798 | */ | |
1799 | if (unlikely(ACCESS_ONCE(cur_trans->aborted))) { | |
1800 | ret = cur_trans->aborted; | |
1801 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1802 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1803 | goto cleanup_transaction; | |
1804 | } | |
1805 | ||
11833d66 YZ |
1806 | btrfs_prepare_extent_commit(trans, root); |
1807 | ||
78fae27e | 1808 | cur_trans = root->fs_info->running_transaction; |
5d4f98a2 YZ |
1809 | |
1810 | btrfs_set_root_node(&root->fs_info->tree_root->root_item, | |
1811 | root->fs_info->tree_root->node); | |
817d52f8 | 1812 | switch_commit_root(root->fs_info->tree_root); |
5d4f98a2 YZ |
1813 | |
1814 | btrfs_set_root_node(&root->fs_info->chunk_root->root_item, | |
1815 | root->fs_info->chunk_root->node); | |
817d52f8 | 1816 | switch_commit_root(root->fs_info->chunk_root); |
5d4f98a2 | 1817 | |
edf39272 | 1818 | assert_qgroups_uptodate(trans); |
5d4f98a2 | 1819 | update_super_roots(root); |
e02119d5 CM |
1820 | |
1821 | if (!root->fs_info->log_root_recovering) { | |
6c41761f DS |
1822 | btrfs_set_super_log_root(root->fs_info->super_copy, 0); |
1823 | btrfs_set_super_log_root_level(root->fs_info->super_copy, 0); | |
e02119d5 CM |
1824 | } |
1825 | ||
6c41761f DS |
1826 | memcpy(root->fs_info->super_for_commit, root->fs_info->super_copy, |
1827 | sizeof(*root->fs_info->super_copy)); | |
ccd467d6 | 1828 | |
a4abeea4 | 1829 | spin_lock(&root->fs_info->trans_lock); |
4a9d8bde | 1830 | cur_trans->state = TRANS_STATE_UNBLOCKED; |
a4abeea4 | 1831 | root->fs_info->running_transaction = NULL; |
a4abeea4 | 1832 | spin_unlock(&root->fs_info->trans_lock); |
7585717f | 1833 | mutex_unlock(&root->fs_info->reloc_mutex); |
b7ec40d7 | 1834 | |
f9295749 | 1835 | wake_up(&root->fs_info->transaction_wait); |
e6dcd2dc | 1836 | |
79154b1b | 1837 | ret = btrfs_write_and_wait_transaction(trans, root); |
49b25e05 JM |
1838 | if (ret) { |
1839 | btrfs_error(root->fs_info, ret, | |
08748810 | 1840 | "Error while writing out transaction"); |
49b25e05 JM |
1841 | mutex_unlock(&root->fs_info->tree_log_mutex); |
1842 | goto cleanup_transaction; | |
1843 | } | |
1844 | ||
1845 | ret = write_ctree_super(trans, root, 0); | |
1846 | if (ret) { | |
1847 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1848 | goto cleanup_transaction; | |
1849 | } | |
4313b399 | 1850 | |
e02119d5 CM |
1851 | /* |
1852 | * the super is written, we can safely allow the tree-loggers | |
1853 | * to go about their business | |
1854 | */ | |
1855 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1856 | ||
11833d66 | 1857 | btrfs_finish_extent_commit(trans, root); |
4313b399 | 1858 | |
15ee9bc7 | 1859 | root->fs_info->last_trans_committed = cur_trans->transid; |
4a9d8bde MX |
1860 | /* |
1861 | * We needn't acquire the lock here because there is no other task | |
1862 | * which can change it. | |
1863 | */ | |
1864 | cur_trans->state = TRANS_STATE_COMPLETED; | |
2c90e5d6 | 1865 | wake_up(&cur_trans->commit_wait); |
3de4586c | 1866 | |
a4abeea4 | 1867 | spin_lock(&root->fs_info->trans_lock); |
13c5a93e | 1868 | list_del_init(&cur_trans->list); |
a4abeea4 JB |
1869 | spin_unlock(&root->fs_info->trans_lock); |
1870 | ||
78fae27e | 1871 | put_transaction(cur_trans); |
79154b1b | 1872 | put_transaction(cur_trans); |
58176a96 | 1873 | |
0860adfd | 1874 | if (trans->type & __TRANS_FREEZABLE) |
354aa0fb | 1875 | sb_end_intwrite(root->fs_info->sb); |
b2b5ef5c | 1876 | |
1abe9b8a | 1877 | trace_btrfs_transaction_commit(root); |
1878 | ||
a2de733c AJ |
1879 | btrfs_scrub_continue(root); |
1880 | ||
9ed74f2d JB |
1881 | if (current->journal_info == trans) |
1882 | current->journal_info = NULL; | |
1883 | ||
2c90e5d6 | 1884 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
24bbcf04 YZ |
1885 | |
1886 | if (current != root->fs_info->transaction_kthread) | |
1887 | btrfs_run_delayed_iputs(root); | |
1888 | ||
79154b1b | 1889 | return ret; |
49b25e05 JM |
1890 | |
1891 | cleanup_transaction: | |
0e721106 JB |
1892 | btrfs_trans_release_metadata(trans, root); |
1893 | trans->block_rsv = NULL; | |
272d26d0 MX |
1894 | if (trans->qgroup_reserved) { |
1895 | btrfs_qgroup_free(root, trans->qgroup_reserved); | |
1896 | trans->qgroup_reserved = 0; | |
1897 | } | |
c2cf52eb | 1898 | btrfs_warn(root->fs_info, "Skipping commit of aborted transaction."); |
49b25e05 JM |
1899 | if (current->journal_info == trans) |
1900 | current->journal_info = NULL; | |
7b8b92af | 1901 | cleanup_transaction(trans, root, ret); |
49b25e05 JM |
1902 | |
1903 | return ret; | |
79154b1b CM |
1904 | } |
1905 | ||
d352ac68 | 1906 | /* |
9d1a2a3a DS |
1907 | * return < 0 if error |
1908 | * 0 if there are no more dead_roots at the time of call | |
1909 | * 1 there are more to be processed, call me again | |
1910 | * | |
1911 | * The return value indicates there are certainly more snapshots to delete, but | |
1912 | * if there comes a new one during processing, it may return 0. We don't mind, | |
1913 | * because btrfs_commit_super will poke cleaner thread and it will process it a | |
1914 | * few seconds later. | |
d352ac68 | 1915 | */ |
9d1a2a3a | 1916 | int btrfs_clean_one_deleted_snapshot(struct btrfs_root *root) |
e9d0b13b | 1917 | { |
9d1a2a3a | 1918 | int ret; |
5d4f98a2 YZ |
1919 | struct btrfs_fs_info *fs_info = root->fs_info; |
1920 | ||
a4abeea4 | 1921 | spin_lock(&fs_info->trans_lock); |
9d1a2a3a DS |
1922 | if (list_empty(&fs_info->dead_roots)) { |
1923 | spin_unlock(&fs_info->trans_lock); | |
1924 | return 0; | |
1925 | } | |
1926 | root = list_first_entry(&fs_info->dead_roots, | |
1927 | struct btrfs_root, root_list); | |
1928 | list_del(&root->root_list); | |
a4abeea4 | 1929 | spin_unlock(&fs_info->trans_lock); |
e9d0b13b | 1930 | |
9d1a2a3a DS |
1931 | pr_debug("btrfs: cleaner removing %llu\n", |
1932 | (unsigned long long)root->objectid); | |
76dda93c | 1933 | |
9d1a2a3a | 1934 | btrfs_kill_all_delayed_nodes(root); |
16cdcec7 | 1935 | |
9d1a2a3a DS |
1936 | if (btrfs_header_backref_rev(root->node) < |
1937 | BTRFS_MIXED_BACKREF_REV) | |
1938 | ret = btrfs_drop_snapshot(root, NULL, 0, 0); | |
1939 | else | |
1940 | ret = btrfs_drop_snapshot(root, NULL, 1, 0); | |
1941 | /* | |
1942 | * If we encounter a transaction abort during snapshot cleaning, we | |
1943 | * don't want to crash here | |
1944 | */ | |
1945 | BUG_ON(ret < 0 && ret != -EAGAIN && ret != -EROFS); | |
1946 | return 1; | |
e9d0b13b | 1947 | } |