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" |
79154b1b | 33 | |
0f7d52f4 CM |
34 | #define BTRFS_ROOT_TRANS_TAG 0 |
35 | ||
49b25e05 | 36 | void put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 37 | { |
13c5a93e JB |
38 | WARN_ON(atomic_read(&transaction->use_count) == 0); |
39 | if (atomic_dec_and_test(&transaction->use_count)) { | |
a4abeea4 | 40 | BUG_ON(!list_empty(&transaction->list)); |
00f04b88 | 41 | WARN_ON(transaction->delayed_refs.root.rb_node); |
2c90e5d6 CM |
42 | memset(transaction, 0, sizeof(*transaction)); |
43 | kmem_cache_free(btrfs_transaction_cachep, transaction); | |
78fae27e | 44 | } |
79154b1b CM |
45 | } |
46 | ||
817d52f8 JB |
47 | static noinline void switch_commit_root(struct btrfs_root *root) |
48 | { | |
817d52f8 JB |
49 | free_extent_buffer(root->commit_root); |
50 | root->commit_root = btrfs_root_node(root); | |
817d52f8 JB |
51 | } |
52 | ||
d352ac68 CM |
53 | /* |
54 | * either allocate a new transaction or hop into the existing one | |
55 | */ | |
a4abeea4 | 56 | static noinline int join_transaction(struct btrfs_root *root, int nofail) |
79154b1b CM |
57 | { |
58 | struct btrfs_transaction *cur_trans; | |
19ae4e81 | 59 | struct btrfs_fs_info *fs_info = root->fs_info; |
a4abeea4 | 60 | |
19ae4e81 | 61 | spin_lock(&fs_info->trans_lock); |
d43317dc | 62 | loop: |
49b25e05 | 63 | /* The file system has been taken offline. No new transactions. */ |
19ae4e81 JS |
64 | if (fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) { |
65 | spin_unlock(&fs_info->trans_lock); | |
49b25e05 JM |
66 | return -EROFS; |
67 | } | |
68 | ||
19ae4e81 | 69 | if (fs_info->trans_no_join) { |
a4abeea4 | 70 | if (!nofail) { |
19ae4e81 | 71 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 JB |
72 | return -EBUSY; |
73 | } | |
74 | } | |
75 | ||
19ae4e81 | 76 | cur_trans = fs_info->running_transaction; |
a4abeea4 | 77 | if (cur_trans) { |
871383be | 78 | if (cur_trans->aborted) { |
19ae4e81 | 79 | spin_unlock(&fs_info->trans_lock); |
49b25e05 | 80 | return cur_trans->aborted; |
871383be | 81 | } |
a4abeea4 | 82 | atomic_inc(&cur_trans->use_count); |
13c5a93e | 83 | atomic_inc(&cur_trans->num_writers); |
15ee9bc7 | 84 | cur_trans->num_joined++; |
19ae4e81 | 85 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 | 86 | return 0; |
79154b1b | 87 | } |
19ae4e81 | 88 | spin_unlock(&fs_info->trans_lock); |
a4abeea4 JB |
89 | |
90 | cur_trans = kmem_cache_alloc(btrfs_transaction_cachep, GFP_NOFS); | |
91 | if (!cur_trans) | |
92 | return -ENOMEM; | |
d43317dc | 93 | |
19ae4e81 JS |
94 | spin_lock(&fs_info->trans_lock); |
95 | if (fs_info->running_transaction) { | |
d43317dc CM |
96 | /* |
97 | * someone started a transaction after we unlocked. Make sure | |
98 | * to redo the trans_no_join checks above | |
99 | */ | |
a4abeea4 | 100 | kmem_cache_free(btrfs_transaction_cachep, cur_trans); |
19ae4e81 | 101 | cur_trans = fs_info->running_transaction; |
d43317dc | 102 | goto loop; |
e4b50e14 DC |
103 | } else if (fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) { |
104 | spin_unlock(&fs_info->trans_lock); | |
7b8b92af JB |
105 | kmem_cache_free(btrfs_transaction_cachep, cur_trans); |
106 | return -EROFS; | |
79154b1b | 107 | } |
d43317dc | 108 | |
a4abeea4 JB |
109 | atomic_set(&cur_trans->num_writers, 1); |
110 | cur_trans->num_joined = 0; | |
111 | init_waitqueue_head(&cur_trans->writer_wait); | |
112 | init_waitqueue_head(&cur_trans->commit_wait); | |
113 | cur_trans->in_commit = 0; | |
114 | cur_trans->blocked = 0; | |
115 | /* | |
116 | * One for this trans handle, one so it will live on until we | |
117 | * commit the transaction. | |
118 | */ | |
119 | atomic_set(&cur_trans->use_count, 2); | |
120 | cur_trans->commit_done = 0; | |
121 | cur_trans->start_time = get_seconds(); | |
122 | ||
123 | cur_trans->delayed_refs.root = RB_ROOT; | |
124 | cur_trans->delayed_refs.num_entries = 0; | |
125 | cur_trans->delayed_refs.num_heads_ready = 0; | |
126 | cur_trans->delayed_refs.num_heads = 0; | |
127 | cur_trans->delayed_refs.flushing = 0; | |
128 | cur_trans->delayed_refs.run_delayed_start = 0; | |
20b297d6 JS |
129 | |
130 | /* | |
131 | * although the tree mod log is per file system and not per transaction, | |
132 | * the log must never go across transaction boundaries. | |
133 | */ | |
134 | smp_mb(); | |
135 | if (!list_empty(&fs_info->tree_mod_seq_list)) { | |
136 | printk(KERN_ERR "btrfs: tree_mod_seq_list not empty when " | |
137 | "creating a fresh transaction\n"); | |
138 | WARN_ON(1); | |
139 | } | |
140 | if (!RB_EMPTY_ROOT(&fs_info->tree_mod_log)) { | |
141 | printk(KERN_ERR "btrfs: tree_mod_log rb tree not empty when " | |
142 | "creating a fresh transaction\n"); | |
143 | WARN_ON(1); | |
144 | } | |
145 | atomic_set(&fs_info->tree_mod_seq, 0); | |
146 | ||
a4abeea4 JB |
147 | spin_lock_init(&cur_trans->commit_lock); |
148 | spin_lock_init(&cur_trans->delayed_refs.lock); | |
149 | ||
150 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); | |
19ae4e81 | 151 | list_add_tail(&cur_trans->list, &fs_info->trans_list); |
a4abeea4 | 152 | extent_io_tree_init(&cur_trans->dirty_pages, |
19ae4e81 JS |
153 | fs_info->btree_inode->i_mapping); |
154 | fs_info->generation++; | |
155 | cur_trans->transid = fs_info->generation; | |
156 | fs_info->running_transaction = cur_trans; | |
49b25e05 | 157 | cur_trans->aborted = 0; |
19ae4e81 | 158 | spin_unlock(&fs_info->trans_lock); |
15ee9bc7 | 159 | |
79154b1b CM |
160 | return 0; |
161 | } | |
162 | ||
d352ac68 | 163 | /* |
d397712b CM |
164 | * this does all the record keeping required to make sure that a reference |
165 | * counted root is properly recorded in a given transaction. This is required | |
166 | * to make sure the old root from before we joined the transaction is deleted | |
167 | * when the transaction commits | |
d352ac68 | 168 | */ |
7585717f | 169 | static int record_root_in_trans(struct btrfs_trans_handle *trans, |
a4abeea4 | 170 | struct btrfs_root *root) |
6702ed49 | 171 | { |
5d4f98a2 | 172 | if (root->ref_cows && root->last_trans < trans->transid) { |
6702ed49 | 173 | WARN_ON(root == root->fs_info->extent_root); |
5d4f98a2 YZ |
174 | WARN_ON(root->commit_root != root->node); |
175 | ||
7585717f CM |
176 | /* |
177 | * see below for in_trans_setup usage rules | |
178 | * we have the reloc mutex held now, so there | |
179 | * is only one writer in this function | |
180 | */ | |
181 | root->in_trans_setup = 1; | |
182 | ||
183 | /* make sure readers find in_trans_setup before | |
184 | * they find our root->last_trans update | |
185 | */ | |
186 | smp_wmb(); | |
187 | ||
a4abeea4 JB |
188 | spin_lock(&root->fs_info->fs_roots_radix_lock); |
189 | if (root->last_trans == trans->transid) { | |
190 | spin_unlock(&root->fs_info->fs_roots_radix_lock); | |
191 | return 0; | |
192 | } | |
5d4f98a2 YZ |
193 | radix_tree_tag_set(&root->fs_info->fs_roots_radix, |
194 | (unsigned long)root->root_key.objectid, | |
195 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 196 | spin_unlock(&root->fs_info->fs_roots_radix_lock); |
7585717f CM |
197 | root->last_trans = trans->transid; |
198 | ||
199 | /* this is pretty tricky. We don't want to | |
200 | * take the relocation lock in btrfs_record_root_in_trans | |
201 | * unless we're really doing the first setup for this root in | |
202 | * this transaction. | |
203 | * | |
204 | * Normally we'd use root->last_trans as a flag to decide | |
205 | * if we want to take the expensive mutex. | |
206 | * | |
207 | * But, we have to set root->last_trans before we | |
208 | * init the relocation root, otherwise, we trip over warnings | |
209 | * in ctree.c. The solution used here is to flag ourselves | |
210 | * with root->in_trans_setup. When this is 1, we're still | |
211 | * fixing up the reloc trees and everyone must wait. | |
212 | * | |
213 | * When this is zero, they can trust root->last_trans and fly | |
214 | * through btrfs_record_root_in_trans without having to take the | |
215 | * lock. smp_wmb() makes sure that all the writes above are | |
216 | * done before we pop in the zero below | |
217 | */ | |
5d4f98a2 | 218 | btrfs_init_reloc_root(trans, root); |
7585717f CM |
219 | smp_wmb(); |
220 | root->in_trans_setup = 0; | |
5d4f98a2 YZ |
221 | } |
222 | return 0; | |
223 | } | |
bcc63abb | 224 | |
7585717f CM |
225 | |
226 | int btrfs_record_root_in_trans(struct btrfs_trans_handle *trans, | |
227 | struct btrfs_root *root) | |
228 | { | |
229 | if (!root->ref_cows) | |
230 | return 0; | |
231 | ||
232 | /* | |
233 | * see record_root_in_trans for comments about in_trans_setup usage | |
234 | * and barriers | |
235 | */ | |
236 | smp_rmb(); | |
237 | if (root->last_trans == trans->transid && | |
238 | !root->in_trans_setup) | |
239 | return 0; | |
240 | ||
241 | mutex_lock(&root->fs_info->reloc_mutex); | |
242 | record_root_in_trans(trans, root); | |
243 | mutex_unlock(&root->fs_info->reloc_mutex); | |
244 | ||
245 | return 0; | |
246 | } | |
247 | ||
d352ac68 CM |
248 | /* wait for commit against the current transaction to become unblocked |
249 | * when this is done, it is safe to start a new transaction, but the current | |
250 | * transaction might not be fully on disk. | |
251 | */ | |
37d1aeee | 252 | static void wait_current_trans(struct btrfs_root *root) |
79154b1b | 253 | { |
f9295749 | 254 | struct btrfs_transaction *cur_trans; |
79154b1b | 255 | |
a4abeea4 | 256 | spin_lock(&root->fs_info->trans_lock); |
f9295749 | 257 | cur_trans = root->fs_info->running_transaction; |
37d1aeee | 258 | if (cur_trans && cur_trans->blocked) { |
13c5a93e | 259 | atomic_inc(&cur_trans->use_count); |
a4abeea4 | 260 | spin_unlock(&root->fs_info->trans_lock); |
72d63ed6 LZ |
261 | |
262 | wait_event(root->fs_info->transaction_wait, | |
263 | !cur_trans->blocked); | |
f9295749 | 264 | put_transaction(cur_trans); |
a4abeea4 JB |
265 | } else { |
266 | spin_unlock(&root->fs_info->trans_lock); | |
f9295749 | 267 | } |
37d1aeee CM |
268 | } |
269 | ||
249ac1e5 JB |
270 | enum btrfs_trans_type { |
271 | TRANS_START, | |
272 | TRANS_JOIN, | |
273 | TRANS_USERSPACE, | |
0af3d00b | 274 | TRANS_JOIN_NOLOCK, |
249ac1e5 JB |
275 | }; |
276 | ||
a22285a6 YZ |
277 | static int may_wait_transaction(struct btrfs_root *root, int type) |
278 | { | |
a4abeea4 JB |
279 | if (root->fs_info->log_root_recovering) |
280 | return 0; | |
281 | ||
282 | if (type == TRANS_USERSPACE) | |
283 | return 1; | |
284 | ||
285 | if (type == TRANS_START && | |
286 | !atomic_read(&root->fs_info->open_ioctl_trans)) | |
a22285a6 | 287 | return 1; |
a4abeea4 | 288 | |
a22285a6 YZ |
289 | return 0; |
290 | } | |
291 | ||
e02119d5 | 292 | static struct btrfs_trans_handle *start_transaction(struct btrfs_root *root, |
a22285a6 | 293 | u64 num_items, int type) |
37d1aeee | 294 | { |
a22285a6 YZ |
295 | struct btrfs_trans_handle *h; |
296 | struct btrfs_transaction *cur_trans; | |
b5009945 | 297 | u64 num_bytes = 0; |
37d1aeee | 298 | int ret; |
c5567237 | 299 | u64 qgroup_reserved = 0; |
acce952b | 300 | |
301 | if (root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) | |
302 | return ERR_PTR(-EROFS); | |
2a1eb461 JB |
303 | |
304 | if (current->journal_info) { | |
305 | WARN_ON(type != TRANS_JOIN && type != TRANS_JOIN_NOLOCK); | |
306 | h = current->journal_info; | |
307 | h->use_count++; | |
308 | h->orig_rsv = h->block_rsv; | |
309 | h->block_rsv = NULL; | |
310 | goto got_it; | |
311 | } | |
b5009945 JB |
312 | |
313 | /* | |
314 | * Do the reservation before we join the transaction so we can do all | |
315 | * the appropriate flushing if need be. | |
316 | */ | |
317 | if (num_items > 0 && root != root->fs_info->chunk_root) { | |
c5567237 AJ |
318 | if (root->fs_info->quota_enabled && |
319 | is_fstree(root->root_key.objectid)) { | |
320 | qgroup_reserved = num_items * root->leafsize; | |
321 | ret = btrfs_qgroup_reserve(root, qgroup_reserved); | |
322 | if (ret) | |
323 | return ERR_PTR(ret); | |
324 | } | |
325 | ||
b5009945 | 326 | num_bytes = btrfs_calc_trans_metadata_size(root, num_items); |
4a92b1b8 | 327 | ret = btrfs_block_rsv_add(root, |
b5009945 JB |
328 | &root->fs_info->trans_block_rsv, |
329 | num_bytes); | |
330 | if (ret) | |
331 | return ERR_PTR(ret); | |
332 | } | |
a22285a6 YZ |
333 | again: |
334 | h = kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); | |
335 | if (!h) | |
336 | return ERR_PTR(-ENOMEM); | |
37d1aeee | 337 | |
a22285a6 | 338 | if (may_wait_transaction(root, type)) |
37d1aeee | 339 | wait_current_trans(root); |
a22285a6 | 340 | |
a4abeea4 JB |
341 | do { |
342 | ret = join_transaction(root, type == TRANS_JOIN_NOLOCK); | |
343 | if (ret == -EBUSY) | |
344 | wait_current_trans(root); | |
345 | } while (ret == -EBUSY); | |
346 | ||
db5b493a | 347 | if (ret < 0) { |
6e8df2ae | 348 | kmem_cache_free(btrfs_trans_handle_cachep, h); |
db5b493a TI |
349 | return ERR_PTR(ret); |
350 | } | |
0f7d52f4 | 351 | |
a22285a6 | 352 | cur_trans = root->fs_info->running_transaction; |
a22285a6 YZ |
353 | |
354 | h->transid = cur_trans->transid; | |
355 | h->transaction = cur_trans; | |
79154b1b | 356 | h->blocks_used = 0; |
a22285a6 | 357 | h->bytes_reserved = 0; |
d13603ef | 358 | h->root = root; |
56bec294 | 359 | h->delayed_ref_updates = 0; |
2a1eb461 | 360 | h->use_count = 1; |
0e721106 | 361 | h->adding_csums = 0; |
f0486c68 | 362 | h->block_rsv = NULL; |
2a1eb461 | 363 | h->orig_rsv = NULL; |
49b25e05 | 364 | h->aborted = 0; |
c5567237 | 365 | h->qgroup_reserved = qgroup_reserved; |
bed92eae AJ |
366 | h->delayed_ref_elem.seq = 0; |
367 | INIT_LIST_HEAD(&h->qgroup_ref_list); | |
b7ec40d7 | 368 | |
a22285a6 YZ |
369 | smp_mb(); |
370 | if (cur_trans->blocked && may_wait_transaction(root, type)) { | |
371 | btrfs_commit_transaction(h, root); | |
372 | goto again; | |
373 | } | |
374 | ||
b5009945 | 375 | if (num_bytes) { |
8c2a3ca2 | 376 | trace_btrfs_space_reservation(root->fs_info, "transaction", |
2bcc0328 | 377 | h->transid, num_bytes, 1); |
b5009945 JB |
378 | h->block_rsv = &root->fs_info->trans_block_rsv; |
379 | h->bytes_reserved = num_bytes; | |
a22285a6 | 380 | } |
9ed74f2d | 381 | |
2a1eb461 | 382 | got_it: |
a4abeea4 | 383 | btrfs_record_root_in_trans(h, root); |
a22285a6 YZ |
384 | |
385 | if (!current->journal_info && type != TRANS_USERSPACE) | |
386 | current->journal_info = h; | |
79154b1b CM |
387 | return h; |
388 | } | |
389 | ||
f9295749 | 390 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
a22285a6 | 391 | int num_items) |
f9295749 | 392 | { |
a22285a6 | 393 | return start_transaction(root, num_items, TRANS_START); |
f9295749 | 394 | } |
7a7eaa40 | 395 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root) |
f9295749 | 396 | { |
a22285a6 | 397 | return start_transaction(root, 0, TRANS_JOIN); |
f9295749 CM |
398 | } |
399 | ||
7a7eaa40 | 400 | struct btrfs_trans_handle *btrfs_join_transaction_nolock(struct btrfs_root *root) |
0af3d00b JB |
401 | { |
402 | return start_transaction(root, 0, TRANS_JOIN_NOLOCK); | |
403 | } | |
404 | ||
7a7eaa40 | 405 | struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *root) |
9ca9ee09 | 406 | { |
7a7eaa40 | 407 | return start_transaction(root, 0, TRANS_USERSPACE); |
9ca9ee09 SW |
408 | } |
409 | ||
d352ac68 | 410 | /* wait for a transaction commit to be fully complete */ |
b9c8300c | 411 | static noinline void wait_for_commit(struct btrfs_root *root, |
89ce8a63 CM |
412 | struct btrfs_transaction *commit) |
413 | { | |
72d63ed6 | 414 | wait_event(commit->commit_wait, commit->commit_done); |
89ce8a63 CM |
415 | } |
416 | ||
46204592 SW |
417 | int btrfs_wait_for_commit(struct btrfs_root *root, u64 transid) |
418 | { | |
419 | struct btrfs_transaction *cur_trans = NULL, *t; | |
420 | int ret; | |
421 | ||
46204592 SW |
422 | ret = 0; |
423 | if (transid) { | |
424 | if (transid <= root->fs_info->last_trans_committed) | |
a4abeea4 | 425 | goto out; |
46204592 SW |
426 | |
427 | /* find specified transaction */ | |
a4abeea4 | 428 | spin_lock(&root->fs_info->trans_lock); |
46204592 SW |
429 | list_for_each_entry(t, &root->fs_info->trans_list, list) { |
430 | if (t->transid == transid) { | |
431 | cur_trans = t; | |
a4abeea4 | 432 | atomic_inc(&cur_trans->use_count); |
46204592 SW |
433 | break; |
434 | } | |
435 | if (t->transid > transid) | |
436 | break; | |
437 | } | |
a4abeea4 | 438 | spin_unlock(&root->fs_info->trans_lock); |
46204592 SW |
439 | ret = -EINVAL; |
440 | if (!cur_trans) | |
a4abeea4 | 441 | goto out; /* bad transid */ |
46204592 SW |
442 | } else { |
443 | /* find newest transaction that is committing | committed */ | |
a4abeea4 | 444 | spin_lock(&root->fs_info->trans_lock); |
46204592 SW |
445 | list_for_each_entry_reverse(t, &root->fs_info->trans_list, |
446 | list) { | |
447 | if (t->in_commit) { | |
448 | if (t->commit_done) | |
3473f3c0 | 449 | break; |
46204592 | 450 | cur_trans = t; |
a4abeea4 | 451 | atomic_inc(&cur_trans->use_count); |
46204592 SW |
452 | break; |
453 | } | |
454 | } | |
a4abeea4 | 455 | spin_unlock(&root->fs_info->trans_lock); |
46204592 | 456 | if (!cur_trans) |
a4abeea4 | 457 | goto out; /* nothing committing|committed */ |
46204592 SW |
458 | } |
459 | ||
46204592 SW |
460 | wait_for_commit(root, cur_trans); |
461 | ||
46204592 SW |
462 | put_transaction(cur_trans); |
463 | ret = 0; | |
a4abeea4 | 464 | out: |
46204592 SW |
465 | return ret; |
466 | } | |
467 | ||
37d1aeee CM |
468 | void btrfs_throttle(struct btrfs_root *root) |
469 | { | |
a4abeea4 | 470 | if (!atomic_read(&root->fs_info->open_ioctl_trans)) |
9ca9ee09 | 471 | wait_current_trans(root); |
37d1aeee CM |
472 | } |
473 | ||
8929ecfa YZ |
474 | static int should_end_transaction(struct btrfs_trans_handle *trans, |
475 | struct btrfs_root *root) | |
476 | { | |
477 | int ret; | |
36ba022a JB |
478 | |
479 | ret = btrfs_block_rsv_check(root, &root->fs_info->global_block_rsv, 5); | |
8929ecfa YZ |
480 | return ret ? 1 : 0; |
481 | } | |
482 | ||
483 | int btrfs_should_end_transaction(struct btrfs_trans_handle *trans, | |
484 | struct btrfs_root *root) | |
485 | { | |
486 | struct btrfs_transaction *cur_trans = trans->transaction; | |
487 | int updates; | |
49b25e05 | 488 | int err; |
8929ecfa | 489 | |
a4abeea4 | 490 | smp_mb(); |
8929ecfa YZ |
491 | if (cur_trans->blocked || cur_trans->delayed_refs.flushing) |
492 | return 1; | |
493 | ||
494 | updates = trans->delayed_ref_updates; | |
495 | trans->delayed_ref_updates = 0; | |
49b25e05 JM |
496 | if (updates) { |
497 | err = btrfs_run_delayed_refs(trans, root, updates); | |
498 | if (err) /* Error code will also eval true */ | |
499 | return err; | |
500 | } | |
8929ecfa YZ |
501 | |
502 | return should_end_transaction(trans, root); | |
503 | } | |
504 | ||
89ce8a63 | 505 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
0af3d00b | 506 | struct btrfs_root *root, int throttle, int lock) |
79154b1b | 507 | { |
8929ecfa | 508 | struct btrfs_transaction *cur_trans = trans->transaction; |
ab78c84d | 509 | struct btrfs_fs_info *info = root->fs_info; |
c3e69d58 | 510 | int count = 0; |
4edc2ca3 | 511 | int err = 0; |
c3e69d58 | 512 | |
2a1eb461 JB |
513 | if (--trans->use_count) { |
514 | trans->block_rsv = trans->orig_rsv; | |
515 | return 0; | |
516 | } | |
517 | ||
edf39272 JS |
518 | /* |
519 | * do the qgroup accounting as early as possible | |
520 | */ | |
521 | err = btrfs_delayed_refs_qgroup_accounting(trans, info); | |
522 | ||
b24e03db | 523 | btrfs_trans_release_metadata(trans, root); |
4c13d758 | 524 | trans->block_rsv = NULL; |
d13603ef AJ |
525 | /* |
526 | * the same root has to be passed to start_transaction and | |
527 | * end_transaction. Subvolume quota depends on this. | |
528 | */ | |
529 | WARN_ON(trans->root != root); | |
c5567237 AJ |
530 | |
531 | if (trans->qgroup_reserved) { | |
532 | btrfs_qgroup_free(root, trans->qgroup_reserved); | |
533 | trans->qgroup_reserved = 0; | |
534 | } | |
535 | ||
203bf287 | 536 | while (count < 2) { |
c3e69d58 CM |
537 | unsigned long cur = trans->delayed_ref_updates; |
538 | trans->delayed_ref_updates = 0; | |
539 | if (cur && | |
540 | trans->transaction->delayed_refs.num_heads_ready > 64) { | |
541 | trans->delayed_ref_updates = 0; | |
542 | btrfs_run_delayed_refs(trans, root, cur); | |
543 | } else { | |
544 | break; | |
545 | } | |
546 | count++; | |
56bec294 | 547 | } |
0e721106 JB |
548 | btrfs_trans_release_metadata(trans, root); |
549 | trans->block_rsv = NULL; | |
56bec294 | 550 | |
a4abeea4 JB |
551 | if (lock && !atomic_read(&root->fs_info->open_ioctl_trans) && |
552 | should_end_transaction(trans, root)) { | |
8929ecfa | 553 | trans->transaction->blocked = 1; |
a4abeea4 JB |
554 | smp_wmb(); |
555 | } | |
8929ecfa | 556 | |
0af3d00b | 557 | if (lock && cur_trans->blocked && !cur_trans->in_commit) { |
81317fde JB |
558 | if (throttle) { |
559 | /* | |
560 | * We may race with somebody else here so end up having | |
561 | * to call end_transaction on ourselves again, so inc | |
562 | * our use_count. | |
563 | */ | |
564 | trans->use_count++; | |
8929ecfa | 565 | return btrfs_commit_transaction(trans, root); |
81317fde | 566 | } else { |
8929ecfa | 567 | wake_up_process(info->transaction_kthread); |
81317fde | 568 | } |
8929ecfa YZ |
569 | } |
570 | ||
8929ecfa | 571 | WARN_ON(cur_trans != info->running_transaction); |
13c5a93e JB |
572 | WARN_ON(atomic_read(&cur_trans->num_writers) < 1); |
573 | atomic_dec(&cur_trans->num_writers); | |
89ce8a63 | 574 | |
99d16cbc | 575 | smp_mb(); |
79154b1b CM |
576 | if (waitqueue_active(&cur_trans->writer_wait)) |
577 | wake_up(&cur_trans->writer_wait); | |
79154b1b | 578 | put_transaction(cur_trans); |
9ed74f2d JB |
579 | |
580 | if (current->journal_info == trans) | |
581 | current->journal_info = NULL; | |
ab78c84d | 582 | |
24bbcf04 YZ |
583 | if (throttle) |
584 | btrfs_run_delayed_iputs(root); | |
585 | ||
49b25e05 JM |
586 | if (trans->aborted || |
587 | root->fs_info->fs_state & BTRFS_SUPER_FLAG_ERROR) { | |
4edc2ca3 | 588 | err = -EIO; |
49b25e05 | 589 | } |
edf39272 | 590 | assert_qgroups_uptodate(trans); |
49b25e05 | 591 | |
4edc2ca3 DJ |
592 | memset(trans, 0, sizeof(*trans)); |
593 | kmem_cache_free(btrfs_trans_handle_cachep, trans); | |
594 | return err; | |
79154b1b CM |
595 | } |
596 | ||
89ce8a63 CM |
597 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, |
598 | struct btrfs_root *root) | |
599 | { | |
16cdcec7 MX |
600 | int ret; |
601 | ||
602 | ret = __btrfs_end_transaction(trans, root, 0, 1); | |
603 | if (ret) | |
604 | return ret; | |
605 | return 0; | |
89ce8a63 CM |
606 | } |
607 | ||
608 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans, | |
609 | struct btrfs_root *root) | |
610 | { | |
16cdcec7 MX |
611 | int ret; |
612 | ||
613 | ret = __btrfs_end_transaction(trans, root, 1, 1); | |
614 | if (ret) | |
615 | return ret; | |
616 | return 0; | |
0af3d00b JB |
617 | } |
618 | ||
619 | int btrfs_end_transaction_nolock(struct btrfs_trans_handle *trans, | |
620 | struct btrfs_root *root) | |
621 | { | |
16cdcec7 MX |
622 | int ret; |
623 | ||
624 | ret = __btrfs_end_transaction(trans, root, 0, 0); | |
625 | if (ret) | |
626 | return ret; | |
627 | return 0; | |
628 | } | |
629 | ||
630 | int btrfs_end_transaction_dmeta(struct btrfs_trans_handle *trans, | |
631 | struct btrfs_root *root) | |
632 | { | |
633 | return __btrfs_end_transaction(trans, root, 1, 1); | |
89ce8a63 CM |
634 | } |
635 | ||
d352ac68 CM |
636 | /* |
637 | * when btree blocks are allocated, they have some corresponding bits set for | |
638 | * them in one of two extent_io trees. This is used to make sure all of | |
690587d1 | 639 | * those extents are sent to disk but does not wait on them |
d352ac68 | 640 | */ |
690587d1 | 641 | int btrfs_write_marked_extents(struct btrfs_root *root, |
8cef4e16 | 642 | struct extent_io_tree *dirty_pages, int mark) |
79154b1b | 643 | { |
777e6bd7 | 644 | int err = 0; |
7c4452b9 | 645 | int werr = 0; |
1728366e | 646 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; |
777e6bd7 | 647 | u64 start = 0; |
5f39d397 | 648 | u64 end; |
7c4452b9 | 649 | |
1728366e JB |
650 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
651 | mark)) { | |
652 | convert_extent_bit(dirty_pages, start, end, EXTENT_NEED_WAIT, mark, | |
653 | GFP_NOFS); | |
654 | err = filemap_fdatawrite_range(mapping, start, end); | |
655 | if (err) | |
656 | werr = err; | |
657 | cond_resched(); | |
658 | start = end + 1; | |
7c4452b9 | 659 | } |
690587d1 CM |
660 | if (err) |
661 | werr = err; | |
662 | return werr; | |
663 | } | |
664 | ||
665 | /* | |
666 | * when btree blocks are allocated, they have some corresponding bits set for | |
667 | * them in one of two extent_io trees. This is used to make sure all of | |
668 | * those extents are on disk for transaction or log commit. We wait | |
669 | * on all the pages and clear them from the dirty pages state tree | |
670 | */ | |
671 | int btrfs_wait_marked_extents(struct btrfs_root *root, | |
8cef4e16 | 672 | struct extent_io_tree *dirty_pages, int mark) |
690587d1 | 673 | { |
690587d1 CM |
674 | int err = 0; |
675 | int werr = 0; | |
1728366e | 676 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; |
690587d1 CM |
677 | u64 start = 0; |
678 | u64 end; | |
777e6bd7 | 679 | |
1728366e JB |
680 | while (!find_first_extent_bit(dirty_pages, start, &start, &end, |
681 | EXTENT_NEED_WAIT)) { | |
682 | clear_extent_bits(dirty_pages, start, end, EXTENT_NEED_WAIT, GFP_NOFS); | |
683 | err = filemap_fdatawait_range(mapping, start, end); | |
684 | if (err) | |
685 | werr = err; | |
686 | cond_resched(); | |
687 | start = end + 1; | |
777e6bd7 | 688 | } |
7c4452b9 CM |
689 | if (err) |
690 | werr = err; | |
691 | return werr; | |
79154b1b CM |
692 | } |
693 | ||
690587d1 CM |
694 | /* |
695 | * when btree blocks are allocated, they have some corresponding bits set for | |
696 | * them in one of two extent_io trees. This is used to make sure all of | |
697 | * those extents are on disk for transaction or log commit | |
698 | */ | |
699 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, | |
8cef4e16 | 700 | struct extent_io_tree *dirty_pages, int mark) |
690587d1 CM |
701 | { |
702 | int ret; | |
703 | int ret2; | |
704 | ||
8cef4e16 YZ |
705 | ret = btrfs_write_marked_extents(root, dirty_pages, mark); |
706 | ret2 = btrfs_wait_marked_extents(root, dirty_pages, mark); | |
bf0da8c1 CM |
707 | |
708 | if (ret) | |
709 | return ret; | |
710 | if (ret2) | |
711 | return ret2; | |
712 | return 0; | |
690587d1 CM |
713 | } |
714 | ||
d0c803c4 CM |
715 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, |
716 | struct btrfs_root *root) | |
717 | { | |
718 | if (!trans || !trans->transaction) { | |
719 | struct inode *btree_inode; | |
720 | btree_inode = root->fs_info->btree_inode; | |
721 | return filemap_write_and_wait(btree_inode->i_mapping); | |
722 | } | |
723 | return btrfs_write_and_wait_marked_extents(root, | |
8cef4e16 YZ |
724 | &trans->transaction->dirty_pages, |
725 | EXTENT_DIRTY); | |
d0c803c4 CM |
726 | } |
727 | ||
d352ac68 CM |
728 | /* |
729 | * this is used to update the root pointer in the tree of tree roots. | |
730 | * | |
731 | * But, in the case of the extent allocation tree, updating the root | |
732 | * pointer may allocate blocks which may change the root of the extent | |
733 | * allocation tree. | |
734 | * | |
735 | * So, this loops and repeats and makes sure the cowonly root didn't | |
736 | * change while the root pointer was being updated in the metadata. | |
737 | */ | |
0b86a832 CM |
738 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
739 | struct btrfs_root *root) | |
79154b1b CM |
740 | { |
741 | int ret; | |
0b86a832 | 742 | u64 old_root_bytenr; |
86b9f2ec | 743 | u64 old_root_used; |
0b86a832 | 744 | struct btrfs_root *tree_root = root->fs_info->tree_root; |
79154b1b | 745 | |
86b9f2ec | 746 | old_root_used = btrfs_root_used(&root->root_item); |
0b86a832 | 747 | btrfs_write_dirty_block_groups(trans, root); |
56bec294 | 748 | |
d397712b | 749 | while (1) { |
0b86a832 | 750 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
86b9f2ec YZ |
751 | if (old_root_bytenr == root->node->start && |
752 | old_root_used == btrfs_root_used(&root->root_item)) | |
79154b1b | 753 | break; |
87ef2bb4 | 754 | |
5d4f98a2 | 755 | btrfs_set_root_node(&root->root_item, root->node); |
79154b1b | 756 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
757 | &root->root_key, |
758 | &root->root_item); | |
49b25e05 JM |
759 | if (ret) |
760 | return ret; | |
56bec294 | 761 | |
86b9f2ec | 762 | old_root_used = btrfs_root_used(&root->root_item); |
4a8c9a62 | 763 | ret = btrfs_write_dirty_block_groups(trans, root); |
49b25e05 JM |
764 | if (ret) |
765 | return ret; | |
0b86a832 | 766 | } |
276e680d YZ |
767 | |
768 | if (root != root->fs_info->extent_root) | |
769 | switch_commit_root(root); | |
770 | ||
0b86a832 CM |
771 | return 0; |
772 | } | |
773 | ||
d352ac68 CM |
774 | /* |
775 | * update all the cowonly tree roots on disk | |
49b25e05 JM |
776 | * |
777 | * The error handling in this function may not be obvious. Any of the | |
778 | * failures will cause the file system to go offline. We still need | |
779 | * to clean up the delayed refs. | |
d352ac68 | 780 | */ |
5d4f98a2 YZ |
781 | static noinline int commit_cowonly_roots(struct btrfs_trans_handle *trans, |
782 | struct btrfs_root *root) | |
0b86a832 CM |
783 | { |
784 | struct btrfs_fs_info *fs_info = root->fs_info; | |
785 | struct list_head *next; | |
84234f3a | 786 | struct extent_buffer *eb; |
56bec294 | 787 | int ret; |
84234f3a | 788 | |
56bec294 | 789 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
790 | if (ret) |
791 | return ret; | |
87ef2bb4 | 792 | |
84234f3a | 793 | eb = btrfs_lock_root_node(fs_info->tree_root); |
49b25e05 JM |
794 | ret = btrfs_cow_block(trans, fs_info->tree_root, eb, NULL, |
795 | 0, &eb); | |
84234f3a YZ |
796 | btrfs_tree_unlock(eb); |
797 | free_extent_buffer(eb); | |
0b86a832 | 798 | |
49b25e05 JM |
799 | if (ret) |
800 | return ret; | |
801 | ||
56bec294 | 802 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
803 | if (ret) |
804 | return ret; | |
87ef2bb4 | 805 | |
733f4fbb SB |
806 | ret = btrfs_run_dev_stats(trans, root->fs_info); |
807 | BUG_ON(ret); | |
808 | ||
546adb0d JS |
809 | ret = btrfs_run_qgroups(trans, root->fs_info); |
810 | BUG_ON(ret); | |
811 | ||
812 | /* run_qgroups might have added some more refs */ | |
813 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); | |
814 | BUG_ON(ret); | |
815 | ||
d397712b | 816 | while (!list_empty(&fs_info->dirty_cowonly_roots)) { |
0b86a832 CM |
817 | next = fs_info->dirty_cowonly_roots.next; |
818 | list_del_init(next); | |
819 | root = list_entry(next, struct btrfs_root, dirty_list); | |
87ef2bb4 | 820 | |
49b25e05 JM |
821 | ret = update_cowonly_root(trans, root); |
822 | if (ret) | |
823 | return ret; | |
79154b1b | 824 | } |
276e680d YZ |
825 | |
826 | down_write(&fs_info->extent_commit_sem); | |
827 | switch_commit_root(fs_info->extent_root); | |
828 | up_write(&fs_info->extent_commit_sem); | |
829 | ||
79154b1b CM |
830 | return 0; |
831 | } | |
832 | ||
d352ac68 CM |
833 | /* |
834 | * dead roots are old snapshots that need to be deleted. This allocates | |
835 | * a dirty root struct and adds it into the list of dead roots that need to | |
836 | * be deleted | |
837 | */ | |
5d4f98a2 | 838 | int btrfs_add_dead_root(struct btrfs_root *root) |
5eda7b5e | 839 | { |
a4abeea4 | 840 | spin_lock(&root->fs_info->trans_lock); |
5d4f98a2 | 841 | list_add(&root->root_list, &root->fs_info->dead_roots); |
a4abeea4 | 842 | spin_unlock(&root->fs_info->trans_lock); |
5eda7b5e CM |
843 | return 0; |
844 | } | |
845 | ||
d352ac68 | 846 | /* |
5d4f98a2 | 847 | * update all the cowonly tree roots on disk |
d352ac68 | 848 | */ |
5d4f98a2 YZ |
849 | static noinline int commit_fs_roots(struct btrfs_trans_handle *trans, |
850 | struct btrfs_root *root) | |
0f7d52f4 | 851 | { |
0f7d52f4 | 852 | struct btrfs_root *gang[8]; |
5d4f98a2 | 853 | struct btrfs_fs_info *fs_info = root->fs_info; |
0f7d52f4 CM |
854 | int i; |
855 | int ret; | |
54aa1f4d CM |
856 | int err = 0; |
857 | ||
a4abeea4 | 858 | spin_lock(&fs_info->fs_roots_radix_lock); |
d397712b | 859 | while (1) { |
5d4f98a2 YZ |
860 | ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix, |
861 | (void **)gang, 0, | |
0f7d52f4 CM |
862 | ARRAY_SIZE(gang), |
863 | BTRFS_ROOT_TRANS_TAG); | |
864 | if (ret == 0) | |
865 | break; | |
866 | for (i = 0; i < ret; i++) { | |
867 | root = gang[i]; | |
5d4f98a2 YZ |
868 | radix_tree_tag_clear(&fs_info->fs_roots_radix, |
869 | (unsigned long)root->root_key.objectid, | |
870 | BTRFS_ROOT_TRANS_TAG); | |
a4abeea4 | 871 | spin_unlock(&fs_info->fs_roots_radix_lock); |
31153d81 | 872 | |
e02119d5 | 873 | btrfs_free_log(trans, root); |
5d4f98a2 | 874 | btrfs_update_reloc_root(trans, root); |
d68fc57b | 875 | btrfs_orphan_commit_root(trans, root); |
bcc63abb | 876 | |
82d5902d LZ |
877 | btrfs_save_ino_cache(root, trans); |
878 | ||
f1ebcc74 LB |
879 | /* see comments in should_cow_block() */ |
880 | root->force_cow = 0; | |
881 | smp_wmb(); | |
882 | ||
978d910d | 883 | if (root->commit_root != root->node) { |
581bb050 | 884 | mutex_lock(&root->fs_commit_mutex); |
817d52f8 | 885 | switch_commit_root(root); |
581bb050 LZ |
886 | btrfs_unpin_free_ino(root); |
887 | mutex_unlock(&root->fs_commit_mutex); | |
888 | ||
978d910d YZ |
889 | btrfs_set_root_node(&root->root_item, |
890 | root->node); | |
891 | } | |
5d4f98a2 | 892 | |
5d4f98a2 | 893 | err = btrfs_update_root(trans, fs_info->tree_root, |
0f7d52f4 CM |
894 | &root->root_key, |
895 | &root->root_item); | |
a4abeea4 | 896 | spin_lock(&fs_info->fs_roots_radix_lock); |
54aa1f4d CM |
897 | if (err) |
898 | break; | |
0f7d52f4 CM |
899 | } |
900 | } | |
a4abeea4 | 901 | spin_unlock(&fs_info->fs_roots_radix_lock); |
54aa1f4d | 902 | return err; |
0f7d52f4 CM |
903 | } |
904 | ||
d352ac68 CM |
905 | /* |
906 | * defrag a given btree. If cacheonly == 1, this won't read from the disk, | |
907 | * otherwise every leaf in the btree is read and defragged. | |
908 | */ | |
e9d0b13b CM |
909 | int btrfs_defrag_root(struct btrfs_root *root, int cacheonly) |
910 | { | |
911 | struct btrfs_fs_info *info = root->fs_info; | |
e9d0b13b | 912 | struct btrfs_trans_handle *trans; |
8929ecfa | 913 | int ret; |
d3c2fdcf | 914 | unsigned long nr; |
e9d0b13b | 915 | |
8929ecfa | 916 | if (xchg(&root->defrag_running, 1)) |
e9d0b13b | 917 | return 0; |
8929ecfa | 918 | |
6b80053d | 919 | while (1) { |
8929ecfa YZ |
920 | trans = btrfs_start_transaction(root, 0); |
921 | if (IS_ERR(trans)) | |
922 | return PTR_ERR(trans); | |
923 | ||
e9d0b13b | 924 | ret = btrfs_defrag_leaves(trans, root, cacheonly); |
8929ecfa | 925 | |
d3c2fdcf | 926 | nr = trans->blocks_used; |
e9d0b13b | 927 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 928 | btrfs_btree_balance_dirty(info->tree_root, nr); |
e9d0b13b CM |
929 | cond_resched(); |
930 | ||
7841cb28 | 931 | if (btrfs_fs_closing(root->fs_info) || ret != -EAGAIN) |
e9d0b13b CM |
932 | break; |
933 | } | |
934 | root->defrag_running = 0; | |
8929ecfa | 935 | return ret; |
e9d0b13b CM |
936 | } |
937 | ||
d352ac68 CM |
938 | /* |
939 | * new snapshots need to be created at a very specific time in the | |
940 | * transaction commit. This does the actual creation | |
941 | */ | |
80b6794d | 942 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
943 | struct btrfs_fs_info *fs_info, |
944 | struct btrfs_pending_snapshot *pending) | |
945 | { | |
946 | struct btrfs_key key; | |
80b6794d | 947 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
948 | struct btrfs_root *tree_root = fs_info->tree_root; |
949 | struct btrfs_root *root = pending->root; | |
6bdb72de | 950 | struct btrfs_root *parent_root; |
98c9942a | 951 | struct btrfs_block_rsv *rsv; |
6bdb72de | 952 | struct inode *parent_inode; |
6a912213 | 953 | struct dentry *parent; |
a22285a6 | 954 | struct dentry *dentry; |
3063d29f | 955 | struct extent_buffer *tmp; |
925baedd | 956 | struct extent_buffer *old; |
8ea05e3a | 957 | struct timespec cur_time = CURRENT_TIME; |
3063d29f | 958 | int ret; |
d68fc57b | 959 | u64 to_reserve = 0; |
6bdb72de | 960 | u64 index = 0; |
a22285a6 | 961 | u64 objectid; |
b83cc969 | 962 | u64 root_flags; |
8ea05e3a | 963 | uuid_le new_uuid; |
3063d29f | 964 | |
98c9942a LB |
965 | rsv = trans->block_rsv; |
966 | ||
80b6794d CM |
967 | new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS); |
968 | if (!new_root_item) { | |
49b25e05 | 969 | ret = pending->error = -ENOMEM; |
80b6794d CM |
970 | goto fail; |
971 | } | |
a22285a6 | 972 | |
581bb050 | 973 | ret = btrfs_find_free_objectid(tree_root, &objectid); |
a22285a6 YZ |
974 | if (ret) { |
975 | pending->error = ret; | |
3063d29f | 976 | goto fail; |
a22285a6 | 977 | } |
3063d29f | 978 | |
3fd0a558 | 979 | btrfs_reloc_pre_snapshot(trans, pending, &to_reserve); |
d68fc57b YZ |
980 | |
981 | if (to_reserve > 0) { | |
62f30c54 MX |
982 | ret = btrfs_block_rsv_add_noflush(root, &pending->block_rsv, |
983 | to_reserve); | |
d68fc57b YZ |
984 | if (ret) { |
985 | pending->error = ret; | |
986 | goto fail; | |
987 | } | |
988 | } | |
989 | ||
6f72c7e2 AJ |
990 | ret = btrfs_qgroup_inherit(trans, fs_info, root->root_key.objectid, |
991 | objectid, pending->inherit); | |
992 | kfree(pending->inherit); | |
993 | if (ret) { | |
994 | pending->error = ret; | |
995 | goto fail; | |
996 | } | |
997 | ||
3063d29f | 998 | key.objectid = objectid; |
a22285a6 YZ |
999 | key.offset = (u64)-1; |
1000 | key.type = BTRFS_ROOT_ITEM_KEY; | |
3063d29f | 1001 | |
a22285a6 | 1002 | trans->block_rsv = &pending->block_rsv; |
3de4586c | 1003 | |
a22285a6 | 1004 | dentry = pending->dentry; |
6a912213 JB |
1005 | parent = dget_parent(dentry); |
1006 | parent_inode = parent->d_inode; | |
a22285a6 | 1007 | parent_root = BTRFS_I(parent_inode)->root; |
7585717f | 1008 | record_root_in_trans(trans, parent_root); |
a22285a6 | 1009 | |
3063d29f CM |
1010 | /* |
1011 | * insert the directory item | |
1012 | */ | |
3de4586c | 1013 | ret = btrfs_set_inode_index(parent_inode, &index); |
49b25e05 | 1014 | BUG_ON(ret); /* -ENOMEM */ |
0660b5af | 1015 | ret = btrfs_insert_dir_item(trans, parent_root, |
a22285a6 | 1016 | dentry->d_name.name, dentry->d_name.len, |
16cdcec7 | 1017 | parent_inode, &key, |
a22285a6 | 1018 | BTRFS_FT_DIR, index); |
79787eaa | 1019 | if (ret == -EEXIST) { |
fe66a05a CM |
1020 | pending->error = -EEXIST; |
1021 | dput(parent); | |
1022 | goto fail; | |
79787eaa JM |
1023 | } else if (ret) { |
1024 | goto abort_trans_dput; | |
1025 | } | |
0660b5af | 1026 | |
a22285a6 YZ |
1027 | btrfs_i_size_write(parent_inode, parent_inode->i_size + |
1028 | dentry->d_name.len * 2); | |
52c26179 | 1029 | ret = btrfs_update_inode(trans, parent_root, parent_inode); |
49b25e05 | 1030 | if (ret) |
79787eaa | 1031 | goto abort_trans_dput; |
52c26179 | 1032 | |
e999376f CM |
1033 | /* |
1034 | * pull in the delayed directory update | |
1035 | * and the delayed inode item | |
1036 | * otherwise we corrupt the FS during | |
1037 | * snapshot | |
1038 | */ | |
1039 | ret = btrfs_run_delayed_items(trans, root); | |
79787eaa JM |
1040 | if (ret) { /* Transaction aborted */ |
1041 | dput(parent); | |
49b25e05 | 1042 | goto fail; |
79787eaa | 1043 | } |
e999376f | 1044 | |
7585717f | 1045 | record_root_in_trans(trans, root); |
6bdb72de SW |
1046 | btrfs_set_root_last_snapshot(&root->root_item, trans->transid); |
1047 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); | |
08fe4db1 | 1048 | btrfs_check_and_init_root_item(new_root_item); |
6bdb72de | 1049 | |
b83cc969 LZ |
1050 | root_flags = btrfs_root_flags(new_root_item); |
1051 | if (pending->readonly) | |
1052 | root_flags |= BTRFS_ROOT_SUBVOL_RDONLY; | |
1053 | else | |
1054 | root_flags &= ~BTRFS_ROOT_SUBVOL_RDONLY; | |
1055 | btrfs_set_root_flags(new_root_item, root_flags); | |
1056 | ||
8ea05e3a AB |
1057 | btrfs_set_root_generation_v2(new_root_item, |
1058 | trans->transid); | |
1059 | uuid_le_gen(&new_uuid); | |
1060 | memcpy(new_root_item->uuid, new_uuid.b, BTRFS_UUID_SIZE); | |
1061 | memcpy(new_root_item->parent_uuid, root->root_item.uuid, | |
1062 | BTRFS_UUID_SIZE); | |
1063 | new_root_item->otime.sec = cpu_to_le64(cur_time.tv_sec); | |
dadd1105 | 1064 | new_root_item->otime.nsec = cpu_to_le32(cur_time.tv_nsec); |
8ea05e3a AB |
1065 | btrfs_set_root_otransid(new_root_item, trans->transid); |
1066 | memset(&new_root_item->stime, 0, sizeof(new_root_item->stime)); | |
1067 | memset(&new_root_item->rtime, 0, sizeof(new_root_item->rtime)); | |
1068 | btrfs_set_root_stransid(new_root_item, 0); | |
1069 | btrfs_set_root_rtransid(new_root_item, 0); | |
1070 | ||
6bdb72de | 1071 | old = btrfs_lock_root_node(root); |
49b25e05 | 1072 | ret = btrfs_cow_block(trans, root, old, NULL, 0, &old); |
79787eaa JM |
1073 | if (ret) { |
1074 | btrfs_tree_unlock(old); | |
1075 | free_extent_buffer(old); | |
1076 | goto abort_trans_dput; | |
1077 | } | |
49b25e05 | 1078 | |
6bdb72de SW |
1079 | btrfs_set_lock_blocking(old); |
1080 | ||
49b25e05 | 1081 | ret = btrfs_copy_root(trans, root, old, &tmp, objectid); |
79787eaa | 1082 | /* clean up in any case */ |
6bdb72de SW |
1083 | btrfs_tree_unlock(old); |
1084 | free_extent_buffer(old); | |
79787eaa JM |
1085 | if (ret) |
1086 | goto abort_trans_dput; | |
6bdb72de | 1087 | |
f1ebcc74 LB |
1088 | /* see comments in should_cow_block() */ |
1089 | root->force_cow = 1; | |
1090 | smp_wmb(); | |
1091 | ||
6bdb72de | 1092 | btrfs_set_root_node(new_root_item, tmp); |
a22285a6 YZ |
1093 | /* record when the snapshot was created in key.offset */ |
1094 | key.offset = trans->transid; | |
1095 | ret = btrfs_insert_root(trans, tree_root, &key, new_root_item); | |
6bdb72de SW |
1096 | btrfs_tree_unlock(tmp); |
1097 | free_extent_buffer(tmp); | |
49b25e05 | 1098 | if (ret) |
79787eaa | 1099 | goto abort_trans_dput; |
6bdb72de | 1100 | |
a22285a6 YZ |
1101 | /* |
1102 | * insert root back/forward references | |
1103 | */ | |
1104 | ret = btrfs_add_root_ref(trans, tree_root, objectid, | |
0660b5af | 1105 | parent_root->root_key.objectid, |
33345d01 | 1106 | btrfs_ino(parent_inode), index, |
a22285a6 | 1107 | dentry->d_name.name, dentry->d_name.len); |
79787eaa | 1108 | dput(parent); |
49b25e05 JM |
1109 | if (ret) |
1110 | goto fail; | |
0660b5af | 1111 | |
a22285a6 YZ |
1112 | key.offset = (u64)-1; |
1113 | pending->snap = btrfs_read_fs_root_no_name(root->fs_info, &key); | |
79787eaa JM |
1114 | if (IS_ERR(pending->snap)) { |
1115 | ret = PTR_ERR(pending->snap); | |
49b25e05 | 1116 | goto abort_trans; |
79787eaa | 1117 | } |
d68fc57b | 1118 | |
49b25e05 JM |
1119 | ret = btrfs_reloc_post_snapshot(trans, pending); |
1120 | if (ret) | |
1121 | goto abort_trans; | |
1122 | ret = 0; | |
3063d29f | 1123 | fail: |
6bdb72de | 1124 | kfree(new_root_item); |
98c9942a | 1125 | trans->block_rsv = rsv; |
a22285a6 | 1126 | btrfs_block_rsv_release(root, &pending->block_rsv, (u64)-1); |
49b25e05 JM |
1127 | return ret; |
1128 | ||
79787eaa JM |
1129 | abort_trans_dput: |
1130 | dput(parent); | |
49b25e05 JM |
1131 | abort_trans: |
1132 | btrfs_abort_transaction(trans, root, ret); | |
1133 | goto fail; | |
3063d29f CM |
1134 | } |
1135 | ||
d352ac68 CM |
1136 | /* |
1137 | * create all the snapshots we've scheduled for creation | |
1138 | */ | |
80b6794d CM |
1139 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans, |
1140 | struct btrfs_fs_info *fs_info) | |
3de4586c CM |
1141 | { |
1142 | struct btrfs_pending_snapshot *pending; | |
1143 | struct list_head *head = &trans->transaction->pending_snapshots; | |
3de4586c | 1144 | |
fe66a05a CM |
1145 | list_for_each_entry(pending, head, list) |
1146 | create_pending_snapshot(trans, fs_info, pending); | |
3de4586c CM |
1147 | return 0; |
1148 | } | |
1149 | ||
5d4f98a2 YZ |
1150 | static void update_super_roots(struct btrfs_root *root) |
1151 | { | |
1152 | struct btrfs_root_item *root_item; | |
1153 | struct btrfs_super_block *super; | |
1154 | ||
6c41761f | 1155 | super = root->fs_info->super_copy; |
5d4f98a2 YZ |
1156 | |
1157 | root_item = &root->fs_info->chunk_root->root_item; | |
1158 | super->chunk_root = root_item->bytenr; | |
1159 | super->chunk_root_generation = root_item->generation; | |
1160 | super->chunk_root_level = root_item->level; | |
1161 | ||
1162 | root_item = &root->fs_info->tree_root->root_item; | |
1163 | super->root = root_item->bytenr; | |
1164 | super->generation = root_item->generation; | |
1165 | super->root_level = root_item->level; | |
73bc1876 | 1166 | if (btrfs_test_opt(root, SPACE_CACHE)) |
0af3d00b | 1167 | super->cache_generation = root_item->generation; |
5d4f98a2 YZ |
1168 | } |
1169 | ||
f36f3042 CM |
1170 | int btrfs_transaction_in_commit(struct btrfs_fs_info *info) |
1171 | { | |
1172 | int ret = 0; | |
a4abeea4 | 1173 | spin_lock(&info->trans_lock); |
f36f3042 CM |
1174 | if (info->running_transaction) |
1175 | ret = info->running_transaction->in_commit; | |
a4abeea4 | 1176 | spin_unlock(&info->trans_lock); |
f36f3042 CM |
1177 | return ret; |
1178 | } | |
1179 | ||
8929ecfa YZ |
1180 | int btrfs_transaction_blocked(struct btrfs_fs_info *info) |
1181 | { | |
1182 | int ret = 0; | |
a4abeea4 | 1183 | spin_lock(&info->trans_lock); |
8929ecfa YZ |
1184 | if (info->running_transaction) |
1185 | ret = info->running_transaction->blocked; | |
a4abeea4 | 1186 | spin_unlock(&info->trans_lock); |
8929ecfa YZ |
1187 | return ret; |
1188 | } | |
1189 | ||
bb9c12c9 SW |
1190 | /* |
1191 | * wait for the current transaction commit to start and block subsequent | |
1192 | * transaction joins | |
1193 | */ | |
1194 | static void wait_current_trans_commit_start(struct btrfs_root *root, | |
1195 | struct btrfs_transaction *trans) | |
1196 | { | |
72d63ed6 | 1197 | wait_event(root->fs_info->transaction_blocked_wait, trans->in_commit); |
bb9c12c9 SW |
1198 | } |
1199 | ||
1200 | /* | |
1201 | * wait for the current transaction to start and then become unblocked. | |
1202 | * caller holds ref. | |
1203 | */ | |
1204 | static void wait_current_trans_commit_start_and_unblock(struct btrfs_root *root, | |
1205 | struct btrfs_transaction *trans) | |
1206 | { | |
72d63ed6 LZ |
1207 | wait_event(root->fs_info->transaction_wait, |
1208 | trans->commit_done || (trans->in_commit && !trans->blocked)); | |
bb9c12c9 SW |
1209 | } |
1210 | ||
1211 | /* | |
1212 | * commit transactions asynchronously. once btrfs_commit_transaction_async | |
1213 | * returns, any subsequent transaction will not be allowed to join. | |
1214 | */ | |
1215 | struct btrfs_async_commit { | |
1216 | struct btrfs_trans_handle *newtrans; | |
1217 | struct btrfs_root *root; | |
1218 | struct delayed_work work; | |
1219 | }; | |
1220 | ||
1221 | static void do_async_commit(struct work_struct *work) | |
1222 | { | |
1223 | struct btrfs_async_commit *ac = | |
1224 | container_of(work, struct btrfs_async_commit, work.work); | |
1225 | ||
1226 | btrfs_commit_transaction(ac->newtrans, ac->root); | |
1227 | kfree(ac); | |
1228 | } | |
1229 | ||
1230 | int btrfs_commit_transaction_async(struct btrfs_trans_handle *trans, | |
1231 | struct btrfs_root *root, | |
1232 | int wait_for_unblock) | |
1233 | { | |
1234 | struct btrfs_async_commit *ac; | |
1235 | struct btrfs_transaction *cur_trans; | |
1236 | ||
1237 | ac = kmalloc(sizeof(*ac), GFP_NOFS); | |
db5b493a TI |
1238 | if (!ac) |
1239 | return -ENOMEM; | |
bb9c12c9 SW |
1240 | |
1241 | INIT_DELAYED_WORK(&ac->work, do_async_commit); | |
1242 | ac->root = root; | |
7a7eaa40 | 1243 | ac->newtrans = btrfs_join_transaction(root); |
3612b495 TI |
1244 | if (IS_ERR(ac->newtrans)) { |
1245 | int err = PTR_ERR(ac->newtrans); | |
1246 | kfree(ac); | |
1247 | return err; | |
1248 | } | |
bb9c12c9 SW |
1249 | |
1250 | /* take transaction reference */ | |
bb9c12c9 | 1251 | cur_trans = trans->transaction; |
13c5a93e | 1252 | atomic_inc(&cur_trans->use_count); |
bb9c12c9 SW |
1253 | |
1254 | btrfs_end_transaction(trans, root); | |
1255 | schedule_delayed_work(&ac->work, 0); | |
1256 | ||
1257 | /* wait for transaction to start and unblock */ | |
bb9c12c9 SW |
1258 | if (wait_for_unblock) |
1259 | wait_current_trans_commit_start_and_unblock(root, cur_trans); | |
1260 | else | |
1261 | wait_current_trans_commit_start(root, cur_trans); | |
bb9c12c9 | 1262 | |
38e88054 SW |
1263 | if (current->journal_info == trans) |
1264 | current->journal_info = NULL; | |
1265 | ||
1266 | put_transaction(cur_trans); | |
bb9c12c9 SW |
1267 | return 0; |
1268 | } | |
1269 | ||
49b25e05 JM |
1270 | |
1271 | static void cleanup_transaction(struct btrfs_trans_handle *trans, | |
7b8b92af | 1272 | struct btrfs_root *root, int err) |
49b25e05 JM |
1273 | { |
1274 | struct btrfs_transaction *cur_trans = trans->transaction; | |
1275 | ||
1276 | WARN_ON(trans->use_count > 1); | |
1277 | ||
7b8b92af JB |
1278 | btrfs_abort_transaction(trans, root, err); |
1279 | ||
49b25e05 JM |
1280 | spin_lock(&root->fs_info->trans_lock); |
1281 | list_del_init(&cur_trans->list); | |
d7096fc3 JB |
1282 | if (cur_trans == root->fs_info->running_transaction) { |
1283 | root->fs_info->running_transaction = NULL; | |
1284 | root->fs_info->trans_no_join = 0; | |
1285 | } | |
49b25e05 JM |
1286 | spin_unlock(&root->fs_info->trans_lock); |
1287 | ||
1288 | btrfs_cleanup_one_transaction(trans->transaction, root); | |
1289 | ||
1290 | put_transaction(cur_trans); | |
1291 | put_transaction(cur_trans); | |
1292 | ||
1293 | trace_btrfs_transaction_commit(root); | |
1294 | ||
1295 | btrfs_scrub_continue(root); | |
1296 | ||
1297 | if (current->journal_info == trans) | |
1298 | current->journal_info = NULL; | |
1299 | ||
1300 | kmem_cache_free(btrfs_trans_handle_cachep, trans); | |
1301 | } | |
1302 | ||
bb9c12c9 SW |
1303 | /* |
1304 | * btrfs_transaction state sequence: | |
1305 | * in_commit = 0, blocked = 0 (initial) | |
1306 | * in_commit = 1, blocked = 1 | |
1307 | * blocked = 0 | |
1308 | * commit_done = 1 | |
1309 | */ | |
79154b1b CM |
1310 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans, |
1311 | struct btrfs_root *root) | |
1312 | { | |
15ee9bc7 | 1313 | unsigned long joined = 0; |
49b25e05 | 1314 | struct btrfs_transaction *cur_trans = trans->transaction; |
8fd17795 | 1315 | struct btrfs_transaction *prev_trans = NULL; |
79154b1b | 1316 | DEFINE_WAIT(wait); |
49b25e05 | 1317 | int ret = -EIO; |
89573b9c CM |
1318 | int should_grow = 0; |
1319 | unsigned long now = get_seconds(); | |
dccae999 | 1320 | int flush_on_commit = btrfs_test_opt(root, FLUSHONCOMMIT); |
79154b1b | 1321 | |
5a3f23d5 CM |
1322 | btrfs_run_ordered_operations(root, 0); |
1323 | ||
49b25e05 JM |
1324 | if (cur_trans->aborted) |
1325 | goto cleanup_transaction; | |
1326 | ||
56bec294 CM |
1327 | /* make a pass through all the delayed refs we have so far |
1328 | * any runnings procs may add more while we are here | |
1329 | */ | |
1330 | ret = btrfs_run_delayed_refs(trans, root, 0); | |
49b25e05 JM |
1331 | if (ret) |
1332 | goto cleanup_transaction; | |
56bec294 | 1333 | |
0e721106 JB |
1334 | btrfs_trans_release_metadata(trans, root); |
1335 | trans->block_rsv = NULL; | |
1336 | ||
b7ec40d7 | 1337 | cur_trans = trans->transaction; |
49b25e05 | 1338 | |
56bec294 CM |
1339 | /* |
1340 | * set the flushing flag so procs in this transaction have to | |
1341 | * start sending their work down. | |
1342 | */ | |
b7ec40d7 | 1343 | cur_trans->delayed_refs.flushing = 1; |
56bec294 | 1344 | |
c3e69d58 | 1345 | ret = btrfs_run_delayed_refs(trans, root, 0); |
49b25e05 JM |
1346 | if (ret) |
1347 | goto cleanup_transaction; | |
56bec294 | 1348 | |
a4abeea4 | 1349 | spin_lock(&cur_trans->commit_lock); |
b7ec40d7 | 1350 | if (cur_trans->in_commit) { |
a4abeea4 | 1351 | spin_unlock(&cur_trans->commit_lock); |
13c5a93e | 1352 | atomic_inc(&cur_trans->use_count); |
49b25e05 | 1353 | ret = btrfs_end_transaction(trans, root); |
ccd467d6 | 1354 | |
b9c8300c | 1355 | wait_for_commit(root, cur_trans); |
15ee9bc7 | 1356 | |
79154b1b | 1357 | put_transaction(cur_trans); |
15ee9bc7 | 1358 | |
49b25e05 | 1359 | return ret; |
79154b1b | 1360 | } |
4313b399 | 1361 | |
2c90e5d6 | 1362 | trans->transaction->in_commit = 1; |
f9295749 | 1363 | trans->transaction->blocked = 1; |
a4abeea4 | 1364 | spin_unlock(&cur_trans->commit_lock); |
bb9c12c9 SW |
1365 | wake_up(&root->fs_info->transaction_blocked_wait); |
1366 | ||
a4abeea4 | 1367 | spin_lock(&root->fs_info->trans_lock); |
ccd467d6 CM |
1368 | if (cur_trans->list.prev != &root->fs_info->trans_list) { |
1369 | prev_trans = list_entry(cur_trans->list.prev, | |
1370 | struct btrfs_transaction, list); | |
1371 | if (!prev_trans->commit_done) { | |
13c5a93e | 1372 | atomic_inc(&prev_trans->use_count); |
a4abeea4 | 1373 | spin_unlock(&root->fs_info->trans_lock); |
ccd467d6 CM |
1374 | |
1375 | wait_for_commit(root, prev_trans); | |
ccd467d6 | 1376 | |
15ee9bc7 | 1377 | put_transaction(prev_trans); |
a4abeea4 JB |
1378 | } else { |
1379 | spin_unlock(&root->fs_info->trans_lock); | |
ccd467d6 | 1380 | } |
a4abeea4 JB |
1381 | } else { |
1382 | spin_unlock(&root->fs_info->trans_lock); | |
ccd467d6 | 1383 | } |
15ee9bc7 | 1384 | |
e39e64ac CM |
1385 | if (!btrfs_test_opt(root, SSD) && |
1386 | (now < cur_trans->start_time || now - cur_trans->start_time < 1)) | |
89573b9c CM |
1387 | should_grow = 1; |
1388 | ||
15ee9bc7 | 1389 | do { |
7ea394f1 | 1390 | int snap_pending = 0; |
a4abeea4 | 1391 | |
15ee9bc7 | 1392 | joined = cur_trans->num_joined; |
7ea394f1 YZ |
1393 | if (!list_empty(&trans->transaction->pending_snapshots)) |
1394 | snap_pending = 1; | |
1395 | ||
2c90e5d6 | 1396 | WARN_ON(cur_trans != trans->transaction); |
15ee9bc7 | 1397 | |
0bdb1db2 | 1398 | if (flush_on_commit || snap_pending) { |
24bbcf04 | 1399 | btrfs_start_delalloc_inodes(root, 1); |
143bede5 | 1400 | btrfs_wait_ordered_extents(root, 0, 1); |
7ea394f1 YZ |
1401 | } |
1402 | ||
16cdcec7 | 1403 | ret = btrfs_run_delayed_items(trans, root); |
49b25e05 JM |
1404 | if (ret) |
1405 | goto cleanup_transaction; | |
16cdcec7 | 1406 | |
edf39272 JS |
1407 | /* |
1408 | * running the delayed items may have added new refs. account | |
1409 | * them now so that they hinder processing of more delayed refs | |
1410 | * as little as possible. | |
1411 | */ | |
1412 | btrfs_delayed_refs_qgroup_accounting(trans, root->fs_info); | |
1413 | ||
5a3f23d5 CM |
1414 | /* |
1415 | * rename don't use btrfs_join_transaction, so, once we | |
1416 | * set the transaction to blocked above, we aren't going | |
1417 | * to get any new ordered operations. We can safely run | |
1418 | * it here and no for sure that nothing new will be added | |
1419 | * to the list | |
1420 | */ | |
1421 | btrfs_run_ordered_operations(root, 1); | |
1422 | ||
ed3b3d31 CM |
1423 | prepare_to_wait(&cur_trans->writer_wait, &wait, |
1424 | TASK_UNINTERRUPTIBLE); | |
1425 | ||
13c5a93e | 1426 | if (atomic_read(&cur_trans->num_writers) > 1) |
99d16cbc SW |
1427 | schedule_timeout(MAX_SCHEDULE_TIMEOUT); |
1428 | else if (should_grow) | |
1429 | schedule_timeout(1); | |
15ee9bc7 | 1430 | |
15ee9bc7 | 1431 | finish_wait(&cur_trans->writer_wait, &wait); |
13c5a93e | 1432 | } while (atomic_read(&cur_trans->num_writers) > 1 || |
89573b9c | 1433 | (should_grow && cur_trans->num_joined != joined)); |
15ee9bc7 | 1434 | |
ed0ca140 JB |
1435 | /* |
1436 | * Ok now we need to make sure to block out any other joins while we | |
1437 | * commit the transaction. We could have started a join before setting | |
1438 | * no_join so make sure to wait for num_writers to == 1 again. | |
1439 | */ | |
1440 | spin_lock(&root->fs_info->trans_lock); | |
1441 | root->fs_info->trans_no_join = 1; | |
1442 | spin_unlock(&root->fs_info->trans_lock); | |
1443 | wait_event(cur_trans->writer_wait, | |
1444 | atomic_read(&cur_trans->num_writers) == 1); | |
1445 | ||
7585717f CM |
1446 | /* |
1447 | * the reloc mutex makes sure that we stop | |
1448 | * the balancing code from coming in and moving | |
1449 | * extents around in the middle of the commit | |
1450 | */ | |
1451 | mutex_lock(&root->fs_info->reloc_mutex); | |
1452 | ||
e999376f | 1453 | ret = btrfs_run_delayed_items(trans, root); |
49b25e05 JM |
1454 | if (ret) { |
1455 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1456 | goto cleanup_transaction; | |
1457 | } | |
3063d29f | 1458 | |
e999376f | 1459 | ret = create_pending_snapshots(trans, root->fs_info); |
49b25e05 JM |
1460 | if (ret) { |
1461 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1462 | goto cleanup_transaction; | |
1463 | } | |
16cdcec7 | 1464 | |
56bec294 | 1465 | ret = btrfs_run_delayed_refs(trans, root, (unsigned long)-1); |
49b25e05 JM |
1466 | if (ret) { |
1467 | mutex_unlock(&root->fs_info->reloc_mutex); | |
1468 | goto cleanup_transaction; | |
1469 | } | |
56bec294 | 1470 | |
e999376f CM |
1471 | /* |
1472 | * make sure none of the code above managed to slip in a | |
1473 | * delayed item | |
1474 | */ | |
1475 | btrfs_assert_delayed_root_empty(root); | |
1476 | ||
2c90e5d6 | 1477 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 1478 | |
a2de733c | 1479 | btrfs_scrub_pause(root); |
e02119d5 CM |
1480 | /* btrfs_commit_tree_roots is responsible for getting the |
1481 | * various roots consistent with each other. Every pointer | |
1482 | * in the tree of tree roots has to point to the most up to date | |
1483 | * root for every subvolume and other tree. So, we have to keep | |
1484 | * the tree logging code from jumping in and changing any | |
1485 | * of the trees. | |
1486 | * | |
1487 | * At this point in the commit, there can't be any tree-log | |
1488 | * writers, but a little lower down we drop the trans mutex | |
1489 | * and let new people in. By holding the tree_log_mutex | |
1490 | * from now until after the super is written, we avoid races | |
1491 | * with the tree-log code. | |
1492 | */ | |
1493 | mutex_lock(&root->fs_info->tree_log_mutex); | |
1494 | ||
5d4f98a2 | 1495 | ret = commit_fs_roots(trans, root); |
49b25e05 JM |
1496 | if (ret) { |
1497 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
871383be | 1498 | mutex_unlock(&root->fs_info->reloc_mutex); |
49b25e05 JM |
1499 | goto cleanup_transaction; |
1500 | } | |
54aa1f4d | 1501 | |
5d4f98a2 | 1502 | /* commit_fs_roots gets rid of all the tree log roots, it is now |
e02119d5 CM |
1503 | * safe to free the root of tree log roots |
1504 | */ | |
1505 | btrfs_free_log_root_tree(trans, root->fs_info); | |
1506 | ||
5d4f98a2 | 1507 | ret = commit_cowonly_roots(trans, root); |
49b25e05 JM |
1508 | if (ret) { |
1509 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
871383be | 1510 | mutex_unlock(&root->fs_info->reloc_mutex); |
49b25e05 JM |
1511 | goto cleanup_transaction; |
1512 | } | |
54aa1f4d | 1513 | |
11833d66 YZ |
1514 | btrfs_prepare_extent_commit(trans, root); |
1515 | ||
78fae27e | 1516 | cur_trans = root->fs_info->running_transaction; |
5d4f98a2 YZ |
1517 | |
1518 | btrfs_set_root_node(&root->fs_info->tree_root->root_item, | |
1519 | root->fs_info->tree_root->node); | |
817d52f8 | 1520 | switch_commit_root(root->fs_info->tree_root); |
5d4f98a2 YZ |
1521 | |
1522 | btrfs_set_root_node(&root->fs_info->chunk_root->root_item, | |
1523 | root->fs_info->chunk_root->node); | |
817d52f8 | 1524 | switch_commit_root(root->fs_info->chunk_root); |
5d4f98a2 | 1525 | |
edf39272 | 1526 | assert_qgroups_uptodate(trans); |
5d4f98a2 | 1527 | update_super_roots(root); |
e02119d5 CM |
1528 | |
1529 | if (!root->fs_info->log_root_recovering) { | |
6c41761f DS |
1530 | btrfs_set_super_log_root(root->fs_info->super_copy, 0); |
1531 | btrfs_set_super_log_root_level(root->fs_info->super_copy, 0); | |
e02119d5 CM |
1532 | } |
1533 | ||
6c41761f DS |
1534 | memcpy(root->fs_info->super_for_commit, root->fs_info->super_copy, |
1535 | sizeof(*root->fs_info->super_copy)); | |
ccd467d6 | 1536 | |
f9295749 | 1537 | trans->transaction->blocked = 0; |
a4abeea4 JB |
1538 | spin_lock(&root->fs_info->trans_lock); |
1539 | root->fs_info->running_transaction = NULL; | |
1540 | root->fs_info->trans_no_join = 0; | |
1541 | spin_unlock(&root->fs_info->trans_lock); | |
7585717f | 1542 | mutex_unlock(&root->fs_info->reloc_mutex); |
b7ec40d7 | 1543 | |
f9295749 | 1544 | wake_up(&root->fs_info->transaction_wait); |
e6dcd2dc | 1545 | |
79154b1b | 1546 | ret = btrfs_write_and_wait_transaction(trans, root); |
49b25e05 JM |
1547 | if (ret) { |
1548 | btrfs_error(root->fs_info, ret, | |
1549 | "Error while writing out transaction."); | |
1550 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1551 | goto cleanup_transaction; | |
1552 | } | |
1553 | ||
1554 | ret = write_ctree_super(trans, root, 0); | |
1555 | if (ret) { | |
1556 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1557 | goto cleanup_transaction; | |
1558 | } | |
4313b399 | 1559 | |
e02119d5 CM |
1560 | /* |
1561 | * the super is written, we can safely allow the tree-loggers | |
1562 | * to go about their business | |
1563 | */ | |
1564 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
1565 | ||
11833d66 | 1566 | btrfs_finish_extent_commit(trans, root); |
4313b399 | 1567 | |
2c90e5d6 | 1568 | cur_trans->commit_done = 1; |
b7ec40d7 | 1569 | |
15ee9bc7 | 1570 | root->fs_info->last_trans_committed = cur_trans->transid; |
817d52f8 | 1571 | |
2c90e5d6 | 1572 | wake_up(&cur_trans->commit_wait); |
3de4586c | 1573 | |
a4abeea4 | 1574 | spin_lock(&root->fs_info->trans_lock); |
13c5a93e | 1575 | list_del_init(&cur_trans->list); |
a4abeea4 JB |
1576 | spin_unlock(&root->fs_info->trans_lock); |
1577 | ||
78fae27e | 1578 | put_transaction(cur_trans); |
79154b1b | 1579 | put_transaction(cur_trans); |
58176a96 | 1580 | |
1abe9b8a | 1581 | trace_btrfs_transaction_commit(root); |
1582 | ||
a2de733c AJ |
1583 | btrfs_scrub_continue(root); |
1584 | ||
9ed74f2d JB |
1585 | if (current->journal_info == trans) |
1586 | current->journal_info = NULL; | |
1587 | ||
2c90e5d6 | 1588 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
24bbcf04 YZ |
1589 | |
1590 | if (current != root->fs_info->transaction_kthread) | |
1591 | btrfs_run_delayed_iputs(root); | |
1592 | ||
79154b1b | 1593 | return ret; |
49b25e05 JM |
1594 | |
1595 | cleanup_transaction: | |
0e721106 JB |
1596 | btrfs_trans_release_metadata(trans, root); |
1597 | trans->block_rsv = NULL; | |
49b25e05 JM |
1598 | btrfs_printk(root->fs_info, "Skipping commit of aborted transaction.\n"); |
1599 | // WARN_ON(1); | |
1600 | if (current->journal_info == trans) | |
1601 | current->journal_info = NULL; | |
7b8b92af | 1602 | cleanup_transaction(trans, root, ret); |
49b25e05 JM |
1603 | |
1604 | return ret; | |
79154b1b CM |
1605 | } |
1606 | ||
d352ac68 CM |
1607 | /* |
1608 | * interface function to delete all the snapshots we have scheduled for deletion | |
1609 | */ | |
e9d0b13b CM |
1610 | int btrfs_clean_old_snapshots(struct btrfs_root *root) |
1611 | { | |
5d4f98a2 YZ |
1612 | LIST_HEAD(list); |
1613 | struct btrfs_fs_info *fs_info = root->fs_info; | |
1614 | ||
a4abeea4 | 1615 | spin_lock(&fs_info->trans_lock); |
5d4f98a2 | 1616 | list_splice_init(&fs_info->dead_roots, &list); |
a4abeea4 | 1617 | spin_unlock(&fs_info->trans_lock); |
e9d0b13b | 1618 | |
5d4f98a2 | 1619 | while (!list_empty(&list)) { |
2c536799 JM |
1620 | int ret; |
1621 | ||
5d4f98a2 | 1622 | root = list_entry(list.next, struct btrfs_root, root_list); |
76dda93c YZ |
1623 | list_del(&root->root_list); |
1624 | ||
16cdcec7 MX |
1625 | btrfs_kill_all_delayed_nodes(root); |
1626 | ||
76dda93c YZ |
1627 | if (btrfs_header_backref_rev(root->node) < |
1628 | BTRFS_MIXED_BACKREF_REV) | |
2c536799 | 1629 | ret = btrfs_drop_snapshot(root, NULL, 0, 0); |
76dda93c | 1630 | else |
2c536799 JM |
1631 | ret =btrfs_drop_snapshot(root, NULL, 1, 0); |
1632 | BUG_ON(ret < 0); | |
e9d0b13b CM |
1633 | } |
1634 | return 0; | |
1635 | } |