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> |
ab3c5c18 | 9 | #include <linux/sched/mm.h> |
d3c2fdcf | 10 | #include <linux/writeback.h> |
5f39d397 | 11 | #include <linux/pagemap.h> |
5f2cc086 | 12 | #include <linux/blkdev.h> |
8ea05e3a | 13 | #include <linux/uuid.h> |
e55958c8 | 14 | #include <linux/timekeeping.h> |
602cbe91 | 15 | #include "misc.h" |
79154b1b CM |
16 | #include "ctree.h" |
17 | #include "disk-io.h" | |
18 | #include "transaction.h" | |
925baedd | 19 | #include "locking.h" |
e02119d5 | 20 | #include "tree-log.h" |
733f4fbb | 21 | #include "volumes.h" |
8dabb742 | 22 | #include "dev-replace.h" |
fcebe456 | 23 | #include "qgroup.h" |
aac0023c | 24 | #include "block-group.h" |
9c343784 | 25 | #include "space-info.h" |
c7f13d42 | 26 | #include "fs.h" |
07e81dc9 | 27 | #include "accessors.h" |
a0231804 | 28 | #include "extent-tree.h" |
45c40c8f | 29 | #include "root-tree.h" |
f2b39277 | 30 | #include "dir-item.h" |
c7a03b52 | 31 | #include "uuid-tree.h" |
7572dec8 | 32 | #include "ioctl.h" |
67707479 | 33 | #include "relocation.h" |
2fc6822c | 34 | #include "scrub.h" |
79154b1b | 35 | |
956504a3 JB |
36 | static struct kmem_cache *btrfs_trans_handle_cachep; |
37 | ||
61c047b5 QW |
38 | /* |
39 | * Transaction states and transitions | |
40 | * | |
41 | * No running transaction (fs tree blocks are not modified) | |
42 | * | | |
43 | * | To next stage: | |
44 | * | Call start_transaction() variants. Except btrfs_join_transaction_nostart(). | |
45 | * V | |
46 | * Transaction N [[TRANS_STATE_RUNNING]] | |
47 | * | | |
48 | * | New trans handles can be attached to transaction N by calling all | |
49 | * | start_transaction() variants. | |
50 | * | | |
51 | * | To next stage: | |
52 | * | Call btrfs_commit_transaction() on any trans handle attached to | |
53 | * | transaction N | |
54 | * V | |
77d20c68 JB |
55 | * Transaction N [[TRANS_STATE_COMMIT_PREP]] |
56 | * | | |
57 | * | If there are simultaneous calls to btrfs_commit_transaction() one will win | |
58 | * | the race and the rest will wait for the winner to commit the transaction. | |
59 | * | | |
60 | * | The winner will wait for previous running transaction to completely finish | |
61 | * | if there is one. | |
61c047b5 | 62 | * | |
77d20c68 | 63 | * Transaction N [[TRANS_STATE_COMMIT_START]] |
61c047b5 | 64 | * | |
77d20c68 | 65 | * | Then one of the following happens: |
61c047b5 QW |
66 | * | - Wait for all other trans handle holders to release. |
67 | * | The btrfs_commit_transaction() caller will do the commit work. | |
68 | * | - Wait for current transaction to be committed by others. | |
69 | * | Other btrfs_commit_transaction() caller will do the commit work. | |
70 | * | | |
71 | * | At this stage, only btrfs_join_transaction*() variants can attach | |
72 | * | to this running transaction. | |
73 | * | All other variants will wait for current one to finish and attach to | |
74 | * | transaction N+1. | |
75 | * | | |
76 | * | To next stage: | |
77 | * | Caller is chosen to commit transaction N, and all other trans handle | |
78 | * | haven been released. | |
79 | * V | |
80 | * Transaction N [[TRANS_STATE_COMMIT_DOING]] | |
81 | * | | |
82 | * | The heavy lifting transaction work is started. | |
83 | * | From running delayed refs (modifying extent tree) to creating pending | |
84 | * | snapshots, running qgroups. | |
85 | * | In short, modify supporting trees to reflect modifications of subvolume | |
86 | * | trees. | |
87 | * | | |
88 | * | At this stage, all start_transaction() calls will wait for this | |
89 | * | transaction to finish and attach to transaction N+1. | |
90 | * | | |
91 | * | To next stage: | |
92 | * | Until all supporting trees are updated. | |
93 | * V | |
94 | * Transaction N [[TRANS_STATE_UNBLOCKED]] | |
95 | * | Transaction N+1 | |
96 | * | All needed trees are modified, thus we only [[TRANS_STATE_RUNNING]] | |
97 | * | need to write them back to disk and update | | |
98 | * | super blocks. | | |
99 | * | | | |
100 | * | At this stage, new transaction is allowed to | | |
101 | * | start. | | |
102 | * | All new start_transaction() calls will be | | |
103 | * | attached to transid N+1. | | |
104 | * | | | |
105 | * | To next stage: | | |
106 | * | Until all tree blocks are super blocks are | | |
107 | * | written to block devices | | |
108 | * V | | |
109 | * Transaction N [[TRANS_STATE_COMPLETED]] V | |
110 | * All tree blocks and super blocks are written. Transaction N+1 | |
111 | * This transaction is finished and all its [[TRANS_STATE_COMMIT_START]] | |
112 | * data structures will be cleaned up. | Life goes on | |
113 | */ | |
e8c9f186 | 114 | static const unsigned int btrfs_blocked_trans_types[TRANS_STATE_MAX] = { |
4a9d8bde | 115 | [TRANS_STATE_RUNNING] = 0U, |
77d20c68 | 116 | [TRANS_STATE_COMMIT_PREP] = 0U, |
bcf3a3e7 NB |
117 | [TRANS_STATE_COMMIT_START] = (__TRANS_START | __TRANS_ATTACH), |
118 | [TRANS_STATE_COMMIT_DOING] = (__TRANS_START | | |
4a9d8bde | 119 | __TRANS_ATTACH | |
a6d155d2 FM |
120 | __TRANS_JOIN | |
121 | __TRANS_JOIN_NOSTART), | |
bcf3a3e7 | 122 | [TRANS_STATE_UNBLOCKED] = (__TRANS_START | |
4a9d8bde MX |
123 | __TRANS_ATTACH | |
124 | __TRANS_JOIN | | |
a6d155d2 FM |
125 | __TRANS_JOIN_NOLOCK | |
126 | __TRANS_JOIN_NOSTART), | |
d0c2f4fa FM |
127 | [TRANS_STATE_SUPER_COMMITTED] = (__TRANS_START | |
128 | __TRANS_ATTACH | | |
129 | __TRANS_JOIN | | |
130 | __TRANS_JOIN_NOLOCK | | |
131 | __TRANS_JOIN_NOSTART), | |
bcf3a3e7 | 132 | [TRANS_STATE_COMPLETED] = (__TRANS_START | |
4a9d8bde MX |
133 | __TRANS_ATTACH | |
134 | __TRANS_JOIN | | |
a6d155d2 FM |
135 | __TRANS_JOIN_NOLOCK | |
136 | __TRANS_JOIN_NOSTART), | |
4a9d8bde MX |
137 | }; |
138 | ||
724e2315 | 139 | void btrfs_put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 140 | { |
9b64f57d ER |
141 | WARN_ON(refcount_read(&transaction->use_count) == 0); |
142 | if (refcount_dec_and_test(&transaction->use_count)) { | |
a4abeea4 | 143 | BUG_ON(!list_empty(&transaction->list)); |
5c9d028b LB |
144 | WARN_ON(!RB_EMPTY_ROOT( |
145 | &transaction->delayed_refs.href_root.rb_root)); | |
81f7eb00 JM |
146 | WARN_ON(!RB_EMPTY_ROOT( |
147 | &transaction->delayed_refs.dirty_extent_root)); | |
1262133b | 148 | if (transaction->delayed_refs.pending_csums) |
ab8d0fc4 JM |
149 | btrfs_err(transaction->fs_info, |
150 | "pending csums is %llu", | |
151 | transaction->delayed_refs.pending_csums); | |
7785a663 FM |
152 | /* |
153 | * If any block groups are found in ->deleted_bgs then it's | |
154 | * because the transaction was aborted and a commit did not | |
155 | * happen (things failed before writing the new superblock | |
156 | * and calling btrfs_finish_extent_commit()), so we can not | |
157 | * discard the physical locations of the block groups. | |
158 | */ | |
159 | while (!list_empty(&transaction->deleted_bgs)) { | |
32da5386 | 160 | struct btrfs_block_group *cache; |
7785a663 FM |
161 | |
162 | cache = list_first_entry(&transaction->deleted_bgs, | |
32da5386 | 163 | struct btrfs_block_group, |
7785a663 FM |
164 | bg_list); |
165 | list_del_init(&cache->bg_list); | |
6b7304af | 166 | btrfs_unfreeze_block_group(cache); |
7785a663 FM |
167 | btrfs_put_block_group(cache); |
168 | } | |
bbbf7243 | 169 | WARN_ON(!list_empty(&transaction->dev_update_list)); |
4b5faeac | 170 | kfree(transaction); |
78fae27e | 171 | } |
79154b1b CM |
172 | } |
173 | ||
889bfa39 | 174 | static noinline void switch_commit_roots(struct btrfs_trans_handle *trans) |
817d52f8 | 175 | { |
889bfa39 | 176 | struct btrfs_transaction *cur_trans = trans->transaction; |
16916a88 | 177 | struct btrfs_fs_info *fs_info = trans->fs_info; |
9e351cc8 JB |
178 | struct btrfs_root *root, *tmp; |
179 | ||
dfba78dc FM |
180 | /* |
181 | * At this point no one can be using this transaction to modify any tree | |
182 | * and no one can start another transaction to modify any tree either. | |
183 | */ | |
184 | ASSERT(cur_trans->state == TRANS_STATE_COMMIT_DOING); | |
185 | ||
9e351cc8 | 186 | down_write(&fs_info->commit_root_sem); |
d96b3424 FM |
187 | |
188 | if (test_bit(BTRFS_FS_RELOC_RUNNING, &fs_info->flags)) | |
189 | fs_info->last_reloc_trans = trans->transid; | |
190 | ||
889bfa39 | 191 | list_for_each_entry_safe(root, tmp, &cur_trans->switch_commits, |
9e351cc8 JB |
192 | dirty_list) { |
193 | list_del_init(&root->dirty_list); | |
194 | free_extent_buffer(root->commit_root); | |
195 | root->commit_root = btrfs_root_node(root); | |
41e7acd3 | 196 | extent_io_tree_release(&root->dirty_log_pages); |
370a11b8 | 197 | btrfs_qgroup_clean_swapped_blocks(root); |
9e351cc8 | 198 | } |
2b9dbef2 JB |
199 | |
200 | /* We can free old roots now. */ | |
889bfa39 JB |
201 | spin_lock(&cur_trans->dropped_roots_lock); |
202 | while (!list_empty(&cur_trans->dropped_roots)) { | |
203 | root = list_first_entry(&cur_trans->dropped_roots, | |
2b9dbef2 JB |
204 | struct btrfs_root, root_list); |
205 | list_del_init(&root->root_list); | |
889bfa39 JB |
206 | spin_unlock(&cur_trans->dropped_roots_lock); |
207 | btrfs_free_log(trans, root); | |
2b9dbef2 | 208 | btrfs_drop_and_free_fs_root(fs_info, root); |
889bfa39 | 209 | spin_lock(&cur_trans->dropped_roots_lock); |
2b9dbef2 | 210 | } |
889bfa39 | 211 | spin_unlock(&cur_trans->dropped_roots_lock); |
27d56e62 | 212 | |
9e351cc8 | 213 | up_write(&fs_info->commit_root_sem); |
817d52f8 JB |
214 | } |
215 | ||
0860adfd MX |
216 | static inline void extwriter_counter_inc(struct btrfs_transaction *trans, |
217 | unsigned int type) | |
218 | { | |
219 | if (type & TRANS_EXTWRITERS) | |
220 | atomic_inc(&trans->num_extwriters); | |
221 | } | |
222 | ||
223 | static inline void extwriter_counter_dec(struct btrfs_transaction *trans, | |
224 | unsigned int type) | |
225 | { | |
226 | if (type & TRANS_EXTWRITERS) | |
227 | atomic_dec(&trans->num_extwriters); | |
228 | } | |
229 | ||
230 | static inline void extwriter_counter_init(struct btrfs_transaction *trans, | |
231 | unsigned int type) | |
232 | { | |
233 | atomic_set(&trans->num_extwriters, ((type & TRANS_EXTWRITERS) ? 1 : 0)); | |
234 | } | |
235 | ||
236 | static inline int extwriter_counter_read(struct btrfs_transaction *trans) | |
237 | { | |
238 | return atomic_read(&trans->num_extwriters); | |
178260b2 MX |
239 | } |
240 | ||
fb6dea26 | 241 | /* |
79bd3712 FM |
242 | * To be called after doing the chunk btree updates right after allocating a new |
243 | * chunk (after btrfs_chunk_alloc_add_chunk_item() is called), when removing a | |
244 | * chunk after all chunk btree updates and after finishing the second phase of | |
245 | * chunk allocation (btrfs_create_pending_block_groups()) in case some block | |
246 | * group had its chunk item insertion delayed to the second phase. | |
fb6dea26 JB |
247 | */ |
248 | void btrfs_trans_release_chunk_metadata(struct btrfs_trans_handle *trans) | |
249 | { | |
250 | struct btrfs_fs_info *fs_info = trans->fs_info; | |
251 | ||
252 | if (!trans->chunk_bytes_reserved) | |
253 | return; | |
254 | ||
fb6dea26 | 255 | btrfs_block_rsv_release(fs_info, &fs_info->chunk_block_rsv, |
63f018be | 256 | trans->chunk_bytes_reserved, NULL); |
fb6dea26 JB |
257 | trans->chunk_bytes_reserved = 0; |
258 | } | |
259 | ||
d352ac68 CM |
260 | /* |
261 | * either allocate a new transaction or hop into the existing one | |
262 | */ | |
2ff7e61e JM |
263 | static noinline int join_transaction(struct btrfs_fs_info *fs_info, |
264 | unsigned int type) | |
79154b1b CM |
265 | { |
266 | struct btrfs_transaction *cur_trans; | |
a4abeea4 | 267 | |
19ae4e81 | 268 | spin_lock(&fs_info->trans_lock); |
d43317dc | 269 | loop: |
49b25e05 | 270 | /* The file system has been taken offline. No new transactions. */ |
84961539 | 271 | if (BTRFS_FS_ERROR(fs_info)) { |
19ae4e81 | 272 | spin_unlock(&fs_info->trans_lock); |
49b25e05 JM |
273 | return -EROFS; |
274 | } | |
275 | ||
19ae4e81 | 276 | cur_trans = fs_info->running_transaction; |
a4abeea4 | 277 | if (cur_trans) { |
bf31f87f | 278 | if (TRANS_ABORTED(cur_trans)) { |
19ae4e81 | 279 | spin_unlock(&fs_info->trans_lock); |
49b25e05 | 280 | return cur_trans->aborted; |
871383be | 281 | } |
4a9d8bde | 282 | if (btrfs_blocked_trans_types[cur_trans->state] & type) { |
178260b2 MX |
283 | spin_unlock(&fs_info->trans_lock); |
284 | return -EBUSY; | |
285 | } | |
9b64f57d | 286 | refcount_inc(&cur_trans->use_count); |
13c5a93e | 287 | atomic_inc(&cur_trans->num_writers); |
0860adfd | 288 | extwriter_counter_inc(cur_trans, type); |
19ae4e81 | 289 | spin_unlock(&fs_info->trans_lock); |
e1489b4f | 290 | btrfs_lockdep_acquire(fs_info, btrfs_trans_num_writers); |
5a9ba670 | 291 | btrfs_lockdep_acquire(fs_info, btrfs_trans_num_extwriters); |
a4abeea4 | 292 | return 0; |
79154b1b | 293 | } |
19ae4e81 | 294 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 295 | |
354aa0fb | 296 | /* |
4490e803 FM |
297 | * If we are ATTACH or TRANS_JOIN_NOSTART, we just want to catch the |
298 | * current transaction, and commit it. If there is no transaction, just | |
299 | * return ENOENT. | |
354aa0fb | 300 | */ |
4490e803 | 301 | if (type == TRANS_ATTACH || type == TRANS_JOIN_NOSTART) |
354aa0fb MX |
302 | return -ENOENT; |
303 | ||
4a9d8bde MX |
304 | /* |
305 | * JOIN_NOLOCK only happens during the transaction commit, so | |
306 | * it is impossible that ->running_transaction is NULL | |
307 | */ | |
308 | BUG_ON(type == TRANS_JOIN_NOLOCK); | |
309 | ||
4b5faeac | 310 | cur_trans = kmalloc(sizeof(*cur_trans), GFP_NOFS); |
a4abeea4 JB |
311 | if (!cur_trans) |
312 | return -ENOMEM; | |
d43317dc | 313 | |
e1489b4f | 314 | btrfs_lockdep_acquire(fs_info, btrfs_trans_num_writers); |
5a9ba670 | 315 | btrfs_lockdep_acquire(fs_info, btrfs_trans_num_extwriters); |
e1489b4f | 316 | |
19ae4e81 JS |
317 | spin_lock(&fs_info->trans_lock); |
318 | if (fs_info->running_transaction) { | |
d43317dc CM |
319 | /* |
320 | * someone started a transaction after we unlocked. Make sure | |
4a9d8bde | 321 | * to redo the checks above |
d43317dc | 322 | */ |
5a9ba670 | 323 | btrfs_lockdep_release(fs_info, btrfs_trans_num_extwriters); |
e1489b4f | 324 | btrfs_lockdep_release(fs_info, btrfs_trans_num_writers); |
4b5faeac | 325 | kfree(cur_trans); |
d43317dc | 326 | goto loop; |
84961539 | 327 | } else if (BTRFS_FS_ERROR(fs_info)) { |
e4b50e14 | 328 | spin_unlock(&fs_info->trans_lock); |
5a9ba670 | 329 | btrfs_lockdep_release(fs_info, btrfs_trans_num_extwriters); |
e1489b4f | 330 | btrfs_lockdep_release(fs_info, btrfs_trans_num_writers); |
4b5faeac | 331 | kfree(cur_trans); |
7b8b92af | 332 | return -EROFS; |
79154b1b | 333 | } |
d43317dc | 334 | |
ab8d0fc4 | 335 | cur_trans->fs_info = fs_info; |
48778179 FM |
336 | atomic_set(&cur_trans->pending_ordered, 0); |
337 | init_waitqueue_head(&cur_trans->pending_wait); | |
a4abeea4 | 338 | atomic_set(&cur_trans->num_writers, 1); |
0860adfd | 339 | extwriter_counter_init(cur_trans, type); |
a4abeea4 JB |
340 | init_waitqueue_head(&cur_trans->writer_wait); |
341 | init_waitqueue_head(&cur_trans->commit_wait); | |
4a9d8bde | 342 | cur_trans->state = TRANS_STATE_RUNNING; |
a4abeea4 JB |
343 | /* |
344 | * One for this trans handle, one so it will live on until we | |
345 | * commit the transaction. | |
346 | */ | |
9b64f57d | 347 | refcount_set(&cur_trans->use_count, 2); |
3204d33c | 348 | cur_trans->flags = 0; |
afd48513 | 349 | cur_trans->start_time = ktime_get_seconds(); |
a4abeea4 | 350 | |
a099d0fd AM |
351 | memset(&cur_trans->delayed_refs, 0, sizeof(cur_trans->delayed_refs)); |
352 | ||
5c9d028b | 353 | cur_trans->delayed_refs.href_root = RB_ROOT_CACHED; |
3368d001 | 354 | cur_trans->delayed_refs.dirty_extent_root = RB_ROOT; |
d7df2c79 | 355 | atomic_set(&cur_trans->delayed_refs.num_entries, 0); |
20b297d6 JS |
356 | |
357 | /* | |
358 | * although the tree mod log is per file system and not per transaction, | |
359 | * the log must never go across transaction boundaries. | |
360 | */ | |
361 | smp_mb(); | |
31b1a2bd | 362 | if (!list_empty(&fs_info->tree_mod_seq_list)) |
5d163e0e | 363 | WARN(1, KERN_ERR "BTRFS: tree_mod_seq_list not empty when creating a fresh transaction\n"); |
31b1a2bd | 364 | if (!RB_EMPTY_ROOT(&fs_info->tree_mod_log)) |
5d163e0e | 365 | WARN(1, KERN_ERR "BTRFS: tree_mod_log rb tree not empty when creating a fresh transaction\n"); |
fc36ed7e | 366 | atomic64_set(&fs_info->tree_mod_seq, 0); |
20b297d6 | 367 | |
a4abeea4 JB |
368 | spin_lock_init(&cur_trans->delayed_refs.lock); |
369 | ||
370 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); | |
bbbf7243 | 371 | INIT_LIST_HEAD(&cur_trans->dev_update_list); |
9e351cc8 | 372 | INIT_LIST_HEAD(&cur_trans->switch_commits); |
ce93ec54 | 373 | INIT_LIST_HEAD(&cur_trans->dirty_bgs); |
1bbc621e | 374 | INIT_LIST_HEAD(&cur_trans->io_bgs); |
2b9dbef2 | 375 | INIT_LIST_HEAD(&cur_trans->dropped_roots); |
1bbc621e | 376 | mutex_init(&cur_trans->cache_write_mutex); |
ce93ec54 | 377 | spin_lock_init(&cur_trans->dirty_bgs_lock); |
e33e17ee | 378 | INIT_LIST_HEAD(&cur_trans->deleted_bgs); |
2b9dbef2 | 379 | spin_lock_init(&cur_trans->dropped_roots_lock); |
19ae4e81 | 380 | list_add_tail(&cur_trans->list, &fs_info->trans_list); |
c258d6e3 | 381 | extent_io_tree_init(fs_info, &cur_trans->dirty_pages, |
35da5a7e | 382 | IO_TREE_TRANS_DIRTY_PAGES); |
fe119a6e | 383 | extent_io_tree_init(fs_info, &cur_trans->pinned_extents, |
35da5a7e | 384 | IO_TREE_FS_PINNED_EXTENTS); |
4a4f8fe2 | 385 | btrfs_set_fs_generation(fs_info, fs_info->generation + 1); |
19ae4e81 JS |
386 | cur_trans->transid = fs_info->generation; |
387 | fs_info->running_transaction = cur_trans; | |
49b25e05 | 388 | cur_trans->aborted = 0; |
19ae4e81 | 389 | spin_unlock(&fs_info->trans_lock); |
15ee9bc7 | 390 | |
79154b1b CM |
391 | return 0; |
392 | } | |
393 | ||
d352ac68 | 394 | /* |
92a7cc42 QW |
395 | * This does all the record keeping required to make sure that a shareable root |
396 | * is properly recorded in a given transaction. This is required to make sure | |
397 | * the old root from before we joined the transaction is deleted when the | |
398 | * transaction commits. | |
d352ac68 | 399 | */ |
7585717f | 400 | static int record_root_in_trans(struct btrfs_trans_handle *trans, |
6426c7ad QW |
401 | struct btrfs_root *root, |
402 | int force) | |
6702ed49 | 403 | { |
0b246afa | 404 | struct btrfs_fs_info *fs_info = root->fs_info; |
03a7e111 | 405 | int ret = 0; |
0b246afa | 406 | |
92a7cc42 | 407 | if ((test_bit(BTRFS_ROOT_SHAREABLE, &root->state) && |
6426c7ad | 408 | root->last_trans < trans->transid) || force) { |
4d31778a | 409 | WARN_ON(!force && root->commit_root != root->node); |
5d4f98a2 | 410 | |
7585717f | 411 | /* |
27cdeb70 | 412 | * see below for IN_TRANS_SETUP usage rules |
7585717f CM |
413 | * we have the reloc mutex held now, so there |
414 | * is only one writer in this function | |
415 | */ | |
27cdeb70 | 416 | set_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state); |
7585717f | 417 | |
27cdeb70 | 418 | /* make sure readers find IN_TRANS_SETUP before |
7585717f CM |
419 | * they find our root->last_trans update |
420 | */ | |
421 | smp_wmb(); | |
422 | ||
fc7cbcd4 | 423 | spin_lock(&fs_info->fs_roots_radix_lock); |
6426c7ad | 424 | if (root->last_trans == trans->transid && !force) { |
fc7cbcd4 | 425 | spin_unlock(&fs_info->fs_roots_radix_lock); |
a4abeea4 JB |
426 | return 0; |
427 | } | |
fc7cbcd4 | 428 | radix_tree_tag_set(&fs_info->fs_roots_radix, |
e094f480 | 429 | (unsigned long)btrfs_root_id(root), |
fc7cbcd4 DS |
430 | BTRFS_ROOT_TRANS_TAG); |
431 | spin_unlock(&fs_info->fs_roots_radix_lock); | |
7585717f CM |
432 | root->last_trans = trans->transid; |
433 | ||
434 | /* this is pretty tricky. We don't want to | |
435 | * take the relocation lock in btrfs_record_root_in_trans | |
436 | * unless we're really doing the first setup for this root in | |
437 | * this transaction. | |
438 | * | |
439 | * Normally we'd use root->last_trans as a flag to decide | |
440 | * if we want to take the expensive mutex. | |
441 | * | |
442 | * But, we have to set root->last_trans before we | |
443 | * init the relocation root, otherwise, we trip over warnings | |
444 | * in ctree.c. The solution used here is to flag ourselves | |
27cdeb70 | 445 | * with root IN_TRANS_SETUP. When this is 1, we're still |
7585717f CM |
446 | * fixing up the reloc trees and everyone must wait. |
447 | * | |
448 | * When this is zero, they can trust root->last_trans and fly | |
449 | * through btrfs_record_root_in_trans without having to take the | |
450 | * lock. smp_wmb() makes sure that all the writes above are | |
451 | * done before we pop in the zero below | |
452 | */ | |
03a7e111 | 453 | ret = btrfs_init_reloc_root(trans, root); |
c7548af6 | 454 | smp_mb__before_atomic(); |
27cdeb70 | 455 | clear_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state); |
5d4f98a2 | 456 | } |
03a7e111 | 457 | return ret; |
5d4f98a2 | 458 | } |
bcc63abb | 459 | |
7585717f | 460 | |
2b9dbef2 JB |
461 | void btrfs_add_dropped_root(struct btrfs_trans_handle *trans, |
462 | struct btrfs_root *root) | |
463 | { | |
0b246afa | 464 | struct btrfs_fs_info *fs_info = root->fs_info; |
2b9dbef2 JB |
465 | struct btrfs_transaction *cur_trans = trans->transaction; |
466 | ||
467 | /* Add ourselves to the transaction dropped list */ | |
468 | spin_lock(&cur_trans->dropped_roots_lock); | |
469 | list_add_tail(&root->root_list, &cur_trans->dropped_roots); | |
470 | spin_unlock(&cur_trans->dropped_roots_lock); | |
471 | ||
472 | /* Make sure we don't try to update the root at commit time */ | |
fc7cbcd4 DS |
473 | spin_lock(&fs_info->fs_roots_radix_lock); |
474 | radix_tree_tag_clear(&fs_info->fs_roots_radix, | |
e094f480 | 475 | (unsigned long)btrfs_root_id(root), |
fc7cbcd4 DS |
476 | BTRFS_ROOT_TRANS_TAG); |
477 | spin_unlock(&fs_info->fs_roots_radix_lock); | |
2b9dbef2 JB |
478 | } |
479 | ||
7585717f CM |
480 | int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, |
481 | struct btrfs_root *root) | |
482 | { | |
0b246afa | 483 | struct btrfs_fs_info *fs_info = root->fs_info; |
1409e6cc | 484 | int ret; |
0b246afa | 485 | |
92a7cc42 | 486 | if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) |
7585717f CM |
487 | return 0; |
488 | ||
489 | /* | |
27cdeb70 | 490 | * see record_root_in_trans for comments about IN_TRANS_SETUP usage |
7585717f CM |
491 | * and barriers |
492 | */ | |
493 | smp_rmb(); | |
494 | if (root->last_trans == trans->transid && | |
27cdeb70 | 495 | !test_bit(BTRFS_ROOT_IN_TRANS_SETUP, &root->state)) |
7585717f CM |
496 | return 0; |
497 | ||
0b246afa | 498 | mutex_lock(&fs_info->reloc_mutex); |
1409e6cc | 499 | ret = record_root_in_trans(trans, root, 0); |
0b246afa | 500 | mutex_unlock(&fs_info->reloc_mutex); |
7585717f | 501 | |
1409e6cc | 502 | return ret; |
7585717f CM |
503 | } |
504 | ||
4a9d8bde MX |
505 | static inline int is_transaction_blocked(struct btrfs_transaction *trans) |
506 | { | |
3296bf56 | 507 | return (trans->state >= TRANS_STATE_COMMIT_START && |
501407aa | 508 | trans->state < TRANS_STATE_UNBLOCKED && |
bf31f87f | 509 | !TRANS_ABORTED(trans)); |
4a9d8bde MX |
510 | } |
511 | ||
d352ac68 CM |
512 | /* wait for commit against the current transaction to become unblocked |
513 | * when this is done, it is safe to start a new transaction, but the current | |
514 | * transaction might not be fully on disk. | |
515 | */ | |
2ff7e61e | 516 | static void wait_current_trans(struct btrfs_fs_info *fs_info) |
79154b1b | 517 | { |
f9295749 | 518 | struct btrfs_transaction *cur_trans; |
79154b1b | 519 | |
0b246afa JM |
520 | spin_lock(&fs_info->trans_lock); |
521 | cur_trans = fs_info->running_transaction; | |
4a9d8bde | 522 | if (cur_trans && is_transaction_blocked(cur_trans)) { |
9b64f57d | 523 | refcount_inc(&cur_trans->use_count); |
0b246afa | 524 | spin_unlock(&fs_info->trans_lock); |
72d63ed6 | 525 | |
3e738c53 | 526 | btrfs_might_wait_for_state(fs_info, BTRFS_LOCKDEP_TRANS_UNBLOCKED); |
0b246afa | 527 | wait_event(fs_info->transaction_wait, |
501407aa | 528 | cur_trans->state >= TRANS_STATE_UNBLOCKED || |
bf31f87f | 529 | TRANS_ABORTED(cur_trans)); |
724e2315 | 530 | btrfs_put_transaction(cur_trans); |
a4abeea4 | 531 | } else { |
0b246afa | 532 | spin_unlock(&fs_info->trans_lock); |
f9295749 | 533 | } |
37d1aeee CM |
534 | } |
535 | ||
2ff7e61e | 536 | static int may_wait_transaction(struct btrfs_fs_info *fs_info, int type) |
a22285a6 | 537 | { |
0b246afa | 538 | if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) |
a4abeea4 JB |
539 | return 0; |
540 | ||
92e2f7e3 | 541 | if (type == TRANS_START) |
a22285a6 | 542 | return 1; |
a4abeea4 | 543 | |
a22285a6 YZ |
544 | return 0; |
545 | } | |
546 | ||
20dd2cbf MX |
547 | static inline bool need_reserve_reloc_root(struct btrfs_root *root) |
548 | { | |
0b246afa JM |
549 | struct btrfs_fs_info *fs_info = root->fs_info; |
550 | ||
551 | if (!fs_info->reloc_ctl || | |
92a7cc42 | 552 | !test_bit(BTRFS_ROOT_SHAREABLE, &root->state) || |
e094f480 | 553 | btrfs_root_id(root) == BTRFS_TREE_RELOC_OBJECTID || |
20dd2cbf MX |
554 | root->reloc_root) |
555 | return false; | |
556 | ||
557 | return true; | |
558 | } | |
559 | ||
28270e25 FM |
560 | static int btrfs_reserve_trans_metadata(struct btrfs_fs_info *fs_info, |
561 | enum btrfs_reserve_flush_enum flush, | |
562 | u64 num_bytes, | |
563 | u64 *delayed_refs_bytes) | |
564 | { | |
28270e25 | 565 | struct btrfs_space_info *si = fs_info->trans_block_rsv.space_info; |
2f6397e4 | 566 | u64 bytes = num_bytes + *delayed_refs_bytes; |
28270e25 FM |
567 | int ret; |
568 | ||
28270e25 FM |
569 | /* |
570 | * We want to reserve all the bytes we may need all at once, so we only | |
571 | * do 1 enospc flushing cycle per transaction start. | |
572 | */ | |
573 | ret = btrfs_reserve_metadata_bytes(fs_info, si, bytes, flush); | |
28270e25 FM |
574 | |
575 | /* | |
576 | * If we are an emergency flush, which can steal from the global block | |
577 | * reserve, then attempt to not reserve space for the delayed refs, as | |
578 | * we will consume space for them from the global block reserve. | |
579 | */ | |
2f6397e4 | 580 | if (ret && flush == BTRFS_RESERVE_FLUSH_ALL_STEAL) { |
28270e25 FM |
581 | bytes -= *delayed_refs_bytes; |
582 | *delayed_refs_bytes = 0; | |
583 | ret = btrfs_reserve_metadata_bytes(fs_info, si, bytes, flush); | |
584 | } | |
585 | ||
586 | return ret; | |
587 | } | |
588 | ||
08e007d2 | 589 | static struct btrfs_trans_handle * |
5aed1dd8 | 590 | start_transaction(struct btrfs_root *root, unsigned int num_items, |
003d7c59 JM |
591 | unsigned int type, enum btrfs_reserve_flush_enum flush, |
592 | bool enforce_qgroups) | |
37d1aeee | 593 | { |
0b246afa | 594 | struct btrfs_fs_info *fs_info = root->fs_info; |
ba2c4d4e | 595 | struct btrfs_block_rsv *delayed_refs_rsv = &fs_info->delayed_refs_rsv; |
28270e25 | 596 | struct btrfs_block_rsv *trans_rsv = &fs_info->trans_block_rsv; |
a22285a6 YZ |
597 | struct btrfs_trans_handle *h; |
598 | struct btrfs_transaction *cur_trans; | |
b5009945 | 599 | u64 num_bytes = 0; |
c5567237 | 600 | u64 qgroup_reserved = 0; |
28270e25 | 601 | u64 delayed_refs_bytes = 0; |
20dd2cbf | 602 | bool reloc_reserved = false; |
9c343784 | 603 | bool do_chunk_alloc = false; |
20dd2cbf | 604 | int ret; |
acce952b | 605 | |
84961539 | 606 | if (BTRFS_FS_ERROR(fs_info)) |
acce952b | 607 | return ERR_PTR(-EROFS); |
2a1eb461 | 608 | |
46c4e71e | 609 | if (current->journal_info) { |
0860adfd | 610 | WARN_ON(type & TRANS_EXTWRITERS); |
2a1eb461 | 611 | h = current->journal_info; |
b50fff81 DS |
612 | refcount_inc(&h->use_count); |
613 | WARN_ON(refcount_read(&h->use_count) > 2); | |
2a1eb461 JB |
614 | h->orig_rsv = h->block_rsv; |
615 | h->block_rsv = NULL; | |
616 | goto got_it; | |
617 | } | |
b5009945 JB |
618 | |
619 | /* | |
620 | * Do the reservation before we join the transaction so we can do all | |
621 | * the appropriate flushing if need be. | |
622 | */ | |
003d7c59 | 623 | if (num_items && root != fs_info->chunk_root) { |
0b246afa | 624 | qgroup_reserved = num_items * fs_info->nodesize; |
a6496849 BB |
625 | /* |
626 | * Use prealloc for now, as there might be a currently running | |
627 | * transaction that could free this reserved space prematurely | |
628 | * by committing. | |
629 | */ | |
630 | ret = btrfs_qgroup_reserve_meta_prealloc(root, qgroup_reserved, | |
631 | enforce_qgroups, false); | |
7174109c QW |
632 | if (ret) |
633 | return ERR_PTR(ret); | |
c5567237 | 634 | |
28270e25 | 635 | num_bytes = btrfs_calc_insert_metadata_size(fs_info, num_items); |
ba2c4d4e | 636 | /* |
28270e25 FM |
637 | * If we plan to insert/update/delete "num_items" from a btree, |
638 | * we will also generate delayed refs for extent buffers in the | |
639 | * respective btree paths, so reserve space for the delayed refs | |
640 | * that will be generated by the caller as it modifies btrees. | |
641 | * Try to reserve them to avoid excessive use of the global | |
642 | * block reserve. | |
ba2c4d4e | 643 | */ |
28270e25 | 644 | delayed_refs_bytes = btrfs_calc_delayed_ref_bytes(fs_info, num_items); |
ba2c4d4e | 645 | |
20dd2cbf MX |
646 | /* |
647 | * Do the reservation for the relocation root creation | |
648 | */ | |
ee39b432 | 649 | if (need_reserve_reloc_root(root)) { |
0b246afa | 650 | num_bytes += fs_info->nodesize; |
20dd2cbf MX |
651 | reloc_reserved = true; |
652 | } | |
653 | ||
28270e25 FM |
654 | ret = btrfs_reserve_trans_metadata(fs_info, flush, num_bytes, |
655 | &delayed_refs_bytes); | |
ba2c4d4e JB |
656 | if (ret) |
657 | goto reserve_fail; | |
9c343784 | 658 | |
28270e25 FM |
659 | btrfs_block_rsv_add_bytes(trans_rsv, num_bytes, true); |
660 | ||
661 | if (trans_rsv->space_info->force_alloc) | |
9c343784 | 662 | do_chunk_alloc = true; |
ba2c4d4e | 663 | } else if (num_items == 0 && flush == BTRFS_RESERVE_FLUSH_ALL && |
748f553c | 664 | !btrfs_block_rsv_full(delayed_refs_rsv)) { |
ba2c4d4e JB |
665 | /* |
666 | * Some people call with btrfs_start_transaction(root, 0) | |
667 | * because they can be throttled, but have some other mechanism | |
668 | * for reserving space. We still want these guys to refill the | |
669 | * delayed block_rsv so just add 1 items worth of reservation | |
670 | * here. | |
671 | */ | |
672 | ret = btrfs_delayed_refs_rsv_refill(fs_info, flush); | |
b5009945 | 673 | if (ret) |
843fcf35 | 674 | goto reserve_fail; |
b5009945 | 675 | } |
a22285a6 | 676 | again: |
f2f767e7 | 677 | h = kmem_cache_zalloc(btrfs_trans_handle_cachep, GFP_NOFS); |
843fcf35 MX |
678 | if (!h) { |
679 | ret = -ENOMEM; | |
680 | goto alloc_fail; | |
681 | } | |
37d1aeee | 682 | |
98114659 JB |
683 | /* |
684 | * If we are JOIN_NOLOCK we're already committing a transaction and | |
685 | * waiting on this guy, so we don't need to do the sb_start_intwrite | |
686 | * because we're already holding a ref. We need this because we could | |
687 | * have raced in and did an fsync() on a file which can kick a commit | |
688 | * and then we deadlock with somebody doing a freeze. | |
354aa0fb MX |
689 | * |
690 | * If we are ATTACH, it means we just want to catch the current | |
691 | * transaction and commit it, so we needn't do sb_start_intwrite(). | |
98114659 | 692 | */ |
0860adfd | 693 | if (type & __TRANS_FREEZABLE) |
0b246afa | 694 | sb_start_intwrite(fs_info->sb); |
b2b5ef5c | 695 | |
2ff7e61e JM |
696 | if (may_wait_transaction(fs_info, type)) |
697 | wait_current_trans(fs_info); | |
a22285a6 | 698 | |
a4abeea4 | 699 | do { |
2ff7e61e | 700 | ret = join_transaction(fs_info, type); |
178260b2 | 701 | if (ret == -EBUSY) { |
2ff7e61e | 702 | wait_current_trans(fs_info); |
a6d155d2 FM |
703 | if (unlikely(type == TRANS_ATTACH || |
704 | type == TRANS_JOIN_NOSTART)) | |
178260b2 MX |
705 | ret = -ENOENT; |
706 | } | |
a4abeea4 JB |
707 | } while (ret == -EBUSY); |
708 | ||
a43f7f82 | 709 | if (ret < 0) |
843fcf35 | 710 | goto join_fail; |
0f7d52f4 | 711 | |
0b246afa | 712 | cur_trans = fs_info->running_transaction; |
a22285a6 YZ |
713 | |
714 | h->transid = cur_trans->transid; | |
715 | h->transaction = cur_trans; | |
b50fff81 | 716 | refcount_set(&h->use_count, 1); |
64b63580 | 717 | h->fs_info = root->fs_info; |
7174109c | 718 | |
a698d075 | 719 | h->type = type; |
ea658bad | 720 | INIT_LIST_HEAD(&h->new_bgs); |
28270e25 | 721 | btrfs_init_metadata_block_rsv(fs_info, &h->delayed_rsv, BTRFS_BLOCK_RSV_DELOPS); |
b7ec40d7 | 722 | |
a22285a6 | 723 | smp_mb(); |
3296bf56 | 724 | if (cur_trans->state >= TRANS_STATE_COMMIT_START && |
2ff7e61e | 725 | may_wait_transaction(fs_info, type)) { |
abdd2e80 | 726 | current->journal_info = h; |
3a45bb20 | 727 | btrfs_commit_transaction(h); |
a22285a6 YZ |
728 | goto again; |
729 | } | |
730 | ||
b5009945 | 731 | if (num_bytes) { |
0b246afa | 732 | trace_btrfs_space_reservation(fs_info, "transaction", |
2bcc0328 | 733 | h->transid, num_bytes, 1); |
28270e25 | 734 | h->block_rsv = trans_rsv; |
b5009945 | 735 | h->bytes_reserved = num_bytes; |
28270e25 FM |
736 | if (delayed_refs_bytes > 0) { |
737 | trace_btrfs_space_reservation(fs_info, | |
738 | "local_delayed_refs_rsv", | |
739 | h->transid, | |
740 | delayed_refs_bytes, 1); | |
741 | h->delayed_refs_bytes_reserved = delayed_refs_bytes; | |
742 | btrfs_block_rsv_add_bytes(&h->delayed_rsv, delayed_refs_bytes, true); | |
743 | delayed_refs_bytes = 0; | |
744 | } | |
20dd2cbf | 745 | h->reloc_reserved = reloc_reserved; |
a22285a6 | 746 | } |
9ed74f2d | 747 | |
2a1eb461 | 748 | got_it: |
bcf3a3e7 | 749 | if (!current->journal_info) |
a22285a6 | 750 | current->journal_info = h; |
fcc99734 | 751 | |
9c343784 JB |
752 | /* |
753 | * If the space_info is marked ALLOC_FORCE then we'll get upgraded to | |
754 | * ALLOC_FORCE the first run through, and then we won't allocate for | |
755 | * anybody else who races in later. We don't care about the return | |
756 | * value here. | |
757 | */ | |
758 | if (do_chunk_alloc && num_bytes) { | |
759 | u64 flags = h->block_rsv->space_info->flags; | |
760 | ||
761 | btrfs_chunk_alloc(h, btrfs_get_alloc_profile(fs_info, flags), | |
762 | CHUNK_ALLOC_NO_FORCE); | |
763 | } | |
764 | ||
fcc99734 QW |
765 | /* |
766 | * btrfs_record_root_in_trans() needs to alloc new extents, and may | |
767 | * call btrfs_join_transaction() while we're also starting a | |
768 | * transaction. | |
769 | * | |
770 | * Thus it need to be called after current->journal_info initialized, | |
771 | * or we can deadlock. | |
772 | */ | |
68075ea8 JB |
773 | ret = btrfs_record_root_in_trans(h, root); |
774 | if (ret) { | |
775 | /* | |
776 | * The transaction handle is fully initialized and linked with | |
777 | * other structures so it needs to be ended in case of errors, | |
778 | * not just freed. | |
779 | */ | |
780 | btrfs_end_transaction(h); | |
211de933 | 781 | goto reserve_fail; |
68075ea8 | 782 | } |
211de933 BB |
783 | /* |
784 | * Now that we have found a transaction to be a part of, convert the | |
785 | * qgroup reservation from prealloc to pertrans. A different transaction | |
786 | * can't race in and free our pertrans out from under us. | |
787 | */ | |
788 | if (qgroup_reserved) | |
789 | btrfs_qgroup_convert_reserved_meta(root, qgroup_reserved); | |
fcc99734 | 790 | |
79154b1b | 791 | return h; |
843fcf35 MX |
792 | |
793 | join_fail: | |
0860adfd | 794 | if (type & __TRANS_FREEZABLE) |
0b246afa | 795 | sb_end_intwrite(fs_info->sb); |
843fcf35 MX |
796 | kmem_cache_free(btrfs_trans_handle_cachep, h); |
797 | alloc_fail: | |
798 | if (num_bytes) | |
28270e25 FM |
799 | btrfs_block_rsv_release(fs_info, trans_rsv, num_bytes, NULL); |
800 | if (delayed_refs_bytes) | |
801 | btrfs_space_info_free_bytes_may_use(fs_info, trans_rsv->space_info, | |
802 | delayed_refs_bytes); | |
843fcf35 | 803 | reserve_fail: |
a6496849 | 804 | btrfs_qgroup_free_meta_prealloc(root, qgroup_reserved); |
843fcf35 | 805 | return ERR_PTR(ret); |
79154b1b CM |
806 | } |
807 | ||
f9295749 | 808 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
5aed1dd8 | 809 | unsigned int num_items) |
f9295749 | 810 | { |
08e007d2 | 811 | return start_transaction(root, num_items, TRANS_START, |
003d7c59 | 812 | BTRFS_RESERVE_FLUSH_ALL, true); |
f9295749 | 813 | } |
003d7c59 | 814 | |
8eab77ff FM |
815 | struct btrfs_trans_handle *btrfs_start_transaction_fallback_global_rsv( |
816 | struct btrfs_root *root, | |
7f9fe614 | 817 | unsigned int num_items) |
8eab77ff | 818 | { |
7f9fe614 JB |
819 | return start_transaction(root, num_items, TRANS_START, |
820 | BTRFS_RESERVE_FLUSH_ALL_STEAL, false); | |
8eab77ff | 821 | } |
8407aa46 | 822 | |
7a7eaa40 | 823 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root) |
f9295749 | 824 | { |
003d7c59 JM |
825 | return start_transaction(root, 0, TRANS_JOIN, BTRFS_RESERVE_NO_FLUSH, |
826 | true); | |
f9295749 CM |
827 | } |
828 | ||
8d510121 | 829 | struct btrfs_trans_handle *btrfs_join_transaction_spacecache(struct btrfs_root *root) |
0af3d00b | 830 | { |
575a75d6 | 831 | return start_transaction(root, 0, TRANS_JOIN_NOLOCK, |
003d7c59 | 832 | BTRFS_RESERVE_NO_FLUSH, true); |
0af3d00b JB |
833 | } |
834 | ||
a6d155d2 FM |
835 | /* |
836 | * Similar to regular join but it never starts a transaction when none is | |
19288951 FM |
837 | * running or when there's a running one at a state >= TRANS_STATE_UNBLOCKED. |
838 | * This is similar to btrfs_attach_transaction() but it allows the join to | |
839 | * happen if the transaction commit already started but it's not yet in the | |
840 | * "doing" phase (the state is < TRANS_STATE_COMMIT_DOING). | |
a6d155d2 FM |
841 | */ |
842 | struct btrfs_trans_handle *btrfs_join_transaction_nostart(struct btrfs_root *root) | |
843 | { | |
844 | return start_transaction(root, 0, TRANS_JOIN_NOSTART, | |
845 | BTRFS_RESERVE_NO_FLUSH, true); | |
846 | } | |
847 | ||
d4edf39b | 848 | /* |
9580503b | 849 | * Catch the running transaction. |
d4edf39b MX |
850 | * |
851 | * It is used when we want to commit the current the transaction, but | |
852 | * don't want to start a new one. | |
853 | * | |
854 | * Note: If this function return -ENOENT, it just means there is no | |
855 | * running transaction. But it is possible that the inactive transaction | |
856 | * is still in the memory, not fully on disk. If you hope there is no | |
857 | * inactive transaction in the fs when -ENOENT is returned, you should | |
858 | * invoke | |
859 | * btrfs_attach_transaction_barrier() | |
860 | */ | |
354aa0fb | 861 | struct btrfs_trans_handle *btrfs_attach_transaction(struct btrfs_root *root) |
60376ce4 | 862 | { |
575a75d6 | 863 | return start_transaction(root, 0, TRANS_ATTACH, |
003d7c59 | 864 | BTRFS_RESERVE_NO_FLUSH, true); |
60376ce4 JB |
865 | } |
866 | ||
d4edf39b | 867 | /* |
9580503b | 868 | * Catch the running transaction. |
d4edf39b | 869 | * |
52042d8e | 870 | * It is similar to the above function, the difference is this one |
d4edf39b MX |
871 | * will wait for all the inactive transactions until they fully |
872 | * complete. | |
873 | */ | |
874 | struct btrfs_trans_handle * | |
875 | btrfs_attach_transaction_barrier(struct btrfs_root *root) | |
876 | { | |
877 | struct btrfs_trans_handle *trans; | |
878 | ||
575a75d6 | 879 | trans = start_transaction(root, 0, TRANS_ATTACH, |
003d7c59 | 880 | BTRFS_RESERVE_NO_FLUSH, true); |
b28ff3a7 FM |
881 | if (trans == ERR_PTR(-ENOENT)) { |
882 | int ret; | |
883 | ||
884 | ret = btrfs_wait_for_commit(root->fs_info, 0); | |
885 | if (ret) | |
886 | return ERR_PTR(ret); | |
887 | } | |
d4edf39b MX |
888 | |
889 | return trans; | |
890 | } | |
891 | ||
d0c2f4fa FM |
892 | /* Wait for a transaction commit to reach at least the given state. */ |
893 | static noinline void wait_for_commit(struct btrfs_transaction *commit, | |
894 | const enum btrfs_trans_state min_state) | |
89ce8a63 | 895 | { |
5fd76bf3 OS |
896 | struct btrfs_fs_info *fs_info = commit->fs_info; |
897 | u64 transid = commit->transid; | |
898 | bool put = false; | |
899 | ||
3e738c53 IA |
900 | /* |
901 | * At the moment this function is called with min_state either being | |
902 | * TRANS_STATE_COMPLETED or TRANS_STATE_SUPER_COMMITTED. | |
903 | */ | |
904 | if (min_state == TRANS_STATE_COMPLETED) | |
905 | btrfs_might_wait_for_state(fs_info, BTRFS_LOCKDEP_TRANS_COMPLETED); | |
906 | else | |
907 | btrfs_might_wait_for_state(fs_info, BTRFS_LOCKDEP_TRANS_SUPER_COMMITTED); | |
908 | ||
5fd76bf3 OS |
909 | while (1) { |
910 | wait_event(commit->commit_wait, commit->state >= min_state); | |
911 | if (put) | |
912 | btrfs_put_transaction(commit); | |
913 | ||
914 | if (min_state < TRANS_STATE_COMPLETED) | |
915 | break; | |
916 | ||
917 | /* | |
918 | * A transaction isn't really completed until all of the | |
919 | * previous transactions are completed, but with fsync we can | |
920 | * end up with SUPER_COMMITTED transactions before a COMPLETED | |
921 | * transaction. Wait for those. | |
922 | */ | |
923 | ||
924 | spin_lock(&fs_info->trans_lock); | |
925 | commit = list_first_entry_or_null(&fs_info->trans_list, | |
926 | struct btrfs_transaction, | |
927 | list); | |
928 | if (!commit || commit->transid > transid) { | |
929 | spin_unlock(&fs_info->trans_lock); | |
930 | break; | |
931 | } | |
932 | refcount_inc(&commit->use_count); | |
933 | put = true; | |
934 | spin_unlock(&fs_info->trans_lock); | |
935 | } | |
89ce8a63 CM |
936 | } |
937 | ||
2ff7e61e | 938 | int btrfs_wait_for_commit(struct btrfs_fs_info *fs_info, u64 transid) |
46204592 SW |
939 | { |
940 | struct btrfs_transaction *cur_trans = NULL, *t; | |
8cd2807f | 941 | int ret = 0; |
46204592 | 942 | |
46204592 | 943 | if (transid) { |
0124855f | 944 | if (transid <= btrfs_get_last_trans_committed(fs_info)) |
a4abeea4 | 945 | goto out; |
46204592 SW |
946 | |
947 | /* find specified transaction */ | |
0b246afa JM |
948 | spin_lock(&fs_info->trans_lock); |
949 | list_for_each_entry(t, &fs_info->trans_list, list) { | |
46204592 SW |
950 | if (t->transid == transid) { |
951 | cur_trans = t; | |
9b64f57d | 952 | refcount_inc(&cur_trans->use_count); |
8cd2807f | 953 | ret = 0; |
46204592 SW |
954 | break; |
955 | } | |
8cd2807f MX |
956 | if (t->transid > transid) { |
957 | ret = 0; | |
46204592 | 958 | break; |
8cd2807f | 959 | } |
46204592 | 960 | } |
0b246afa | 961 | spin_unlock(&fs_info->trans_lock); |
42383020 SW |
962 | |
963 | /* | |
964 | * The specified transaction doesn't exist, or we | |
965 | * raced with btrfs_commit_transaction | |
966 | */ | |
967 | if (!cur_trans) { | |
0124855f | 968 | if (transid > btrfs_get_last_trans_committed(fs_info)) |
42383020 | 969 | ret = -EINVAL; |
8cd2807f | 970 | goto out; |
42383020 | 971 | } |
46204592 SW |
972 | } else { |
973 | /* find newest transaction that is committing | committed */ | |
0b246afa JM |
974 | spin_lock(&fs_info->trans_lock); |
975 | list_for_each_entry_reverse(t, &fs_info->trans_list, | |
46204592 | 976 | list) { |
4a9d8bde MX |
977 | if (t->state >= TRANS_STATE_COMMIT_START) { |
978 | if (t->state == TRANS_STATE_COMPLETED) | |
3473f3c0 | 979 | break; |
46204592 | 980 | cur_trans = t; |
9b64f57d | 981 | refcount_inc(&cur_trans->use_count); |
46204592 SW |
982 | break; |
983 | } | |
984 | } | |
0b246afa | 985 | spin_unlock(&fs_info->trans_lock); |
46204592 | 986 | if (!cur_trans) |
a4abeea4 | 987 | goto out; /* nothing committing|committed */ |
46204592 SW |
988 | } |
989 | ||
d0c2f4fa | 990 | wait_for_commit(cur_trans, TRANS_STATE_COMPLETED); |
bf7ecbe9 | 991 | ret = cur_trans->aborted; |
724e2315 | 992 | btrfs_put_transaction(cur_trans); |
a4abeea4 | 993 | out: |
46204592 SW |
994 | return ret; |
995 | } | |
996 | ||
2ff7e61e | 997 | void btrfs_throttle(struct btrfs_fs_info *fs_info) |
37d1aeee | 998 | { |
92e2f7e3 | 999 | wait_current_trans(fs_info); |
37d1aeee CM |
1000 | } |
1001 | ||
a2633b6a | 1002 | bool btrfs_should_end_transaction(struct btrfs_trans_handle *trans) |
8929ecfa YZ |
1003 | { |
1004 | struct btrfs_transaction *cur_trans = trans->transaction; | |
8929ecfa | 1005 | |
3296bf56 | 1006 | if (cur_trans->state >= TRANS_STATE_COMMIT_START || |
e19eb11f | 1007 | test_bit(BTRFS_DELAYED_REFS_FLUSHING, &cur_trans->delayed_refs.flags)) |
a2633b6a | 1008 | return true; |
8929ecfa | 1009 | |
04fb3285 FM |
1010 | if (btrfs_check_space_for_delayed_refs(trans->fs_info)) |
1011 | return true; | |
1012 | ||
1013 | return !!btrfs_block_rsv_check(&trans->fs_info->global_block_rsv, 50); | |
8929ecfa YZ |
1014 | } |
1015 | ||
dc60c525 NB |
1016 | static void btrfs_trans_release_metadata(struct btrfs_trans_handle *trans) |
1017 | ||
0e34693f | 1018 | { |
dc60c525 NB |
1019 | struct btrfs_fs_info *fs_info = trans->fs_info; |
1020 | ||
0e34693f NB |
1021 | if (!trans->block_rsv) { |
1022 | ASSERT(!trans->bytes_reserved); | |
28270e25 | 1023 | ASSERT(!trans->delayed_refs_bytes_reserved); |
0e34693f NB |
1024 | return; |
1025 | } | |
1026 | ||
28270e25 FM |
1027 | if (!trans->bytes_reserved) { |
1028 | ASSERT(!trans->delayed_refs_bytes_reserved); | |
0e34693f | 1029 | return; |
28270e25 | 1030 | } |
0e34693f NB |
1031 | |
1032 | ASSERT(trans->block_rsv == &fs_info->trans_block_rsv); | |
1033 | trace_btrfs_space_reservation(fs_info, "transaction", | |
1034 | trans->transid, trans->bytes_reserved, 0); | |
1035 | btrfs_block_rsv_release(fs_info, trans->block_rsv, | |
63f018be | 1036 | trans->bytes_reserved, NULL); |
0e34693f | 1037 | trans->bytes_reserved = 0; |
28270e25 FM |
1038 | |
1039 | if (!trans->delayed_refs_bytes_reserved) | |
1040 | return; | |
1041 | ||
1042 | trace_btrfs_space_reservation(fs_info, "local_delayed_refs_rsv", | |
1043 | trans->transid, | |
1044 | trans->delayed_refs_bytes_reserved, 0); | |
1045 | btrfs_block_rsv_release(fs_info, &trans->delayed_rsv, | |
1046 | trans->delayed_refs_bytes_reserved, NULL); | |
1047 | trans->delayed_refs_bytes_reserved = 0; | |
0e34693f NB |
1048 | } |
1049 | ||
89ce8a63 | 1050 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
3a45bb20 | 1051 | int throttle) |
79154b1b | 1052 | { |
3a45bb20 | 1053 | struct btrfs_fs_info *info = trans->fs_info; |
8929ecfa | 1054 | struct btrfs_transaction *cur_trans = trans->transaction; |
fdee5e55 | 1055 | int ret = 0; |
c3e69d58 | 1056 | |
b50fff81 DS |
1057 | if (refcount_read(&trans->use_count) > 1) { |
1058 | refcount_dec(&trans->use_count); | |
2a1eb461 JB |
1059 | trans->block_rsv = trans->orig_rsv; |
1060 | return 0; | |
1061 | } | |
1062 | ||
dc60c525 | 1063 | btrfs_trans_release_metadata(trans); |
4c13d758 | 1064 | trans->block_rsv = NULL; |
c5567237 | 1065 | |
119e80df | 1066 | btrfs_create_pending_block_groups(trans); |
ea658bad | 1067 | |
4fbcdf66 FM |
1068 | btrfs_trans_release_chunk_metadata(trans); |
1069 | ||
0860adfd | 1070 | if (trans->type & __TRANS_FREEZABLE) |
0b246afa | 1071 | sb_end_intwrite(info->sb); |
6df7881a | 1072 | |
8929ecfa | 1073 | WARN_ON(cur_trans != info->running_transaction); |
13c5a93e JB |
1074 | WARN_ON(atomic_read(&cur_trans->num_writers) < 1); |
1075 | atomic_dec(&cur_trans->num_writers); | |
0860adfd | 1076 | extwriter_counter_dec(cur_trans, trans->type); |
89ce8a63 | 1077 | |
093258e6 | 1078 | cond_wake_up(&cur_trans->writer_wait); |
e1489b4f | 1079 | |
5a9ba670 | 1080 | btrfs_lockdep_release(info, btrfs_trans_num_extwriters); |
e1489b4f IA |
1081 | btrfs_lockdep_release(info, btrfs_trans_num_writers); |
1082 | ||
724e2315 | 1083 | btrfs_put_transaction(cur_trans); |
9ed74f2d JB |
1084 | |
1085 | if (current->journal_info == trans) | |
1086 | current->journal_info = NULL; | |
ab78c84d | 1087 | |
24bbcf04 | 1088 | if (throttle) |
2ff7e61e | 1089 | btrfs_run_delayed_iputs(info); |
24bbcf04 | 1090 | |
84961539 | 1091 | if (TRANS_ABORTED(trans) || BTRFS_FS_ERROR(info)) { |
4e121c06 | 1092 | wake_up_process(info->transaction_kthread); |
fbabd4a3 | 1093 | if (TRANS_ABORTED(trans)) |
fdee5e55 | 1094 | ret = trans->aborted; |
fbabd4a3 | 1095 | else |
fdee5e55 | 1096 | ret = -EROFS; |
4e121c06 | 1097 | } |
49b25e05 | 1098 | |
4edc2ca3 | 1099 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
fdee5e55 | 1100 | return ret; |
79154b1b CM |
1101 | } |
1102 | ||
3a45bb20 | 1103 | int btrfs_end_transaction(struct btrfs_trans_handle *trans) |
89ce8a63 | 1104 | { |
3a45bb20 | 1105 | return __btrfs_end_transaction(trans, 0); |
89ce8a63 CM |
1106 | } |
1107 | ||
3a45bb20 | 1108 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans) |
89ce8a63 | 1109 | { |
3a45bb20 | 1110 | return __btrfs_end_transaction(trans, 1); |
16cdcec7 MX |
1111 | } |
1112 | ||
d352ac68 CM |
1113 | /* |
1114 | * when btree blocks are allocated, they have some corresponding bits set for | |
1115 | * them in one of two extent_io trees. This is used to make sure all of | |
690587d1 | 1116 | * those extents are sent to disk but does not wait on them |
d352ac68 | 1117 | */ |
2ff7e61e | 1118 | int btrfs_write_marked_extents(struct btrfs_fs_info *fs_info, |
8cef4e16 | 1119 | struct extent_io_tree *dirty_pages, int mark) |
79154b1b | 1120 | { |
777e6bd7 | 1121 | int err = 0; |
7c4452b9 | 1122 | int werr = 0; |
0b246afa | 1123 | struct address_space *mapping = fs_info->btree_inode->i_mapping; |
e6138876 | 1124 | struct extent_state *cached_state = NULL; |
777e6bd7 | 1125 | u64 start = 0; |
5f39d397 | 1126 | u64 end; |
7c4452b9 | 1127 | |
e5860f82 FM |
1128 | while (find_first_extent_bit(dirty_pages, start, &start, &end, |
1129 | mark, &cached_state)) { | |
663dfbb0 FM |
1130 | bool wait_writeback = false; |
1131 | ||
1132 | err = convert_extent_bit(dirty_pages, start, end, | |
1133 | EXTENT_NEED_WAIT, | |
210aa277 | 1134 | mark, &cached_state); |
663dfbb0 FM |
1135 | /* |
1136 | * convert_extent_bit can return -ENOMEM, which is most of the | |
1137 | * time a temporary error. So when it happens, ignore the error | |
1138 | * and wait for writeback of this range to finish - because we | |
1139 | * failed to set the bit EXTENT_NEED_WAIT for the range, a call | |
bf89d38f JM |
1140 | * to __btrfs_wait_marked_extents() would not know that |
1141 | * writeback for this range started and therefore wouldn't | |
1142 | * wait for it to finish - we don't want to commit a | |
1143 | * superblock that points to btree nodes/leafs for which | |
1144 | * writeback hasn't finished yet (and without errors). | |
663dfbb0 | 1145 | * We cleanup any entries left in the io tree when committing |
41e7acd3 | 1146 | * the transaction (through extent_io_tree_release()). |
663dfbb0 FM |
1147 | */ |
1148 | if (err == -ENOMEM) { | |
1149 | err = 0; | |
1150 | wait_writeback = true; | |
1151 | } | |
1152 | if (!err) | |
1153 | err = filemap_fdatawrite_range(mapping, start, end); | |
1728366e JB |
1154 | if (err) |
1155 | werr = err; | |
663dfbb0 FM |
1156 | else if (wait_writeback) |
1157 | werr = filemap_fdatawait_range(mapping, start, end); | |
e38e2ed7 | 1158 | free_extent_state(cached_state); |
663dfbb0 | 1159 | cached_state = NULL; |
1728366e JB |
1160 | cond_resched(); |
1161 | start = end + 1; | |
7c4452b9 | 1162 | } |
690587d1 CM |
1163 | return werr; |
1164 | } | |
1165 | ||
1166 | /* | |
1167 | * when btree blocks are allocated, they have some corresponding bits set for | |
1168 | * them in one of two extent_io trees. This is used to make sure all of | |
1169 | * those extents are on disk for transaction or log commit. We wait | |
1170 | * on all the pages and clear them from the dirty pages state tree | |
1171 | */ | |
bf89d38f JM |
1172 | static int __btrfs_wait_marked_extents(struct btrfs_fs_info *fs_info, |
1173 | struct extent_io_tree *dirty_pages) | |
690587d1 | 1174 | { |
690587d1 CM |
1175 | int err = 0; |
1176 | int werr = 0; | |
0b246afa | 1177 | struct address_space *mapping = fs_info->btree_inode->i_mapping; |
e6138876 | 1178 | struct extent_state *cached_state = NULL; |
690587d1 CM |
1179 | u64 start = 0; |
1180 | u64 end; | |
777e6bd7 | 1181 | |
e5860f82 FM |
1182 | while (find_first_extent_bit(dirty_pages, start, &start, &end, |
1183 | EXTENT_NEED_WAIT, &cached_state)) { | |
663dfbb0 FM |
1184 | /* |
1185 | * Ignore -ENOMEM errors returned by clear_extent_bit(). | |
1186 | * When committing the transaction, we'll remove any entries | |
1187 | * left in the io tree. For a log commit, we don't remove them | |
1188 | * after committing the log because the tree can be accessed | |
1189 | * concurrently - we do it only at transaction commit time when | |
41e7acd3 | 1190 | * it's safe to do it (through extent_io_tree_release()). |
663dfbb0 FM |
1191 | */ |
1192 | err = clear_extent_bit(dirty_pages, start, end, | |
bd015294 | 1193 | EXTENT_NEED_WAIT, &cached_state); |
663dfbb0 FM |
1194 | if (err == -ENOMEM) |
1195 | err = 0; | |
1196 | if (!err) | |
1197 | err = filemap_fdatawait_range(mapping, start, end); | |
1728366e JB |
1198 | if (err) |
1199 | werr = err; | |
e38e2ed7 FM |
1200 | free_extent_state(cached_state); |
1201 | cached_state = NULL; | |
1728366e JB |
1202 | cond_resched(); |
1203 | start = end + 1; | |
777e6bd7 | 1204 | } |
7c4452b9 CM |
1205 | if (err) |
1206 | werr = err; | |
bf89d38f JM |
1207 | return werr; |
1208 | } | |
656f30db | 1209 | |
b9fae2eb | 1210 | static int btrfs_wait_extents(struct btrfs_fs_info *fs_info, |
bf89d38f JM |
1211 | struct extent_io_tree *dirty_pages) |
1212 | { | |
1213 | bool errors = false; | |
1214 | int err; | |
656f30db | 1215 | |
bf89d38f JM |
1216 | err = __btrfs_wait_marked_extents(fs_info, dirty_pages); |
1217 | if (test_and_clear_bit(BTRFS_FS_BTREE_ERR, &fs_info->flags)) | |
1218 | errors = true; | |
1219 | ||
1220 | if (errors && !err) | |
1221 | err = -EIO; | |
1222 | return err; | |
1223 | } | |
656f30db | 1224 | |
bf89d38f JM |
1225 | int btrfs_wait_tree_log_extents(struct btrfs_root *log_root, int mark) |
1226 | { | |
1227 | struct btrfs_fs_info *fs_info = log_root->fs_info; | |
1228 | struct extent_io_tree *dirty_pages = &log_root->dirty_log_pages; | |
1229 | bool errors = false; | |
1230 | int err; | |
656f30db | 1231 | |
e094f480 | 1232 | ASSERT(btrfs_root_id(log_root) == BTRFS_TREE_LOG_OBJECTID); |
bf89d38f JM |
1233 | |
1234 | err = __btrfs_wait_marked_extents(fs_info, dirty_pages); | |
1235 | if ((mark & EXTENT_DIRTY) && | |
1236 | test_and_clear_bit(BTRFS_FS_LOG1_ERR, &fs_info->flags)) | |
1237 | errors = true; | |
1238 | ||
1239 | if ((mark & EXTENT_NEW) && | |
1240 | test_and_clear_bit(BTRFS_FS_LOG2_ERR, &fs_info->flags)) | |
1241 | errors = true; | |
1242 | ||
1243 | if (errors && !err) | |
1244 | err = -EIO; | |
1245 | return err; | |
79154b1b CM |
1246 | } |
1247 | ||
690587d1 | 1248 | /* |
c9b577c0 NB |
1249 | * When btree blocks are allocated the corresponding extents are marked dirty. |
1250 | * This function ensures such extents are persisted on disk for transaction or | |
1251 | * log commit. | |
1252 | * | |
1253 | * @trans: transaction whose dirty pages we'd like to write | |
690587d1 | 1254 | */ |
70458a58 | 1255 | static int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans) |
690587d1 CM |
1256 | { |
1257 | int ret; | |
1258 | int ret2; | |
c9b577c0 | 1259 | struct extent_io_tree *dirty_pages = &trans->transaction->dirty_pages; |
70458a58 | 1260 | struct btrfs_fs_info *fs_info = trans->fs_info; |
c6adc9cc | 1261 | struct blk_plug plug; |
690587d1 | 1262 | |
c6adc9cc | 1263 | blk_start_plug(&plug); |
c9b577c0 | 1264 | ret = btrfs_write_marked_extents(fs_info, dirty_pages, EXTENT_DIRTY); |
c6adc9cc | 1265 | blk_finish_plug(&plug); |
bf89d38f | 1266 | ret2 = btrfs_wait_extents(fs_info, dirty_pages); |
bf0da8c1 | 1267 | |
41e7acd3 | 1268 | extent_io_tree_release(&trans->transaction->dirty_pages); |
c9b577c0 | 1269 | |
bf0da8c1 CM |
1270 | if (ret) |
1271 | return ret; | |
c9b577c0 | 1272 | else if (ret2) |
bf0da8c1 | 1273 | return ret2; |
c9b577c0 NB |
1274 | else |
1275 | return 0; | |
d0c803c4 CM |
1276 | } |
1277 | ||
d352ac68 CM |
1278 | /* |
1279 | * this is used to update the root pointer in the tree of tree roots. | |
1280 | * | |
1281 | * But, in the case of the extent allocation tree, updating the root | |
1282 | * pointer may allocate blocks which may change the root of the extent | |
1283 | * allocation tree. | |
1284 | * | |
1285 | * So, this loops and repeats and makes sure the cowonly root didn't | |
1286 | * change while the root pointer was being updated in the metadata. | |
1287 | */ | |
0b86a832 CM |
1288 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
1289 | struct btrfs_root *root) | |
79154b1b CM |
1290 | { |
1291 | int ret; | |
0b86a832 | 1292 | u64 old_root_bytenr; |
86b9f2ec | 1293 | u64 old_root_used; |
0b246afa JM |
1294 | struct btrfs_fs_info *fs_info = root->fs_info; |
1295 | struct btrfs_root *tree_root = fs_info->tree_root; | |
79154b1b | 1296 | |
86b9f2ec | 1297 | old_root_used = btrfs_root_used(&root->root_item); |
56bec294 | 1298 | |
d397712b | 1299 | while (1) { |
0b86a832 | 1300 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
86b9f2ec | 1301 | if (old_root_bytenr == root->node->start && |
ea526d18 | 1302 | old_root_used == btrfs_root_used(&root->root_item)) |
79154b1b | 1303 | break; |
87ef2bb4 | 1304 | |
5d4f98a2 | 1305 | btrfs_set_root_node(&root->root_item, root->node); |
79154b1b | 1306 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
1307 | &root->root_key, |
1308 | &root->root_item); | |
49b25e05 JM |
1309 | if (ret) |
1310 | return ret; | |
56bec294 | 1311 | |
86b9f2ec | 1312 | old_root_used = btrfs_root_used(&root->root_item); |
0b86a832 | 1313 | } |
276e680d | 1314 | |
0b86a832 CM |
1315 | return 0; |
1316 | } | |
1317 | ||
d352ac68 CM |
1318 | /* |
1319 | * update all the cowonly tree roots on disk | |
49b25e05 JM |
1320 | * |
1321 | * The error handling in this function may not be obvious. Any of the | |
1322 | * failures will cause the file system to go offline. We still need | |
1323 | * to clean up the delayed refs. | |
d352ac68 | 1324 | */ |
9386d8bc | 1325 | static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans) |
0b86a832 | 1326 | { |
9386d8bc | 1327 | struct btrfs_fs_info *fs_info = trans->fs_info; |
ea526d18 | 1328 | struct list_head *dirty_bgs = &trans->transaction->dirty_bgs; |
1bbc621e | 1329 | struct list_head *io_bgs = &trans->transaction->io_bgs; |
0b86a832 | 1330 | struct list_head *next; |
84234f3a | 1331 | struct extent_buffer *eb; |
56bec294 | 1332 | int ret; |
84234f3a | 1333 | |
dfba78dc FM |
1334 | /* |
1335 | * At this point no one can be using this transaction to modify any tree | |
1336 | * and no one can start another transaction to modify any tree either. | |
1337 | */ | |
1338 | ASSERT(trans->transaction->state == TRANS_STATE_COMMIT_DOING); | |
1339 | ||
84234f3a | 1340 | eb = btrfs_lock_root_node(fs_info->tree_root); |
49b25e05 | 1341 | ret = btrfs_cow_block(trans, fs_info->tree_root, eb, NULL, |
9631e4cc | 1342 | 0, &eb, BTRFS_NESTING_COW); |
84234f3a YZ |
1343 | btrfs_tree_unlock(eb); |
1344 | free_extent_buffer(eb); | |
0b86a832 | 1345 | |
49b25e05 JM |
1346 | if (ret) |
1347 | return ret; | |
87ef2bb4 | 1348 | |
196c9d8d | 1349 | ret = btrfs_run_dev_stats(trans); |
c16ce190 JB |
1350 | if (ret) |
1351 | return ret; | |
2b584c68 | 1352 | ret = btrfs_run_dev_replace(trans); |
c16ce190 JB |
1353 | if (ret) |
1354 | return ret; | |
280f8bd2 | 1355 | ret = btrfs_run_qgroups(trans); |
c16ce190 JB |
1356 | if (ret) |
1357 | return ret; | |
546adb0d | 1358 | |
bbebb3e0 | 1359 | ret = btrfs_setup_space_cache(trans); |
dcdf7f6d JB |
1360 | if (ret) |
1361 | return ret; | |
1362 | ||
ea526d18 | 1363 | again: |
d397712b | 1364 | while (!list_empty(&fs_info->dirty_cowonly_roots)) { |
2ff7e61e | 1365 | struct btrfs_root *root; |
0b86a832 CM |
1366 | next = fs_info->dirty_cowonly_roots.next; |
1367 | list_del_init(next); | |
1368 | root = list_entry(next, struct btrfs_root, dirty_list); | |
e7070be1 | 1369 | clear_bit(BTRFS_ROOT_DIRTY, &root->state); |
87ef2bb4 | 1370 | |
826582ca JB |
1371 | list_add_tail(&root->dirty_list, |
1372 | &trans->transaction->switch_commits); | |
49b25e05 JM |
1373 | ret = update_cowonly_root(trans, root); |
1374 | if (ret) | |
1375 | return ret; | |
79154b1b | 1376 | } |
276e680d | 1377 | |
488bc2a2 | 1378 | /* Now flush any delayed refs generated by updating all of the roots */ |
8a526c44 | 1379 | ret = btrfs_run_delayed_refs(trans, U64_MAX); |
488bc2a2 JB |
1380 | if (ret) |
1381 | return ret; | |
1382 | ||
1bbc621e | 1383 | while (!list_empty(dirty_bgs) || !list_empty(io_bgs)) { |
5742d15f | 1384 | ret = btrfs_write_dirty_block_groups(trans); |
ea526d18 JB |
1385 | if (ret) |
1386 | return ret; | |
488bc2a2 JB |
1387 | |
1388 | /* | |
1389 | * We're writing the dirty block groups, which could generate | |
1390 | * delayed refs, which could generate more dirty block groups, | |
1391 | * so we want to keep this flushing in this loop to make sure | |
1392 | * everything gets run. | |
1393 | */ | |
8a526c44 | 1394 | ret = btrfs_run_delayed_refs(trans, U64_MAX); |
ea526d18 JB |
1395 | if (ret) |
1396 | return ret; | |
1397 | } | |
1398 | ||
1399 | if (!list_empty(&fs_info->dirty_cowonly_roots)) | |
1400 | goto again; | |
1401 | ||
9f6cbcbb DS |
1402 | /* Update dev-replace pointer once everything is committed */ |
1403 | fs_info->dev_replace.committed_cursor_left = | |
1404 | fs_info->dev_replace.cursor_left_last_write_of_item; | |
8dabb742 | 1405 | |
79154b1b CM |
1406 | return 0; |
1407 | } | |
1408 | ||
b4be6aef JB |
1409 | /* |
1410 | * If we had a pending drop we need to see if there are any others left in our | |
1411 | * dead roots list, and if not clear our bit and wake any waiters. | |
1412 | */ | |
1413 | void btrfs_maybe_wake_unfinished_drop(struct btrfs_fs_info *fs_info) | |
1414 | { | |
1415 | /* | |
1416 | * We put the drop in progress roots at the front of the list, so if the | |
1417 | * first entry doesn't have UNFINISHED_DROP set we can wake everybody | |
1418 | * up. | |
1419 | */ | |
1420 | spin_lock(&fs_info->trans_lock); | |
1421 | if (!list_empty(&fs_info->dead_roots)) { | |
1422 | struct btrfs_root *root = list_first_entry(&fs_info->dead_roots, | |
1423 | struct btrfs_root, | |
1424 | root_list); | |
1425 | if (test_bit(BTRFS_ROOT_UNFINISHED_DROP, &root->state)) { | |
1426 | spin_unlock(&fs_info->trans_lock); | |
1427 | return; | |
1428 | } | |
1429 | } | |
1430 | spin_unlock(&fs_info->trans_lock); | |
1431 | ||
1432 | btrfs_wake_unfinished_drop(fs_info); | |
1433 | } | |
1434 | ||
d352ac68 CM |
1435 | /* |
1436 | * dead roots are old snapshots that need to be deleted. This allocates | |
1437 | * a dirty root struct and adds it into the list of dead roots that need to | |
1438 | * be deleted | |
1439 | */ | |
cfad392b | 1440 | void btrfs_add_dead_root(struct btrfs_root *root) |
5eda7b5e | 1441 | { |
0b246afa JM |
1442 | struct btrfs_fs_info *fs_info = root->fs_info; |
1443 | ||
1444 | spin_lock(&fs_info->trans_lock); | |
dc9492c1 JB |
1445 | if (list_empty(&root->root_list)) { |
1446 | btrfs_grab_root(root); | |
b4be6aef JB |
1447 | |
1448 | /* We want to process the partially complete drops first. */ | |
1449 | if (test_bit(BTRFS_ROOT_UNFINISHED_DROP, &root->state)) | |
1450 | list_add(&root->root_list, &fs_info->dead_roots); | |
1451 | else | |
1452 | list_add_tail(&root->root_list, &fs_info->dead_roots); | |
dc9492c1 | 1453 | } |
0b246afa | 1454 | spin_unlock(&fs_info->trans_lock); |
5eda7b5e CM |
1455 | } |
1456 | ||
d352ac68 | 1457 | /* |
dfba78dc FM |
1458 | * Update each subvolume root and its relocation root, if it exists, in the tree |
1459 | * of tree roots. Also free log roots if they exist. | |
d352ac68 | 1460 | */ |
7e4443d9 | 1461 | static noinline int commit_fs_roots(struct btrfs_trans_handle *trans) |
0f7d52f4 | 1462 | { |
7e4443d9 | 1463 | struct btrfs_fs_info *fs_info = trans->fs_info; |
fc7cbcd4 DS |
1464 | struct btrfs_root *gang[8]; |
1465 | int i; | |
1466 | int ret; | |
54aa1f4d | 1467 | |
dfba78dc FM |
1468 | /* |
1469 | * At this point no one can be using this transaction to modify any tree | |
1470 | * and no one can start another transaction to modify any tree either. | |
1471 | */ | |
1472 | ASSERT(trans->transaction->state == TRANS_STATE_COMMIT_DOING); | |
1473 | ||
fc7cbcd4 DS |
1474 | spin_lock(&fs_info->fs_roots_radix_lock); |
1475 | while (1) { | |
1476 | ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix, | |
1477 | (void **)gang, 0, | |
1478 | ARRAY_SIZE(gang), | |
1479 | BTRFS_ROOT_TRANS_TAG); | |
1480 | if (ret == 0) | |
1481 | break; | |
1482 | for (i = 0; i < ret; i++) { | |
1483 | struct btrfs_root *root = gang[i]; | |
1484 | int ret2; | |
1485 | ||
1486 | /* | |
1487 | * At this point we can neither have tasks logging inodes | |
1488 | * from a root nor trying to commit a log tree. | |
1489 | */ | |
1490 | ASSERT(atomic_read(&root->log_writers) == 0); | |
1491 | ASSERT(atomic_read(&root->log_commit[0]) == 0); | |
1492 | ASSERT(atomic_read(&root->log_commit[1]) == 0); | |
1493 | ||
1494 | radix_tree_tag_clear(&fs_info->fs_roots_radix, | |
e094f480 | 1495 | (unsigned long)btrfs_root_id(root), |
fc7cbcd4 | 1496 | BTRFS_ROOT_TRANS_TAG); |
6e68de0b | 1497 | btrfs_qgroup_free_meta_all_pertrans(root); |
fc7cbcd4 DS |
1498 | spin_unlock(&fs_info->fs_roots_radix_lock); |
1499 | ||
1500 | btrfs_free_log(trans, root); | |
1501 | ret2 = btrfs_update_reloc_root(trans, root); | |
1502 | if (ret2) | |
1503 | return ret2; | |
1504 | ||
1505 | /* see comments in should_cow_block() */ | |
1506 | clear_bit(BTRFS_ROOT_FORCE_COW, &root->state); | |
1507 | smp_mb__after_atomic(); | |
1508 | ||
1509 | if (root->commit_root != root->node) { | |
1510 | list_add_tail(&root->dirty_list, | |
1511 | &trans->transaction->switch_commits); | |
1512 | btrfs_set_root_node(&root->root_item, | |
1513 | root->node); | |
1514 | } | |
48b36a60 | 1515 | |
fc7cbcd4 DS |
1516 | ret2 = btrfs_update_root(trans, fs_info->tree_root, |
1517 | &root->root_key, | |
1518 | &root->root_item); | |
1519 | if (ret2) | |
1520 | return ret2; | |
1521 | spin_lock(&fs_info->fs_roots_radix_lock); | |
0f7d52f4 CM |
1522 | } |
1523 | } | |
fc7cbcd4 | 1524 | spin_unlock(&fs_info->fs_roots_radix_lock); |
4f4317c1 | 1525 | return 0; |
0f7d52f4 CM |
1526 | } |
1527 | ||
6426c7ad QW |
1528 | /* |
1529 | * Do all special snapshot related qgroup dirty hack. | |
1530 | * | |
1531 | * Will do all needed qgroup inherit and dirty hack like switch commit | |
1532 | * roots inside one transaction and write all btree into disk, to make | |
1533 | * qgroup works. | |
1534 | */ | |
1535 | static int qgroup_account_snapshot(struct btrfs_trans_handle *trans, | |
1536 | struct btrfs_root *src, | |
1537 | struct btrfs_root *parent, | |
1538 | struct btrfs_qgroup_inherit *inherit, | |
1539 | u64 dst_objectid) | |
1540 | { | |
1541 | struct btrfs_fs_info *fs_info = src->fs_info; | |
1542 | int ret; | |
1543 | ||
1544 | /* | |
5343cd93 BB |
1545 | * Save some performance in the case that qgroups are not enabled. If |
1546 | * this check races with the ioctl, rescan will kick in anyway. | |
6426c7ad | 1547 | */ |
182940f4 | 1548 | if (!btrfs_qgroup_full_accounting(fs_info)) |
6426c7ad | 1549 | return 0; |
6426c7ad | 1550 | |
4d31778a | 1551 | /* |
52042d8e | 1552 | * Ensure dirty @src will be committed. Or, after coming |
4d31778a QW |
1553 | * commit_fs_roots() and switch_commit_roots(), any dirty but not |
1554 | * recorded root will never be updated again, causing an outdated root | |
1555 | * item. | |
1556 | */ | |
1c442d22 JB |
1557 | ret = record_root_in_trans(trans, src, 1); |
1558 | if (ret) | |
1559 | return ret; | |
4d31778a | 1560 | |
2a4d84c1 JB |
1561 | /* |
1562 | * btrfs_qgroup_inherit relies on a consistent view of the usage for the | |
1563 | * src root, so we must run the delayed refs here. | |
1564 | * | |
1565 | * However this isn't particularly fool proof, because there's no | |
1566 | * synchronization keeping us from changing the tree after this point | |
1567 | * before we do the qgroup_inherit, or even from making changes while | |
1568 | * we're doing the qgroup_inherit. But that's a problem for the future, | |
1569 | * for now flush the delayed refs to narrow the race window where the | |
1570 | * qgroup counters could end up wrong. | |
1571 | */ | |
8a526c44 | 1572 | ret = btrfs_run_delayed_refs(trans, U64_MAX); |
2a4d84c1 JB |
1573 | if (ret) { |
1574 | btrfs_abort_transaction(trans, ret); | |
44365827 | 1575 | return ret; |
2a4d84c1 JB |
1576 | } |
1577 | ||
7e4443d9 | 1578 | ret = commit_fs_roots(trans); |
6426c7ad QW |
1579 | if (ret) |
1580 | goto out; | |
460fb20a | 1581 | ret = btrfs_qgroup_account_extents(trans); |
6426c7ad QW |
1582 | if (ret < 0) |
1583 | goto out; | |
1584 | ||
1585 | /* Now qgroup are all updated, we can inherit it to new qgroups */ | |
e094f480 JB |
1586 | ret = btrfs_qgroup_inherit(trans, btrfs_root_id(src), dst_objectid, |
1587 | btrfs_root_id(parent), inherit); | |
6426c7ad QW |
1588 | if (ret < 0) |
1589 | goto out; | |
1590 | ||
1591 | /* | |
1592 | * Now we do a simplified commit transaction, which will: | |
1593 | * 1) commit all subvolume and extent tree | |
1594 | * To ensure all subvolume and extent tree have a valid | |
1595 | * commit_root to accounting later insert_dir_item() | |
1596 | * 2) write all btree blocks onto disk | |
1597 | * This is to make sure later btree modification will be cowed | |
1598 | * Or commit_root can be populated and cause wrong qgroup numbers | |
1599 | * In this simplified commit, we don't really care about other trees | |
1600 | * like chunk and root tree, as they won't affect qgroup. | |
1601 | * And we don't write super to avoid half committed status. | |
1602 | */ | |
9386d8bc | 1603 | ret = commit_cowonly_roots(trans); |
6426c7ad QW |
1604 | if (ret) |
1605 | goto out; | |
889bfa39 | 1606 | switch_commit_roots(trans); |
70458a58 | 1607 | ret = btrfs_write_and_wait_transaction(trans); |
6426c7ad | 1608 | if (ret) |
f7af3934 | 1609 | btrfs_handle_fs_error(fs_info, ret, |
6426c7ad QW |
1610 | "Error while writing out transaction for qgroup"); |
1611 | ||
1612 | out: | |
6426c7ad QW |
1613 | /* |
1614 | * Force parent root to be updated, as we recorded it before so its | |
1615 | * last_trans == cur_transid. | |
1616 | * Or it won't be committed again onto disk after later | |
1617 | * insert_dir_item() | |
1618 | */ | |
1619 | if (!ret) | |
1c442d22 | 1620 | ret = record_root_in_trans(trans, parent, 1); |
6426c7ad QW |
1621 | return ret; |
1622 | } | |
1623 | ||
d352ac68 CM |
1624 | /* |
1625 | * new snapshots need to be created at a very specific time in the | |
aec8030a MX |
1626 | * transaction commit. This does the actual creation. |
1627 | * | |
1628 | * Note: | |
1629 | * If the error which may affect the commitment of the current transaction | |
1630 | * happens, we should return the error number. If the error which just affect | |
1631 | * the creation of the pending snapshots, just return 0. | |
d352ac68 | 1632 | */ |
80b6794d | 1633 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
1634 | struct btrfs_pending_snapshot *pending) |
1635 | { | |
08d50ca3 NB |
1636 | |
1637 | struct btrfs_fs_info *fs_info = trans->fs_info; | |
3063d29f | 1638 | struct btrfs_key key; |
80b6794d | 1639 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
1640 | struct btrfs_root *tree_root = fs_info->tree_root; |
1641 | struct btrfs_root *root = pending->root; | |
6bdb72de | 1642 | struct btrfs_root *parent_root; |
98c9942a | 1643 | struct btrfs_block_rsv *rsv; |
ab3c5c18 | 1644 | struct inode *parent_inode = pending->dir; |
42874b3d MX |
1645 | struct btrfs_path *path; |
1646 | struct btrfs_dir_item *dir_item; | |
3063d29f | 1647 | struct extent_buffer *tmp; |
925baedd | 1648 | struct extent_buffer *old; |
95582b00 | 1649 | struct timespec64 cur_time; |
aec8030a | 1650 | int ret = 0; |
d68fc57b | 1651 | u64 to_reserve = 0; |
6bdb72de | 1652 | u64 index = 0; |
a22285a6 | 1653 | u64 objectid; |
b83cc969 | 1654 | u64 root_flags; |
ab3c5c18 STD |
1655 | unsigned int nofs_flags; |
1656 | struct fscrypt_name fname; | |
3063d29f | 1657 | |
8546b570 DS |
1658 | ASSERT(pending->path); |
1659 | path = pending->path; | |
42874b3d | 1660 | |
b0c0ea63 DS |
1661 | ASSERT(pending->root_item); |
1662 | new_root_item = pending->root_item; | |
a22285a6 | 1663 | |
ab3c5c18 STD |
1664 | /* |
1665 | * We're inside a transaction and must make sure that any potential | |
1666 | * allocations with GFP_KERNEL in fscrypt won't recurse back to | |
1667 | * filesystem. | |
1668 | */ | |
1669 | nofs_flags = memalloc_nofs_save(); | |
1670 | pending->error = fscrypt_setup_filename(parent_inode, | |
1671 | &pending->dentry->d_name, 0, | |
1672 | &fname); | |
1673 | memalloc_nofs_restore(nofs_flags); | |
1674 | if (pending->error) | |
1675 | goto free_pending; | |
ab3c5c18 | 1676 | |
543068a2 | 1677 | pending->error = btrfs_get_free_objectid(tree_root, &objectid); |
aec8030a | 1678 | if (pending->error) |
ab3c5c18 | 1679 | goto free_fname; |
3063d29f | 1680 | |
d6726335 QW |
1681 | /* |
1682 | * Make qgroup to skip current new snapshot's qgroupid, as it is | |
1683 | * accounted by later btrfs_qgroup_inherit(). | |
1684 | */ | |
1685 | btrfs_set_skip_qgroup(trans, objectid); | |
1686 | ||
147d256e | 1687 | btrfs_reloc_pre_snapshot(pending, &to_reserve); |
d68fc57b YZ |
1688 | |
1689 | if (to_reserve > 0) { | |
9270501c | 1690 | pending->error = btrfs_block_rsv_add(fs_info, |
aec8030a MX |
1691 | &pending->block_rsv, |
1692 | to_reserve, | |
1693 | BTRFS_RESERVE_NO_FLUSH); | |
1694 | if (pending->error) | |
d6726335 | 1695 | goto clear_skip_qgroup; |
d68fc57b YZ |
1696 | } |
1697 | ||
3063d29f | 1698 | key.objectid = objectid; |
a22285a6 YZ |
1699 | key.offset = (u64)-1; |
1700 | key.type = BTRFS_ROOT_ITEM_KEY; | |
3063d29f | 1701 | |
6fa9700e | 1702 | rsv = trans->block_rsv; |
a22285a6 | 1703 | trans->block_rsv = &pending->block_rsv; |
2382c5cc | 1704 | trans->bytes_reserved = trans->block_rsv->reserved; |
0b246afa | 1705 | trace_btrfs_space_reservation(fs_info, "transaction", |
88d3a5aa JB |
1706 | trans->transid, |
1707 | trans->bytes_reserved, 1); | |
a22285a6 | 1708 | parent_root = BTRFS_I(parent_inode)->root; |
f0118cb6 JB |
1709 | ret = record_root_in_trans(trans, parent_root, 0); |
1710 | if (ret) | |
1711 | goto fail; | |
c2050a45 | 1712 | cur_time = current_time(parent_inode); |
04b285f3 | 1713 | |
3063d29f CM |
1714 | /* |
1715 | * insert the directory item | |
1716 | */ | |
877574e2 | 1717 | ret = btrfs_set_inode_index(BTRFS_I(parent_inode), &index); |
df9f2782 FM |
1718 | if (ret) { |
1719 | btrfs_abort_transaction(trans, ret); | |
1720 | goto fail; | |
1721 | } | |
42874b3d MX |
1722 | |
1723 | /* check if there is a file/dir which has the same name. */ | |
1724 | dir_item = btrfs_lookup_dir_item(NULL, parent_root, path, | |
4a0cc7ca | 1725 | btrfs_ino(BTRFS_I(parent_inode)), |
6db75318 | 1726 | &fname.disk_name, 0); |
42874b3d | 1727 | if (dir_item != NULL && !IS_ERR(dir_item)) { |
fe66a05a | 1728 | pending->error = -EEXIST; |
aec8030a | 1729 | goto dir_item_existed; |
42874b3d MX |
1730 | } else if (IS_ERR(dir_item)) { |
1731 | ret = PTR_ERR(dir_item); | |
66642832 | 1732 | btrfs_abort_transaction(trans, ret); |
8732d44f | 1733 | goto fail; |
79787eaa | 1734 | } |
42874b3d | 1735 | btrfs_release_path(path); |
52c26179 | 1736 | |
6ed05643 | 1737 | ret = btrfs_create_qgroup(trans, objectid); |
8049ba5d | 1738 | if (ret && ret != -EEXIST) { |
6ed05643 BB |
1739 | btrfs_abort_transaction(trans, ret); |
1740 | goto fail; | |
1741 | } | |
1742 | ||
e999376f CM |
1743 | /* |
1744 | * pull in the delayed directory update | |
1745 | * and the delayed inode item | |
1746 | * otherwise we corrupt the FS during | |
1747 | * snapshot | |
1748 | */ | |
e5c304e6 | 1749 | ret = btrfs_run_delayed_items(trans); |
8732d44f | 1750 | if (ret) { /* Transaction aborted */ |
66642832 | 1751 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1752 | goto fail; |
1753 | } | |
e999376f | 1754 | |
f0118cb6 JB |
1755 | ret = record_root_in_trans(trans, root, 0); |
1756 | if (ret) { | |
1757 | btrfs_abort_transaction(trans, ret); | |
1758 | goto fail; | |
1759 | } | |
6bdb72de SW |
1760 | btrfs_set_root_last_snapshot(&root->root_item, trans->transid); |
1761 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); | |
08fe4db1 | 1762 | btrfs_check_and_init_root_item(new_root_item); |
6bdb72de | 1763 | |
b83cc969 LZ |
1764 | root_flags = btrfs_root_flags(new_root_item); |
1765 | if (pending->readonly) | |
1766 | root_flags |= BTRFS_ROOT_SUBVOL_RDONLY; | |
1767 | else | |
1768 | root_flags &= ~BTRFS_ROOT_SUBVOL_RDONLY; | |
1769 | btrfs_set_root_flags(new_root_item, root_flags); | |
1770 | ||
8ea05e3a AB |
1771 | btrfs_set_root_generation_v2(new_root_item, |
1772 | trans->transid); | |
807fc790 | 1773 | generate_random_guid(new_root_item->uuid); |
8ea05e3a AB |
1774 | memcpy(new_root_item->parent_uuid, root->root_item.uuid, |
1775 | BTRFS_UUID_SIZE); | |
70023da2 SB |
1776 | if (!(root_flags & BTRFS_ROOT_SUBVOL_RDONLY)) { |
1777 | memset(new_root_item->received_uuid, 0, | |
1778 | sizeof(new_root_item->received_uuid)); | |
1779 | memset(&new_root_item->stime, 0, sizeof(new_root_item->stime)); | |
1780 | memset(&new_root_item->rtime, 0, sizeof(new_root_item->rtime)); | |
1781 | btrfs_set_root_stransid(new_root_item, 0); | |
1782 | btrfs_set_root_rtransid(new_root_item, 0); | |
1783 | } | |
3cae210f QW |
1784 | btrfs_set_stack_timespec_sec(&new_root_item->otime, cur_time.tv_sec); |
1785 | btrfs_set_stack_timespec_nsec(&new_root_item->otime, cur_time.tv_nsec); | |
8ea05e3a | 1786 | btrfs_set_root_otransid(new_root_item, trans->transid); |
8ea05e3a | 1787 | |
6bdb72de | 1788 | old = btrfs_lock_root_node(root); |
9631e4cc JB |
1789 | ret = btrfs_cow_block(trans, root, old, NULL, 0, &old, |
1790 | BTRFS_NESTING_COW); | |
79787eaa JM |
1791 | if (ret) { |
1792 | btrfs_tree_unlock(old); | |
1793 | free_extent_buffer(old); | |
66642832 | 1794 | btrfs_abort_transaction(trans, ret); |
8732d44f | 1795 | goto fail; |
79787eaa | 1796 | } |
49b25e05 | 1797 | |
49b25e05 | 1798 | ret = btrfs_copy_root(trans, root, old, &tmp, objectid); |
79787eaa | 1799 | /* clean up in any case */ |
6bdb72de SW |
1800 | btrfs_tree_unlock(old); |
1801 | free_extent_buffer(old); | |
8732d44f | 1802 | if (ret) { |
66642832 | 1803 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1804 | goto fail; |
1805 | } | |
f1ebcc74 | 1806 | /* see comments in should_cow_block() */ |
27cdeb70 | 1807 | set_bit(BTRFS_ROOT_FORCE_COW, &root->state); |
f1ebcc74 LB |
1808 | smp_wmb(); |
1809 | ||
6bdb72de | 1810 | btrfs_set_root_node(new_root_item, tmp); |
a22285a6 YZ |
1811 | /* record when the snapshot was created in key.offset */ |
1812 | key.offset = trans->transid; | |
1813 | ret = btrfs_insert_root(trans, tree_root, &key, new_root_item); | |
6bdb72de SW |
1814 | btrfs_tree_unlock(tmp); |
1815 | free_extent_buffer(tmp); | |
8732d44f | 1816 | if (ret) { |
66642832 | 1817 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1818 | goto fail; |
1819 | } | |
6bdb72de | 1820 | |
a22285a6 YZ |
1821 | /* |
1822 | * insert root back/forward references | |
1823 | */ | |
6025c19f | 1824 | ret = btrfs_add_root_ref(trans, objectid, |
e094f480 | 1825 | btrfs_root_id(parent_root), |
4a0cc7ca | 1826 | btrfs_ino(BTRFS_I(parent_inode)), index, |
6db75318 | 1827 | &fname.disk_name); |
8732d44f | 1828 | if (ret) { |
66642832 | 1829 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1830 | goto fail; |
1831 | } | |
0660b5af | 1832 | |
a22285a6 | 1833 | key.offset = (u64)-1; |
e2b54eaf | 1834 | pending->snap = btrfs_get_new_fs_root(fs_info, objectid, &pending->anon_dev); |
79787eaa JM |
1835 | if (IS_ERR(pending->snap)) { |
1836 | ret = PTR_ERR(pending->snap); | |
2d892ccd | 1837 | pending->snap = NULL; |
66642832 | 1838 | btrfs_abort_transaction(trans, ret); |
8732d44f | 1839 | goto fail; |
79787eaa | 1840 | } |
d68fc57b | 1841 | |
49b25e05 | 1842 | ret = btrfs_reloc_post_snapshot(trans, pending); |
8732d44f | 1843 | if (ret) { |
66642832 | 1844 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1845 | goto fail; |
1846 | } | |
361048f5 | 1847 | |
6426c7ad QW |
1848 | /* |
1849 | * Do special qgroup accounting for snapshot, as we do some qgroup | |
1850 | * snapshot hack to do fast snapshot. | |
1851 | * To co-operate with that hack, we do hack again. | |
1852 | * Or snapshot will be greatly slowed down by a subtree qgroup rescan | |
1853 | */ | |
5343cd93 BB |
1854 | if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_FULL) |
1855 | ret = qgroup_account_snapshot(trans, root, parent_root, | |
1856 | pending->inherit, objectid); | |
1857 | else if (btrfs_qgroup_mode(fs_info) == BTRFS_QGROUP_MODE_SIMPLE) | |
e094f480 JB |
1858 | ret = btrfs_qgroup_inherit(trans, btrfs_root_id(root), objectid, |
1859 | btrfs_root_id(parent_root), pending->inherit); | |
6426c7ad QW |
1860 | if (ret < 0) |
1861 | goto fail; | |
1862 | ||
6db75318 STD |
1863 | ret = btrfs_insert_dir_item(trans, &fname.disk_name, |
1864 | BTRFS_I(parent_inode), &key, BTRFS_FT_DIR, | |
1865 | index); | |
8732d44f | 1866 | if (ret) { |
66642832 | 1867 | btrfs_abort_transaction(trans, ret); |
8732d44f MX |
1868 | goto fail; |
1869 | } | |
42874b3d | 1870 | |
6ef06d27 | 1871 | btrfs_i_size_write(BTRFS_I(parent_inode), parent_inode->i_size + |
6db75318 | 1872 | fname.disk_name.len * 2); |
b1c38a13 JL |
1873 | inode_set_mtime_to_ts(parent_inode, |
1874 | inode_set_ctime_current(parent_inode)); | |
0a5d0dc5 | 1875 | ret = btrfs_update_inode_fallback(trans, BTRFS_I(parent_inode)); |
dd5f9615 | 1876 | if (ret) { |
66642832 | 1877 | btrfs_abort_transaction(trans, ret); |
dd5f9615 SB |
1878 | goto fail; |
1879 | } | |
807fc790 AS |
1880 | ret = btrfs_uuid_tree_add(trans, new_root_item->uuid, |
1881 | BTRFS_UUID_KEY_SUBVOL, | |
cdb345a8 | 1882 | objectid); |
dd5f9615 | 1883 | if (ret) { |
66642832 | 1884 | btrfs_abort_transaction(trans, ret); |
dd5f9615 SB |
1885 | goto fail; |
1886 | } | |
1887 | if (!btrfs_is_empty_uuid(new_root_item->received_uuid)) { | |
cdb345a8 | 1888 | ret = btrfs_uuid_tree_add(trans, new_root_item->received_uuid, |
dd5f9615 SB |
1889 | BTRFS_UUID_KEY_RECEIVED_SUBVOL, |
1890 | objectid); | |
1891 | if (ret && ret != -EEXIST) { | |
66642832 | 1892 | btrfs_abort_transaction(trans, ret); |
dd5f9615 SB |
1893 | goto fail; |
1894 | } | |
1895 | } | |
d6726335 | 1896 | |
3063d29f | 1897 | fail: |
aec8030a MX |
1898 | pending->error = ret; |
1899 | dir_item_existed: | |
98c9942a | 1900 | trans->block_rsv = rsv; |
2382c5cc | 1901 | trans->bytes_reserved = 0; |
d6726335 QW |
1902 | clear_skip_qgroup: |
1903 | btrfs_clear_skip_qgroup(trans); | |
ab3c5c18 STD |
1904 | free_fname: |
1905 | fscrypt_free_filename(&fname); | |
1906 | free_pending: | |
6fa9700e | 1907 | kfree(new_root_item); |
b0c0ea63 | 1908 | pending->root_item = NULL; |
42874b3d | 1909 | btrfs_free_path(path); |
8546b570 DS |
1910 | pending->path = NULL; |
1911 | ||
49b25e05 | 1912 | return ret; |
3063d29f CM |
1913 | } |
1914 | ||
d352ac68 CM |
1915 | /* |
1916 | * create all the snapshots we've scheduled for creation | |
1917 | */ | |
08d50ca3 | 1918 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans) |
3de4586c | 1919 | { |
aec8030a | 1920 | struct btrfs_pending_snapshot *pending, *next; |
3de4586c | 1921 | struct list_head *head = &trans->transaction->pending_snapshots; |
aec8030a | 1922 | int ret = 0; |
3de4586c | 1923 | |
aec8030a MX |
1924 | list_for_each_entry_safe(pending, next, head, list) { |
1925 | list_del(&pending->list); | |
08d50ca3 | 1926 | ret = create_pending_snapshot(trans, pending); |
aec8030a MX |
1927 | if (ret) |
1928 | break; | |
1929 | } | |
1930 | return ret; | |
3de4586c CM |
1931 | } |
1932 | ||
2ff7e61e | 1933 | static void update_super_roots(struct btrfs_fs_info *fs_info) |
5d4f98a2 YZ |
1934 | { |
1935 | struct btrfs_root_item *root_item; | |
1936 | struct btrfs_super_block *super; | |
1937 | ||
0b246afa | 1938 | super = fs_info->super_copy; |
5d4f98a2 | 1939 | |
0b246afa | 1940 | root_item = &fs_info->chunk_root->root_item; |
093e037c DS |
1941 | super->chunk_root = root_item->bytenr; |
1942 | super->chunk_root_generation = root_item->generation; | |
1943 | super->chunk_root_level = root_item->level; | |
5d4f98a2 | 1944 | |
0b246afa | 1945 | root_item = &fs_info->tree_root->root_item; |
093e037c DS |
1946 | super->root = root_item->bytenr; |
1947 | super->generation = root_item->generation; | |
1948 | super->root_level = root_item->level; | |
0b246afa | 1949 | if (btrfs_test_opt(fs_info, SPACE_CACHE)) |
093e037c | 1950 | super->cache_generation = root_item->generation; |
94846229 BB |
1951 | else if (test_bit(BTRFS_FS_CLEANUP_SPACE_CACHE_V1, &fs_info->flags)) |
1952 | super->cache_generation = 0; | |
0b246afa | 1953 | if (test_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags)) |
093e037c | 1954 | super->uuid_tree_generation = root_item->generation; |
5d4f98a2 YZ |
1955 | } |
1956 | ||
8929ecfa YZ |
1957 | int btrfs_transaction_blocked(struct btrfs_fs_info *info) |
1958 | { | |
4a9d8bde | 1959 | struct btrfs_transaction *trans; |
8929ecfa | 1960 | int ret = 0; |
4a9d8bde | 1961 | |
a4abeea4 | 1962 | spin_lock(&info->trans_lock); |
4a9d8bde MX |
1963 | trans = info->running_transaction; |
1964 | if (trans) | |
1965 | ret = is_transaction_blocked(trans); | |
a4abeea4 | 1966 | spin_unlock(&info->trans_lock); |
8929ecfa YZ |
1967 | return ret; |
1968 | } | |
1969 | ||
fdfbf020 | 1970 | void btrfs_commit_transaction_async(struct btrfs_trans_handle *trans) |
bb9c12c9 | 1971 | { |
3a45bb20 | 1972 | struct btrfs_fs_info *fs_info = trans->fs_info; |
bb9c12c9 SW |
1973 | struct btrfs_transaction *cur_trans; |
1974 | ||
fdfbf020 JB |
1975 | /* Kick the transaction kthread. */ |
1976 | set_bit(BTRFS_FS_COMMIT_TRANS, &fs_info->flags); | |
1977 | wake_up_process(fs_info->transaction_kthread); | |
bb9c12c9 SW |
1978 | |
1979 | /* take transaction reference */ | |
bb9c12c9 | 1980 | cur_trans = trans->transaction; |
9b64f57d | 1981 | refcount_inc(&cur_trans->use_count); |
bb9c12c9 | 1982 | |
3a45bb20 | 1983 | btrfs_end_transaction(trans); |
6fc4e354 | 1984 | |
ae5d29d4 DS |
1985 | /* |
1986 | * Wait for the current transaction commit to start and block | |
1987 | * subsequent transaction joins | |
1988 | */ | |
77d20c68 | 1989 | btrfs_might_wait_for_state(fs_info, BTRFS_LOCKDEP_TRANS_COMMIT_PREP); |
ae5d29d4 DS |
1990 | wait_event(fs_info->transaction_blocked_wait, |
1991 | cur_trans->state >= TRANS_STATE_COMMIT_START || | |
1992 | TRANS_ABORTED(cur_trans)); | |
724e2315 | 1993 | btrfs_put_transaction(cur_trans); |
bb9c12c9 SW |
1994 | } |
1995 | ||
97cb39bb | 1996 | static void cleanup_transaction(struct btrfs_trans_handle *trans, int err) |
49b25e05 | 1997 | { |
97cb39bb | 1998 | struct btrfs_fs_info *fs_info = trans->fs_info; |
49b25e05 JM |
1999 | struct btrfs_transaction *cur_trans = trans->transaction; |
2000 | ||
b50fff81 | 2001 | WARN_ON(refcount_read(&trans->use_count) > 1); |
49b25e05 | 2002 | |
66642832 | 2003 | btrfs_abort_transaction(trans, err); |
7b8b92af | 2004 | |
0b246afa | 2005 | spin_lock(&fs_info->trans_lock); |
66b6135b | 2006 | |
25d8c284 MX |
2007 | /* |
2008 | * If the transaction is removed from the list, it means this | |
2009 | * transaction has been committed successfully, so it is impossible | |
2010 | * to call the cleanup function. | |
2011 | */ | |
2012 | BUG_ON(list_empty(&cur_trans->list)); | |
66b6135b | 2013 | |
0b246afa | 2014 | if (cur_trans == fs_info->running_transaction) { |
4a9d8bde | 2015 | cur_trans->state = TRANS_STATE_COMMIT_DOING; |
0b246afa | 2016 | spin_unlock(&fs_info->trans_lock); |
e1489b4f IA |
2017 | |
2018 | /* | |
2019 | * The thread has already released the lockdep map as reader | |
2020 | * already in btrfs_commit_transaction(). | |
2021 | */ | |
2022 | btrfs_might_wait_for_event(fs_info, btrfs_trans_num_writers); | |
f094ac32 LB |
2023 | wait_event(cur_trans->writer_wait, |
2024 | atomic_read(&cur_trans->num_writers) == 1); | |
2025 | ||
0b246afa | 2026 | spin_lock(&fs_info->trans_lock); |
d7096fc3 | 2027 | } |
061dde82 FM |
2028 | |
2029 | /* | |
2030 | * Now that we know no one else is still using the transaction we can | |
2031 | * remove the transaction from the list of transactions. This avoids | |
2032 | * the transaction kthread from cleaning up the transaction while some | |
2033 | * other task is still using it, which could result in a use-after-free | |
2034 | * on things like log trees, as it forces the transaction kthread to | |
2035 | * wait for this transaction to be cleaned up by us. | |
2036 | */ | |
2037 | list_del_init(&cur_trans->list); | |
2038 | ||
0b246afa | 2039 | spin_unlock(&fs_info->trans_lock); |
49b25e05 | 2040 | |
2ff7e61e | 2041 | btrfs_cleanup_one_transaction(trans->transaction, fs_info); |
49b25e05 | 2042 | |
0b246afa JM |
2043 | spin_lock(&fs_info->trans_lock); |
2044 | if (cur_trans == fs_info->running_transaction) | |
2045 | fs_info->running_transaction = NULL; | |
2046 | spin_unlock(&fs_info->trans_lock); | |
4a9d8bde | 2047 | |
e0228285 | 2048 | if (trans->type & __TRANS_FREEZABLE) |
0b246afa | 2049 | sb_end_intwrite(fs_info->sb); |
724e2315 JB |
2050 | btrfs_put_transaction(cur_trans); |
2051 | btrfs_put_transaction(cur_trans); | |
49b25e05 | 2052 | |
2e4e97ab | 2053 | trace_btrfs_transaction_commit(fs_info); |
49b25e05 | 2054 | |
49b25e05 JM |
2055 | if (current->journal_info == trans) |
2056 | current->journal_info = NULL; | |
2d82a40a FM |
2057 | |
2058 | /* | |
2059 | * If relocation is running, we can't cancel scrub because that will | |
2060 | * result in a deadlock. Before relocating a block group, relocation | |
2061 | * pauses scrub, then starts and commits a transaction before unpausing | |
2062 | * scrub. If the transaction commit is being done by the relocation | |
2063 | * task or triggered by another task and the relocation task is waiting | |
2064 | * for the commit, and we end up here due to an error in the commit | |
2065 | * path, then calling btrfs_scrub_cancel() will deadlock, as we are | |
2066 | * asking for scrub to stop while having it asked to be paused higher | |
2067 | * above in relocation code. | |
2068 | */ | |
2069 | if (!test_bit(BTRFS_FS_RELOC_RUNNING, &fs_info->flags)) | |
2070 | btrfs_scrub_cancel(fs_info); | |
49b25e05 JM |
2071 | |
2072 | kmem_cache_free(btrfs_trans_handle_cachep, trans); | |
2073 | } | |
2074 | ||
c7cc64a9 DS |
2075 | /* |
2076 | * Release reserved delayed ref space of all pending block groups of the | |
2077 | * transaction and remove them from the list | |
2078 | */ | |
2079 | static void btrfs_cleanup_pending_block_groups(struct btrfs_trans_handle *trans) | |
2080 | { | |
2081 | struct btrfs_fs_info *fs_info = trans->fs_info; | |
32da5386 | 2082 | struct btrfs_block_group *block_group, *tmp; |
c7cc64a9 DS |
2083 | |
2084 | list_for_each_entry_safe(block_group, tmp, &trans->new_bgs, bg_list) { | |
9ef17228 | 2085 | btrfs_dec_delayed_refs_rsv_bg_inserts(fs_info); |
c7cc64a9 DS |
2086 | list_del_init(&block_group->bg_list); |
2087 | } | |
2088 | } | |
2089 | ||
88090ad3 | 2090 | static inline int btrfs_start_delalloc_flush(struct btrfs_fs_info *fs_info) |
82436617 | 2091 | { |
ce8ea7cc | 2092 | /* |
a0f0cf83 | 2093 | * We use try_to_writeback_inodes_sb() here because if we used |
ce8ea7cc JB |
2094 | * btrfs_start_delalloc_roots we would deadlock with fs freeze. |
2095 | * Currently are holding the fs freeze lock, if we do an async flush | |
2096 | * we'll do btrfs_join_transaction() and deadlock because we need to | |
2097 | * wait for the fs freeze lock. Using the direct flushing we benefit | |
2098 | * from already being in a transaction and our join_transaction doesn't | |
2099 | * have to re-take the fs freeze lock. | |
a0f0cf83 FM |
2100 | * |
2101 | * Note that try_to_writeback_inodes_sb() will only trigger writeback | |
2102 | * if it can read lock sb->s_umount. It will always be able to lock it, | |
2103 | * except when the filesystem is being unmounted or being frozen, but in | |
2104 | * those cases sync_filesystem() is called, which results in calling | |
2105 | * writeback_inodes_sb() while holding a write lock on sb->s_umount. | |
2106 | * Note that we don't call writeback_inodes_sb() directly, because it | |
2107 | * will emit a warning if sb->s_umount is not locked. | |
ce8ea7cc | 2108 | */ |
88090ad3 | 2109 | if (btrfs_test_opt(fs_info, FLUSHONCOMMIT)) |
a0f0cf83 | 2110 | try_to_writeback_inodes_sb(fs_info->sb, WB_REASON_SYNC); |
82436617 MX |
2111 | return 0; |
2112 | } | |
2113 | ||
88090ad3 | 2114 | static inline void btrfs_wait_delalloc_flush(struct btrfs_fs_info *fs_info) |
82436617 | 2115 | { |
88090ad3 | 2116 | if (btrfs_test_opt(fs_info, FLUSHONCOMMIT)) |
6374e57a | 2117 | btrfs_wait_ordered_roots(fs_info, U64_MAX, 0, (u64)-1); |
82436617 MX |
2118 | } |
2119 | ||
28b21c55 FM |
2120 | /* |
2121 | * Add a pending snapshot associated with the given transaction handle to the | |
2122 | * respective handle. This must be called after the transaction commit started | |
2123 | * and while holding fs_info->trans_lock. | |
2124 | * This serves to guarantee a caller of btrfs_commit_transaction() that it can | |
2125 | * safely free the pending snapshot pointer in case btrfs_commit_transaction() | |
2126 | * returns an error. | |
2127 | */ | |
2128 | static void add_pending_snapshot(struct btrfs_trans_handle *trans) | |
2129 | { | |
2130 | struct btrfs_transaction *cur_trans = trans->transaction; | |
2131 | ||
2132 | if (!trans->pending_snapshot) | |
2133 | return; | |
2134 | ||
2135 | lockdep_assert_held(&trans->fs_info->trans_lock); | |
77d20c68 | 2136 | ASSERT(cur_trans->state >= TRANS_STATE_COMMIT_PREP); |
28b21c55 FM |
2137 | |
2138 | list_add(&trans->pending_snapshot->list, &cur_trans->pending_snapshots); | |
2139 | } | |
2140 | ||
e55958c8 IA |
2141 | static void update_commit_stats(struct btrfs_fs_info *fs_info, ktime_t interval) |
2142 | { | |
2143 | fs_info->commit_stats.commit_count++; | |
2144 | fs_info->commit_stats.last_commit_dur = interval; | |
2145 | fs_info->commit_stats.max_commit_dur = | |
2146 | max_t(u64, fs_info->commit_stats.max_commit_dur, interval); | |
2147 | fs_info->commit_stats.total_commit_dur += interval; | |
2148 | } | |
2149 | ||
3a45bb20 | 2150 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans) |
79154b1b | 2151 | { |
3a45bb20 | 2152 | struct btrfs_fs_info *fs_info = trans->fs_info; |
49b25e05 | 2153 | struct btrfs_transaction *cur_trans = trans->transaction; |
8fd17795 | 2154 | struct btrfs_transaction *prev_trans = NULL; |
25287e0a | 2155 | int ret; |
e55958c8 IA |
2156 | ktime_t start_time; |
2157 | ktime_t interval; | |
79154b1b | 2158 | |
35b814f3 | 2159 | ASSERT(refcount_read(&trans->use_count) == 1); |
77d20c68 | 2160 | btrfs_trans_state_lockdep_acquire(fs_info, BTRFS_LOCKDEP_TRANS_COMMIT_PREP); |
35b814f3 | 2161 | |
c52cc7b7 JB |
2162 | clear_bit(BTRFS_FS_NEED_TRANS_COMMIT, &fs_info->flags); |
2163 | ||
8d25a086 | 2164 | /* Stop the commit early if ->aborted is set */ |
bf31f87f | 2165 | if (TRANS_ABORTED(cur_trans)) { |
25287e0a | 2166 | ret = cur_trans->aborted; |
3e738c53 | 2167 | goto lockdep_trans_commit_start_release; |
25287e0a | 2168 | } |
49b25e05 | 2169 | |
f45c752b JB |
2170 | btrfs_trans_release_metadata(trans); |
2171 | trans->block_rsv = NULL; | |
2172 | ||
56bec294 | 2173 | /* |
e19eb11f JB |
2174 | * We only want one transaction commit doing the flushing so we do not |
2175 | * waste a bunch of time on lock contention on the extent root node. | |
56bec294 | 2176 | */ |
e19eb11f JB |
2177 | if (!test_and_set_bit(BTRFS_DELAYED_REFS_FLUSHING, |
2178 | &cur_trans->delayed_refs.flags)) { | |
2179 | /* | |
2180 | * Make a pass through all the delayed refs we have so far. | |
2181 | * Any running threads may add more while we are here. | |
2182 | */ | |
2183 | ret = btrfs_run_delayed_refs(trans, 0); | |
3e738c53 IA |
2184 | if (ret) |
2185 | goto lockdep_trans_commit_start_release; | |
e19eb11f | 2186 | } |
56bec294 | 2187 | |
119e80df | 2188 | btrfs_create_pending_block_groups(trans); |
ea658bad | 2189 | |
3204d33c | 2190 | if (!test_bit(BTRFS_TRANS_DIRTY_BG_RUN, &cur_trans->flags)) { |
1bbc621e CM |
2191 | int run_it = 0; |
2192 | ||
2193 | /* this mutex is also taken before trying to set | |
2194 | * block groups readonly. We need to make sure | |
2195 | * that nobody has set a block group readonly | |
2196 | * after a extents from that block group have been | |
2197 | * allocated for cache files. btrfs_set_block_group_ro | |
2198 | * will wait for the transaction to commit if it | |
3204d33c | 2199 | * finds BTRFS_TRANS_DIRTY_BG_RUN set. |
1bbc621e | 2200 | * |
3204d33c JB |
2201 | * The BTRFS_TRANS_DIRTY_BG_RUN flag is also used to make sure |
2202 | * only one process starts all the block group IO. It wouldn't | |
1bbc621e CM |
2203 | * hurt to have more than one go through, but there's no |
2204 | * real advantage to it either. | |
2205 | */ | |
0b246afa | 2206 | mutex_lock(&fs_info->ro_block_group_mutex); |
3204d33c JB |
2207 | if (!test_and_set_bit(BTRFS_TRANS_DIRTY_BG_RUN, |
2208 | &cur_trans->flags)) | |
1bbc621e | 2209 | run_it = 1; |
0b246afa | 2210 | mutex_unlock(&fs_info->ro_block_group_mutex); |
1bbc621e | 2211 | |
f9cacae3 | 2212 | if (run_it) { |
21217054 | 2213 | ret = btrfs_start_dirty_block_groups(trans); |
3e738c53 IA |
2214 | if (ret) |
2215 | goto lockdep_trans_commit_start_release; | |
f9cacae3 | 2216 | } |
1bbc621e CM |
2217 | } |
2218 | ||
0b246afa | 2219 | spin_lock(&fs_info->trans_lock); |
77d20c68 | 2220 | if (cur_trans->state >= TRANS_STATE_COMMIT_PREP) { |
d0c2f4fa FM |
2221 | enum btrfs_trans_state want_state = TRANS_STATE_COMPLETED; |
2222 | ||
28b21c55 FM |
2223 | add_pending_snapshot(trans); |
2224 | ||
0b246afa | 2225 | spin_unlock(&fs_info->trans_lock); |
9b64f57d | 2226 | refcount_inc(&cur_trans->use_count); |
ccd467d6 | 2227 | |
d0c2f4fa FM |
2228 | if (trans->in_fsync) |
2229 | want_state = TRANS_STATE_SUPER_COMMITTED; | |
3e738c53 IA |
2230 | |
2231 | btrfs_trans_state_lockdep_release(fs_info, | |
77d20c68 | 2232 | BTRFS_LOCKDEP_TRANS_COMMIT_PREP); |
d0c2f4fa FM |
2233 | ret = btrfs_end_transaction(trans); |
2234 | wait_for_commit(cur_trans, want_state); | |
15ee9bc7 | 2235 | |
bf31f87f | 2236 | if (TRANS_ABORTED(cur_trans)) |
b4924a0f LB |
2237 | ret = cur_trans->aborted; |
2238 | ||
724e2315 | 2239 | btrfs_put_transaction(cur_trans); |
15ee9bc7 | 2240 | |
49b25e05 | 2241 | return ret; |
79154b1b | 2242 | } |
4313b399 | 2243 | |
77d20c68 | 2244 | cur_trans->state = TRANS_STATE_COMMIT_PREP; |
0b246afa | 2245 | wake_up(&fs_info->transaction_blocked_wait); |
77d20c68 | 2246 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_COMMIT_PREP); |
bb9c12c9 | 2247 | |
0b246afa | 2248 | if (cur_trans->list.prev != &fs_info->trans_list) { |
d0c2f4fa FM |
2249 | enum btrfs_trans_state want_state = TRANS_STATE_COMPLETED; |
2250 | ||
2251 | if (trans->in_fsync) | |
2252 | want_state = TRANS_STATE_SUPER_COMMITTED; | |
2253 | ||
ccd467d6 CM |
2254 | prev_trans = list_entry(cur_trans->list.prev, |
2255 | struct btrfs_transaction, list); | |
d0c2f4fa | 2256 | if (prev_trans->state < want_state) { |
9b64f57d | 2257 | refcount_inc(&prev_trans->use_count); |
0b246afa | 2258 | spin_unlock(&fs_info->trans_lock); |
ccd467d6 | 2259 | |
d0c2f4fa FM |
2260 | wait_for_commit(prev_trans, want_state); |
2261 | ||
bf31f87f | 2262 | ret = READ_ONCE(prev_trans->aborted); |
ccd467d6 | 2263 | |
724e2315 | 2264 | btrfs_put_transaction(prev_trans); |
1f9b8c8f | 2265 | if (ret) |
e1489b4f | 2266 | goto lockdep_release; |
77d20c68 | 2267 | spin_lock(&fs_info->trans_lock); |
ccd467d6 | 2268 | } |
a4abeea4 | 2269 | } else { |
cb2d3dad FM |
2270 | /* |
2271 | * The previous transaction was aborted and was already removed | |
2272 | * from the list of transactions at fs_info->trans_list. So we | |
2273 | * abort to prevent writing a new superblock that reflects a | |
2274 | * corrupt state (pointing to trees with unwritten nodes/leafs). | |
2275 | */ | |
84961539 | 2276 | if (BTRFS_FS_ERROR(fs_info)) { |
77d20c68 | 2277 | spin_unlock(&fs_info->trans_lock); |
cb2d3dad | 2278 | ret = -EROFS; |
e1489b4f | 2279 | goto lockdep_release; |
cb2d3dad | 2280 | } |
ccd467d6 | 2281 | } |
15ee9bc7 | 2282 | |
77d20c68 JB |
2283 | cur_trans->state = TRANS_STATE_COMMIT_START; |
2284 | wake_up(&fs_info->transaction_blocked_wait); | |
2285 | spin_unlock(&fs_info->trans_lock); | |
2286 | ||
e55958c8 IA |
2287 | /* |
2288 | * Get the time spent on the work done by the commit thread and not | |
2289 | * the time spent waiting on a previous commit | |
2290 | */ | |
2291 | start_time = ktime_get_ns(); | |
2292 | ||
0860adfd MX |
2293 | extwriter_counter_dec(cur_trans, trans->type); |
2294 | ||
88090ad3 | 2295 | ret = btrfs_start_delalloc_flush(fs_info); |
82436617 | 2296 | if (ret) |
e1489b4f | 2297 | goto lockdep_release; |
82436617 | 2298 | |
e5c304e6 | 2299 | ret = btrfs_run_delayed_items(trans); |
581227d0 | 2300 | if (ret) |
e1489b4f | 2301 | goto lockdep_release; |
15ee9bc7 | 2302 | |
5a9ba670 IA |
2303 | /* |
2304 | * The thread has started/joined the transaction thus it holds the | |
2305 | * lockdep map as a reader. It has to release it before acquiring the | |
2306 | * lockdep map as a writer. | |
2307 | */ | |
2308 | btrfs_lockdep_release(fs_info, btrfs_trans_num_extwriters); | |
2309 | btrfs_might_wait_for_event(fs_info, btrfs_trans_num_extwriters); | |
581227d0 MX |
2310 | wait_event(cur_trans->writer_wait, |
2311 | extwriter_counter_read(cur_trans) == 0); | |
15ee9bc7 | 2312 | |
581227d0 | 2313 | /* some pending stuffs might be added after the previous flush. */ |
e5c304e6 | 2314 | ret = btrfs_run_delayed_items(trans); |
e1489b4f IA |
2315 | if (ret) { |
2316 | btrfs_lockdep_release(fs_info, btrfs_trans_num_writers); | |
ca469637 | 2317 | goto cleanup_transaction; |
e1489b4f | 2318 | } |
ca469637 | 2319 | |
88090ad3 | 2320 | btrfs_wait_delalloc_flush(fs_info); |
cb7ab021 | 2321 | |
48778179 FM |
2322 | /* |
2323 | * Wait for all ordered extents started by a fast fsync that joined this | |
2324 | * transaction. Otherwise if this transaction commits before the ordered | |
2325 | * extents complete we lose logged data after a power failure. | |
2326 | */ | |
8b53779e | 2327 | btrfs_might_wait_for_event(fs_info, btrfs_trans_pending_ordered); |
48778179 FM |
2328 | wait_event(cur_trans->pending_wait, |
2329 | atomic_read(&cur_trans->pending_ordered) == 0); | |
2330 | ||
2ff7e61e | 2331 | btrfs_scrub_pause(fs_info); |
ed0ca140 JB |
2332 | /* |
2333 | * Ok now we need to make sure to block out any other joins while we | |
2334 | * commit the transaction. We could have started a join before setting | |
4a9d8bde | 2335 | * COMMIT_DOING so make sure to wait for num_writers to == 1 again. |
ed0ca140 | 2336 | */ |
0b246afa | 2337 | spin_lock(&fs_info->trans_lock); |
28b21c55 | 2338 | add_pending_snapshot(trans); |
4a9d8bde | 2339 | cur_trans->state = TRANS_STATE_COMMIT_DOING; |
0b246afa | 2340 | spin_unlock(&fs_info->trans_lock); |
e1489b4f IA |
2341 | |
2342 | /* | |
2343 | * The thread has started/joined the transaction thus it holds the | |
2344 | * lockdep map as a reader. It has to release it before acquiring the | |
2345 | * lockdep map as a writer. | |
2346 | */ | |
2347 | btrfs_lockdep_release(fs_info, btrfs_trans_num_writers); | |
2348 | btrfs_might_wait_for_event(fs_info, btrfs_trans_num_writers); | |
ed0ca140 JB |
2349 | wait_event(cur_trans->writer_wait, |
2350 | atomic_read(&cur_trans->num_writers) == 1); | |
2351 | ||
3e738c53 IA |
2352 | /* |
2353 | * Make lockdep happy by acquiring the state locks after | |
2354 | * btrfs_trans_num_writers is released. If we acquired the state locks | |
2355 | * before releasing the btrfs_trans_num_writers lock then lockdep would | |
2356 | * complain because we did not follow the reverse order unlocking rule. | |
2357 | */ | |
2358 | btrfs_trans_state_lockdep_acquire(fs_info, BTRFS_LOCKDEP_TRANS_COMPLETED); | |
2359 | btrfs_trans_state_lockdep_acquire(fs_info, BTRFS_LOCKDEP_TRANS_SUPER_COMMITTED); | |
2360 | btrfs_trans_state_lockdep_acquire(fs_info, BTRFS_LOCKDEP_TRANS_UNBLOCKED); | |
2361 | ||
fdfbf020 JB |
2362 | /* |
2363 | * We've started the commit, clear the flag in case we were triggered to | |
2364 | * do an async commit but somebody else started before the transaction | |
2365 | * kthread could do the work. | |
2366 | */ | |
2367 | clear_bit(BTRFS_FS_COMMIT_TRANS, &fs_info->flags); | |
2368 | ||
bf31f87f | 2369 | if (TRANS_ABORTED(cur_trans)) { |
2cba30f1 | 2370 | ret = cur_trans->aborted; |
3e738c53 | 2371 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_UNBLOCKED); |
6cf7f77e | 2372 | goto scrub_continue; |
2cba30f1 | 2373 | } |
7585717f CM |
2374 | /* |
2375 | * the reloc mutex makes sure that we stop | |
2376 | * the balancing code from coming in and moving | |
2377 | * extents around in the middle of the commit | |
2378 | */ | |
0b246afa | 2379 | mutex_lock(&fs_info->reloc_mutex); |
7585717f | 2380 | |
42874b3d MX |
2381 | /* |
2382 | * We needn't worry about the delayed items because we will | |
2383 | * deal with them in create_pending_snapshot(), which is the | |
2384 | * core function of the snapshot creation. | |
2385 | */ | |
08d50ca3 | 2386 | ret = create_pending_snapshots(trans); |
56e9f6ea DS |
2387 | if (ret) |
2388 | goto unlock_reloc; | |
3063d29f | 2389 | |
42874b3d MX |
2390 | /* |
2391 | * We insert the dir indexes of the snapshots and update the inode | |
2392 | * of the snapshots' parents after the snapshot creation, so there | |
2393 | * are some delayed items which are not dealt with. Now deal with | |
2394 | * them. | |
2395 | * | |
2396 | * We needn't worry that this operation will corrupt the snapshots, | |
2397 | * because all the tree which are snapshoted will be forced to COW | |
2398 | * the nodes and leaves. | |
2399 | */ | |
e5c304e6 | 2400 | ret = btrfs_run_delayed_items(trans); |
56e9f6ea DS |
2401 | if (ret) |
2402 | goto unlock_reloc; | |
16cdcec7 | 2403 | |
8a526c44 | 2404 | ret = btrfs_run_delayed_refs(trans, U64_MAX); |
56e9f6ea DS |
2405 | if (ret) |
2406 | goto unlock_reloc; | |
56bec294 | 2407 | |
e999376f CM |
2408 | /* |
2409 | * make sure none of the code above managed to slip in a | |
2410 | * delayed item | |
2411 | */ | |
ccdf9b30 | 2412 | btrfs_assert_delayed_root_empty(fs_info); |
e999376f | 2413 | |
2c90e5d6 | 2414 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 2415 | |
7e4443d9 | 2416 | ret = commit_fs_roots(trans); |
56e9f6ea | 2417 | if (ret) |
dfba78dc | 2418 | goto unlock_reloc; |
54aa1f4d | 2419 | |
5d4f98a2 | 2420 | /* commit_fs_roots gets rid of all the tree log roots, it is now |
e02119d5 CM |
2421 | * safe to free the root of tree log roots |
2422 | */ | |
0b246afa | 2423 | btrfs_free_log_root_tree(trans, fs_info); |
e02119d5 | 2424 | |
0ed4792a QW |
2425 | /* |
2426 | * Since fs roots are all committed, we can get a quite accurate | |
2427 | * new_roots. So let's do quota accounting. | |
2428 | */ | |
460fb20a | 2429 | ret = btrfs_qgroup_account_extents(trans); |
56e9f6ea | 2430 | if (ret < 0) |
dfba78dc | 2431 | goto unlock_reloc; |
0ed4792a | 2432 | |
9386d8bc | 2433 | ret = commit_cowonly_roots(trans); |
56e9f6ea | 2434 | if (ret) |
dfba78dc | 2435 | goto unlock_reloc; |
54aa1f4d | 2436 | |
2cba30f1 MX |
2437 | /* |
2438 | * The tasks which save the space cache and inode cache may also | |
2439 | * update ->aborted, check it. | |
2440 | */ | |
bf31f87f | 2441 | if (TRANS_ABORTED(cur_trans)) { |
2cba30f1 | 2442 | ret = cur_trans->aborted; |
dfba78dc | 2443 | goto unlock_reloc; |
2cba30f1 MX |
2444 | } |
2445 | ||
0b246afa | 2446 | cur_trans = fs_info->running_transaction; |
5d4f98a2 | 2447 | |
0b246afa JM |
2448 | btrfs_set_root_node(&fs_info->tree_root->root_item, |
2449 | fs_info->tree_root->node); | |
2450 | list_add_tail(&fs_info->tree_root->dirty_list, | |
9e351cc8 | 2451 | &cur_trans->switch_commits); |
5d4f98a2 | 2452 | |
0b246afa JM |
2453 | btrfs_set_root_node(&fs_info->chunk_root->root_item, |
2454 | fs_info->chunk_root->node); | |
2455 | list_add_tail(&fs_info->chunk_root->dirty_list, | |
9e351cc8 JB |
2456 | &cur_trans->switch_commits); |
2457 | ||
f7238e50 JB |
2458 | if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2)) { |
2459 | btrfs_set_root_node(&fs_info->block_group_root->root_item, | |
2460 | fs_info->block_group_root->node); | |
2461 | list_add_tail(&fs_info->block_group_root->dirty_list, | |
2462 | &cur_trans->switch_commits); | |
2463 | } | |
2464 | ||
889bfa39 | 2465 | switch_commit_roots(trans); |
5d4f98a2 | 2466 | |
ce93ec54 | 2467 | ASSERT(list_empty(&cur_trans->dirty_bgs)); |
1bbc621e | 2468 | ASSERT(list_empty(&cur_trans->io_bgs)); |
2ff7e61e | 2469 | update_super_roots(fs_info); |
e02119d5 | 2470 | |
0b246afa JM |
2471 | btrfs_set_super_log_root(fs_info->super_copy, 0); |
2472 | btrfs_set_super_log_root_level(fs_info->super_copy, 0); | |
2473 | memcpy(fs_info->super_for_commit, fs_info->super_copy, | |
2474 | sizeof(*fs_info->super_copy)); | |
ccd467d6 | 2475 | |
bbbf7243 | 2476 | btrfs_commit_device_sizes(cur_trans); |
935e5cc9 | 2477 | |
0b246afa JM |
2478 | clear_bit(BTRFS_FS_LOG1_ERR, &fs_info->flags); |
2479 | clear_bit(BTRFS_FS_LOG2_ERR, &fs_info->flags); | |
656f30db | 2480 | |
4fbcdf66 FM |
2481 | btrfs_trans_release_chunk_metadata(trans); |
2482 | ||
dfba78dc FM |
2483 | /* |
2484 | * Before changing the transaction state to TRANS_STATE_UNBLOCKED and | |
2485 | * setting fs_info->running_transaction to NULL, lock tree_log_mutex to | |
2486 | * make sure that before we commit our superblock, no other task can | |
2487 | * start a new transaction and commit a log tree before we commit our | |
2488 | * superblock. Anyone trying to commit a log tree locks this mutex before | |
2489 | * writing its superblock. | |
2490 | */ | |
2491 | mutex_lock(&fs_info->tree_log_mutex); | |
2492 | ||
0b246afa | 2493 | spin_lock(&fs_info->trans_lock); |
4a9d8bde | 2494 | cur_trans->state = TRANS_STATE_UNBLOCKED; |
0b246afa JM |
2495 | fs_info->running_transaction = NULL; |
2496 | spin_unlock(&fs_info->trans_lock); | |
2497 | mutex_unlock(&fs_info->reloc_mutex); | |
b7ec40d7 | 2498 | |
0b246afa | 2499 | wake_up(&fs_info->transaction_wait); |
3e738c53 | 2500 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_UNBLOCKED); |
e6dcd2dc | 2501 | |
b7625f46 QW |
2502 | /* If we have features changed, wake up the cleaner to update sysfs. */ |
2503 | if (test_bit(BTRFS_FS_FEATURE_CHANGED, &fs_info->flags) && | |
2504 | fs_info->cleaner_kthread) | |
2505 | wake_up_process(fs_info->cleaner_kthread); | |
2506 | ||
70458a58 | 2507 | ret = btrfs_write_and_wait_transaction(trans); |
49b25e05 | 2508 | if (ret) { |
0b246afa JM |
2509 | btrfs_handle_fs_error(fs_info, ret, |
2510 | "Error while writing out transaction"); | |
2511 | mutex_unlock(&fs_info->tree_log_mutex); | |
6cf7f77e | 2512 | goto scrub_continue; |
49b25e05 JM |
2513 | } |
2514 | ||
eece6a9c | 2515 | ret = write_all_supers(fs_info, 0); |
e02119d5 CM |
2516 | /* |
2517 | * the super is written, we can safely allow the tree-loggers | |
2518 | * to go about their business | |
2519 | */ | |
0b246afa | 2520 | mutex_unlock(&fs_info->tree_log_mutex); |
c1f32b7c AJ |
2521 | if (ret) |
2522 | goto scrub_continue; | |
e02119d5 | 2523 | |
d0c2f4fa FM |
2524 | /* |
2525 | * We needn't acquire the lock here because there is no other task | |
2526 | * which can change it. | |
2527 | */ | |
2528 | cur_trans->state = TRANS_STATE_SUPER_COMMITTED; | |
2529 | wake_up(&cur_trans->commit_wait); | |
3e738c53 | 2530 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_SUPER_COMMITTED); |
d0c2f4fa | 2531 | |
5ead2dd0 | 2532 | btrfs_finish_extent_commit(trans); |
4313b399 | 2533 | |
3204d33c | 2534 | if (test_bit(BTRFS_TRANS_HAVE_FREE_BGS, &cur_trans->flags)) |
0b246afa | 2535 | btrfs_clear_space_info_full(fs_info); |
13212b54 | 2536 | |
0124855f | 2537 | btrfs_set_last_trans_committed(fs_info, cur_trans->transid); |
4a9d8bde MX |
2538 | /* |
2539 | * We needn't acquire the lock here because there is no other task | |
2540 | * which can change it. | |
2541 | */ | |
2542 | cur_trans->state = TRANS_STATE_COMPLETED; | |
2c90e5d6 | 2543 | wake_up(&cur_trans->commit_wait); |
3e738c53 | 2544 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_COMPLETED); |
3de4586c | 2545 | |
0b246afa | 2546 | spin_lock(&fs_info->trans_lock); |
13c5a93e | 2547 | list_del_init(&cur_trans->list); |
0b246afa | 2548 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 2549 | |
724e2315 JB |
2550 | btrfs_put_transaction(cur_trans); |
2551 | btrfs_put_transaction(cur_trans); | |
58176a96 | 2552 | |
0860adfd | 2553 | if (trans->type & __TRANS_FREEZABLE) |
0b246afa | 2554 | sb_end_intwrite(fs_info->sb); |
b2b5ef5c | 2555 | |
2e4e97ab | 2556 | trace_btrfs_transaction_commit(fs_info); |
1abe9b8a | 2557 | |
e55958c8 IA |
2558 | interval = ktime_get_ns() - start_time; |
2559 | ||
2ff7e61e | 2560 | btrfs_scrub_continue(fs_info); |
a2de733c | 2561 | |
9ed74f2d JB |
2562 | if (current->journal_info == trans) |
2563 | current->journal_info = NULL; | |
2564 | ||
2c90e5d6 | 2565 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
24bbcf04 | 2566 | |
e55958c8 IA |
2567 | update_commit_stats(fs_info, interval); |
2568 | ||
79154b1b | 2569 | return ret; |
49b25e05 | 2570 | |
56e9f6ea DS |
2571 | unlock_reloc: |
2572 | mutex_unlock(&fs_info->reloc_mutex); | |
3e738c53 | 2573 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_UNBLOCKED); |
6cf7f77e | 2574 | scrub_continue: |
3e738c53 IA |
2575 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_SUPER_COMMITTED); |
2576 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_COMPLETED); | |
2ff7e61e | 2577 | btrfs_scrub_continue(fs_info); |
49b25e05 | 2578 | cleanup_transaction: |
dc60c525 | 2579 | btrfs_trans_release_metadata(trans); |
c7cc64a9 | 2580 | btrfs_cleanup_pending_block_groups(trans); |
4fbcdf66 | 2581 | btrfs_trans_release_chunk_metadata(trans); |
0e721106 | 2582 | trans->block_rsv = NULL; |
0b246afa | 2583 | btrfs_warn(fs_info, "Skipping commit of aborted transaction."); |
49b25e05 JM |
2584 | if (current->journal_info == trans) |
2585 | current->journal_info = NULL; | |
97cb39bb | 2586 | cleanup_transaction(trans, ret); |
49b25e05 JM |
2587 | |
2588 | return ret; | |
e1489b4f IA |
2589 | |
2590 | lockdep_release: | |
5a9ba670 | 2591 | btrfs_lockdep_release(fs_info, btrfs_trans_num_extwriters); |
e1489b4f IA |
2592 | btrfs_lockdep_release(fs_info, btrfs_trans_num_writers); |
2593 | goto cleanup_transaction; | |
3e738c53 IA |
2594 | |
2595 | lockdep_trans_commit_start_release: | |
77d20c68 | 2596 | btrfs_trans_state_lockdep_release(fs_info, BTRFS_LOCKDEP_TRANS_COMMIT_PREP); |
3e738c53 IA |
2597 | btrfs_end_transaction(trans); |
2598 | return ret; | |
79154b1b CM |
2599 | } |
2600 | ||
d352ac68 | 2601 | /* |
9d1a2a3a DS |
2602 | * return < 0 if error |
2603 | * 0 if there are no more dead_roots at the time of call | |
2604 | * 1 there are more to be processed, call me again | |
2605 | * | |
2606 | * The return value indicates there are certainly more snapshots to delete, but | |
2607 | * if there comes a new one during processing, it may return 0. We don't mind, | |
2608 | * because btrfs_commit_super will poke cleaner thread and it will process it a | |
2609 | * few seconds later. | |
d352ac68 | 2610 | */ |
33c44184 | 2611 | int btrfs_clean_one_deleted_snapshot(struct btrfs_fs_info *fs_info) |
e9d0b13b | 2612 | { |
33c44184 | 2613 | struct btrfs_root *root; |
9d1a2a3a | 2614 | int ret; |
5d4f98a2 | 2615 | |
a4abeea4 | 2616 | spin_lock(&fs_info->trans_lock); |
9d1a2a3a DS |
2617 | if (list_empty(&fs_info->dead_roots)) { |
2618 | spin_unlock(&fs_info->trans_lock); | |
2619 | return 0; | |
2620 | } | |
2621 | root = list_first_entry(&fs_info->dead_roots, | |
2622 | struct btrfs_root, root_list); | |
cfad392b | 2623 | list_del_init(&root->root_list); |
a4abeea4 | 2624 | spin_unlock(&fs_info->trans_lock); |
e9d0b13b | 2625 | |
e094f480 | 2626 | btrfs_debug(fs_info, "cleaner removing %llu", btrfs_root_id(root)); |
76dda93c | 2627 | |
9d1a2a3a | 2628 | btrfs_kill_all_delayed_nodes(root); |
16cdcec7 | 2629 | |
9d1a2a3a DS |
2630 | if (btrfs_header_backref_rev(root->node) < |
2631 | BTRFS_MIXED_BACKREF_REV) | |
0078a9f9 | 2632 | ret = btrfs_drop_snapshot(root, 0, 0); |
9d1a2a3a | 2633 | else |
0078a9f9 | 2634 | ret = btrfs_drop_snapshot(root, 1, 0); |
32471dc2 | 2635 | |
dc9492c1 | 2636 | btrfs_put_root(root); |
6596a928 | 2637 | return (ret < 0) ? 0 : 1; |
e9d0b13b | 2638 | } |
572d9ab7 | 2639 | |
fccf0c84 JB |
2640 | /* |
2641 | * We only mark the transaction aborted and then set the file system read-only. | |
2642 | * This will prevent new transactions from starting or trying to join this | |
2643 | * one. | |
2644 | * | |
2645 | * This means that error recovery at the call site is limited to freeing | |
2646 | * any local memory allocations and passing the error code up without | |
2647 | * further cleanup. The transaction should complete as it normally would | |
2648 | * in the call path but will return -EIO. | |
2649 | * | |
2650 | * We'll complete the cleanup in btrfs_end_transaction and | |
2651 | * btrfs_commit_transaction. | |
2652 | */ | |
2653 | void __cold __btrfs_abort_transaction(struct btrfs_trans_handle *trans, | |
2654 | const char *function, | |
ed164802 | 2655 | unsigned int line, int error, bool first_hit) |
fccf0c84 JB |
2656 | { |
2657 | struct btrfs_fs_info *fs_info = trans->fs_info; | |
2658 | ||
ed164802 DS |
2659 | WRITE_ONCE(trans->aborted, error); |
2660 | WRITE_ONCE(trans->transaction->aborted, error); | |
2661 | if (first_hit && error == -ENOSPC) | |
fccf0c84 JB |
2662 | btrfs_dump_space_info_for_trans_abort(fs_info); |
2663 | /* Wake up anybody who may be waiting on this transaction */ | |
2664 | wake_up(&fs_info->transaction_wait); | |
2665 | wake_up(&fs_info->transaction_blocked_wait); | |
ed164802 | 2666 | __btrfs_handle_fs_error(fs_info, function, line, error, NULL); |
fccf0c84 JB |
2667 | } |
2668 | ||
956504a3 JB |
2669 | int __init btrfs_transaction_init(void) |
2670 | { | |
ef5a05c5 | 2671 | btrfs_trans_handle_cachep = KMEM_CACHE(btrfs_trans_handle, SLAB_TEMPORARY); |
956504a3 JB |
2672 | if (!btrfs_trans_handle_cachep) |
2673 | return -ENOMEM; | |
2674 | return 0; | |
2675 | } | |
2676 | ||
2677 | void __cold btrfs_transaction_exit(void) | |
2678 | { | |
2679 | kmem_cache_destroy(btrfs_trans_handle_cachep); | |
2680 | } |