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