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