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