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