]>
Commit | Line | Data |
---|---|---|
c1d7c514 | 1 | // SPDX-License-Identifier: GPL-2.0 |
6cbd5570 CM |
2 | /* |
3 | * Copyright (C) 2007 Oracle. All rights reserved. | |
6cbd5570 CM |
4 | */ |
5 | ||
79154b1b | 6 | #include <linux/fs.h> |
5a0e3ad6 | 7 | #include <linux/slab.h> |
34088780 | 8 | #include <linux/sched.h> |
d3c2fdcf | 9 | #include <linux/writeback.h> |
5f39d397 | 10 | #include <linux/pagemap.h> |
5f2cc086 | 11 | #include <linux/blkdev.h> |
8ea05e3a | 12 | #include <linux/uuid.h> |
79154b1b CM |
13 | #include "ctree.h" |
14 | #include "disk-io.h" | |
15 | #include "transaction.h" | |
925baedd | 16 | #include "locking.h" |
e02119d5 | 17 | #include "tree-log.h" |
581bb050 | 18 | #include "inode-map.h" |
733f4fbb | 19 | #include "volumes.h" |
8dabb742 | 20 | #include "dev-replace.h" |
fcebe456 | 21 | #include "qgroup.h" |
79154b1b | 22 | |
0f7d52f4 CM |
23 | #define BTRFS_ROOT_TRANS_TAG 0 |
24 | ||
e8c9f186 | 25 | static const unsigned int btrfs_blocked_trans_types[TRANS_STATE_MAX] = { |
4a9d8bde | 26 | [TRANS_STATE_RUNNING] = 0U, |
bcf3a3e7 NB |
27 | [TRANS_STATE_BLOCKED] = __TRANS_START, |
28 | [TRANS_STATE_COMMIT_START] = (__TRANS_START | __TRANS_ATTACH), | |
29 | [TRANS_STATE_COMMIT_DOING] = (__TRANS_START | | |
4a9d8bde MX |
30 | __TRANS_ATTACH | |
31 | __TRANS_JOIN), | |
bcf3a3e7 | 32 | [TRANS_STATE_UNBLOCKED] = (__TRANS_START | |
4a9d8bde MX |
33 | __TRANS_ATTACH | |
34 | __TRANS_JOIN | | |
35 | __TRANS_JOIN_NOLOCK), | |
bcf3a3e7 | 36 | [TRANS_STATE_COMPLETED] = (__TRANS_START | |
4a9d8bde MX |
37 | __TRANS_ATTACH | |
38 | __TRANS_JOIN | | |
39 | __TRANS_JOIN_NOLOCK), | |
40 | }; | |
41 | ||
724e2315 | 42 | void btrfs_put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 43 | { |
9b64f57d ER |
44 | WARN_ON(refcount_read(&transaction->use_count) == 0); |
45 | if (refcount_dec_and_test(&transaction->use_count)) { | |
a4abeea4 | 46 | BUG_ON(!list_empty(&transaction->list)); |
5c9d028b LB |
47 | WARN_ON(!RB_EMPTY_ROOT( |
48 | &transaction->delayed_refs.href_root.rb_root)); | |
1262133b | 49 | if (transaction->delayed_refs.pending_csums) |
ab8d0fc4 JM |
50 | btrfs_err(transaction->fs_info, |
51 | "pending csums is %llu", | |
52 | transaction->delayed_refs.pending_csums); | |
6df9a95e JB |
53 | while (!list_empty(&transaction->pending_chunks)) { |
54 | struct extent_map *em; | |
55 | ||
56 | em = list_first_entry(&transaction->pending_chunks, | |
57 | struct extent_map, list); | |
58 | list_del_init(&em->list); | |
59 | free_extent_map(em); | |
60 | } | |
7785a663 FM |
61 | /* |
62 | * If any block groups are found in ->deleted_bgs then it's | |
63 | * because the transaction was aborted and a commit did not | |
64 | * happen (things failed before writing the new superblock | |
65 | * and calling btrfs_finish_extent_commit()), so we can not | |
66 | * discard the physical locations of the block groups. | |
67 | */ | |
68 | while (!list_empty(&transaction->deleted_bgs)) { | |
69 | struct btrfs_block_group_cache *cache; | |
70 | ||
71 | cache = list_first_entry(&transaction->deleted_bgs, | |
72 | struct btrfs_block_group_cache, | |
73 | bg_list); | |
74 | list_del_init(&cache->bg_list); | |
75 | btrfs_put_block_group_trimming(cache); | |
76 | btrfs_put_block_group(cache); | |
77 | } | |
4b5faeac | 78 | kfree(transaction); |
78fae27e | 79 | } |
79154b1b CM |
80 | } |
81 | ||
663dfbb0 FM |
82 | static void clear_btree_io_tree(struct extent_io_tree *tree) |
83 | { | |
84 | spin_lock(&tree->lock); | |
b666a9cd DS |
85 | /* |
86 | * Do a single barrier for the waitqueue_active check here, the state | |
87 | * of the waitqueue should not change once clear_btree_io_tree is | |
88 | * called. | |
89 | */ | |
90 | smp_mb(); | |
663dfbb0 FM |
91 | while (!RB_EMPTY_ROOT(&tree->state)) { |
92 | struct rb_node *node; | |
93 | struct extent_state *state; | |
94 | ||
95 | node = rb_first(&tree->state); | |
96 | state = rb_entry(node, struct extent_state, rb_node); | |
97 | rb_erase(&state->rb_node, &tree->state); | |
98 | RB_CLEAR_NODE(&state->rb_node); | |
99 | /* | |
100 | * btree io trees aren't supposed to have tasks waiting for | |
101 | * changes in the flags of extent states ever. | |
102 | */ | |
103 | ASSERT(!waitqueue_active(&state->wq)); | |
104 | free_extent_state(state); | |
351810c1 DS |
105 | |
106 | cond_resched_lock(&tree->lock); | |
663dfbb0 FM |
107 | } |
108 | spin_unlock(&tree->lock); | |
109 | } | |
110 | ||
16916a88 | 111 | static noinline void switch_commit_roots(struct btrfs_transaction *trans) |
817d52f8 | 112 | { |
16916a88 | 113 | struct btrfs_fs_info *fs_info = trans->fs_info; |
9e351cc8 JB |
114 | struct btrfs_root *root, *tmp; |
115 | ||
116 | down_write(&fs_info->commit_root_sem); | |
117 | list_for_each_entry_safe(root, tmp, &trans->switch_commits, | |
118 | dirty_list) { | |
119 | list_del_init(&root->dirty_list); | |
120 | free_extent_buffer(root->commit_root); | |
121 | root->commit_root = btrfs_root_node(root); | |
4fd786e6 | 122 | if (is_fstree(root->root_key.objectid)) |
9e351cc8 | 123 | btrfs_unpin_free_ino(root); |
663dfbb0 | 124 | clear_btree_io_tree(&root->dirty_log_pages); |
9e351cc8 | 125 | } |
2b9dbef2 JB |
126 | |
127 | /* We can free old roots now. */ | |
128 | spin_lock(&trans->dropped_roots_lock); | |
129 | while (!list_empty(&trans->dropped_roots)) { | |
130 | root = list_first_entry(&trans->dropped_roots, | |
131 | struct btrfs_root, root_list); | |
132 | list_del_init(&root->root_list); | |
133 | spin_unlock(&trans->dropped_roots_lock); | |
134 | btrfs_drop_and_free_fs_root(fs_info, root); | |
135 | spin_lock(&trans->dropped_roots_lock); | |
136 | } | |
137 | spin_unlock(&trans->dropped_roots_lock); | |
9e351cc8 | 138 | up_write(&fs_info->commit_root_sem); |
817d52f8 JB |
139 | } |
140 | ||
0860adfd MX |
141 | static inline void extwriter_counter_inc(struct btrfs_transaction *trans, |
142 | unsigned int type) | |
143 | { | |
144 | if (type & TRANS_EXTWRITERS) | |
145 | atomic_inc(&trans->num_extwriters); | |
146 | } | |
147 | ||
148 | static inline void extwriter_counter_dec(struct btrfs_transaction *trans, | |
149 | unsigned int type) | |
150 | { | |
151 | if (type & TRANS_EXTWRITERS) | |
152 | atomic_dec(&trans->num_extwriters); | |
153 | } | |
154 | ||
155 | static inline void extwriter_counter_init(struct btrfs_transaction *trans, | |
156 | unsigned int type) | |
157 | { | |
158 | atomic_set(&trans->num_extwriters, ((type & TRANS_EXTWRITERS) ? 1 : 0)); | |
159 | } | |
160 | ||
161 | static inline int extwriter_counter_read(struct btrfs_transaction *trans) | |
162 | { | |
163 | return atomic_read(&trans->num_extwriters); | |
178260b2 MX |
164 | } |
165 | ||
d352ac68 CM |
166 | /* |
167 | * either allocate a new transaction or hop into the existing one | |
168 | */ | |
2ff7e61e JM |
169 | static noinline int join_transaction(struct btrfs_fs_info *fs_info, |
170 | unsigned int type) | |
79154b1b CM |
171 | { |
172 | struct btrfs_transaction *cur_trans; | |
a4abeea4 | 173 | |
19ae4e81 | 174 | spin_lock(&fs_info->trans_lock); |
d43317dc | 175 | loop: |
49b25e05 | 176 | /* The file system has been taken offline. No new transactions. */ |
87533c47 | 177 | if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) { |
19ae4e81 | 178 | spin_unlock(&fs_info->trans_lock); |
49b25e05 JM |
179 | return -EROFS; |
180 | } | |
181 | ||
19ae4e81 | 182 | cur_trans = fs_info->running_transaction; |
a4abeea4 | 183 | if (cur_trans) { |
871383be | 184 | if (cur_trans->aborted) { |
19ae4e81 | 185 | spin_unlock(&fs_info->trans_lock); |
49b25e05 | 186 | return cur_trans->aborted; |
871383be | 187 | } |
4a9d8bde | 188 | if (btrfs_blocked_trans_types[cur_trans->state] & type) { |
178260b2 MX |
189 | spin_unlock(&fs_info->trans_lock); |
190 | return -EBUSY; | |
191 | } | |
9b64f57d | 192 | refcount_inc(&cur_trans->use_count); |
13c5a93e | 193 | atomic_inc(&cur_trans->num_writers); |
0860adfd | 194 | extwriter_counter_inc(cur_trans, type); |
19ae4e81 | 195 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 196 | return 0; |
79154b1b | 197 | } |
19ae4e81 | 198 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 199 | |
354aa0fb MX |
200 | /* |
201 | * If we are ATTACH, we just want to catch the current transaction, | |
202 | * and commit it. If there is no transaction, just return ENOENT. | |
203 | */ | |
204 | if (type == TRANS_ATTACH) | |
205 | return -ENOENT; | |
206 | ||
4a9d8bde MX |
207 | /* |
208 | * JOIN_NOLOCK only happens during the transaction commit, so | |
209 | * it is impossible that ->running_transaction is NULL | |
210 | */ | |
211 | BUG_ON(type == TRANS_JOIN_NOLOCK); | |
212 | ||
4b5faeac | 213 | cur_trans = kmalloc(sizeof(*cur_trans), GFP_NOFS); |
a4abeea4 JB |
214 | if (!cur_trans) |
215 | return -ENOMEM; | |
d43317dc | 216 | |
19ae4e81 JS |
217 | spin_lock(&fs_info->trans_lock); |
218 | if (fs_info->running_transaction) { | |
d43317dc CM |
219 | /* |
220 | * someone started a transaction after we unlocked. Make sure | |
4a9d8bde | 221 | * to redo the checks above |
d43317dc | 222 | */ |
4b5faeac | 223 | kfree(cur_trans); |
d43317dc | 224 | goto loop; |
87533c47 | 225 | } else if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) { |
e4b50e14 | 226 | spin_unlock(&fs_info->trans_lock); |
4b5faeac | 227 | kfree(cur_trans); |
7b8b92af | 228 | return -EROFS; |
79154b1b | 229 | } |
d43317dc | 230 | |
ab8d0fc4 | 231 | cur_trans->fs_info = fs_info; |
a4abeea4 | 232 | atomic_set(&cur_trans->num_writers, 1); |
0860adfd | 233 | extwriter_counter_init(cur_trans, type); |
a4abeea4 JB |
234 | init_waitqueue_head(&cur_trans->writer_wait); |
235 | init_waitqueue_head(&cur_trans->commit_wait); | |
4a9d8bde | 236 | cur_trans->state = TRANS_STATE_RUNNING; |
a4abeea4 JB |
237 | /* |
238 | * One for this trans handle, one so it will live on until we | |
239 | * commit the transaction. | |
240 | */ | |
9b64f57d | 241 | refcount_set(&cur_trans->use_count, 2); |
3204d33c | 242 | cur_trans->flags = 0; |
afd48513 | 243 | cur_trans->start_time = ktime_get_seconds(); |
a4abeea4 | 244 | |
a099d0fd AM |
245 | memset(&cur_trans->delayed_refs, 0, sizeof(cur_trans->delayed_refs)); |
246 | ||
5c9d028b | 247 | cur_trans->delayed_refs.href_root = RB_ROOT_CACHED; |
3368d001 | 248 | cur_trans->delayed_refs.dirty_extent_root = RB_ROOT; |
d7df2c79 | 249 | atomic_set(&cur_trans->delayed_refs.num_entries, 0); |
20b297d6 JS |
250 | |
251 | /* | |
252 | * although the tree mod log is per file system and not per transaction, | |
253 | * the log must never go across transaction boundaries. | |
254 | */ | |
255 | smp_mb(); | |
31b1a2bd | 256 | if (!list_empty(&fs_info->tree_mod_seq_list)) |
5d163e0e | 257 | WARN(1, KERN_ERR "BTRFS: tree_mod_seq_list not empty when creating a fresh transaction\n"); |
31b1a2bd | 258 | if (!RB_EMPTY_ROOT(&fs_info->tree_mod_log)) |
5d163e0e | 259 | WARN(1, KERN_ERR "BTRFS: tree_mod_log rb tree not empty when creating a fresh transaction\n"); |
fc36ed7e | 260 | atomic64_set(&fs_info->tree_mod_seq, 0); |
20b297d6 | 261 | |
a4abeea4 JB |
262 | spin_lock_init(&cur_trans->delayed_refs.lock); |
263 | ||
264 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); | |
6df9a95e | 265 | INIT_LIST_HEAD(&cur_trans->pending_chunks); |
9e351cc8 | 266 | INIT_LIST_HEAD(&cur_trans->switch_commits); |
ce93ec54 | 267 | INIT_LIST_HEAD(&cur_trans->dirty_bgs); |
1bbc621e | 268 | INIT_LIST_HEAD(&cur_trans->io_bgs); |
2b9dbef2 | 269 | INIT_LIST_HEAD(&cur_trans->dropped_roots); |
1bbc621e | 270 | mutex_init(&cur_trans->cache_write_mutex); |
cb723e49 | 271 | cur_trans->num_dirty_bgs = 0; |
ce93ec54 | 272 | spin_lock_init(&cur_trans->dirty_bgs_lock); |
e33e17ee | 273 | INIT_LIST_HEAD(&cur_trans->deleted_bgs); |
2b9dbef2 | 274 | spin_lock_init(&cur_trans->dropped_roots_lock); |
19ae4e81 | 275 | list_add_tail(&cur_trans->list, &fs_info->trans_list); |
a4abeea4 | 276 | extent_io_tree_init(&cur_trans->dirty_pages, |
c6100a4b | 277 | fs_info->btree_inode); |
19ae4e81 JS |
278 | fs_info->generation++; |
279 | cur_trans->transid = fs_info->generation; | |
280 | fs_info->running_transaction = cur_trans; | |
49b25e05 | 281 | cur_trans->aborted = 0; |
19ae4e81 | 282 | spin_unlock(&fs_info->trans_lock); |
15ee9bc7 | 283 | |
79154b1b CM |
284 | return 0; |
285 | } | |
286 | ||
d352ac68 | 287 | /* |
d397712b CM |
288 | * this does all the record keeping required to make sure that a reference |
289 | * counted root is properly recorded in a given transaction. This is required | |
290 | * to make sure the old root from before we joined the transaction is deleted | |
291 | * when the transaction commits | |
d352ac68 | 292 | */ |
7585717f | 293 | static int record_root_in_trans(struct btrfs_trans_handle *trans, |
6426c7ad QW |
294 | struct btrfs_root *root, |
295 | int force) | |
6702ed49 | 296 | { |
0b246afa JM |
297 | struct btrfs_fs_info *fs_info = root->fs_info; |
298 | ||
6426c7ad QW |
299 | if ((test_bit(BTRFS_ROOT_REF_COWS, &root->state) && |
300 | root->last_trans < trans->transid) || force) { | |
0b246afa | 301 | WARN_ON(root == fs_info->extent_root); |
4d31778a | 302 | WARN_ON(!force && root->commit_root != root->node); |
5d4f98a2 | 303 | |
7585717f | 304 | /* |
27cdeb70 | 305 | * see below for IN_TRANS_SETUP usage rules |
7585717f CM |
306 | * we have the reloc mutex held now, so there |
307 | * is only one writer in this function | |
308 | */ | |
27cdeb70 | 309 | set_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state); |
7585717f | 310 | |
27cdeb70 | 311 | /* make sure readers find IN_TRANS_SETUP before |
7585717f CM |
312 | * they find our root->last_trans update |
313 | */ | |
314 | smp_wmb(); | |
315 | ||
0b246afa | 316 | spin_lock(&fs_info->fs_roots_radix_lock); |
6426c7ad | 317 | if (root->last_trans == trans->transid && !force) { |
0b246afa | 318 | spin_unlock(&fs_info->fs_roots_radix_lock); |
a4abeea4 JB |
319 | return 0; |
320 | } | |
0b246afa JM |
321 | radix_tree_tag_set(&fs_info->fs_roots_radix, |
322 | (unsigned long)root->root_key.objectid, | |
323 | BTRFS_ROOT_TRANS_TAG); | |
324 | spin_unlock(&fs_info->fs_roots_radix_lock); | |
7585717f CM |
325 | root->last_trans = trans->transid; |
326 | ||
327 | /* this is pretty tricky. We don't want to | |
328 | * take the relocation lock in btrfs_record_root_in_trans | |
329 | * unless we're really doing the first setup for this root in | |
330 | * this transaction. | |
331 | * | |
332 | * Normally we'd use root->last_trans as a flag to decide | |
333 | * if we want to take the expensive mutex. | |
334 | * | |
335 | * But, we have to set root->last_trans before we | |
336 | * init the relocation root, otherwise, we trip over warnings | |
337 | * in ctree.c. The solution used here is to flag ourselves | |
27cdeb70 | 338 | * with root IN_TRANS_SETUP. When this is 1, we're still |
7585717f CM |
339 | * fixing up the reloc trees and everyone must wait. |
340 | * | |
341 | * When this is zero, they can trust root->last_trans and fly | |
342 | * through btrfs_record_root_in_trans without having to take the | |
343 | * lock. smp_wmb() makes sure that all the writes above are | |
344 | * done before we pop in the zero below | |
345 | */ | |
5d4f98a2 | 346 | btrfs_init_reloc_root(trans, root); |
c7548af6 | 347 | smp_mb__before_atomic(); |
27cdeb70 | 348 | clear_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state); |
5d4f98a2 YZ |
349 | } |
350 | return 0; | |
351 | } | |
bcc63abb | 352 | |
7585717f | 353 | |
2b9dbef2 JB |
354 | void btrfs_add_dropped_root(struct btrfs_trans_handle *trans, |
355 | struct btrfs_root *root) | |
356 | { | |
0b246afa | 357 | struct btrfs_fs_info *fs_info = root->fs_info; |
2b9dbef2 JB |
358 | struct btrfs_transaction *cur_trans = trans->transaction; |
359 | ||
360 | /* Add ourselves to the transaction dropped list */ | |
361 | spin_lock(&cur_trans->dropped_roots_lock); | |
362 | list_add_tail(&root->root_list, &cur_trans->dropped_roots); | |
363 | spin_unlock(&cur_trans->dropped_roots_lock); | |
364 | ||
365 | /* Make sure we don't try to update the root at commit time */ | |
0b246afa JM |
366 | spin_lock(&fs_info->fs_roots_radix_lock); |
367 | radix_tree_tag_clear(&fs_info->fs_roots_radix, | |
2b9dbef2 JB |
368 | (unsigned long)root->root_key.objectid, |
369 | BTRFS_ROOT_TRANS_TAG); | |
0b246afa | 370 | spin_unlock(&fs_info->fs_roots_radix_lock); |
2b9dbef2 JB |
371 | } |
372 | ||
7585717f CM |
373 | int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, |
374 | struct btrfs_root *root) | |
375 | { | |
0b246afa JM |
376 | struct btrfs_fs_info *fs_info = root->fs_info; |
377 | ||
27cdeb70 | 378 | if (!test_bit(BTRFS_ROOT_REF_COWS, &root->state)) |
7585717f CM |
379 | return 0; |
380 | ||
381 | /* | |
27cdeb70 | 382 | * see record_root_in_trans for comments about IN_TRANS_SETUP usage |
7585717f CM |
383 | * and barriers |
384 | */ | |
385 | smp_rmb(); | |
386 | if (root->last_trans == trans->transid && | |
27cdeb70 | 387 | !test_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state)) |
7585717f CM |
388 | return 0; |
389 | ||
0b246afa | 390 | mutex_lock(&fs_info->reloc_mutex); |
6426c7ad | 391 | record_root_in_trans(trans, root, 0); |
0b246afa | 392 | mutex_unlock(&fs_info->reloc_mutex); |
7585717f CM |
393 | |
394 | return 0; | |
395 | } | |
396 | ||
4a9d8bde MX |
397 | static inline int is_transaction_blocked(struct btrfs_transaction *trans) |
398 | { | |
399 | return (trans->state >= TRANS_STATE_BLOCKED && | |
501407aa JB |
400 | trans->state < TRANS_STATE_UNBLOCKED && |
401 | !trans->aborted); | |
4a9d8bde MX |
402 | } |
403 | ||
d352ac68 CM |
404 | /* wait for commit against the current transaction to become unblocked |
405 | * when this is done, it is safe to start a new transaction, but the current | |
406 | * transaction might not be fully on disk. | |
407 | */ | |
2ff7e61e | 408 | static void wait_current_trans(struct btrfs_fs_info *fs_info) |
79154b1b | 409 | { |
f9295749 | 410 | struct btrfs_transaction *cur_trans; |
79154b1b | 411 | |
0b246afa JM |
412 | spin_lock(&fs_info->trans_lock); |
413 | cur_trans = fs_info->running_transaction; | |
4a9d8bde | 414 | if (cur_trans && is_transaction_blocked(cur_trans)) { |
9b64f57d | 415 | refcount_inc(&cur_trans->use_count); |
0b246afa | 416 | spin_unlock(&fs_info->trans_lock); |
72d63ed6 | 417 | |
0b246afa | 418 | wait_event(fs_info->transaction_wait, |
501407aa JB |
419 | cur_trans->state >= TRANS_STATE_UNBLOCKED || |
420 | cur_trans->aborted); | |
724e2315 | 421 | btrfs_put_transaction(cur_trans); |
a4abeea4 | 422 | } else { |
0b246afa | 423 | spin_unlock(&fs_info->trans_lock); |
f9295749 | 424 | } |
37d1aeee CM |
425 | } |
426 | ||
2ff7e61e | 427 | static int may_wait_transaction(struct btrfs_fs_info *fs_info, int type) |
a22285a6 | 428 | { |
0b246afa | 429 | if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) |
a4abeea4 JB |
430 | return 0; |
431 | ||
92e2f7e3 | 432 | if (type == TRANS_START) |
a22285a6 | 433 | return 1; |
a4abeea4 | 434 | |
a22285a6 YZ |
435 | return 0; |
436 | } | |
437 | ||
20dd2cbf MX |
438 | static inline bool need_reserve_reloc_root(struct btrfs_root *root) |
439 | { | |
0b246afa JM |
440 | struct btrfs_fs_info *fs_info = root->fs_info; |
441 | ||
442 | if (!fs_info->reloc_ctl || | |
27cdeb70 | 443 | !test_bit(BTRFS_ROOT_REF_COWS, &root->state) || |
20dd2cbf MX |
444 | root->root_key.objectid == BTRFS_TREE_RELOC_OBJECTID || |
445 | root->reloc_root) | |
446 | return false; | |
447 | ||
448 | return true; | |
449 | } | |
450 | ||
08e007d2 | 451 | static struct btrfs_trans_handle * |
5aed1dd8 | 452 | start_transaction(struct btrfs_root *root, unsigned int num_items, |
003d7c59 JM |
453 | unsigned int type, enum btrfs_reserve_flush_enum flush, |
454 | bool enforce_qgroups) | |
37d1aeee | 455 | { |
0b246afa JM |
456 | struct btrfs_fs_info *fs_info = root->fs_info; |
457 | ||
a22285a6 YZ |
458 | struct btrfs_trans_handle *h; |
459 | struct btrfs_transaction *cur_trans; | |
b5009945 | 460 | u64 num_bytes = 0; |
c5567237 | 461 | u64 qgroup_reserved = 0; |
20dd2cbf MX |
462 | bool reloc_reserved = false; |
463 | int ret; | |
acce952b | 464 | |
46c4e71e | 465 | /* Send isn't supposed to start transactions. */ |
2755a0de | 466 | ASSERT(current->journal_info != BTRFS_SEND_TRANS_STUB); |
46c4e71e | 467 | |
0b246afa | 468 | if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) |
acce952b | 469 | return ERR_PTR(-EROFS); |
2a1eb461 | 470 | |
46c4e71e | 471 | if (current->journal_info) { |
0860adfd | 472 | WARN_ON(type & TRANS_EXTWRITERS); |
2a1eb461 | 473 | h = current->journal_info; |
b50fff81 DS |
474 | refcount_inc(&h->use_count); |
475 | WARN_ON(refcount_read(&h->use_count) > 2); | |
2a1eb461 JB |
476 | h->orig_rsv = h->block_rsv; |
477 | h->block_rsv = NULL; | |
478 | goto got_it; | |
479 | } | |
b5009945 JB |
480 | |
481 | /* | |
482 | * Do the reservation before we join the transaction so we can do all | |
483 | * the appropriate flushing if need be. | |
484 | */ | |
003d7c59 | 485 | if (num_items && root != fs_info->chunk_root) { |
0b246afa | 486 | qgroup_reserved = num_items * fs_info->nodesize; |
733e03a0 QW |
487 | ret = btrfs_qgroup_reserve_meta_pertrans(root, qgroup_reserved, |
488 | enforce_qgroups); | |
7174109c QW |
489 | if (ret) |
490 | return ERR_PTR(ret); | |
c5567237 | 491 | |
0b246afa | 492 | num_bytes = btrfs_calc_trans_metadata_size(fs_info, num_items); |
20dd2cbf MX |
493 | /* |
494 | * Do the reservation for the relocation root creation | |
495 | */ | |
ee39b432 | 496 | if (need_reserve_reloc_root(root)) { |
0b246afa | 497 | num_bytes += fs_info->nodesize; |
20dd2cbf MX |
498 | reloc_reserved = true; |
499 | } | |
500 | ||
0b246afa | 501 | ret = btrfs_block_rsv_add(root, &fs_info->trans_block_rsv, |
08e007d2 | 502 | num_bytes, flush); |
b5009945 | 503 | if (ret) |
843fcf35 | 504 | goto reserve_fail; |
b5009945 | 505 | } |
a22285a6 | 506 | again: |
f2f767e7 | 507 | h = kmem_cache_zalloc(btrfs_trans_handle_cachep, GFP_NOFS); |
843fcf35 MX |
508 | if (!h) { |
509 | ret = -ENOMEM; | |
510 | goto alloc_fail; | |
511 | } | |
37d1aeee | 512 | |
98114659 JB |
513 | /* |
514 | * If we are JOIN_NOLOCK we're already committing a transaction and | |
515 | * waiting on this guy, so we don't need to do the sb_start_intwrite | |
516 | * because we're already holding a ref. We need this because we could | |
517 | * have raced in and did an fsync() on a file which can kick a commit | |
518 | * and then we deadlock with somebody doing a freeze. | |
354aa0fb MX |
519 | * |
520 | * If we are ATTACH, it means we just want to catch the current | |
521 | * transaction and commit it, so we needn't do sb_start_intwrite(). | |
98114659 | 522 | */ |
0860adfd | 523 | if (type & __TRANS_FREEZABLE) |
0b246afa | 524 | sb_start_intwrite(fs_info->sb); |
b2b5ef5c | 525 | |
2ff7e61e JM |
526 | if (may_wait_transaction(fs_info, type)) |
527 | wait_current_trans(fs_info); | |
a22285a6 | 528 | |
a4abeea4 | 529 | do { |
2ff7e61e | 530 | ret = join_transaction(fs_info, type); |
178260b2 | 531 | if (ret == -EBUSY) { |
2ff7e61e | 532 | wait_current_trans(fs_info); |
178260b2 MX |
533 | if (unlikely(type == TRANS_ATTACH)) |
534 | ret = -ENOENT; | |
535 | } | |
a4abeea4 JB |
536 | } while (ret == -EBUSY); |
537 | ||
a43f7f82 | 538 | if (ret < 0) |
843fcf35 | 539 | goto join_fail; |
0f7d52f4 | 540 | |
0b246afa | 541 | cur_trans = fs_info->running_transaction; |
a22285a6 YZ |
542 | |
543 | h->transid = cur_trans->transid; | |
544 | h->transaction = cur_trans; | |
d13603ef | 545 | h->root = root; |
b50fff81 | 546 | refcount_set(&h->use_count, 1); |
64b63580 | 547 | h->fs_info = root->fs_info; |
7174109c | 548 | |
a698d075 | 549 | h->type = type; |
d9a0540a | 550 | h->can_flush_pending_bgs = true; |
ea658bad | 551 | INIT_LIST_HEAD(&h->new_bgs); |
b7ec40d7 | 552 | |
a22285a6 | 553 | smp_mb(); |
4a9d8bde | 554 | if (cur_trans->state >= TRANS_STATE_BLOCKED && |
2ff7e61e | 555 | may_wait_transaction(fs_info, type)) { |
abdd2e80 | 556 | current->journal_info = h; |
3a45bb20 | 557 | btrfs_commit_transaction(h); |
a22285a6 YZ |
558 | goto again; |
559 | } | |
560 | ||
b5009945 | 561 | if (num_bytes) { |
0b246afa | 562 | trace_btrfs_space_reservation(fs_info, "transaction", |
2bcc0328 | 563 | h->transid, num_bytes, 1); |
0b246afa | 564 | h->block_rsv = &fs_info->trans_block_rsv; |
b5009945 | 565 | h->bytes_reserved = num_bytes; |
20dd2cbf | 566 | h->reloc_reserved = reloc_reserved; |
a22285a6 | 567 | } |
9ed74f2d | 568 | |
2a1eb461 | 569 | got_it: |
a4abeea4 | 570 | btrfs_record_root_in_trans(h, root); |
a22285a6 | 571 | |
bcf3a3e7 | 572 | if (!current->journal_info) |
a22285a6 | 573 | current->journal_info = h; |
79154b1b | 574 | return h; |
843fcf35 MX |
575 | |
576 | join_fail: | |
0860adfd | 577 | if (type & __TRANS_FREEZABLE) |
0b246afa | 578 | sb_end_intwrite(fs_info->sb); |
843fcf35 MX |
579 | kmem_cache_free(btrfs_trans_handle_cachep, h); |
580 | alloc_fail: | |
581 | if (num_bytes) | |
2ff7e61e | 582 | btrfs_block_rsv_release(fs_info, &fs_info->trans_block_rsv, |
843fcf35 MX |
583 | num_bytes); |
584 | reserve_fail: | |
733e03a0 | 585 | btrfs_qgroup_free_meta_pertrans(root, qgroup_reserved); |
843fcf35 | 586 | return ERR_PTR(ret); |
79154b1b CM |
587 | } |
588 | ||
f9295749 | 589 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
5aed1dd8 | 590 | unsigned int num_items) |
f9295749 | 591 | { |
08e007d2 | 592 | return start_transaction(root, num_items, TRANS_START, |
003d7c59 | 593 | BTRFS_RESERVE_FLUSH_ALL, true); |
f9295749 | 594 | } |
003d7c59 | 595 | |
8eab77ff FM |
596 | struct btrfs_trans_handle *btrfs_start_transaction_fallback_global_rsv( |
597 | struct btrfs_root *root, | |
598 | unsigned int num_items, | |
599 | int min_factor) | |
600 | { | |
0b246afa | 601 | struct btrfs_fs_info *fs_info = root->fs_info; |
8eab77ff FM |
602 | struct btrfs_trans_handle *trans; |
603 | u64 num_bytes; | |
604 | int ret; | |
605 | ||
003d7c59 JM |
606 | /* |
607 | * We have two callers: unlink and block group removal. The | |
608 | * former should succeed even if we will temporarily exceed | |
609 | * quota and the latter operates on the extent root so | |
610 | * qgroup enforcement is ignored anyway. | |
611 | */ | |
612 | trans = start_transaction(root, num_items, TRANS_START, | |
613 | BTRFS_RESERVE_FLUSH_ALL, false); | |
8eab77ff FM |
614 | if (!IS_ERR(trans) || PTR_ERR(trans) != -ENOSPC) |
615 | return trans; | |
616 | ||
617 | trans = btrfs_start_transaction(root, 0); | |
618 | if (IS_ERR(trans)) | |
619 | return trans; | |
620 | ||
0b246afa JM |
621 | num_bytes = btrfs_calc_trans_metadata_size(fs_info, num_items); |
622 | ret = btrfs_cond_migrate_bytes(fs_info, &fs_info->trans_block_rsv, | |
623 | num_bytes, min_factor); | |
8eab77ff | 624 | if (ret) { |
3a45bb20 | 625 | btrfs_end_transaction(trans); |
8eab77ff FM |
626 | return ERR_PTR(ret); |
627 | } | |
628 | ||
0b246afa | 629 | trans->block_rsv = &fs_info->trans_block_rsv; |
8eab77ff | 630 | trans->bytes_reserved = num_bytes; |
0b246afa | 631 | trace_btrfs_space_reservation(fs_info, "transaction", |
88d3a5aa | 632 | trans->transid, num_bytes, 1); |
8eab77ff FM |
633 | |
634 | return trans; | |
635 | } | |
8407aa46 | 636 | |
7a7eaa40 | 637 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root) |
f9295749 | 638 | { |
003d7c59 JM |
639 | return start_transaction(root, 0, TRANS_JOIN, BTRFS_RESERVE_NO_FLUSH, |
640 | true); | |
f9295749 CM |
641 | } |
642 | ||
7a7eaa40 | 643 | struct btrfs_trans_handle *btrfs_join_transaction_nolock(struct btrfs_root *root) |
0af3d00b | 644 | { |
575a75d6 | 645 | return start_transaction(root, 0, TRANS_JOIN_NOLOCK, |
003d7c59 | 646 | BTRFS_RESERVE_NO_FLUSH, true); |
0af3d00b JB |
647 | } |
648 | ||
d4edf39b MX |
649 | /* |
650 | * btrfs_attach_transaction() - catch the running transaction | |
651 | * | |
652 | * It is used when we want to commit the current the transaction, but | |
653 | * don't want to start a new one. | |
654 | * | |
655 | * Note: If this function return -ENOENT, it just means there is no | |
656 | * running transaction. But it is possible that the inactive transaction | |
657 | * is still in the memory, not fully on disk. If you hope there is no | |
658 | * inactive transaction in the fs when -ENOENT is returned, you should | |
659 | * invoke | |
660 | * btrfs_attach_transaction_barrier() | |
661 | */ | |
354aa0fb | 662 | struct btrfs_trans_handle *btrfs_attach_transaction(struct btrfs_root *root) |
60376ce4 | 663 | { |
575a75d6 | 664 | return start_transaction(root, 0, TRANS_ATTACH, |
003d7c59 | 665 | BTRFS_RESERVE_NO_FLUSH, true); |
60376ce4 JB |
666 | } |
667 | ||
d4edf39b | 668 | /* |
90b6d283 | 669 | * btrfs_attach_transaction_barrier() - catch the running transaction |
d4edf39b MX |
670 | * |
671 | * It is similar to the above function, the differentia is this one | |
672 | * will wait for all the inactive transactions until they fully | |
673 | * complete. | |
674 | */ | |
675 | struct btrfs_trans_handle * | |
676 | btrfs_attach_transaction_barrier(struct btrfs_root *root) | |
677 | { | |
678 | struct btrfs_trans_handle *trans; | |
679 | ||
575a75d6 | 680 | trans = start_transaction(root, 0, TRANS_ATTACH, |
003d7c59 | 681 | BTRFS_RESERVE_NO_FLUSH, true); |
8d9e220c | 682 | if (trans == ERR_PTR(-ENOENT)) |
2ff7e61e | 683 | btrfs_wait_for_commit(root->fs_info, 0); |
d4edf39b MX |
684 | |
685 | return trans; | |
686 | } | |
687 | ||
d352ac68 | 688 | /* wait for a transaction commit to be fully complete */ |
2ff7e61e | 689 | static noinline void wait_for_commit(struct btrfs_transaction *commit) |
89ce8a63 | 690 | { |
4a9d8bde | 691 | wait_event(commit->commit_wait, commit->state == TRANS_STATE_COMPLETED); |
89ce8a63 CM |
692 | } |
693 | ||
2ff7e61e | 694 | int btrfs_wait_for_commit(struct btrfs_fs_info *fs_info, u64 transid) |
46204592 SW |
695 | { |
696 | struct btrfs_transaction *cur_trans = NULL, *t; | |
8cd2807f | 697 | int ret = 0; |
46204592 | 698 | |
46204592 | 699 | if (transid) { |
0b246afa | 700 | if (transid <= fs_info->last_trans_committed) |
a4abeea4 | 701 | goto out; |
46204592 SW |
702 | |
703 | /* find specified transaction */ | |
0b246afa JM |
704 | spin_lock(&fs_info->trans_lock); |
705 | list_for_each_entry(t, &fs_info->trans_list, list) { | |
46204592 SW |
706 | if (t->transid == transid) { |
707 | cur_trans = t; | |
9b64f57d | 708 | refcount_inc(&cur_trans->use_count); |
8cd2807f | 709 | ret = 0; |
46204592 SW |
710 | break; |
711 | } | |
8cd2807f MX |
712 | if (t->transid > transid) { |
713 | ret = 0; | |
46204592 | 714 | break; |
8cd2807f | 715 | } |
46204592 | 716 | } |
0b246afa | 717 | spin_unlock(&fs_info->trans_lock); |
42383020 SW |
718 | |
719 | /* | |
720 | * The specified transaction doesn't exist, or we | |
721 | * raced with btrfs_commit_transaction | |
722 | */ | |
723 | if (!cur_trans) { | |
0b246afa | 724 | if (transid > fs_info->last_trans_committed) |
42383020 | 725 | ret = -EINVAL; |
8cd2807f | 726 | goto out; |
42383020 | 727 | } |
46204592 SW |
728 | } else { |
729 | /* find newest transaction that is committing | committed */ | |
0b246afa JM |
730 | spin_lock(&fs_info->trans_lock); |
731 | list_for_each_entry_reverse(t, &fs_info->trans_list, | |
46204592 | 732 | list) { |
4a9d8bde MX |
733 | if (t->state >= TRANS_STATE_COMMIT_START) { |
734 | if (t->state == TRANS_STATE_COMPLETED) | |
3473f3c0 | 735 | break; |
46204592 | 736 | cur_trans = t; |
9b64f57d | 737 | refcount_inc(&cur_trans->use_count); |
46204592 SW |
738 | break; |
739 | } | |
740 | } | |
0b246afa | 741 | spin_unlock(&fs_info->trans_lock); |
46204592 | 742 | if (!cur_trans) |
a4abeea4 | 743 | goto out; /* nothing committing|committed */ |
46204592 SW |
744 | } |
745 | ||
2ff7e61e | 746 | wait_for_commit(cur_trans); |
724e2315 | 747 | btrfs_put_transaction(cur_trans); |
a4abeea4 | 748 | out: |
46204592 SW |
749 | return ret; |
750 | } | |
751 | ||
2ff7e61e | 752 | void btrfs_throttle(struct btrfs_fs_info *fs_info) |
37d1aeee | 753 | { |
92e2f7e3 | 754 | wait_current_trans(fs_info); |
37d1aeee CM |
755 | } |
756 | ||
2ff7e61e | 757 | static int should_end_transaction(struct btrfs_trans_handle *trans) |
8929ecfa | 758 | { |
2ff7e61e | 759 | struct btrfs_fs_info *fs_info = trans->fs_info; |
0b246afa | 760 | |
af9b8a0e | 761 | if (btrfs_check_space_for_delayed_refs(trans)) |
1be41b78 | 762 | return 1; |
36ba022a | 763 | |
2ff7e61e | 764 | return !!btrfs_block_rsv_check(&fs_info->global_block_rsv, 5); |
8929ecfa YZ |
765 | } |
766 | ||
3a45bb20 | 767 | int btrfs_should_end_transaction(struct btrfs_trans_handle *trans) |
8929ecfa YZ |
768 | { |
769 | struct btrfs_transaction *cur_trans = trans->transaction; | |
770 | int updates; | |
49b25e05 | 771 | int err; |
8929ecfa | 772 | |
a4abeea4 | 773 | smp_mb(); |
4a9d8bde MX |
774 | if (cur_trans->state >= TRANS_STATE_BLOCKED || |
775 | cur_trans->delayed_refs.flushing) | |
8929ecfa YZ |
776 | return 1; |
777 | ||
778 | updates = trans->delayed_ref_updates; | |
779 | trans->delayed_ref_updates = 0; | |
49b25e05 | 780 | if (updates) { |
c79a70b1 | 781 | err = btrfs_run_delayed_refs(trans, updates * 2); |
49b25e05 JM |
782 | if (err) /* Error code will also eval true */ |
783 | return err; | |
784 | } | |
8929ecfa | 785 | |
2ff7e61e | 786 | return should_end_transaction(trans); |
8929ecfa YZ |
787 | } |
788 | ||
dc60c525 NB |
789 | static void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans) |
790 | ||
0e34693f | 791 | { |
dc60c525 NB |
792 | struct btrfs_fs_info *fs_info = trans->fs_info; |
793 | ||
0e34693f NB |
794 | if (!trans->block_rsv) { |
795 | ASSERT(!trans->bytes_reserved); | |
796 | return; | |
797 | } | |
798 | ||
799 | if (!trans->bytes_reserved) | |
800 | return; | |
801 | ||
802 | ASSERT(trans->block_rsv == &fs_info->trans_block_rsv); | |
803 | trace_btrfs_space_reservation(fs_info, "transaction", | |
804 | trans->transid, trans->bytes_reserved, 0); | |
805 | btrfs_block_rsv_release(fs_info, trans->block_rsv, | |
806 | trans->bytes_reserved); | |
807 | trans->bytes_reserved = 0; | |
808 | } | |
809 | ||
89ce8a63 | 810 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
3a45bb20 | 811 | int throttle) |
79154b1b | 812 | { |
3a45bb20 | 813 | struct btrfs_fs_info *info = trans->fs_info; |
8929ecfa | 814 | struct btrfs_transaction *cur_trans = trans->transaction; |
31b9655f | 815 | u64 transid = trans->transid; |
1be41b78 | 816 | unsigned long cur = trans->delayed_ref_updates; |
a698d075 | 817 | int lock = (trans->type != TRANS_JOIN_NOLOCK); |
4edc2ca3 | 818 | int err = 0; |
a79b7d4b | 819 | int must_run_delayed_refs = 0; |
c3e69d58 | 820 | |
b50fff81 DS |
821 | if (refcount_read(&trans->use_count) > 1) { |
822 | refcount_dec(&trans->use_count); | |
2a1eb461 JB |
823 | trans->block_rsv = trans->orig_rsv; |
824 | return 0; | |
825 | } | |
826 | ||
dc60c525 | 827 | btrfs_trans_release_metadata(trans); |
4c13d758 | 828 | trans->block_rsv = NULL; |
c5567237 | 829 | |
ea658bad | 830 | if (!list_empty(&trans->new_bgs)) |
6c686b35 | 831 | btrfs_create_pending_block_groups(trans); |
ea658bad | 832 | |
1be41b78 | 833 | trans->delayed_ref_updates = 0; |
a79b7d4b CM |
834 | if (!trans->sync) { |
835 | must_run_delayed_refs = | |
7c861627 | 836 | btrfs_should_throttle_delayed_refs(trans); |
0a2b2a84 | 837 | cur = max_t(unsigned long, cur, 32); |
a79b7d4b CM |
838 | |
839 | /* | |
840 | * don't make the caller wait if they are from a NOLOCK | |
841 | * or ATTACH transaction, it will deadlock with commit | |
842 | */ | |
843 | if (must_run_delayed_refs == 1 && | |
844 | (trans->type & (__TRANS_JOIN_NOLOCK | __TRANS_ATTACH))) | |
845 | must_run_delayed_refs = 2; | |
56bec294 | 846 | } |
bb721703 | 847 | |
dc60c525 | 848 | btrfs_trans_release_metadata(trans); |
0e721106 | 849 | trans->block_rsv = NULL; |
56bec294 | 850 | |
ea658bad | 851 | if (!list_empty(&trans->new_bgs)) |
6c686b35 | 852 | btrfs_create_pending_block_groups(trans); |
ea658bad | 853 | |
4fbcdf66 FM |
854 | btrfs_trans_release_chunk_metadata(trans); |
855 | ||
92e2f7e3 | 856 | if (lock && should_end_transaction(trans) && |
20c7bcec | 857 | READ_ONCE(cur_trans->state) == TRANS_STATE_RUNNING) { |
4a9d8bde MX |
858 | spin_lock(&info->trans_lock); |
859 | if (cur_trans->state == TRANS_STATE_RUNNING) | |
860 | cur_trans->state = TRANS_STATE_BLOCKED; | |
861 | spin_unlock(&info->trans_lock); | |
a4abeea4 | 862 | } |
8929ecfa | 863 | |
20c7bcec | 864 | if (lock && READ_ONCE(cur_trans->state) == TRANS_STATE_BLOCKED) { |
3bbb24b2 | 865 | if (throttle) |
3a45bb20 | 866 | return btrfs_commit_transaction(trans); |
3bbb24b2 | 867 | else |
8929ecfa YZ |
868 | wake_up_process(info->transaction_kthread); |
869 | } | |
870 | ||
0860adfd | 871 | if (trans->type & __TRANS_FREEZABLE) |
0b246afa | 872 | sb_end_intwrite(info->sb); |
6df7881a | 873 | |
8929ecfa | 874 | WARN_ON(cur_trans != info->running_transaction); |
13c5a93e JB |
875 | WARN_ON(atomic_read(&cur_trans->num_writers) < 1); |
876 | atomic_dec(&cur_trans->num_writers); | |
0860adfd | 877 | extwriter_counter_dec(cur_trans, trans->type); |
89ce8a63 | 878 | |
093258e6 | 879 | cond_wake_up(&cur_trans->writer_wait); |
724e2315 | 880 | btrfs_put_transaction(cur_trans); |
9ed74f2d JB |
881 | |
882 | if (current->journal_info == trans) | |
883 | current->journal_info = NULL; | |
ab78c84d | 884 | |
24bbcf04 | 885 | if (throttle) |
2ff7e61e | 886 | btrfs_run_delayed_iputs(info); |
24bbcf04 | 887 | |
49b25e05 | 888 | if (trans->aborted || |
0b246afa | 889 | test_bit(BTRFS_FS_STATE_ERROR, &info->fs_state)) { |
4e121c06 | 890 | wake_up_process(info->transaction_kthread); |
4edc2ca3 | 891 | err = -EIO; |
4e121c06 | 892 | } |
49b25e05 | 893 | |
4edc2ca3 | 894 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
a79b7d4b | 895 | if (must_run_delayed_refs) { |
2ff7e61e | 896 | btrfs_async_run_delayed_refs(info, cur, transid, |
a79b7d4b CM |
897 | must_run_delayed_refs == 1); |
898 | } | |
4edc2ca3 | 899 | return err; |
79154b1b CM |
900 | } |
901 | ||
3a45bb20 | 902 | int btrfs_end_transaction(struct btrfs_trans_handle *trans) |
89ce8a63 | 903 | { |
3a45bb20 | 904 | return __btrfs_end_transaction(trans, 0); |
89ce8a63 CM |
905 | } |
906 | ||
3a45bb20 | 907 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans) |
89ce8a63 | 908 | { |
3a45bb20 | 909 | return __btrfs_end_transaction(trans, 1); |
16cdcec7 MX |
910 | } |
911 | ||
d352ac68 CM |
912 | /* |
913 | * when btree blocks are allocated, they have some corresponding bits set for | |
914 | * them in one of two extent_io trees. This is used to make sure all of | |
690587d1 | 915 | * those extents are sent to disk but does not wait on them |
d352ac68 | 916 | */ |
2ff7e61e | 917 | int btrfs_write_marked_extents(struct btrfs_fs_info *fs_info, |
8cef4e16 | 918 | struct extent_io_tree *dirty_pages, int mark) |
79154b1b | 919 | { |
777e6bd7 | 920 | int err = 0; |
7c4452b9 | 921 | int werr = 0; |
0b246afa | 922 | struct address_space *mapping = fs_info->btree_inode->i_mapping; |
e6138876 | 923 | struct extent_state *cached_state = NULL; |
777e6bd7 | 924 | u64 start = 0; |
5f39d397 | 925 | u64 end; |
7c4452b9 | 926 | |
6300463b | 927 | atomic_inc(&BTRFS_I(fs_info->btree_inode)->sync_writers); |
1728366e | 928 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
e6138876 | 929 | mark, &cached_state)) { |
663dfbb0 FM |
930 | bool wait_writeback = false; |
931 | ||
932 | err = convert_extent_bit(dirty_pages, start, end, | |
933 | EXTENT_NEED_WAIT, | |
210aa277 | 934 | mark, &cached_state); |
663dfbb0 FM |
935 | /* |
936 | * convert_extent_bit can return -ENOMEM, which is most of the | |
937 | * time a temporary error. So when it happens, ignore the error | |
938 | * and wait for writeback of this range to finish - because we | |
939 | * failed to set the bit EXTENT_NEED_WAIT for the range, a call | |
bf89d38f JM |
940 | * to __btrfs_wait_marked_extents() would not know that |
941 | * writeback for this range started and therefore wouldn't | |
942 | * wait for it to finish - we don't want to commit a | |
943 | * superblock that points to btree nodes/leafs for which | |
944 | * writeback hasn't finished yet (and without errors). | |
663dfbb0 FM |
945 | * We cleanup any entries left in the io tree when committing |
946 | * the transaction (through clear_btree_io_tree()). | |
947 | */ | |
948 | if (err == -ENOMEM) { | |
949 | err = 0; | |
950 | wait_writeback = true; | |
951 | } | |
952 | if (!err) | |
953 | err = filemap_fdatawrite_range(mapping, start, end); | |
1728366e JB |
954 | if (err) |
955 | werr = err; | |
663dfbb0 FM |
956 | else if (wait_writeback) |
957 | werr = filemap_fdatawait_range(mapping, start, end); | |
e38e2ed7 | 958 | free_extent_state(cached_state); |
663dfbb0 | 959 | cached_state = NULL; |
1728366e JB |
960 | cond_resched(); |
961 | start = end + 1; | |
7c4452b9 | 962 | } |
6300463b | 963 | atomic_dec(&BTRFS_I(fs_info->btree_inode)->sync_writers); |
690587d1 CM |
964 | return werr; |
965 | } | |
966 | ||
967 | /* | |
968 | * when btree blocks are allocated, they have some corresponding bits set for | |
969 | * them in one of two extent_io trees. This is used to make sure all of | |
970 | * those extents are on disk for transaction or log commit. We wait | |
971 | * on all the pages and clear them from the dirty pages state tree | |
972 | */ | |
bf89d38f JM |
973 | static int __btrfs_wait_marked_extents(struct btrfs_fs_info *fs_info, |
974 | struct extent_io_tree *dirty_pages) | |
690587d1 | 975 | { |
690587d1 CM |
976 | int err = 0; |
977 | int werr = 0; | |
0b246afa | 978 | struct address_space *mapping = fs_info->btree_inode->i_mapping; |
e6138876 | 979 | struct extent_state *cached_state = NULL; |
690587d1 CM |
980 | u64 start = 0; |
981 | u64 end; | |
777e6bd7 | 982 | |
1728366e | 983 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
e6138876 | 984 | EXTENT_NEED_WAIT, &cached_state)) { |
663dfbb0 FM |
985 | /* |
986 | * Ignore -ENOMEM errors returned by clear_extent_bit(). | |
987 | * When committing the transaction, we'll remove any entries | |
988 | * left in the io tree. For a log commit, we don't remove them | |
989 | * after committing the log because the tree can be accessed | |
990 | * concurrently - we do it only at transaction commit time when | |
991 | * it's safe to do it (through clear_btree_io_tree()). | |
992 | */ | |
993 | err = clear_extent_bit(dirty_pages, start, end, | |
ae0f1625 | 994 | EXTENT_NEED_WAIT, 0, 0, &cached_state); |
663dfbb0 FM |
995 | if (err == -ENOMEM) |
996 | err = 0; | |
997 | if (!err) | |
998 | err = filemap_fdatawait_range(mapping, start, end); | |
1728366e JB |
999 | if (err) |
1000 | werr = err; | |
e38e2ed7 FM |
1001 | free_extent_state(cached_state); |
1002 | cached_state = NULL; | |
1728366e JB |
1003 | cond_resched(); |
1004 | start = end + 1; | |
777e6bd7 | 1005 | } |
7c4452b9 CM |
1006 | if (err) |
1007 | werr = err; | |
bf89d38f JM |
1008 | return werr; |
1009 | } | |
656f30db | 1010 | |
bf89d38f JM |
1011 | int btrfs_wait_extents(struct btrfs_fs_info *fs_info, |
1012 | struct extent_io_tree *dirty_pages) | |
1013 | { | |
1014 | bool errors = false; | |
1015 | int err; | |
656f30db | 1016 | |
bf89d38f JM |
1017 | err = __btrfs_wait_marked_extents(fs_info, dirty_pages); |
1018 | if (test_and_clear_bit(BTRFS_FS_BTREE_ERR, &fs_info->flags)) | |
1019 | errors = true; | |
1020 | ||
1021 | if (errors && !err) | |
1022 | err = -EIO; | |
1023 | return err; | |
1024 | } | |
656f30db | 1025 | |
bf89d38f JM |
1026 | int btrfs_wait_tree_log_extents(struct btrfs_root *log_root, int mark) |
1027 | { | |
1028 | struct btrfs_fs_info *fs_info = log_root->fs_info; | |
1029 | struct extent_io_tree *dirty_pages = &log_root->dirty_log_pages; | |
1030 | bool errors = false; | |
1031 | int err; | |
656f30db | 1032 | |
bf89d38f JM |
1033 | ASSERT(log_root->root_key.objectid == BTRFS_TREE_LOG_OBJECTID); |
1034 | ||
1035 | err = __btrfs_wait_marked_extents(fs_info, dirty_pages); | |
1036 | if ((mark & EXTENT_DIRTY) && | |
1037 | test_and_clear_bit(BTRFS_FS_LOG1_ERR, &fs_info->flags)) | |
1038 | errors = true; | |
1039 | ||
1040 | if ((mark & EXTENT_NEW) && | |
1041 | test_and_clear_bit(BTRFS_FS_LOG2_ERR, &fs_info->flags)) | |
1042 | errors = true; | |
1043 | ||
1044 | if (errors && !err) | |
1045 | err = -EIO; | |
1046 | return err; | |
79154b1b CM |
1047 | } |
1048 | ||
690587d1 | 1049 | /* |
c9b577c0 NB |
1050 | * When btree blocks are allocated the corresponding extents are marked dirty. |
1051 | * This function ensures such extents are persisted on disk for transaction or | |
1052 | * log commit. | |
1053 | * | |
1054 | * @trans: transaction whose dirty pages we'd like to write | |
690587d1 | 1055 | */ |
70458a58 | 1056 | static int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans) |
690587d1 CM |
1057 | { |
1058 | int ret; | |
1059 | int ret2; | |
c9b577c0 | 1060 | struct extent_io_tree *dirty_pages = &trans->transaction->dirty_pages; |
70458a58 | 1061 | struct btrfs_fs_info *fs_info = trans->fs_info; |
c6adc9cc | 1062 | struct blk_plug plug; |
690587d1 | 1063 | |
c6adc9cc | 1064 | blk_start_plug(&plug); |
c9b577c0 | 1065 | ret = btrfs_write_marked_extents(fs_info, dirty_pages, EXTENT_DIRTY); |
c6adc9cc | 1066 | blk_finish_plug(&plug); |
bf89d38f | 1067 | ret2 = btrfs_wait_extents(fs_info, dirty_pages); |
bf0da8c1 | 1068 | |
c9b577c0 NB |
1069 | clear_btree_io_tree(&trans->transaction->dirty_pages); |
1070 | ||
bf0da8c1 CM |
1071 | if (ret) |
1072 | return ret; | |
c9b577c0 | 1073 | else if (ret2) |
bf0da8c1 | 1074 | return ret2; |
c9b577c0 NB |
1075 | else |
1076 | return 0; | |
d0c803c4 CM |
1077 | } |
1078 | ||
d352ac68 CM |
1079 | /* |
1080 | * this is used to update the root pointer in the tree of tree roots. | |
1081 | * | |
1082 | * But, in the case of the extent allocation tree, updating the root | |
1083 | * pointer may allocate blocks which may change the root of the extent | |
1084 | * allocation tree. | |
1085 | * | |
1086 | * So, this loops and repeats and makes sure the cowonly root didn't | |
1087 | * change while the root pointer was being updated in the metadata. | |
1088 | */ | |
0b86a832 CM |
1089 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
1090 | struct btrfs_root *root) | |
79154b1b CM |
1091 | { |
1092 | int ret; | |
0b86a832 | 1093 | u64 old_root_bytenr; |
86b9f2ec | 1094 | u64 old_root_used; |
0b246afa JM |
1095 | struct btrfs_fs_info *fs_info = root->fs_info; |
1096 | struct btrfs_root *tree_root = fs_info->tree_root; | |
79154b1b | 1097 | |
86b9f2ec | 1098 | old_root_used = btrfs_root_used(&root->root_item); |
56bec294 | 1099 | |
d397712b | 1100 | while (1) { |
0b86a832 | 1101 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
86b9f2ec | 1102 | if (old_root_bytenr == root->node->start && |
ea526d18 | 1103 | old_root_used == btrfs_root_used(&root->root_item)) |
79154b1b | 1104 | break; |
87ef2bb4 | 1105 | |
5d4f98a2 | 1106 | btrfs_set_root_node(&root->root_item, root->node); |
79154b1b | 1107 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
1108 | &root->root_key, |
1109 | &root->root_item); | |
49b25e05 JM |
1110 | if (ret) |
1111 | return ret; | |
56bec294 | 1112 | |
86b9f2ec | 1113 | old_root_used = btrfs_root_used(&root->root_item); |
0b86a832 | 1114 | } |
276e680d | 1115 | |
0b86a832 CM |
1116 | return 0; |
1117 | } | |
1118 | ||
d352ac68 CM |
1119 | /* |
1120 | * update all the cowonly tree roots on disk | |
49b25e05 JM |
1121 | * |
1122 | * The error handling in this function may not be obvious. Any of the | |
1123 | * failures will cause the file system to go offline. We still need | |
1124 | * to clean up the delayed refs. | |
d352ac68 | 1125 | */ |
9386d8bc | 1126 | static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans) |
0b86a832 | 1127 | { |
9386d8bc | 1128 | struct btrfs_fs_info *fs_info = trans->fs_info; |
ea526d18 | 1129 | struct list_head *dirty_bgs = &trans->transaction->dirty_bgs; |
1bbc621e | 1130 | struct list_head *io_bgs = &trans->transaction->io_bgs; |
0b86a832 | 1131 | struct list_head *next; |
84234f3a | 1132 | struct extent_buffer *eb; |
56bec294 | 1133 | int ret; |
84234f3a YZ |
1134 | |
1135 | eb = btrfs_lock_root_node(fs_info->tree_root); | |
49b25e05 JM |
1136 | ret = btrfs_cow_block(trans, fs_info->tree_root, eb, NULL, |
1137 | 0, &eb); | |
84234f3a YZ |
1138 | btrfs_tree_unlock(eb); |
1139 | free_extent_buffer(eb); | |
0b86a832 | 1140 | |
49b25e05 JM |
1141 | if (ret) |
1142 | return ret; | |
1143 | ||
c79a70b1 | 1144 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
49b25e05 JM |
1145 | if (ret) |
1146 | return ret; | |
87ef2bb4 | 1147 | |
0b246afa | 1148 | ret = btrfs_run_dev_stats(trans, fs_info); |
c16ce190 JB |
1149 | if (ret) |
1150 | return ret; | |
0b246afa | 1151 | ret = btrfs_run_dev_replace(trans, fs_info); |
c16ce190 JB |
1152 | if (ret) |
1153 | return ret; | |
280f8bd2 | 1154 | ret = btrfs_run_qgroups(trans); |
c16ce190 JB |
1155 | if (ret) |
1156 | return ret; | |
546adb0d | 1157 | |
2ff7e61e | 1158 | ret = btrfs_setup_space_cache(trans, fs_info); |
dcdf7f6d JB |
1159 | if (ret) |
1160 | return ret; | |
1161 | ||
546adb0d | 1162 | /* run_qgroups might have added some more refs */ |
c79a70b1 | 1163 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
c16ce190 JB |
1164 | if (ret) |
1165 | return ret; | |
ea526d18 | 1166 | again: |
d397712b | 1167 | while (!list_empty(&fs_info->dirty_cowonly_roots)) { |
2ff7e61e | 1168 | struct btrfs_root *root; |
0b86a832 CM |
1169 | next = fs_info->dirty_cowonly_roots.next; |
1170 | list_del_init(next); | |
1171 | root = list_entry(next, struct btrfs_root, dirty_list); | |
e7070be1 | 1172 | clear_bit(BTRFS_ROOT_DIRTY, &root->state); |
87ef2bb4 | 1173 | |
9e351cc8 JB |
1174 | if (root != fs_info->extent_root) |
1175 | list_add_tail(&root->dirty_list, | |
1176 | &trans->transaction->switch_commits); | |
49b25e05 JM |
1177 | ret = update_cowonly_root(trans, root); |
1178 | if (ret) | |
1179 | return ret; | |
c79a70b1 | 1180 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
ea526d18 JB |
1181 | if (ret) |
1182 | return ret; | |
79154b1b | 1183 | } |
276e680d | 1184 | |
1bbc621e | 1185 | while (!list_empty(dirty_bgs) || !list_empty(io_bgs)) { |
2ff7e61e | 1186 | ret = btrfs_write_dirty_block_groups(trans, fs_info); |
ea526d18 JB |
1187 | if (ret) |
1188 | return ret; | |
c79a70b1 | 1189 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
ea526d18 JB |
1190 | if (ret) |
1191 | return ret; | |
1192 | } | |
1193 | ||
1194 | if (!list_empty(&fs_info->dirty_cowonly_roots)) | |
1195 | goto again; | |
1196 | ||
9e351cc8 JB |
1197 | list_add_tail(&fs_info->extent_root->dirty_list, |
1198 | &trans->transaction->switch_commits); | |
9f6cbcbb DS |
1199 | |
1200 | /* Update dev-replace pointer once everything is committed */ | |
1201 | fs_info->dev_replace.committed_cursor_left = | |
1202 | fs_info->dev_replace.cursor_left_last_write_of_item; | |
8dabb742 | 1203 | |
79154b1b CM |
1204 | return 0; |
1205 | } | |
1206 | ||
d352ac68 CM |
1207 | /* |
1208 | * dead roots are old snapshots that need to be deleted. This allocates | |
1209 | * a dirty root struct and adds it into the list of dead roots that need to | |
1210 | * be deleted | |
1211 | */ | |
cfad392b | 1212 | void btrfs_add_dead_root(struct btrfs_root *root) |
5eda7b5e | 1213 | { |
0b246afa JM |
1214 | struct btrfs_fs_info *fs_info = root->fs_info; |
1215 | ||
1216 | spin_lock(&fs_info->trans_lock); | |
cfad392b | 1217 | if (list_empty(&root->root_list)) |
0b246afa JM |
1218 | list_add_tail(&root->root_list, &fs_info->dead_roots); |
1219 | spin_unlock(&fs_info->trans_lock); | |
5eda7b5e CM |
1220 | } |
1221 | ||
d352ac68 | 1222 | /* |
5d4f98a2 | 1223 | * update all the cowonly tree roots on disk |
d352ac68 | 1224 | */ |
7e4443d9 | 1225 | static noinline int commit_fs_roots(struct btrfs_trans_handle *trans) |
0f7d52f4 | 1226 | { |
7e4443d9 | 1227 | struct btrfs_fs_info *fs_info = trans->fs_info; |
0f7d52f4 | 1228 | struct btrfs_root *gang[8]; |
0f7d52f4 CM |
1229 | int i; |
1230 | int ret; | |
54aa1f4d CM |
1231 | int err = 0; |
1232 | ||
a4abeea4 | 1233 | spin_lock(&fs_info->fs_roots_radix_lock); |
d397712b | 1234 | while (1) { |
5d4f98a2 YZ |
1235 | ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix, |
1236 | (void **)gang, 0, | |
0f7d52f4 CM |
1237 | ARRAY_SIZE(gang), |
1238 | BTRFS_ROOT_TRANS_TAG); | |
1239 | if (ret == 0) | |
1240 | break; | |
1241 | for (i = 0; i < ret; i++) { | |
5b4aacef | 1242 | struct btrfs_root *root = gang[i]; |
5d4f98a2 YZ |
1243 | radix_tree_tag_clear(&fs_info->fs_roots_radix, |
1244 | (unsigned long)root->root_key.objectid, | |
1245 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 1246 | spin_unlock(&fs_info->fs_roots_radix_lock); |
31153d81 | 1247 | |
e02119d5 | 1248 | btrfs_free_log(trans, root); |
5d4f98a2 | 1249 | btrfs_update_reloc_root(trans, root); |
bcc63abb | 1250 | |
82d5902d LZ |
1251 | btrfs_save_ino_cache(root, trans); |
1252 | ||
f1ebcc74 | 1253 | /* see comments in should_cow_block() */ |
27cdeb70 | 1254 | clear_bit(BTRFS_ROOT_FORCE_COW, &root->state); |
c7548af6 | 1255 | smp_mb__after_atomic(); |
f1ebcc74 | 1256 | |
978d910d | 1257 | if (root->commit_root != root->node) { |
9e351cc8 JB |
1258 | list_add_tail(&root->dirty_list, |
1259 | &trans->transaction->switch_commits); | |
978d910d YZ |
1260 | btrfs_set_root_node(&root->root_item, |
1261 | root->node); | |
1262 | } | |
5d4f98a2 | 1263 | |
5d4f98a2 | 1264 | err = btrfs_update_root(trans, fs_info->tree_root, |
0f7d52f4 CM |
1265 | &root->root_key, |
1266 | &root->root_item); | |
a4abeea4 | 1267 | spin_lock(&fs_info->fs_roots_radix_lock); |
54aa1f4d CM |
1268 | if (err) |
1269 | break; | |
733e03a0 | 1270 | btrfs_qgroup_free_meta_all_pertrans(root); |
0f7d52f4 CM |
1271 | } |
1272 | } | |
a4abeea4 | 1273 | spin_unlock(&fs_info->fs_roots_radix_lock); |
54aa1f4d | 1274 | return err; |
0f7d52f4 CM |
1275 | } |
1276 | ||
d352ac68 | 1277 | /* |
de78b51a ES |
1278 | * defrag a given btree. |
1279 | * Every leaf in the btree is read and defragged. | |
d352ac68 | 1280 | */ |
de78b51a | 1281 | int btrfs_defrag_root(struct btrfs_root *root) |
e9d0b13b CM |
1282 | { |
1283 | struct btrfs_fs_info *info = root->fs_info; | |
e9d0b13b | 1284 | struct btrfs_trans_handle *trans; |
8929ecfa | 1285 | int ret; |
e9d0b13b | 1286 | |
27cdeb70 | 1287 | if (test_and_set_bit(BTRFS_ROOT_DEFRAG_RUNNING, &root->state)) |
e9d0b13b | 1288 | return 0; |
8929ecfa | 1289 | |
6b80053d | 1290 | while (1) { |
8929ecfa YZ |
1291 | trans = btrfs_start_transaction(root, 0); |
1292 | if (IS_ERR(trans)) | |
1293 | return PTR_ERR(trans); | |
1294 | ||
de78b51a | 1295 | ret = btrfs_defrag_leaves(trans, root); |
8929ecfa | 1296 | |
3a45bb20 | 1297 | btrfs_end_transaction(trans); |
2ff7e61e | 1298 | btrfs_btree_balance_dirty(info); |
e9d0b13b CM |
1299 | cond_resched(); |
1300 | ||
ab8d0fc4 | 1301 | if (btrfs_fs_closing(info) || ret != -EAGAIN) |
e9d0b13b | 1302 | break; |
210549eb | 1303 | |
ab8d0fc4 JM |
1304 | if (btrfs_defrag_cancelled(info)) { |
1305 | btrfs_debug(info, "defrag_root cancelled"); | |
210549eb DS |
1306 | ret = -EAGAIN; |
1307 | break; | |
1308 | } | |
e9d0b13b | 1309 | } |
27cdeb70 | 1310 | clear_bit(BTRFS_ROOT_DEFRAG_RUNNING, &root->state); |
8929ecfa | 1311 | return ret; |
e9d0b13b CM |
1312 | } |
1313 | ||
6426c7ad QW |
1314 | /* |
1315 | * Do all special snapshot related qgroup dirty hack. | |
1316 | * | |
1317 | * Will do all needed qgroup inherit and dirty hack like switch commit | |
1318 | * roots inside one transaction and write all btree into disk, to make | |
1319 | * qgroup works. | |
1320 | */ | |
1321 | static int qgroup_account_snapshot(struct btrfs_trans_handle *trans, | |
1322 | struct btrfs_root *src, | |
1323 | struct btrfs_root *parent, | |
1324 | struct btrfs_qgroup_inherit *inherit, | |
1325 | u64 dst_objectid) | |
1326 | { | |
1327 | struct btrfs_fs_info *fs_info = src->fs_info; | |
1328 | int ret; | |
1329 | ||
1330 | /* | |
1331 | * Save some performance in the case that qgroups are not | |
1332 | * enabled. If this check races with the ioctl, rescan will | |
1333 | * kick in anyway. | |
1334 | */ | |
9ea6e2b5 | 1335 | if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) |
6426c7ad | 1336 | return 0; |
6426c7ad | 1337 | |
4d31778a QW |
1338 | /* |
1339 | * Ensure dirty @src will be commited. Or, after comming | |
1340 | * commit_fs_roots() and switch_commit_roots(), any dirty but not | |
1341 | * recorded root will never be updated again, causing an outdated root | |
1342 | * item. | |
1343 | */ | |
1344 | record_root_in_trans(trans, src, 1); | |
1345 | ||
6426c7ad QW |
1346 | /* |
1347 | * We are going to commit transaction, see btrfs_commit_transaction() | |
1348 | * comment for reason locking tree_log_mutex | |
1349 | */ | |
1350 | mutex_lock(&fs_info->tree_log_mutex); | |
1351 | ||
7e4443d9 | 1352 | ret = commit_fs_roots(trans); |
6426c7ad QW |
1353 | if (ret) |
1354 | goto out; | |
460fb20a | 1355 | ret = btrfs_qgroup_account_extents(trans); |
6426c7ad QW |
1356 | if (ret < 0) |
1357 | goto out; | |
1358 | ||
1359 | /* Now qgroup are all updated, we can inherit it to new qgroups */ | |
a9377422 | 1360 | ret = btrfs_qgroup_inherit(trans, src->root_key.objectid, dst_objectid, |
6426c7ad QW |
1361 | inherit); |
1362 | if (ret < 0) | |
1363 | goto out; | |
1364 | ||
1365 | /* | |
1366 | * Now we do a simplified commit transaction, which will: | |
1367 | * 1) commit all subvolume and extent tree | |
1368 | * To ensure all subvolume and extent tree have a valid | |
1369 | * commit_root to accounting later insert_dir_item() | |
1370 | * 2) write all btree blocks onto disk | |
1371 | * This is to make sure later btree modification will be cowed | |
1372 | * Or commit_root can be populated and cause wrong qgroup numbers | |
1373 | * In this simplified commit, we don't really care about other trees | |
1374 | * like chunk and root tree, as they won't affect qgroup. | |
1375 | * And we don't write super to avoid half committed status. | |
1376 | */ | |
9386d8bc | 1377 | ret = commit_cowonly_roots(trans); |
6426c7ad QW |
1378 | if (ret) |
1379 | goto out; | |
16916a88 | 1380 | switch_commit_roots(trans->transaction); |
70458a58 | 1381 | ret = btrfs_write_and_wait_transaction(trans); |
6426c7ad | 1382 | if (ret) |
f7af3934 | 1383 | btrfs_handle_fs_error(fs_info, ret, |
6426c7ad QW |
1384 | "Error while writing out transaction for qgroup"); |
1385 | ||
1386 | out: | |
1387 | mutex_unlock(&fs_info->tree_log_mutex); | |
1388 | ||
1389 | /* | |
1390 | * Force parent root to be updated, as we recorded it before so its | |
1391 | * last_trans == cur_transid. | |
1392 | * Or it won't be committed again onto disk after later | |
1393 | * insert_dir_item() | |
1394 | */ | |
1395 | if (!ret) | |
1396 | record_root_in_trans(trans, parent, 1); | |
1397 | return ret; | |
1398 | } | |
1399 | ||
d352ac68 CM |
1400 | /* |
1401 | * new snapshots need to be created at a very specific time in the | |
aec8030a MX |
1402 | * transaction commit. This does the actual creation. |
1403 | * | |
1404 | * Note: | |
1405 | * If the error which may affect the commitment of the current transaction | |
1406 | * happens, we should return the error number. If the error which just affect | |
1407 | * the creation of the pending snapshots, just return 0. | |
d352ac68 | 1408 | */ |
80b6794d | 1409 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
1410 | struct btrfs_pending_snapshot *pending) |
1411 | { | |
08d50ca3 NB |
1412 | |
1413 | struct btrfs_fs_info *fs_info = trans->fs_info; | |
3063d29f | 1414 | struct btrfs_key key; |
80b6794d | 1415 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
1416 | struct btrfs_root *tree_root = fs_info->tree_root; |
1417 | struct btrfs_root *root = pending->root; | |
6bdb72de | 1418 | struct btrfs_root *parent_root; |
98c9942a | 1419 | struct btrfs_block_rsv *rsv; |
6bdb72de | 1420 | struct inode *parent_inode; |
42874b3d MX |
1421 | struct btrfs_path *path; |
1422 | struct btrfs_dir_item *dir_item; | |
a22285a6 | 1423 | struct dentry *dentry; |
3063d29f | 1424 | struct extent_buffer *tmp; |
925baedd | 1425 | struct extent_buffer *old; |
95582b00 | 1426 | struct timespec64 cur_time; |
aec8030a | 1427 | int ret = 0; |
d68fc57b | 1428 | u64 to_reserve = 0; |
6bdb72de | 1429 | u64 index = 0; |
a22285a6 | 1430 | u64 objectid; |
b83cc969 | 1431 | u64 root_flags; |
8ea05e3a | 1432 | uuid_le new_uuid; |
3063d29f | 1433 | |
8546b570 DS |
1434 | ASSERT(pending->path); |
1435 | path = pending->path; | |
42874b3d | 1436 | |
b0c0ea63 DS |
1437 | ASSERT(pending->root_item); |
1438 | new_root_item = pending->root_item; | |
a22285a6 | 1439 | |
aec8030a MX |
1440 | pending->error = btrfs_find_free_objectid(tree_root, &objectid); |
1441 | if (pending->error) | |
6fa9700e | 1442 | goto no_free_objectid; |
3063d29f | 1443 | |
d6726335 QW |
1444 | /* |
1445 | * Make qgroup to skip current new snapshot's qgroupid, as it is | |
1446 | * accounted by later btrfs_qgroup_inherit(). | |
1447 | */ | |
1448 | btrfs_set_skip_qgroup(trans, objectid); | |
1449 | ||
147d256e | 1450 | btrfs_reloc_pre_snapshot(pending, &to_reserve); |
d68fc57b YZ |
1451 | |
1452 | if (to_reserve > 0) { | |
aec8030a MX |
1453 | pending->error = btrfs_block_rsv_add(root, |
1454 | &pending->block_rsv, | |
1455 | to_reserve, | |
1456 | BTRFS_RESERVE_NO_FLUSH); | |
1457 | if (pending->error) | |
d6726335 | 1458 | goto clear_skip_qgroup; |
d68fc57b YZ |
1459 | } |
1460 | ||
3063d29f | 1461 | key.objectid = objectid; |
a22285a6 YZ |
1462 | key.offset = (u64)-1; |
1463 | key.type = BTRFS_ROOT_ITEM_KEY; | |
3063d29f | 1464 | |
6fa9700e | 1465 | rsv = trans->block_rsv; |
a22285a6 | 1466 | trans->block_rsv = &pending->block_rsv; |
2382c5cc | 1467 | trans->bytes_reserved = trans->block_rsv->reserved; |
0b246afa | 1468 | trace_btrfs_space_reservation(fs_info, "transaction", |
88d3a5aa JB |
1469 | trans->transid, |
1470 | trans->bytes_reserved, 1); | |
a22285a6 | 1471 | dentry = pending->dentry; |
e9662f70 | 1472 | parent_inode = pending->dir; |
a22285a6 | 1473 | parent_root = BTRFS_I(parent_inode)->root; |
6426c7ad | 1474 | record_root_in_trans(trans, parent_root, 0); |
a22285a6 | 1475 | |
c2050a45 | 1476 | cur_time = current_time(parent_inode); |
04b285f3 | 1477 | |
3063d29f CM |
1478 | /* |
1479 | * insert the directory item | |
1480 | */ | |
877574e2 | 1481 | ret = btrfs_set_inode_index(BTRFS_I(parent_inode), &index); |
49b25e05 | 1482 | BUG_ON(ret); /* -ENOMEM */ |
42874b3d MX |
1483 | |
1484 | /* check if there is a file/dir which has the same name. */ | |
1485 | dir_item = btrfs_lookup_dir_item(NULL, parent_root, path, | |
4a0cc7ca | 1486 | btrfs_ino(BTRFS_I(parent_inode)), |
42874b3d MX |
1487 | dentry->d_name.name, |
1488 | dentry->d_name.len, 0); | |
1489 | if (dir_item != NULL && !IS_ERR(dir_item)) { | |
fe66a05a | 1490 | pending->error = -EEXIST; |
aec8030a | 1491 | goto dir_item_existed; |
42874b3d MX |
1492 | } else if (IS_ERR(dir_item)) { |
1493 | ret = PTR_ERR(dir_item); | |
66642832 | 1494 | btrfs_abort_transaction(trans, ret); |
8732d44f | 1495 | goto fail; |
79787eaa | 1496 | } |
42874b3d | 1497 | btrfs_release_path(path); |
52c26179 | 1498 | |
e999376f CM |
1499 | /* |
1500 | * pull in the delayed directory update | |
1501 | * and the delayed inode item | |
1502 | * otherwise we corrupt the FS during | |
1503 | * snapshot | |
1504 | */ | |
e5c304e6 | 1505 | ret = btrfs_run_delayed_items(trans); |
8732d44f | 1506 | if (ret) { /* Transaction aborted */ |
66642832 | 1507 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1508 | goto fail; |
1509 | } | |
e999376f | 1510 | |
6426c7ad | 1511 | record_root_in_trans(trans, root, 0); |
6bdb72de SW |
1512 | btrfs_set_root_last_snapshot(&root->root_item, trans->transid); |
1513 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); | |
08fe4db1 | 1514 | btrfs_check_and_init_root_item(new_root_item); |
6bdb72de | 1515 | |
b83cc969 LZ |
1516 | root_flags = btrfs_root_flags(new_root_item); |
1517 | if (pending->readonly) | |
1518 | root_flags |= BTRFS_ROOT_SUBVOL_RDONLY; | |
1519 | else | |
1520 | root_flags &= ~BTRFS_ROOT_SUBVOL_RDONLY; | |
1521 | btrfs_set_root_flags(new_root_item, root_flags); | |
1522 | ||
8ea05e3a AB |
1523 | btrfs_set_root_generation_v2(new_root_item, |
1524 | trans->transid); | |
1525 | uuid_le_gen(&new_uuid); | |
1526 | memcpy(new_root_item->uuid, new_uuid.b, BTRFS_UUID_SIZE); | |
1527 | memcpy(new_root_item->parent_uuid, root->root_item.uuid, | |
1528 | BTRFS_UUID_SIZE); | |
70023da2 SB |
1529 | if (!(root_flags & BTRFS_ROOT_SUBVOL_RDONLY)) { |
1530 | memset(new_root_item->received_uuid, 0, | |
1531 | sizeof(new_root_item->received_uuid)); | |
1532 | memset(&new_root_item->stime, 0, sizeof(new_root_item->stime)); | |
1533 | memset(&new_root_item->rtime, 0, sizeof(new_root_item->rtime)); | |
1534 | btrfs_set_root_stransid(new_root_item, 0); | |
1535 | btrfs_set_root_rtransid(new_root_item, 0); | |
1536 | } | |
3cae210f QW |
1537 | btrfs_set_stack_timespec_sec(&new_root_item->otime, cur_time.tv_sec); |
1538 | btrfs_set_stack_timespec_nsec(&new_root_item->otime, cur_time.tv_nsec); | |
8ea05e3a | 1539 | btrfs_set_root_otransid(new_root_item, trans->transid); |
8ea05e3a | 1540 | |
6bdb72de | 1541 | old = btrfs_lock_root_node(root); |
49b25e05 | 1542 | ret = btrfs_cow_block(trans, root, old, NULL, 0, &old); |
79787eaa JM |
1543 | if (ret) { |
1544 | btrfs_tree_unlock(old); | |
1545 | free_extent_buffer(old); | |
66642832 | 1546 | btrfs_abort_transaction(trans, ret); |
8732d44f | 1547 | goto fail; |
79787eaa | 1548 | } |
49b25e05 | 1549 | |
6bdb72de SW |
1550 | btrfs_set_lock_blocking(old); |
1551 | ||
49b25e05 | 1552 | ret = btrfs_copy_root(trans, root, old, &tmp, objectid); |
79787eaa | 1553 | /* clean up in any case */ |
6bdb72de SW |
1554 | btrfs_tree_unlock(old); |
1555 | free_extent_buffer(old); | |
8732d44f | 1556 | if (ret) { |
66642832 | 1557 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1558 | goto fail; |
1559 | } | |
f1ebcc74 | 1560 | /* see comments in should_cow_block() */ |
27cdeb70 | 1561 | set_bit(BTRFS_ROOT_FORCE_COW, &root->state); |
f1ebcc74 LB |
1562 | smp_wmb(); |
1563 | ||
6bdb72de | 1564 | btrfs_set_root_node(new_root_item, tmp); |
a22285a6 YZ |
1565 | /* record when the snapshot was created in key.offset */ |
1566 | key.offset = trans->transid; | |
1567 | ret = btrfs_insert_root(trans, tree_root, &key, new_root_item); | |
6bdb72de SW |
1568 | btrfs_tree_unlock(tmp); |
1569 | free_extent_buffer(tmp); | |
8732d44f | 1570 | if (ret) { |
66642832 | 1571 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1572 | goto fail; |
1573 | } | |
6bdb72de | 1574 | |
a22285a6 YZ |
1575 | /* |
1576 | * insert root back/forward references | |
1577 | */ | |
6025c19f | 1578 | ret = btrfs_add_root_ref(trans, objectid, |
0660b5af | 1579 | parent_root->root_key.objectid, |
4a0cc7ca | 1580 | btrfs_ino(BTRFS_I(parent_inode)), index, |
a22285a6 | 1581 | dentry->d_name.name, dentry->d_name.len); |
8732d44f | 1582 | if (ret) { |
66642832 | 1583 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1584 | goto fail; |
1585 | } | |
0660b5af | 1586 | |
a22285a6 | 1587 | key.offset = (u64)-1; |
0b246afa | 1588 | pending->snap = btrfs_read_fs_root_no_name(fs_info, &key); |
79787eaa JM |
1589 | if (IS_ERR(pending->snap)) { |
1590 | ret = PTR_ERR(pending->snap); | |
66642832 | 1591 | btrfs_abort_transaction(trans, ret); |
8732d44f | 1592 | goto fail; |
79787eaa | 1593 | } |
d68fc57b | 1594 | |
49b25e05 | 1595 | ret = btrfs_reloc_post_snapshot(trans, pending); |
8732d44f | 1596 | if (ret) { |
66642832 | 1597 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1598 | goto fail; |
1599 | } | |
361048f5 | 1600 | |
c79a70b1 | 1601 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
8732d44f | 1602 | if (ret) { |
66642832 | 1603 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1604 | goto fail; |
1605 | } | |
42874b3d | 1606 | |
6426c7ad QW |
1607 | /* |
1608 | * Do special qgroup accounting for snapshot, as we do some qgroup | |
1609 | * snapshot hack to do fast snapshot. | |
1610 | * To co-operate with that hack, we do hack again. | |
1611 | * Or snapshot will be greatly slowed down by a subtree qgroup rescan | |
1612 | */ | |
1613 | ret = qgroup_account_snapshot(trans, root, parent_root, | |
1614 | pending->inherit, objectid); | |
1615 | if (ret < 0) | |
1616 | goto fail; | |
1617 | ||
684572df LF |
1618 | ret = btrfs_insert_dir_item(trans, dentry->d_name.name, |
1619 | dentry->d_name.len, BTRFS_I(parent_inode), | |
1620 | &key, BTRFS_FT_DIR, index); | |
42874b3d | 1621 | /* We have check then name at the beginning, so it is impossible. */ |
9c52057c | 1622 | BUG_ON(ret == -EEXIST || ret == -EOVERFLOW); |
8732d44f | 1623 | if (ret) { |
66642832 | 1624 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1625 | goto fail; |
1626 | } | |
42874b3d | 1627 | |
6ef06d27 | 1628 | btrfs_i_size_write(BTRFS_I(parent_inode), parent_inode->i_size + |
42874b3d | 1629 | dentry->d_name.len * 2); |
04b285f3 | 1630 | parent_inode->i_mtime = parent_inode->i_ctime = |
c2050a45 | 1631 | current_time(parent_inode); |
be6aef60 | 1632 | ret = btrfs_update_inode_fallback(trans, parent_root, parent_inode); |
dd5f9615 | 1633 | if (ret) { |
66642832 | 1634 | btrfs_abort_transaction(trans, ret); |
dd5f9615 SB |
1635 | goto fail; |
1636 | } | |
cdb345a8 LF |
1637 | ret = btrfs_uuid_tree_add(trans, new_uuid.b, BTRFS_UUID_KEY_SUBVOL, |
1638 | objectid); | |
dd5f9615 | 1639 | if (ret) { |
66642832 | 1640 | btrfs_abort_transaction(trans, ret); |
dd5f9615 SB |
1641 | goto fail; |
1642 | } | |
1643 | if (!btrfs_is_empty_uuid(new_root_item->received_uuid)) { | |
cdb345a8 | 1644 | ret = btrfs_uuid_tree_add(trans, new_root_item->received_uuid, |
dd5f9615 SB |
1645 | BTRFS_UUID_KEY_RECEIVED_SUBVOL, |
1646 | objectid); | |
1647 | if (ret && ret != -EEXIST) { | |
66642832 | 1648 | btrfs_abort_transaction(trans, ret); |
dd5f9615 SB |
1649 | goto fail; |
1650 | } | |
1651 | } | |
d6726335 | 1652 | |
c79a70b1 | 1653 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
d6726335 | 1654 | if (ret) { |
66642832 | 1655 | btrfs_abort_transaction(trans, ret); |
d6726335 QW |
1656 | goto fail; |
1657 | } | |
1658 | ||
3063d29f | 1659 | fail: |
aec8030a MX |
1660 | pending->error = ret; |
1661 | dir_item_existed: | |
98c9942a | 1662 | trans->block_rsv = rsv; |
2382c5cc | 1663 | trans->bytes_reserved = 0; |
d6726335 QW |
1664 | clear_skip_qgroup: |
1665 | btrfs_clear_skip_qgroup(trans); | |
6fa9700e MX |
1666 | no_free_objectid: |
1667 | kfree(new_root_item); | |
b0c0ea63 | 1668 | pending->root_item = NULL; |
42874b3d | 1669 | btrfs_free_path(path); |
8546b570 DS |
1670 | pending->path = NULL; |
1671 | ||
49b25e05 | 1672 | return ret; |
3063d29f CM |
1673 | } |
1674 | ||
d352ac68 CM |
1675 | /* |
1676 | * create all the snapshots we've scheduled for creation | |
1677 | */ | |
08d50ca3 | 1678 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans) |
3de4586c | 1679 | { |
aec8030a | 1680 | struct btrfs_pending_snapshot *pending, *next; |
3de4586c | 1681 | struct list_head *head = &trans->transaction->pending_snapshots; |
aec8030a | 1682 | int ret = 0; |
3de4586c | 1683 | |
aec8030a MX |
1684 | list_for_each_entry_safe(pending, next, head, list) { |
1685 | list_del(&pending->list); | |
08d50ca3 | 1686 | ret = create_pending_snapshot(trans, pending); |
aec8030a MX |
1687 | if (ret) |
1688 | break; | |
1689 | } | |
1690 | return ret; | |
3de4586c CM |
1691 | } |
1692 | ||
2ff7e61e | 1693 | static void update_super_roots(struct btrfs_fs_info *fs_info) |
5d4f98a2 YZ |
1694 | { |
1695 | struct btrfs_root_item *root_item; | |
1696 | struct btrfs_super_block *super; | |
1697 | ||
0b246afa | 1698 | super = fs_info->super_copy; |
5d4f98a2 | 1699 | |
0b246afa | 1700 | root_item = &fs_info->chunk_root->root_item; |
093e037c DS |
1701 | super->chunk_root = root_item->bytenr; |
1702 | super->chunk_root_generation = root_item->generation; | |
1703 | super->chunk_root_level = root_item->level; | |
5d4f98a2 | 1704 | |
0b246afa | 1705 | root_item = &fs_info->tree_root->root_item; |
093e037c DS |
1706 | super->root = root_item->bytenr; |
1707 | super->generation = root_item->generation; | |
1708 | super->root_level = root_item->level; | |
0b246afa | 1709 | if (btrfs_test_opt(fs_info, SPACE_CACHE)) |
093e037c | 1710 | super->cache_generation = root_item->generation; |
0b246afa | 1711 | if (test_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags)) |
093e037c | 1712 | super->uuid_tree_generation = root_item->generation; |
5d4f98a2 YZ |
1713 | } |
1714 | ||
f36f3042 CM |
1715 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info) |
1716 | { | |
4a9d8bde | 1717 | struct btrfs_transaction *trans; |
f36f3042 | 1718 | int ret = 0; |
4a9d8bde | 1719 | |
a4abeea4 | 1720 | spin_lock(&info->trans_lock); |
4a9d8bde MX |
1721 | trans = info->running_transaction; |
1722 | if (trans) | |
1723 | ret = (trans->state >= TRANS_STATE_COMMIT_START); | |
a4abeea4 | 1724 | spin_unlock(&info->trans_lock); |
f36f3042 CM |
1725 | return ret; |
1726 | } | |
1727 | ||
8929ecfa YZ |
1728 | int btrfs_transaction_blocked(struct btrfs_fs_info *info) |
1729 | { | |
4a9d8bde | 1730 | struct btrfs_transaction *trans; |
8929ecfa | 1731 | int ret = 0; |
4a9d8bde | 1732 | |
a4abeea4 | 1733 | spin_lock(&info->trans_lock); |
4a9d8bde MX |
1734 | trans = info->running_transaction; |
1735 | if (trans) | |
1736 | ret = is_transaction_blocked(trans); | |
a4abeea4 | 1737 | spin_unlock(&info->trans_lock); |
8929ecfa YZ |
1738 | return ret; |
1739 | } | |
1740 | ||
bb9c12c9 SW |
1741 | /* |
1742 | * wait for the current transaction commit to start and block subsequent | |
1743 | * transaction joins | |
1744 | */ | |
2ff7e61e | 1745 | static void wait_current_trans_commit_start(struct btrfs_fs_info *fs_info, |
bb9c12c9 SW |
1746 | struct btrfs_transaction *trans) |
1747 | { | |
2ff7e61e JM |
1748 | wait_event(fs_info->transaction_blocked_wait, |
1749 | trans->state >= TRANS_STATE_COMMIT_START || trans->aborted); | |
bb9c12c9 SW |
1750 | } |
1751 | ||
1752 | /* | |
1753 | * wait for the current transaction to start and then become unblocked. | |
1754 | * caller holds ref. | |
1755 | */ | |
2ff7e61e JM |
1756 | static void wait_current_trans_commit_start_and_unblock( |
1757 | struct btrfs_fs_info *fs_info, | |
1758 | struct btrfs_transaction *trans) | |
bb9c12c9 | 1759 | { |
2ff7e61e JM |
1760 | wait_event(fs_info->transaction_wait, |
1761 | trans->state >= TRANS_STATE_UNBLOCKED || trans->aborted); | |
bb9c12c9 SW |
1762 | } |
1763 | ||
1764 | /* | |
1765 | * commit transactions asynchronously. once btrfs_commit_transaction_async | |
1766 | * returns, any subsequent transaction will not be allowed to join. | |
1767 | */ | |
1768 | struct btrfs_async_commit { | |
1769 | struct btrfs_trans_handle *newtrans; | |
7892b5af | 1770 | struct work_struct work; |
bb9c12c9 SW |
1771 | }; |
1772 | ||
1773 | static void do_async_commit(struct work_struct *work) | |
1774 | { | |
1775 | struct btrfs_async_commit *ac = | |
7892b5af | 1776 | container_of(work, struct btrfs_async_commit, work); |
bb9c12c9 | 1777 | |
6fc4e354 SW |
1778 | /* |
1779 | * We've got freeze protection passed with the transaction. | |
1780 | * Tell lockdep about it. | |
1781 | */ | |
b1a06a4b | 1782 | if (ac->newtrans->type & __TRANS_FREEZABLE) |
3a45bb20 | 1783 | __sb_writers_acquired(ac->newtrans->fs_info->sb, SB_FREEZE_FS); |
6fc4e354 | 1784 | |
e209db7a SW |
1785 | current->journal_info = ac->newtrans; |
1786 | ||
3a45bb20 | 1787 | btrfs_commit_transaction(ac->newtrans); |
bb9c12c9 SW |
1788 | kfree(ac); |
1789 | } | |
1790 | ||
1791 | int btrfs_commit_transaction_async(struct btrfs_trans_handle *trans, | |
bb9c12c9 SW |
1792 | int wait_for_unblock) |
1793 | { | |
3a45bb20 | 1794 | struct btrfs_fs_info *fs_info = trans->fs_info; |
bb9c12c9 SW |
1795 | struct btrfs_async_commit *ac; |
1796 | struct btrfs_transaction *cur_trans; | |
1797 | ||
1798 | ac = kmalloc(sizeof(*ac), GFP_NOFS); | |
db5b493a TI |
1799 | if (!ac) |
1800 | return -ENOMEM; | |
bb9c12c9 | 1801 | |
7892b5af | 1802 | INIT_WORK(&ac->work, do_async_commit); |
3a45bb20 | 1803 | ac->newtrans = btrfs_join_transaction(trans->root); |
3612b495 TI |
1804 | if (IS_ERR(ac->newtrans)) { |
1805 | int err = PTR_ERR(ac->newtrans); | |
1806 | kfree(ac); | |
1807 | return err; | |
1808 | } | |
bb9c12c9 SW |
1809 | |
1810 | /* take transaction reference */ | |
bb9c12c9 | 1811 | cur_trans = trans->transaction; |
9b64f57d | 1812 | refcount_inc(&cur_trans->use_count); |
bb9c12c9 | 1813 | |
3a45bb20 | 1814 | btrfs_end_transaction(trans); |
6fc4e354 SW |
1815 | |
1816 | /* | |
1817 | * Tell lockdep we've released the freeze rwsem, since the | |
1818 | * async commit thread will be the one to unlock it. | |
1819 | */ | |
b1a06a4b | 1820 | if (ac->newtrans->type & __TRANS_FREEZABLE) |
0b246afa | 1821 | __sb_writers_release(fs_info->sb, SB_FREEZE_FS); |
6fc4e354 | 1822 | |
7892b5af | 1823 | schedule_work(&ac->work); |
bb9c12c9 SW |
1824 | |
1825 | /* wait for transaction to start and unblock */ | |
bb9c12c9 | 1826 | if (wait_for_unblock) |
2ff7e61e | 1827 | wait_current_trans_commit_start_and_unblock(fs_info, cur_trans); |
bb9c12c9 | 1828 | else |
2ff7e61e | 1829 | wait_current_trans_commit_start(fs_info, cur_trans); |
bb9c12c9 | 1830 | |
38e88054 SW |
1831 | if (current->journal_info == trans) |
1832 | current->journal_info = NULL; | |
1833 | ||
724e2315 | 1834 | btrfs_put_transaction(cur_trans); |
bb9c12c9 SW |
1835 | return 0; |
1836 | } | |
1837 | ||
49b25e05 | 1838 | |
97cb39bb | 1839 | static void cleanup_transaction(struct btrfs_trans_handle *trans, int err) |
49b25e05 | 1840 | { |
97cb39bb | 1841 | struct btrfs_fs_info *fs_info = trans->fs_info; |
49b25e05 JM |
1842 | struct btrfs_transaction *cur_trans = trans->transaction; |
1843 | ||
b50fff81 | 1844 | WARN_ON(refcount_read(&trans->use_count) > 1); |
49b25e05 | 1845 | |
66642832 | 1846 | btrfs_abort_transaction(trans, err); |
7b8b92af | 1847 | |
0b246afa | 1848 | spin_lock(&fs_info->trans_lock); |
66b6135b | 1849 | |
25d8c284 MX |
1850 | /* |
1851 | * If the transaction is removed from the list, it means this | |
1852 | * transaction has been committed successfully, so it is impossible | |
1853 | * to call the cleanup function. | |
1854 | */ | |
1855 | BUG_ON(list_empty(&cur_trans->list)); | |
66b6135b | 1856 | |
49b25e05 | 1857 | list_del_init(&cur_trans->list); |
0b246afa | 1858 | if (cur_trans == fs_info->running_transaction) { |
4a9d8bde | 1859 | cur_trans->state = TRANS_STATE_COMMIT_DOING; |
0b246afa | 1860 | spin_unlock(&fs_info->trans_lock); |
f094ac32 LB |
1861 | wait_event(cur_trans->writer_wait, |
1862 | atomic_read(&cur_trans->num_writers) == 1); | |
1863 | ||
0b246afa | 1864 | spin_lock(&fs_info->trans_lock); |
d7096fc3 | 1865 | } |
0b246afa | 1866 | spin_unlock(&fs_info->trans_lock); |
49b25e05 | 1867 | |
2ff7e61e | 1868 | btrfs_cleanup_one_transaction(trans->transaction, fs_info); |
49b25e05 | 1869 | |
0b246afa JM |
1870 | spin_lock(&fs_info->trans_lock); |
1871 | if (cur_trans == fs_info->running_transaction) | |
1872 | fs_info->running_transaction = NULL; | |
1873 | spin_unlock(&fs_info->trans_lock); | |
4a9d8bde | 1874 | |
e0228285 | 1875 | if (trans->type & __TRANS_FREEZABLE) |
0b246afa | 1876 | sb_end_intwrite(fs_info->sb); |
724e2315 JB |
1877 | btrfs_put_transaction(cur_trans); |
1878 | btrfs_put_transaction(cur_trans); | |
49b25e05 | 1879 | |
97cb39bb | 1880 | trace_btrfs_transaction_commit(trans->root); |
49b25e05 | 1881 | |
49b25e05 JM |
1882 | if (current->journal_info == trans) |
1883 | current->journal_info = NULL; | |
0b246afa | 1884 | btrfs_scrub_cancel(fs_info); |
49b25e05 JM |
1885 | |
1886 | kmem_cache_free(btrfs_trans_handle_cachep, trans); | |
1887 | } | |
1888 | ||
82436617 MX |
1889 | static inline int btrfs_start_delalloc_flush(struct btrfs_fs_info *fs_info) |
1890 | { | |
ce8ea7cc JB |
1891 | /* |
1892 | * We use writeback_inodes_sb here because if we used | |
1893 | * btrfs_start_delalloc_roots we would deadlock with fs freeze. | |
1894 | * Currently are holding the fs freeze lock, if we do an async flush | |
1895 | * we'll do btrfs_join_transaction() and deadlock because we need to | |
1896 | * wait for the fs freeze lock. Using the direct flushing we benefit | |
1897 | * from already being in a transaction and our join_transaction doesn't | |
1898 | * have to re-take the fs freeze lock. | |
1899 | */ | |
3cdde224 | 1900 | if (btrfs_test_opt(fs_info, FLUSHONCOMMIT)) |
ce8ea7cc | 1901 | writeback_inodes_sb(fs_info->sb, WB_REASON_SYNC); |
82436617 MX |
1902 | return 0; |
1903 | } | |
1904 | ||
1905 | static inline void btrfs_wait_delalloc_flush(struct btrfs_fs_info *fs_info) | |
1906 | { | |
3cdde224 | 1907 | if (btrfs_test_opt(fs_info, FLUSHONCOMMIT)) |
6374e57a | 1908 | btrfs_wait_ordered_roots(fs_info, U64_MAX, 0, (u64)-1); |
82436617 MX |
1909 | } |
1910 | ||
3a45bb20 | 1911 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans) |
79154b1b | 1912 | { |
3a45bb20 | 1913 | struct btrfs_fs_info *fs_info = trans->fs_info; |
49b25e05 | 1914 | struct btrfs_transaction *cur_trans = trans->transaction; |
8fd17795 | 1915 | struct btrfs_transaction *prev_trans = NULL; |
25287e0a | 1916 | int ret; |
79154b1b | 1917 | |
8d25a086 | 1918 | /* Stop the commit early if ->aborted is set */ |
20c7bcec | 1919 | if (unlikely(READ_ONCE(cur_trans->aborted))) { |
25287e0a | 1920 | ret = cur_trans->aborted; |
3a45bb20 | 1921 | btrfs_end_transaction(trans); |
e4a2bcac | 1922 | return ret; |
25287e0a | 1923 | } |
49b25e05 | 1924 | |
f45c752b JB |
1925 | btrfs_trans_release_metadata(trans); |
1926 | trans->block_rsv = NULL; | |
1927 | ||
56bec294 CM |
1928 | /* make a pass through all the delayed refs we have so far |
1929 | * any runnings procs may add more while we are here | |
1930 | */ | |
c79a70b1 | 1931 | ret = btrfs_run_delayed_refs(trans, 0); |
e4a2bcac | 1932 | if (ret) { |
3a45bb20 | 1933 | btrfs_end_transaction(trans); |
e4a2bcac JB |
1934 | return ret; |
1935 | } | |
56bec294 | 1936 | |
b7ec40d7 | 1937 | cur_trans = trans->transaction; |
49b25e05 | 1938 | |
56bec294 CM |
1939 | /* |
1940 | * set the flushing flag so procs in this transaction have to | |
1941 | * start sending their work down. | |
1942 | */ | |
b7ec40d7 | 1943 | cur_trans->delayed_refs.flushing = 1; |
1be41b78 | 1944 | smp_wmb(); |
56bec294 | 1945 | |
ea658bad | 1946 | if (!list_empty(&trans->new_bgs)) |
6c686b35 | 1947 | btrfs_create_pending_block_groups(trans); |
ea658bad | 1948 | |
c79a70b1 | 1949 | ret = btrfs_run_delayed_refs(trans, 0); |
e4a2bcac | 1950 | if (ret) { |
3a45bb20 | 1951 | btrfs_end_transaction(trans); |
e4a2bcac JB |
1952 | return ret; |
1953 | } | |
56bec294 | 1954 | |
3204d33c | 1955 | if (!test_bit(BTRFS_TRANS_DIRTY_BG_RUN, &cur_trans->flags)) { |
1bbc621e CM |
1956 | int run_it = 0; |
1957 | ||
1958 | /* this mutex is also taken before trying to set | |
1959 | * block groups readonly. We need to make sure | |
1960 | * that nobody has set a block group readonly | |
1961 | * after a extents from that block group have been | |
1962 | * allocated for cache files. btrfs_set_block_group_ro | |
1963 | * will wait for the transaction to commit if it | |
3204d33c | 1964 | * finds BTRFS_TRANS_DIRTY_BG_RUN set. |
1bbc621e | 1965 | * |
3204d33c JB |
1966 | * The BTRFS_TRANS_DIRTY_BG_RUN flag is also used to make sure |
1967 | * only one process starts all the block group IO. It wouldn't | |
1bbc621e CM |
1968 | * hurt to have more than one go through, but there's no |
1969 | * real advantage to it either. | |
1970 | */ | |
0b246afa | 1971 | mutex_lock(&fs_info->ro_block_group_mutex); |
3204d33c JB |
1972 | if (!test_and_set_bit(BTRFS_TRANS_DIRTY_BG_RUN, |
1973 | &cur_trans->flags)) | |
1bbc621e | 1974 | run_it = 1; |
0b246afa | 1975 | mutex_unlock(&fs_info->ro_block_group_mutex); |
1bbc621e | 1976 | |
f9cacae3 | 1977 | if (run_it) { |
21217054 | 1978 | ret = btrfs_start_dirty_block_groups(trans); |
f9cacae3 NB |
1979 | if (ret) { |
1980 | btrfs_end_transaction(trans); | |
1981 | return ret; | |
1982 | } | |
1983 | } | |
1bbc621e CM |
1984 | } |
1985 | ||
0b246afa | 1986 | spin_lock(&fs_info->trans_lock); |
4a9d8bde | 1987 | if (cur_trans->state >= TRANS_STATE_COMMIT_START) { |
0b246afa | 1988 | spin_unlock(&fs_info->trans_lock); |
9b64f57d | 1989 | refcount_inc(&cur_trans->use_count); |
3a45bb20 | 1990 | ret = btrfs_end_transaction(trans); |
ccd467d6 | 1991 | |
2ff7e61e | 1992 | wait_for_commit(cur_trans); |
15ee9bc7 | 1993 | |
b4924a0f LB |
1994 | if (unlikely(cur_trans->aborted)) |
1995 | ret = cur_trans->aborted; | |
1996 | ||
724e2315 | 1997 | btrfs_put_transaction(cur_trans); |
15ee9bc7 | 1998 | |
49b25e05 | 1999 | return ret; |
79154b1b | 2000 | } |
4313b399 | 2001 | |
4a9d8bde | 2002 | cur_trans->state = TRANS_STATE_COMMIT_START; |
0b246afa | 2003 | wake_up(&fs_info->transaction_blocked_wait); |
bb9c12c9 | 2004 | |
0b246afa | 2005 | if (cur_trans->list.prev != &fs_info->trans_list) { |
ccd467d6 CM |
2006 | prev_trans = list_entry(cur_trans->list.prev, |
2007 | struct btrfs_transaction, list); | |
4a9d8bde | 2008 | if (prev_trans->state != TRANS_STATE_COMPLETED) { |
9b64f57d | 2009 | refcount_inc(&prev_trans->use_count); |
0b246afa | 2010 | spin_unlock(&fs_info->trans_lock); |
ccd467d6 | 2011 | |
2ff7e61e | 2012 | wait_for_commit(prev_trans); |
1f9b8c8f | 2013 | ret = prev_trans->aborted; |
ccd467d6 | 2014 | |
724e2315 | 2015 | btrfs_put_transaction(prev_trans); |
1f9b8c8f FM |
2016 | if (ret) |
2017 | goto cleanup_transaction; | |
a4abeea4 | 2018 | } else { |
0b246afa | 2019 | spin_unlock(&fs_info->trans_lock); |
ccd467d6 | 2020 | } |
a4abeea4 | 2021 | } else { |
0b246afa | 2022 | spin_unlock(&fs_info->trans_lock); |
ccd467d6 | 2023 | } |
15ee9bc7 | 2024 | |
0860adfd MX |
2025 | extwriter_counter_dec(cur_trans, trans->type); |
2026 | ||
0b246afa | 2027 | ret = btrfs_start_delalloc_flush(fs_info); |
82436617 MX |
2028 | if (ret) |
2029 | goto cleanup_transaction; | |
2030 | ||
e5c304e6 | 2031 | ret = btrfs_run_delayed_items(trans); |
581227d0 MX |
2032 | if (ret) |
2033 | goto cleanup_transaction; | |
15ee9bc7 | 2034 | |
581227d0 MX |
2035 | wait_event(cur_trans->writer_wait, |
2036 | extwriter_counter_read(cur_trans) == 0); | |
15ee9bc7 | 2037 | |
581227d0 | 2038 | /* some pending stuffs might be added after the previous flush. */ |
e5c304e6 | 2039 | ret = btrfs_run_delayed_items(trans); |
ca469637 MX |
2040 | if (ret) |
2041 | goto cleanup_transaction; | |
2042 | ||
0b246afa | 2043 | btrfs_wait_delalloc_flush(fs_info); |
cb7ab021 | 2044 | |
2ff7e61e | 2045 | btrfs_scrub_pause(fs_info); |
ed0ca140 JB |
2046 | /* |
2047 | * Ok now we need to make sure to block out any other joins while we | |
2048 | * commit the transaction. We could have started a join before setting | |
4a9d8bde | 2049 | * COMMIT_DOING so make sure to wait for num_writers to == 1 again. |
ed0ca140 | 2050 | */ |
0b246afa | 2051 | spin_lock(&fs_info->trans_lock); |
4a9d8bde | 2052 | cur_trans->state = TRANS_STATE_COMMIT_DOING; |
0b246afa | 2053 | spin_unlock(&fs_info->trans_lock); |
ed0ca140 JB |
2054 | wait_event(cur_trans->writer_wait, |
2055 | atomic_read(&cur_trans->num_writers) == 1); | |
2056 | ||
2cba30f1 | 2057 | /* ->aborted might be set after the previous check, so check it */ |
20c7bcec | 2058 | if (unlikely(READ_ONCE(cur_trans->aborted))) { |
2cba30f1 | 2059 | ret = cur_trans->aborted; |
6cf7f77e | 2060 | goto scrub_continue; |
2cba30f1 | 2061 | } |
7585717f CM |
2062 | /* |
2063 | * the reloc mutex makes sure that we stop | |
2064 | * the balancing code from coming in and moving | |
2065 | * extents around in the middle of the commit | |
2066 | */ | |
0b246afa | 2067 | mutex_lock(&fs_info->reloc_mutex); |
7585717f | 2068 | |
42874b3d MX |
2069 | /* |
2070 | * We needn't worry about the delayed items because we will | |
2071 | * deal with them in create_pending_snapshot(), which is the | |
2072 | * core function of the snapshot creation. | |
2073 | */ | |
08d50ca3 | 2074 | ret = create_pending_snapshots(trans); |
49b25e05 | 2075 | if (ret) { |
0b246afa | 2076 | mutex_unlock(&fs_info->reloc_mutex); |
6cf7f77e | 2077 | goto scrub_continue; |
49b25e05 | 2078 | } |
3063d29f | 2079 | |
42874b3d MX |
2080 | /* |
2081 | * We insert the dir indexes of the snapshots and update the inode | |
2082 | * of the snapshots' parents after the snapshot creation, so there | |
2083 | * are some delayed items which are not dealt with. Now deal with | |
2084 | * them. | |
2085 | * | |
2086 | * We needn't worry that this operation will corrupt the snapshots, | |
2087 | * because all the tree which are snapshoted will be forced to COW | |
2088 | * the nodes and leaves. | |
2089 | */ | |
e5c304e6 | 2090 | ret = btrfs_run_delayed_items(trans); |
49b25e05 | 2091 | if (ret) { |
0b246afa | 2092 | mutex_unlock(&fs_info->reloc_mutex); |
6cf7f77e | 2093 | goto scrub_continue; |
49b25e05 | 2094 | } |
16cdcec7 | 2095 | |
c79a70b1 | 2096 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
49b25e05 | 2097 | if (ret) { |
0b246afa | 2098 | mutex_unlock(&fs_info->reloc_mutex); |
6cf7f77e | 2099 | goto scrub_continue; |
49b25e05 | 2100 | } |
56bec294 | 2101 | |
e999376f CM |
2102 | /* |
2103 | * make sure none of the code above managed to slip in a | |
2104 | * delayed item | |
2105 | */ | |
ccdf9b30 | 2106 | btrfs_assert_delayed_root_empty(fs_info); |
e999376f | 2107 | |
2c90e5d6 | 2108 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 2109 | |
e02119d5 CM |
2110 | /* btrfs_commit_tree_roots is responsible for getting the |
2111 | * various roots consistent with each other. Every pointer | |
2112 | * in the tree of tree roots has to point to the most up to date | |
2113 | * root for every subvolume and other tree. So, we have to keep | |
2114 | * the tree logging code from jumping in and changing any | |
2115 | * of the trees. | |
2116 | * | |
2117 | * At this point in the commit, there can't be any tree-log | |
2118 | * writers, but a little lower down we drop the trans mutex | |
2119 | * and let new people in. By holding the tree_log_mutex | |
2120 | * from now until after the super is written, we avoid races | |
2121 | * with the tree-log code. | |
2122 | */ | |
0b246afa | 2123 | mutex_lock(&fs_info->tree_log_mutex); |
e02119d5 | 2124 | |
7e4443d9 | 2125 | ret = commit_fs_roots(trans); |
49b25e05 | 2126 | if (ret) { |
0b246afa JM |
2127 | mutex_unlock(&fs_info->tree_log_mutex); |
2128 | mutex_unlock(&fs_info->reloc_mutex); | |
6cf7f77e | 2129 | goto scrub_continue; |
49b25e05 | 2130 | } |
54aa1f4d | 2131 | |
3818aea2 | 2132 | /* |
7e1876ac DS |
2133 | * Since the transaction is done, we can apply the pending changes |
2134 | * before the next transaction. | |
3818aea2 | 2135 | */ |
0b246afa | 2136 | btrfs_apply_pending_changes(fs_info); |
3818aea2 | 2137 | |
5d4f98a2 | 2138 | /* commit_fs_roots gets rid of all the tree log roots, it is now |
e02119d5 CM |
2139 | * safe to free the root of tree log roots |
2140 | */ | |
0b246afa | 2141 | btrfs_free_log_root_tree(trans, fs_info); |
e02119d5 | 2142 | |
82bafb38 QW |
2143 | /* |
2144 | * commit_fs_roots() can call btrfs_save_ino_cache(), which generates | |
2145 | * new delayed refs. Must handle them or qgroup can be wrong. | |
2146 | */ | |
c79a70b1 | 2147 | ret = btrfs_run_delayed_refs(trans, (unsigned long)-1); |
82bafb38 QW |
2148 | if (ret) { |
2149 | mutex_unlock(&fs_info->tree_log_mutex); | |
2150 | mutex_unlock(&fs_info->reloc_mutex); | |
2151 | goto scrub_continue; | |
2152 | } | |
2153 | ||
0ed4792a QW |
2154 | /* |
2155 | * Since fs roots are all committed, we can get a quite accurate | |
2156 | * new_roots. So let's do quota accounting. | |
2157 | */ | |
460fb20a | 2158 | ret = btrfs_qgroup_account_extents(trans); |
0ed4792a | 2159 | if (ret < 0) { |
0b246afa JM |
2160 | mutex_unlock(&fs_info->tree_log_mutex); |
2161 | mutex_unlock(&fs_info->reloc_mutex); | |
0ed4792a QW |
2162 | goto scrub_continue; |
2163 | } | |
2164 | ||
9386d8bc | 2165 | ret = commit_cowonly_roots(trans); |
49b25e05 | 2166 | if (ret) { |
0b246afa JM |
2167 | mutex_unlock(&fs_info->tree_log_mutex); |
2168 | mutex_unlock(&fs_info->reloc_mutex); | |
6cf7f77e | 2169 | goto scrub_continue; |
49b25e05 | 2170 | } |
54aa1f4d | 2171 | |
2cba30f1 MX |
2172 | /* |
2173 | * The tasks which save the space cache and inode cache may also | |
2174 | * update ->aborted, check it. | |
2175 | */ | |
20c7bcec | 2176 | if (unlikely(READ_ONCE(cur_trans->aborted))) { |
2cba30f1 | 2177 | ret = cur_trans->aborted; |
0b246afa JM |
2178 | mutex_unlock(&fs_info->tree_log_mutex); |
2179 | mutex_unlock(&fs_info->reloc_mutex); | |
6cf7f77e | 2180 | goto scrub_continue; |
2cba30f1 MX |
2181 | } |
2182 | ||
8b74c03e | 2183 | btrfs_prepare_extent_commit(fs_info); |
11833d66 | 2184 | |
0b246afa | 2185 | cur_trans = fs_info->running_transaction; |
5d4f98a2 | 2186 | |
0b246afa JM |
2187 | btrfs_set_root_node(&fs_info->tree_root->root_item, |
2188 | fs_info->tree_root->node); | |
2189 | list_add_tail(&fs_info->tree_root->dirty_list, | |
9e351cc8 | 2190 | &cur_trans->switch_commits); |
5d4f98a2 | 2191 | |
0b246afa JM |
2192 | btrfs_set_root_node(&fs_info->chunk_root->root_item, |
2193 | fs_info->chunk_root->node); | |
2194 | list_add_tail(&fs_info->chunk_root->dirty_list, | |
9e351cc8 JB |
2195 | &cur_trans->switch_commits); |
2196 | ||
16916a88 | 2197 | switch_commit_roots(cur_trans); |
5d4f98a2 | 2198 | |
ce93ec54 | 2199 | ASSERT(list_empty(&cur_trans->dirty_bgs)); |
1bbc621e | 2200 | ASSERT(list_empty(&cur_trans->io_bgs)); |
2ff7e61e | 2201 | update_super_roots(fs_info); |
e02119d5 | 2202 | |
0b246afa JM |
2203 | btrfs_set_super_log_root(fs_info->super_copy, 0); |
2204 | btrfs_set_super_log_root_level(fs_info->super_copy, 0); | |
2205 | memcpy(fs_info->super_for_commit, fs_info->super_copy, | |
2206 | sizeof(*fs_info->super_copy)); | |
ccd467d6 | 2207 | |
0b246afa | 2208 | btrfs_update_commit_device_size(fs_info); |
e9b919b1 | 2209 | btrfs_update_commit_device_bytes_used(cur_trans); |
935e5cc9 | 2210 | |
0b246afa JM |
2211 | clear_bit(BTRFS_FS_LOG1_ERR, &fs_info->flags); |
2212 | clear_bit(BTRFS_FS_LOG2_ERR, &fs_info->flags); | |
656f30db | 2213 | |
4fbcdf66 FM |
2214 | btrfs_trans_release_chunk_metadata(trans); |
2215 | ||
0b246afa | 2216 | spin_lock(&fs_info->trans_lock); |
4a9d8bde | 2217 | cur_trans->state = TRANS_STATE_UNBLOCKED; |
0b246afa JM |
2218 | fs_info->running_transaction = NULL; |
2219 | spin_unlock(&fs_info->trans_lock); | |
2220 | mutex_unlock(&fs_info->reloc_mutex); | |
b7ec40d7 | 2221 | |
0b246afa | 2222 | wake_up(&fs_info->transaction_wait); |
e6dcd2dc | 2223 | |
70458a58 | 2224 | ret = btrfs_write_and_wait_transaction(trans); |
49b25e05 | 2225 | if (ret) { |
0b246afa JM |
2226 | btrfs_handle_fs_error(fs_info, ret, |
2227 | "Error while writing out transaction"); | |
2228 | mutex_unlock(&fs_info->tree_log_mutex); | |
6cf7f77e | 2229 | goto scrub_continue; |
49b25e05 JM |
2230 | } |
2231 | ||
eece6a9c | 2232 | ret = write_all_supers(fs_info, 0); |
e02119d5 CM |
2233 | /* |
2234 | * the super is written, we can safely allow the tree-loggers | |
2235 | * to go about their business | |
2236 | */ | |
0b246afa | 2237 | mutex_unlock(&fs_info->tree_log_mutex); |
c1f32b7c AJ |
2238 | if (ret) |
2239 | goto scrub_continue; | |
e02119d5 | 2240 | |
5ead2dd0 | 2241 | btrfs_finish_extent_commit(trans); |
4313b399 | 2242 | |
3204d33c | 2243 | if (test_bit(BTRFS_TRANS_HAVE_FREE_BGS, &cur_trans->flags)) |
0b246afa | 2244 | btrfs_clear_space_info_full(fs_info); |
13212b54 | 2245 | |
0b246afa | 2246 | fs_info->last_trans_committed = cur_trans->transid; |
4a9d8bde MX |
2247 | /* |
2248 | * We needn't acquire the lock here because there is no other task | |
2249 | * which can change it. | |
2250 | */ | |
2251 | cur_trans->state = TRANS_STATE_COMPLETED; | |
2c90e5d6 | 2252 | wake_up(&cur_trans->commit_wait); |
a514d638 | 2253 | clear_bit(BTRFS_FS_NEED_ASYNC_COMMIT, &fs_info->flags); |
3de4586c | 2254 | |
0b246afa | 2255 | spin_lock(&fs_info->trans_lock); |
13c5a93e | 2256 | list_del_init(&cur_trans->list); |
0b246afa | 2257 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 2258 | |
724e2315 JB |
2259 | btrfs_put_transaction(cur_trans); |
2260 | btrfs_put_transaction(cur_trans); | |
58176a96 | 2261 | |
0860adfd | 2262 | if (trans->type & __TRANS_FREEZABLE) |
0b246afa | 2263 | sb_end_intwrite(fs_info->sb); |
b2b5ef5c | 2264 | |
3a45bb20 | 2265 | trace_btrfs_transaction_commit(trans->root); |
1abe9b8a | 2266 | |
2ff7e61e | 2267 | btrfs_scrub_continue(fs_info); |
a2de733c | 2268 | |
9ed74f2d JB |
2269 | if (current->journal_info == trans) |
2270 | current->journal_info = NULL; | |
2271 | ||
2c90e5d6 | 2272 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
24bbcf04 | 2273 | |
79154b1b | 2274 | return ret; |
49b25e05 | 2275 | |
6cf7f77e | 2276 | scrub_continue: |
2ff7e61e | 2277 | btrfs_scrub_continue(fs_info); |
49b25e05 | 2278 | cleanup_transaction: |
dc60c525 | 2279 | btrfs_trans_release_metadata(trans); |
4fbcdf66 | 2280 | btrfs_trans_release_chunk_metadata(trans); |
0e721106 | 2281 | trans->block_rsv = NULL; |
0b246afa | 2282 | btrfs_warn(fs_info, "Skipping commit of aborted transaction."); |
49b25e05 JM |
2283 | if (current->journal_info == trans) |
2284 | current->journal_info = NULL; | |
97cb39bb | 2285 | cleanup_transaction(trans, ret); |
49b25e05 JM |
2286 | |
2287 | return ret; | |
79154b1b CM |
2288 | } |
2289 | ||
d352ac68 | 2290 | /* |
9d1a2a3a DS |
2291 | * return < 0 if error |
2292 | * 0 if there are no more dead_roots at the time of call | |
2293 | * 1 there are more to be processed, call me again | |
2294 | * | |
2295 | * The return value indicates there are certainly more snapshots to delete, but | |
2296 | * if there comes a new one during processing, it may return 0. We don't mind, | |
2297 | * because btrfs_commit_super will poke cleaner thread and it will process it a | |
2298 | * few seconds later. | |
d352ac68 | 2299 | */ |
9d1a2a3a | 2300 | int btrfs_clean_one_deleted_snapshot(struct btrfs_root *root) |
e9d0b13b | 2301 | { |
9d1a2a3a | 2302 | int ret; |
5d4f98a2 YZ |
2303 | struct btrfs_fs_info *fs_info = root->fs_info; |
2304 | ||
a4abeea4 | 2305 | spin_lock(&fs_info->trans_lock); |
9d1a2a3a DS |
2306 | if (list_empty(&fs_info->dead_roots)) { |
2307 | spin_unlock(&fs_info->trans_lock); | |
2308 | return 0; | |
2309 | } | |
2310 | root = list_first_entry(&fs_info->dead_roots, | |
2311 | struct btrfs_root, root_list); | |
cfad392b | 2312 | list_del_init(&root->root_list); |
a4abeea4 | 2313 | spin_unlock(&fs_info->trans_lock); |
e9d0b13b | 2314 | |
4fd786e6 | 2315 | btrfs_debug(fs_info, "cleaner removing %llu", root->root_key.objectid); |
76dda93c | 2316 | |
9d1a2a3a | 2317 | btrfs_kill_all_delayed_nodes(root); |
16cdcec7 | 2318 | |
9d1a2a3a DS |
2319 | if (btrfs_header_backref_rev(root->node) < |
2320 | BTRFS_MIXED_BACKREF_REV) | |
2321 | ret = btrfs_drop_snapshot(root, NULL, 0, 0); | |
2322 | else | |
2323 | ret = btrfs_drop_snapshot(root, NULL, 1, 0); | |
32471dc2 | 2324 | |
6596a928 | 2325 | return (ret < 0) ? 0 : 1; |
e9d0b13b | 2326 | } |
572d9ab7 DS |
2327 | |
2328 | void btrfs_apply_pending_changes(struct btrfs_fs_info *fs_info) | |
2329 | { | |
2330 | unsigned long prev; | |
2331 | unsigned long bit; | |
2332 | ||
6c9fe14f | 2333 | prev = xchg(&fs_info->pending_changes, 0); |
572d9ab7 DS |
2334 | if (!prev) |
2335 | return; | |
2336 | ||
7e1876ac DS |
2337 | bit = 1 << BTRFS_PENDING_SET_INODE_MAP_CACHE; |
2338 | if (prev & bit) | |
2339 | btrfs_set_opt(fs_info->mount_opt, INODE_MAP_CACHE); | |
2340 | prev &= ~bit; | |
2341 | ||
2342 | bit = 1 << BTRFS_PENDING_CLEAR_INODE_MAP_CACHE; | |
2343 | if (prev & bit) | |
2344 | btrfs_clear_opt(fs_info->mount_opt, INODE_MAP_CACHE); | |
2345 | prev &= ~bit; | |
2346 | ||
d51033d0 DS |
2347 | bit = 1 << BTRFS_PENDING_COMMIT; |
2348 | if (prev & bit) | |
2349 | btrfs_debug(fs_info, "pending commit done"); | |
2350 | prev &= ~bit; | |
2351 | ||
572d9ab7 DS |
2352 | if (prev) |
2353 | btrfs_warn(fs_info, | |
2354 | "unknown pending changes left 0x%lx, ignoring", prev); | |
2355 | } |