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> |
34088780 | 20 | #include <linux/sched.h> |
d3c2fdcf | 21 | #include <linux/writeback.h> |
5f39d397 | 22 | #include <linux/pagemap.h> |
79154b1b CM |
23 | #include "ctree.h" |
24 | #include "disk-io.h" | |
25 | #include "transaction.h" | |
925baedd | 26 | #include "locking.h" |
31153d81 | 27 | #include "ref-cache.h" |
e02119d5 | 28 | #include "tree-log.h" |
79154b1b | 29 | |
78fae27e | 30 | static int total_trans = 0; |
2c90e5d6 CM |
31 | extern struct kmem_cache *btrfs_trans_handle_cachep; |
32 | extern struct kmem_cache *btrfs_transaction_cachep; | |
33 | ||
0f7d52f4 CM |
34 | #define BTRFS_ROOT_TRANS_TAG 0 |
35 | ||
80b6794d | 36 | static noinline void put_transaction(struct btrfs_transaction *transaction) |
79154b1b | 37 | { |
2c90e5d6 | 38 | WARN_ON(transaction->use_count == 0); |
79154b1b | 39 | transaction->use_count--; |
78fae27e CM |
40 | if (transaction->use_count == 0) { |
41 | WARN_ON(total_trans == 0); | |
42 | total_trans--; | |
8fd17795 | 43 | list_del_init(&transaction->list); |
2c90e5d6 CM |
44 | memset(transaction, 0, sizeof(*transaction)); |
45 | kmem_cache_free(btrfs_transaction_cachep, transaction); | |
78fae27e | 46 | } |
79154b1b CM |
47 | } |
48 | ||
80b6794d | 49 | static noinline int join_transaction(struct btrfs_root *root) |
79154b1b CM |
50 | { |
51 | struct btrfs_transaction *cur_trans; | |
52 | cur_trans = root->fs_info->running_transaction; | |
53 | if (!cur_trans) { | |
2c90e5d6 CM |
54 | cur_trans = kmem_cache_alloc(btrfs_transaction_cachep, |
55 | GFP_NOFS); | |
78fae27e | 56 | total_trans++; |
79154b1b | 57 | BUG_ON(!cur_trans); |
0f7d52f4 | 58 | root->fs_info->generation++; |
e18e4809 | 59 | root->fs_info->last_alloc = 0; |
4529ba49 | 60 | root->fs_info->last_data_alloc = 0; |
e02119d5 | 61 | root->fs_info->last_log_alloc = 0; |
15ee9bc7 JB |
62 | cur_trans->num_writers = 1; |
63 | cur_trans->num_joined = 0; | |
0f7d52f4 | 64 | cur_trans->transid = root->fs_info->generation; |
79154b1b CM |
65 | init_waitqueue_head(&cur_trans->writer_wait); |
66 | init_waitqueue_head(&cur_trans->commit_wait); | |
67 | cur_trans->in_commit = 0; | |
f9295749 | 68 | cur_trans->blocked = 0; |
d5719762 | 69 | cur_trans->use_count = 1; |
79154b1b | 70 | cur_trans->commit_done = 0; |
08607c1b | 71 | cur_trans->start_time = get_seconds(); |
3063d29f | 72 | INIT_LIST_HEAD(&cur_trans->pending_snapshots); |
8fd17795 | 73 | list_add_tail(&cur_trans->list, &root->fs_info->trans_list); |
d1310b2e | 74 | extent_io_tree_init(&cur_trans->dirty_pages, |
5f39d397 CM |
75 | root->fs_info->btree_inode->i_mapping, |
76 | GFP_NOFS); | |
48ec2cf8 CM |
77 | spin_lock(&root->fs_info->new_trans_lock); |
78 | root->fs_info->running_transaction = cur_trans; | |
79 | spin_unlock(&root->fs_info->new_trans_lock); | |
15ee9bc7 JB |
80 | } else { |
81 | cur_trans->num_writers++; | |
82 | cur_trans->num_joined++; | |
79154b1b | 83 | } |
15ee9bc7 | 84 | |
79154b1b CM |
85 | return 0; |
86 | } | |
87 | ||
e02119d5 | 88 | noinline int btrfs_record_root_in_trans(struct btrfs_root *root) |
6702ed49 | 89 | { |
f321e491 | 90 | struct btrfs_dirty_root *dirty; |
6702ed49 CM |
91 | u64 running_trans_id = root->fs_info->running_transaction->transid; |
92 | if (root->ref_cows && root->last_trans < running_trans_id) { | |
93 | WARN_ON(root == root->fs_info->extent_root); | |
94 | if (root->root_item.refs != 0) { | |
95 | radix_tree_tag_set(&root->fs_info->fs_roots_radix, | |
96 | (unsigned long)root->root_key.objectid, | |
97 | BTRFS_ROOT_TRANS_TAG); | |
31153d81 YZ |
98 | |
99 | dirty = kmalloc(sizeof(*dirty), GFP_NOFS); | |
100 | BUG_ON(!dirty); | |
101 | dirty->root = kmalloc(sizeof(*dirty->root), GFP_NOFS); | |
102 | BUG_ON(!dirty->root); | |
31153d81 YZ |
103 | dirty->latest_root = root; |
104 | INIT_LIST_HEAD(&dirty->list); | |
31153d81 | 105 | |
925baedd | 106 | root->commit_root = btrfs_root_node(root); |
31153d81 YZ |
107 | |
108 | memcpy(dirty->root, root, sizeof(*root)); | |
109 | spin_lock_init(&dirty->root->node_lock); | |
bcc63abb | 110 | spin_lock_init(&dirty->root->list_lock); |
31153d81 | 111 | mutex_init(&dirty->root->objectid_mutex); |
5b21f2ed | 112 | mutex_init(&dirty->root->log_mutex); |
bcc63abb | 113 | INIT_LIST_HEAD(&dirty->root->dead_list); |
31153d81 YZ |
114 | dirty->root->node = root->commit_root; |
115 | dirty->root->commit_root = NULL; | |
bcc63abb Y |
116 | |
117 | spin_lock(&root->list_lock); | |
118 | list_add(&dirty->root->dead_list, &root->dead_list); | |
119 | spin_unlock(&root->list_lock); | |
120 | ||
121 | root->dirty_root = dirty; | |
6702ed49 CM |
122 | } else { |
123 | WARN_ON(1); | |
124 | } | |
125 | root->last_trans = running_trans_id; | |
126 | } | |
127 | return 0; | |
128 | } | |
129 | ||
37d1aeee | 130 | static void wait_current_trans(struct btrfs_root *root) |
79154b1b | 131 | { |
f9295749 | 132 | struct btrfs_transaction *cur_trans; |
79154b1b | 133 | |
f9295749 | 134 | cur_trans = root->fs_info->running_transaction; |
37d1aeee | 135 | if (cur_trans && cur_trans->blocked) { |
f9295749 CM |
136 | DEFINE_WAIT(wait); |
137 | cur_trans->use_count++; | |
138 | while(1) { | |
139 | prepare_to_wait(&root->fs_info->transaction_wait, &wait, | |
140 | TASK_UNINTERRUPTIBLE); | |
141 | if (cur_trans->blocked) { | |
142 | mutex_unlock(&root->fs_info->trans_mutex); | |
143 | schedule(); | |
144 | mutex_lock(&root->fs_info->trans_mutex); | |
145 | finish_wait(&root->fs_info->transaction_wait, | |
146 | &wait); | |
147 | } else { | |
148 | finish_wait(&root->fs_info->transaction_wait, | |
149 | &wait); | |
150 | break; | |
151 | } | |
152 | } | |
153 | put_transaction(cur_trans); | |
154 | } | |
37d1aeee CM |
155 | } |
156 | ||
e02119d5 | 157 | static struct btrfs_trans_handle *start_transaction(struct btrfs_root *root, |
9ca9ee09 | 158 | int num_blocks, int wait) |
37d1aeee CM |
159 | { |
160 | struct btrfs_trans_handle *h = | |
161 | kmem_cache_alloc(btrfs_trans_handle_cachep, GFP_NOFS); | |
162 | int ret; | |
163 | ||
164 | mutex_lock(&root->fs_info->trans_mutex); | |
4bef0848 CM |
165 | if (!root->fs_info->log_root_recovering && |
166 | ((wait == 1 && !root->fs_info->open_ioctl_trans) || wait == 2)) | |
37d1aeee | 167 | wait_current_trans(root); |
79154b1b CM |
168 | ret = join_transaction(root); |
169 | BUG_ON(ret); | |
0f7d52f4 | 170 | |
e02119d5 | 171 | btrfs_record_root_in_trans(root); |
6702ed49 | 172 | h->transid = root->fs_info->running_transaction->transid; |
79154b1b CM |
173 | h->transaction = root->fs_info->running_transaction; |
174 | h->blocks_reserved = num_blocks; | |
175 | h->blocks_used = 0; | |
31f3c99b | 176 | h->block_group = NULL; |
26b8003f CM |
177 | h->alloc_exclude_nr = 0; |
178 | h->alloc_exclude_start = 0; | |
79154b1b CM |
179 | root->fs_info->running_transaction->use_count++; |
180 | mutex_unlock(&root->fs_info->trans_mutex); | |
181 | return h; | |
182 | } | |
183 | ||
f9295749 CM |
184 | struct btrfs_trans_handle *btrfs_start_transaction(struct btrfs_root *root, |
185 | int num_blocks) | |
186 | { | |
9ca9ee09 | 187 | return start_transaction(root, num_blocks, 1); |
f9295749 CM |
188 | } |
189 | struct btrfs_trans_handle *btrfs_join_transaction(struct btrfs_root *root, | |
190 | int num_blocks) | |
191 | { | |
9ca9ee09 | 192 | return start_transaction(root, num_blocks, 0); |
f9295749 CM |
193 | } |
194 | ||
9ca9ee09 SW |
195 | struct btrfs_trans_handle *btrfs_start_ioctl_transaction(struct btrfs_root *r, |
196 | int num_blocks) | |
197 | { | |
198 | return start_transaction(r, num_blocks, 2); | |
199 | } | |
200 | ||
201 | ||
89ce8a63 CM |
202 | static noinline int wait_for_commit(struct btrfs_root *root, |
203 | struct btrfs_transaction *commit) | |
204 | { | |
205 | DEFINE_WAIT(wait); | |
206 | mutex_lock(&root->fs_info->trans_mutex); | |
207 | while(!commit->commit_done) { | |
208 | prepare_to_wait(&commit->commit_wait, &wait, | |
209 | TASK_UNINTERRUPTIBLE); | |
210 | if (commit->commit_done) | |
211 | break; | |
212 | mutex_unlock(&root->fs_info->trans_mutex); | |
213 | schedule(); | |
214 | mutex_lock(&root->fs_info->trans_mutex); | |
215 | } | |
216 | mutex_unlock(&root->fs_info->trans_mutex); | |
217 | finish_wait(&commit->commit_wait, &wait); | |
218 | return 0; | |
219 | } | |
220 | ||
37d1aeee | 221 | static void throttle_on_drops(struct btrfs_root *root) |
ab78c84d CM |
222 | { |
223 | struct btrfs_fs_info *info = root->fs_info; | |
2dd3e67b | 224 | int harder_count = 0; |
ab78c84d | 225 | |
2dd3e67b | 226 | harder: |
ab78c84d CM |
227 | if (atomic_read(&info->throttles)) { |
228 | DEFINE_WAIT(wait); | |
229 | int thr; | |
ab78c84d CM |
230 | thr = atomic_read(&info->throttle_gen); |
231 | ||
232 | do { | |
233 | prepare_to_wait(&info->transaction_throttle, | |
234 | &wait, TASK_UNINTERRUPTIBLE); | |
235 | if (!atomic_read(&info->throttles)) { | |
236 | finish_wait(&info->transaction_throttle, &wait); | |
237 | break; | |
238 | } | |
239 | schedule(); | |
240 | finish_wait(&info->transaction_throttle, &wait); | |
241 | } while (thr == atomic_read(&info->throttle_gen)); | |
2dd3e67b CM |
242 | harder_count++; |
243 | ||
244 | if (root->fs_info->total_ref_cache_size > 1 * 1024 * 1024 && | |
245 | harder_count < 2) | |
246 | goto harder; | |
247 | ||
248 | if (root->fs_info->total_ref_cache_size > 5 * 1024 * 1024 && | |
249 | harder_count < 10) | |
250 | goto harder; | |
251 | ||
252 | if (root->fs_info->total_ref_cache_size > 10 * 1024 * 1024 && | |
253 | harder_count < 20) | |
254 | goto harder; | |
ab78c84d CM |
255 | } |
256 | } | |
257 | ||
37d1aeee CM |
258 | void btrfs_throttle(struct btrfs_root *root) |
259 | { | |
260 | mutex_lock(&root->fs_info->trans_mutex); | |
9ca9ee09 SW |
261 | if (!root->fs_info->open_ioctl_trans) |
262 | wait_current_trans(root); | |
37d1aeee CM |
263 | mutex_unlock(&root->fs_info->trans_mutex); |
264 | ||
265 | throttle_on_drops(root); | |
266 | } | |
267 | ||
89ce8a63 CM |
268 | static int __btrfs_end_transaction(struct btrfs_trans_handle *trans, |
269 | struct btrfs_root *root, int throttle) | |
79154b1b CM |
270 | { |
271 | struct btrfs_transaction *cur_trans; | |
ab78c84d | 272 | struct btrfs_fs_info *info = root->fs_info; |
d6e4a428 | 273 | |
ab78c84d CM |
274 | mutex_lock(&info->trans_mutex); |
275 | cur_trans = info->running_transaction; | |
ccd467d6 | 276 | WARN_ON(cur_trans != trans->transaction); |
d5719762 | 277 | WARN_ON(cur_trans->num_writers < 1); |
ccd467d6 | 278 | cur_trans->num_writers--; |
89ce8a63 | 279 | |
79154b1b CM |
280 | if (waitqueue_active(&cur_trans->writer_wait)) |
281 | wake_up(&cur_trans->writer_wait); | |
79154b1b | 282 | put_transaction(cur_trans); |
ab78c84d | 283 | mutex_unlock(&info->trans_mutex); |
d6025579 | 284 | memset(trans, 0, sizeof(*trans)); |
2c90e5d6 | 285 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
ab78c84d CM |
286 | |
287 | if (throttle) | |
37d1aeee | 288 | throttle_on_drops(root); |
ab78c84d | 289 | |
79154b1b CM |
290 | return 0; |
291 | } | |
292 | ||
89ce8a63 CM |
293 | int btrfs_end_transaction(struct btrfs_trans_handle *trans, |
294 | struct btrfs_root *root) | |
295 | { | |
296 | return __btrfs_end_transaction(trans, root, 0); | |
297 | } | |
298 | ||
299 | int btrfs_end_transaction_throttle(struct btrfs_trans_handle *trans, | |
300 | struct btrfs_root *root) | |
301 | { | |
302 | return __btrfs_end_transaction(trans, root, 1); | |
303 | } | |
304 | ||
79154b1b | 305 | |
d0c803c4 CM |
306 | int btrfs_write_and_wait_marked_extents(struct btrfs_root *root, |
307 | struct extent_io_tree *dirty_pages) | |
79154b1b | 308 | { |
7c4452b9 | 309 | int ret; |
777e6bd7 | 310 | int err = 0; |
7c4452b9 CM |
311 | int werr = 0; |
312 | struct page *page; | |
7c4452b9 | 313 | struct inode *btree_inode = root->fs_info->btree_inode; |
777e6bd7 | 314 | u64 start = 0; |
5f39d397 CM |
315 | u64 end; |
316 | unsigned long index; | |
7c4452b9 | 317 | |
7c4452b9 | 318 | while(1) { |
777e6bd7 | 319 | ret = find_first_extent_bit(dirty_pages, start, &start, &end, |
5f39d397 CM |
320 | EXTENT_DIRTY); |
321 | if (ret) | |
7c4452b9 | 322 | break; |
5f39d397 | 323 | while(start <= end) { |
777e6bd7 CM |
324 | cond_resched(); |
325 | ||
5f39d397 | 326 | index = start >> PAGE_CACHE_SHIFT; |
35ebb934 | 327 | start = (u64)(index + 1) << PAGE_CACHE_SHIFT; |
4bef0848 | 328 | page = find_get_page(btree_inode->i_mapping, index); |
7c4452b9 CM |
329 | if (!page) |
330 | continue; | |
4bef0848 CM |
331 | |
332 | btree_lock_page_hook(page); | |
333 | if (!page->mapping) { | |
334 | unlock_page(page); | |
335 | page_cache_release(page); | |
336 | continue; | |
337 | } | |
338 | ||
6702ed49 CM |
339 | if (PageWriteback(page)) { |
340 | if (PageDirty(page)) | |
341 | wait_on_page_writeback(page); | |
342 | else { | |
343 | unlock_page(page); | |
344 | page_cache_release(page); | |
345 | continue; | |
346 | } | |
347 | } | |
7c4452b9 CM |
348 | err = write_one_page(page, 0); |
349 | if (err) | |
350 | werr = err; | |
351 | page_cache_release(page); | |
352 | } | |
353 | } | |
777e6bd7 CM |
354 | while(1) { |
355 | ret = find_first_extent_bit(dirty_pages, 0, &start, &end, | |
356 | EXTENT_DIRTY); | |
357 | if (ret) | |
358 | break; | |
359 | ||
360 | clear_extent_dirty(dirty_pages, start, end, GFP_NOFS); | |
361 | while(start <= end) { | |
362 | index = start >> PAGE_CACHE_SHIFT; | |
363 | start = (u64)(index + 1) << PAGE_CACHE_SHIFT; | |
364 | page = find_get_page(btree_inode->i_mapping, index); | |
365 | if (!page) | |
366 | continue; | |
367 | if (PageDirty(page)) { | |
4bef0848 CM |
368 | btree_lock_page_hook(page); |
369 | wait_on_page_writeback(page); | |
777e6bd7 CM |
370 | err = write_one_page(page, 0); |
371 | if (err) | |
372 | werr = err; | |
373 | } | |
374 | wait_on_page_writeback(page); | |
375 | page_cache_release(page); | |
376 | cond_resched(); | |
377 | } | |
378 | } | |
7c4452b9 CM |
379 | if (err) |
380 | werr = err; | |
381 | return werr; | |
79154b1b CM |
382 | } |
383 | ||
d0c803c4 CM |
384 | int btrfs_write_and_wait_transaction(struct btrfs_trans_handle *trans, |
385 | struct btrfs_root *root) | |
386 | { | |
387 | if (!trans || !trans->transaction) { | |
388 | struct inode *btree_inode; | |
389 | btree_inode = root->fs_info->btree_inode; | |
390 | return filemap_write_and_wait(btree_inode->i_mapping); | |
391 | } | |
392 | return btrfs_write_and_wait_marked_extents(root, | |
393 | &trans->transaction->dirty_pages); | |
394 | } | |
395 | ||
0b86a832 CM |
396 | static int update_cowonly_root(struct btrfs_trans_handle *trans, |
397 | struct btrfs_root *root) | |
79154b1b CM |
398 | { |
399 | int ret; | |
0b86a832 CM |
400 | u64 old_root_bytenr; |
401 | struct btrfs_root *tree_root = root->fs_info->tree_root; | |
79154b1b | 402 | |
0b86a832 | 403 | btrfs_write_dirty_block_groups(trans, root); |
79154b1b | 404 | while(1) { |
0b86a832 CM |
405 | old_root_bytenr = btrfs_root_bytenr(&root->root_item); |
406 | if (old_root_bytenr == root->node->start) | |
79154b1b | 407 | break; |
0b86a832 CM |
408 | btrfs_set_root_bytenr(&root->root_item, |
409 | root->node->start); | |
410 | btrfs_set_root_level(&root->root_item, | |
411 | btrfs_header_level(root->node)); | |
79154b1b | 412 | ret = btrfs_update_root(trans, tree_root, |
0b86a832 CM |
413 | &root->root_key, |
414 | &root->root_item); | |
79154b1b | 415 | BUG_ON(ret); |
0b86a832 CM |
416 | btrfs_write_dirty_block_groups(trans, root); |
417 | } | |
418 | return 0; | |
419 | } | |
420 | ||
421 | int btrfs_commit_tree_roots(struct btrfs_trans_handle *trans, | |
422 | struct btrfs_root *root) | |
423 | { | |
424 | struct btrfs_fs_info *fs_info = root->fs_info; | |
425 | struct list_head *next; | |
426 | ||
427 | while(!list_empty(&fs_info->dirty_cowonly_roots)) { | |
428 | next = fs_info->dirty_cowonly_roots.next; | |
429 | list_del_init(next); | |
430 | root = list_entry(next, struct btrfs_root, dirty_list); | |
431 | update_cowonly_root(trans, root); | |
79154b1b CM |
432 | } |
433 | return 0; | |
434 | } | |
435 | ||
b48652c1 | 436 | int btrfs_add_dead_root(struct btrfs_root *root, struct btrfs_root *latest) |
5eda7b5e | 437 | { |
f321e491 | 438 | struct btrfs_dirty_root *dirty; |
5eda7b5e CM |
439 | |
440 | dirty = kmalloc(sizeof(*dirty), GFP_NOFS); | |
441 | if (!dirty) | |
442 | return -ENOMEM; | |
5eda7b5e | 443 | dirty->root = root; |
5ce14bbc | 444 | dirty->latest_root = latest; |
b48652c1 YZ |
445 | |
446 | mutex_lock(&root->fs_info->trans_mutex); | |
447 | list_add(&dirty->list, &latest->fs_info->dead_roots); | |
448 | mutex_unlock(&root->fs_info->trans_mutex); | |
5eda7b5e CM |
449 | return 0; |
450 | } | |
451 | ||
80b6794d CM |
452 | static noinline int add_dirty_roots(struct btrfs_trans_handle *trans, |
453 | struct radix_tree_root *radix, | |
454 | struct list_head *list) | |
0f7d52f4 | 455 | { |
f321e491 | 456 | struct btrfs_dirty_root *dirty; |
0f7d52f4 CM |
457 | struct btrfs_root *gang[8]; |
458 | struct btrfs_root *root; | |
459 | int i; | |
460 | int ret; | |
54aa1f4d | 461 | int err = 0; |
5eda7b5e | 462 | u32 refs; |
54aa1f4d | 463 | |
0f7d52f4 CM |
464 | while(1) { |
465 | ret = radix_tree_gang_lookup_tag(radix, (void **)gang, 0, | |
466 | ARRAY_SIZE(gang), | |
467 | BTRFS_ROOT_TRANS_TAG); | |
468 | if (ret == 0) | |
469 | break; | |
470 | for (i = 0; i < ret; i++) { | |
471 | root = gang[i]; | |
2619ba1f CM |
472 | radix_tree_tag_clear(radix, |
473 | (unsigned long)root->root_key.objectid, | |
474 | BTRFS_ROOT_TRANS_TAG); | |
31153d81 YZ |
475 | |
476 | BUG_ON(!root->ref_tree); | |
017e5369 | 477 | dirty = root->dirty_root; |
31153d81 | 478 | |
e02119d5 | 479 | btrfs_free_log(trans, root); |
1a40e23b | 480 | btrfs_free_reloc_root(root); |
e02119d5 | 481 | |
0f7d52f4 | 482 | if (root->commit_root == root->node) { |
db94535d CM |
483 | WARN_ON(root->node->start != |
484 | btrfs_root_bytenr(&root->root_item)); | |
31153d81 | 485 | |
5f39d397 | 486 | free_extent_buffer(root->commit_root); |
0f7d52f4 | 487 | root->commit_root = NULL; |
7ea394f1 | 488 | root->dirty_root = NULL; |
bcc63abb Y |
489 | |
490 | spin_lock(&root->list_lock); | |
491 | list_del_init(&dirty->root->dead_list); | |
492 | spin_unlock(&root->list_lock); | |
493 | ||
31153d81 YZ |
494 | kfree(dirty->root); |
495 | kfree(dirty); | |
58176a96 JB |
496 | |
497 | /* make sure to update the root on disk | |
498 | * so we get any updates to the block used | |
499 | * counts | |
500 | */ | |
501 | err = btrfs_update_root(trans, | |
502 | root->fs_info->tree_root, | |
503 | &root->root_key, | |
504 | &root->root_item); | |
0f7d52f4 CM |
505 | continue; |
506 | } | |
9f3a7427 CM |
507 | |
508 | memset(&root->root_item.drop_progress, 0, | |
509 | sizeof(struct btrfs_disk_key)); | |
510 | root->root_item.drop_level = 0; | |
0f7d52f4 | 511 | root->commit_root = NULL; |
7ea394f1 | 512 | root->dirty_root = NULL; |
0f7d52f4 | 513 | root->root_key.offset = root->fs_info->generation; |
db94535d CM |
514 | btrfs_set_root_bytenr(&root->root_item, |
515 | root->node->start); | |
516 | btrfs_set_root_level(&root->root_item, | |
517 | btrfs_header_level(root->node)); | |
0f7d52f4 CM |
518 | err = btrfs_insert_root(trans, root->fs_info->tree_root, |
519 | &root->root_key, | |
520 | &root->root_item); | |
54aa1f4d CM |
521 | if (err) |
522 | break; | |
9f3a7427 CM |
523 | |
524 | refs = btrfs_root_refs(&dirty->root->root_item); | |
525 | btrfs_set_root_refs(&dirty->root->root_item, refs - 1); | |
5eda7b5e | 526 | err = btrfs_update_root(trans, root->fs_info->tree_root, |
9f3a7427 CM |
527 | &dirty->root->root_key, |
528 | &dirty->root->root_item); | |
5eda7b5e CM |
529 | |
530 | BUG_ON(err); | |
9f3a7427 | 531 | if (refs == 1) { |
5eda7b5e | 532 | list_add(&dirty->list, list); |
9f3a7427 CM |
533 | } else { |
534 | WARN_ON(1); | |
31153d81 | 535 | free_extent_buffer(dirty->root->node); |
9f3a7427 | 536 | kfree(dirty->root); |
5eda7b5e | 537 | kfree(dirty); |
9f3a7427 | 538 | } |
0f7d52f4 CM |
539 | } |
540 | } | |
54aa1f4d | 541 | return err; |
0f7d52f4 CM |
542 | } |
543 | ||
e9d0b13b CM |
544 | int btrfs_defrag_root(struct btrfs_root *root, int cacheonly) |
545 | { | |
546 | struct btrfs_fs_info *info = root->fs_info; | |
547 | int ret; | |
548 | struct btrfs_trans_handle *trans; | |
d3c2fdcf | 549 | unsigned long nr; |
e9d0b13b | 550 | |
a2135011 | 551 | smp_mb(); |
e9d0b13b CM |
552 | if (root->defrag_running) |
553 | return 0; | |
e9d0b13b | 554 | trans = btrfs_start_transaction(root, 1); |
6b80053d | 555 | while (1) { |
e9d0b13b CM |
556 | root->defrag_running = 1; |
557 | ret = btrfs_defrag_leaves(trans, root, cacheonly); | |
d3c2fdcf | 558 | nr = trans->blocks_used; |
e9d0b13b | 559 | btrfs_end_transaction(trans, root); |
d3c2fdcf | 560 | btrfs_btree_balance_dirty(info->tree_root, nr); |
e9d0b13b CM |
561 | cond_resched(); |
562 | ||
e9d0b13b | 563 | trans = btrfs_start_transaction(root, 1); |
3f157a2f | 564 | if (root->fs_info->closing || ret != -EAGAIN) |
e9d0b13b CM |
565 | break; |
566 | } | |
567 | root->defrag_running = 0; | |
a2135011 | 568 | smp_mb(); |
e9d0b13b CM |
569 | btrfs_end_transaction(trans, root); |
570 | return 0; | |
571 | } | |
572 | ||
80b6794d CM |
573 | static noinline int drop_dirty_roots(struct btrfs_root *tree_root, |
574 | struct list_head *list) | |
0f7d52f4 | 575 | { |
f321e491 | 576 | struct btrfs_dirty_root *dirty; |
0f7d52f4 | 577 | struct btrfs_trans_handle *trans; |
d3c2fdcf | 578 | unsigned long nr; |
db94535d CM |
579 | u64 num_bytes; |
580 | u64 bytes_used; | |
bcc63abb | 581 | u64 max_useless; |
54aa1f4d | 582 | int ret = 0; |
9f3a7427 CM |
583 | int err; |
584 | ||
0f7d52f4 | 585 | while(!list_empty(list)) { |
58176a96 JB |
586 | struct btrfs_root *root; |
587 | ||
f321e491 | 588 | dirty = list_entry(list->prev, struct btrfs_dirty_root, list); |
0f7d52f4 | 589 | list_del_init(&dirty->list); |
5eda7b5e | 590 | |
db94535d | 591 | num_bytes = btrfs_root_used(&dirty->root->root_item); |
58176a96 | 592 | root = dirty->latest_root; |
a2135011 | 593 | atomic_inc(&root->fs_info->throttles); |
58176a96 | 594 | |
9f3a7427 CM |
595 | while(1) { |
596 | trans = btrfs_start_transaction(tree_root, 1); | |
5b21f2ed | 597 | mutex_lock(&root->fs_info->drop_mutex); |
9f3a7427 CM |
598 | ret = btrfs_drop_snapshot(trans, dirty->root); |
599 | if (ret != -EAGAIN) { | |
600 | break; | |
601 | } | |
5b21f2ed | 602 | mutex_unlock(&root->fs_info->drop_mutex); |
58176a96 | 603 | |
9f3a7427 CM |
604 | err = btrfs_update_root(trans, |
605 | tree_root, | |
606 | &dirty->root->root_key, | |
607 | &dirty->root->root_item); | |
608 | if (err) | |
609 | ret = err; | |
d3c2fdcf | 610 | nr = trans->blocks_used; |
017e5369 | 611 | ret = btrfs_end_transaction(trans, tree_root); |
9f3a7427 | 612 | BUG_ON(ret); |
a2135011 | 613 | |
d3c2fdcf | 614 | btrfs_btree_balance_dirty(tree_root, nr); |
4dc11904 | 615 | cond_resched(); |
9f3a7427 | 616 | } |
0f7d52f4 | 617 | BUG_ON(ret); |
a2135011 | 618 | atomic_dec(&root->fs_info->throttles); |
017e5369 | 619 | wake_up(&root->fs_info->transaction_throttle); |
58176a96 | 620 | |
a2135011 | 621 | mutex_lock(&root->fs_info->alloc_mutex); |
db94535d CM |
622 | num_bytes -= btrfs_root_used(&dirty->root->root_item); |
623 | bytes_used = btrfs_root_used(&root->root_item); | |
624 | if (num_bytes) { | |
e02119d5 | 625 | btrfs_record_root_in_trans(root); |
5f39d397 | 626 | btrfs_set_root_used(&root->root_item, |
db94535d | 627 | bytes_used - num_bytes); |
58176a96 | 628 | } |
a2135011 CM |
629 | mutex_unlock(&root->fs_info->alloc_mutex); |
630 | ||
9f3a7427 | 631 | ret = btrfs_del_root(trans, tree_root, &dirty->root->root_key); |
58176a96 JB |
632 | if (ret) { |
633 | BUG(); | |
54aa1f4d | 634 | break; |
58176a96 | 635 | } |
a2135011 CM |
636 | mutex_unlock(&root->fs_info->drop_mutex); |
637 | ||
bcc63abb Y |
638 | spin_lock(&root->list_lock); |
639 | list_del_init(&dirty->root->dead_list); | |
640 | if (!list_empty(&root->dead_list)) { | |
641 | struct btrfs_root *oldest; | |
642 | oldest = list_entry(root->dead_list.prev, | |
643 | struct btrfs_root, dead_list); | |
644 | max_useless = oldest->root_key.offset - 1; | |
645 | } else { | |
646 | max_useless = root->root_key.offset - 1; | |
647 | } | |
648 | spin_unlock(&root->list_lock); | |
649 | ||
d3c2fdcf | 650 | nr = trans->blocks_used; |
0f7d52f4 CM |
651 | ret = btrfs_end_transaction(trans, tree_root); |
652 | BUG_ON(ret); | |
5eda7b5e | 653 | |
e4657689 | 654 | ret = btrfs_remove_leaf_refs(root, max_useless, 0); |
bcc63abb Y |
655 | BUG_ON(ret); |
656 | ||
f510cfec | 657 | free_extent_buffer(dirty->root->node); |
9f3a7427 | 658 | kfree(dirty->root); |
0f7d52f4 | 659 | kfree(dirty); |
d3c2fdcf CM |
660 | |
661 | btrfs_btree_balance_dirty(tree_root, nr); | |
4dc11904 | 662 | cond_resched(); |
0f7d52f4 | 663 | } |
54aa1f4d | 664 | return ret; |
0f7d52f4 CM |
665 | } |
666 | ||
80b6794d | 667 | static noinline int create_pending_snapshot(struct btrfs_trans_handle *trans, |
3063d29f CM |
668 | struct btrfs_fs_info *fs_info, |
669 | struct btrfs_pending_snapshot *pending) | |
670 | { | |
671 | struct btrfs_key key; | |
80b6794d | 672 | struct btrfs_root_item *new_root_item; |
3063d29f CM |
673 | struct btrfs_root *tree_root = fs_info->tree_root; |
674 | struct btrfs_root *root = pending->root; | |
675 | struct extent_buffer *tmp; | |
925baedd | 676 | struct extent_buffer *old; |
3063d29f | 677 | int ret; |
3b96362c | 678 | int namelen; |
3063d29f CM |
679 | u64 objectid; |
680 | ||
80b6794d CM |
681 | new_root_item = kmalloc(sizeof(*new_root_item), GFP_NOFS); |
682 | if (!new_root_item) { | |
683 | ret = -ENOMEM; | |
684 | goto fail; | |
685 | } | |
3063d29f CM |
686 | ret = btrfs_find_free_objectid(trans, tree_root, 0, &objectid); |
687 | if (ret) | |
688 | goto fail; | |
689 | ||
80b6794d | 690 | memcpy(new_root_item, &root->root_item, sizeof(*new_root_item)); |
3063d29f CM |
691 | |
692 | key.objectid = objectid; | |
5b21f2ed | 693 | key.offset = trans->transid; |
3063d29f CM |
694 | btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY); |
695 | ||
925baedd | 696 | old = btrfs_lock_root_node(root); |
65b51a00 | 697 | btrfs_cow_block(trans, root, old, NULL, 0, &old, 0); |
3063d29f | 698 | |
925baedd CM |
699 | btrfs_copy_root(trans, root, old, &tmp, objectid); |
700 | btrfs_tree_unlock(old); | |
701 | free_extent_buffer(old); | |
3063d29f | 702 | |
80b6794d CM |
703 | btrfs_set_root_bytenr(new_root_item, tmp->start); |
704 | btrfs_set_root_level(new_root_item, btrfs_header_level(tmp)); | |
3063d29f | 705 | ret = btrfs_insert_root(trans, root->fs_info->tree_root, &key, |
80b6794d | 706 | new_root_item); |
925baedd | 707 | btrfs_tree_unlock(tmp); |
3063d29f CM |
708 | free_extent_buffer(tmp); |
709 | if (ret) | |
710 | goto fail; | |
711 | ||
712 | /* | |
713 | * insert the directory item | |
714 | */ | |
715 | key.offset = (u64)-1; | |
3b96362c | 716 | namelen = strlen(pending->name); |
3063d29f | 717 | ret = btrfs_insert_dir_item(trans, root->fs_info->tree_root, |
3b96362c | 718 | pending->name, namelen, |
3063d29f | 719 | root->fs_info->sb->s_root->d_inode->i_ino, |
aec7477b | 720 | &key, BTRFS_FT_DIR, 0); |
3063d29f CM |
721 | |
722 | if (ret) | |
723 | goto fail; | |
724 | ||
725 | ret = btrfs_insert_inode_ref(trans, root->fs_info->tree_root, | |
726 | pending->name, strlen(pending->name), objectid, | |
aec7477b | 727 | root->fs_info->sb->s_root->d_inode->i_ino, 0); |
3b96362c SW |
728 | |
729 | /* Invalidate existing dcache entry for new snapshot. */ | |
730 | btrfs_invalidate_dcache_root(root, pending->name, namelen); | |
731 | ||
3063d29f | 732 | fail: |
80b6794d | 733 | kfree(new_root_item); |
3063d29f CM |
734 | return ret; |
735 | } | |
736 | ||
80b6794d CM |
737 | static noinline int create_pending_snapshots(struct btrfs_trans_handle *trans, |
738 | struct btrfs_fs_info *fs_info) | |
3063d29f CM |
739 | { |
740 | struct btrfs_pending_snapshot *pending; | |
741 | struct list_head *head = &trans->transaction->pending_snapshots; | |
742 | int ret; | |
743 | ||
744 | while(!list_empty(head)) { | |
745 | pending = list_entry(head->next, | |
746 | struct btrfs_pending_snapshot, list); | |
747 | ret = create_pending_snapshot(trans, fs_info, pending); | |
748 | BUG_ON(ret); | |
749 | list_del(&pending->list); | |
750 | kfree(pending->name); | |
751 | kfree(pending); | |
752 | } | |
dc17ff8f CM |
753 | return 0; |
754 | } | |
755 | ||
79154b1b CM |
756 | int btrfs_commit_transaction(struct btrfs_trans_handle *trans, |
757 | struct btrfs_root *root) | |
758 | { | |
15ee9bc7 JB |
759 | unsigned long joined = 0; |
760 | unsigned long timeout = 1; | |
79154b1b | 761 | struct btrfs_transaction *cur_trans; |
8fd17795 | 762 | struct btrfs_transaction *prev_trans = NULL; |
0b86a832 | 763 | struct btrfs_root *chunk_root = root->fs_info->chunk_root; |
0f7d52f4 | 764 | struct list_head dirty_fs_roots; |
d1310b2e | 765 | struct extent_io_tree *pinned_copy; |
79154b1b | 766 | DEFINE_WAIT(wait); |
15ee9bc7 | 767 | int ret; |
79154b1b | 768 | |
0f7d52f4 | 769 | INIT_LIST_HEAD(&dirty_fs_roots); |
79154b1b CM |
770 | mutex_lock(&root->fs_info->trans_mutex); |
771 | if (trans->transaction->in_commit) { | |
772 | cur_trans = trans->transaction; | |
773 | trans->transaction->use_count++; | |
ccd467d6 | 774 | mutex_unlock(&root->fs_info->trans_mutex); |
79154b1b | 775 | btrfs_end_transaction(trans, root); |
ccd467d6 | 776 | |
79154b1b CM |
777 | ret = wait_for_commit(root, cur_trans); |
778 | BUG_ON(ret); | |
15ee9bc7 JB |
779 | |
780 | mutex_lock(&root->fs_info->trans_mutex); | |
79154b1b | 781 | put_transaction(cur_trans); |
15ee9bc7 JB |
782 | mutex_unlock(&root->fs_info->trans_mutex); |
783 | ||
79154b1b CM |
784 | return 0; |
785 | } | |
4313b399 CM |
786 | |
787 | pinned_copy = kmalloc(sizeof(*pinned_copy), GFP_NOFS); | |
788 | if (!pinned_copy) | |
789 | return -ENOMEM; | |
790 | ||
d1310b2e | 791 | extent_io_tree_init(pinned_copy, |
4313b399 CM |
792 | root->fs_info->btree_inode->i_mapping, GFP_NOFS); |
793 | ||
2c90e5d6 | 794 | trans->transaction->in_commit = 1; |
f9295749 | 795 | trans->transaction->blocked = 1; |
ccd467d6 CM |
796 | cur_trans = trans->transaction; |
797 | if (cur_trans->list.prev != &root->fs_info->trans_list) { | |
798 | prev_trans = list_entry(cur_trans->list.prev, | |
799 | struct btrfs_transaction, list); | |
800 | if (!prev_trans->commit_done) { | |
801 | prev_trans->use_count++; | |
ccd467d6 CM |
802 | mutex_unlock(&root->fs_info->trans_mutex); |
803 | ||
804 | wait_for_commit(root, prev_trans); | |
ccd467d6 | 805 | |
ccd467d6 | 806 | mutex_lock(&root->fs_info->trans_mutex); |
15ee9bc7 | 807 | put_transaction(prev_trans); |
ccd467d6 CM |
808 | } |
809 | } | |
15ee9bc7 JB |
810 | |
811 | do { | |
7ea394f1 | 812 | int snap_pending = 0; |
15ee9bc7 | 813 | joined = cur_trans->num_joined; |
7ea394f1 YZ |
814 | if (!list_empty(&trans->transaction->pending_snapshots)) |
815 | snap_pending = 1; | |
816 | ||
2c90e5d6 | 817 | WARN_ON(cur_trans != trans->transaction); |
15ee9bc7 | 818 | prepare_to_wait(&cur_trans->writer_wait, &wait, |
79154b1b | 819 | TASK_UNINTERRUPTIBLE); |
15ee9bc7 JB |
820 | |
821 | if (cur_trans->num_writers > 1) | |
822 | timeout = MAX_SCHEDULE_TIMEOUT; | |
823 | else | |
824 | timeout = 1; | |
825 | ||
79154b1b | 826 | mutex_unlock(&root->fs_info->trans_mutex); |
15ee9bc7 | 827 | |
7ea394f1 YZ |
828 | if (snap_pending) { |
829 | ret = btrfs_wait_ordered_extents(root, 1); | |
830 | BUG_ON(ret); | |
831 | } | |
832 | ||
15ee9bc7 JB |
833 | schedule_timeout(timeout); |
834 | ||
79154b1b | 835 | mutex_lock(&root->fs_info->trans_mutex); |
15ee9bc7 JB |
836 | finish_wait(&cur_trans->writer_wait, &wait); |
837 | } while (cur_trans->num_writers > 1 || | |
838 | (cur_trans->num_joined != joined)); | |
839 | ||
3063d29f CM |
840 | ret = create_pending_snapshots(trans, root->fs_info); |
841 | BUG_ON(ret); | |
842 | ||
2c90e5d6 | 843 | WARN_ON(cur_trans != trans->transaction); |
dc17ff8f | 844 | |
e02119d5 CM |
845 | /* btrfs_commit_tree_roots is responsible for getting the |
846 | * various roots consistent with each other. Every pointer | |
847 | * in the tree of tree roots has to point to the most up to date | |
848 | * root for every subvolume and other tree. So, we have to keep | |
849 | * the tree logging code from jumping in and changing any | |
850 | * of the trees. | |
851 | * | |
852 | * At this point in the commit, there can't be any tree-log | |
853 | * writers, but a little lower down we drop the trans mutex | |
854 | * and let new people in. By holding the tree_log_mutex | |
855 | * from now until after the super is written, we avoid races | |
856 | * with the tree-log code. | |
857 | */ | |
858 | mutex_lock(&root->fs_info->tree_log_mutex); | |
1a40e23b ZY |
859 | /* |
860 | * keep tree reloc code from adding new reloc trees | |
861 | */ | |
862 | mutex_lock(&root->fs_info->tree_reloc_mutex); | |
863 | ||
e02119d5 | 864 | |
54aa1f4d CM |
865 | ret = add_dirty_roots(trans, &root->fs_info->fs_roots_radix, |
866 | &dirty_fs_roots); | |
867 | BUG_ON(ret); | |
868 | ||
e02119d5 CM |
869 | /* add_dirty_roots gets rid of all the tree log roots, it is now |
870 | * safe to free the root of tree log roots | |
871 | */ | |
872 | btrfs_free_log_root_tree(trans, root->fs_info); | |
873 | ||
1a40e23b ZY |
874 | btrfs_free_reloc_mappings(root); |
875 | ||
79154b1b CM |
876 | ret = btrfs_commit_tree_roots(trans, root); |
877 | BUG_ON(ret); | |
54aa1f4d | 878 | |
78fae27e | 879 | cur_trans = root->fs_info->running_transaction; |
cee36a03 | 880 | spin_lock(&root->fs_info->new_trans_lock); |
78fae27e | 881 | root->fs_info->running_transaction = NULL; |
cee36a03 | 882 | spin_unlock(&root->fs_info->new_trans_lock); |
4b52dff6 CM |
883 | btrfs_set_super_generation(&root->fs_info->super_copy, |
884 | cur_trans->transid); | |
885 | btrfs_set_super_root(&root->fs_info->super_copy, | |
db94535d CM |
886 | root->fs_info->tree_root->node->start); |
887 | btrfs_set_super_root_level(&root->fs_info->super_copy, | |
888 | btrfs_header_level(root->fs_info->tree_root->node)); | |
5f39d397 | 889 | |
0b86a832 CM |
890 | btrfs_set_super_chunk_root(&root->fs_info->super_copy, |
891 | chunk_root->node->start); | |
892 | btrfs_set_super_chunk_root_level(&root->fs_info->super_copy, | |
893 | btrfs_header_level(chunk_root->node)); | |
e02119d5 CM |
894 | |
895 | if (!root->fs_info->log_root_recovering) { | |
896 | btrfs_set_super_log_root(&root->fs_info->super_copy, 0); | |
897 | btrfs_set_super_log_root_level(&root->fs_info->super_copy, 0); | |
898 | } | |
899 | ||
a061fc8d CM |
900 | memcpy(&root->fs_info->super_for_commit, &root->fs_info->super_copy, |
901 | sizeof(root->fs_info->super_copy)); | |
ccd467d6 | 902 | |
4313b399 | 903 | btrfs_copy_pinned(root, pinned_copy); |
ccd467d6 | 904 | |
f9295749 | 905 | trans->transaction->blocked = 0; |
e6dcd2dc | 906 | wake_up(&root->fs_info->transaction_throttle); |
f9295749 | 907 | wake_up(&root->fs_info->transaction_wait); |
e6dcd2dc | 908 | |
78fae27e | 909 | mutex_unlock(&root->fs_info->trans_mutex); |
79154b1b CM |
910 | ret = btrfs_write_and_wait_transaction(trans, root); |
911 | BUG_ON(ret); | |
79154b1b | 912 | write_ctree_super(trans, root); |
4313b399 | 913 | |
e02119d5 CM |
914 | /* |
915 | * the super is written, we can safely allow the tree-loggers | |
916 | * to go about their business | |
917 | */ | |
918 | mutex_unlock(&root->fs_info->tree_log_mutex); | |
919 | ||
4313b399 | 920 | btrfs_finish_extent_commit(trans, root, pinned_copy); |
4313b399 CM |
921 | kfree(pinned_copy); |
922 | ||
1a40e23b ZY |
923 | btrfs_drop_dead_reloc_roots(root); |
924 | mutex_unlock(&root->fs_info->tree_reloc_mutex); | |
925 | ||
926 | mutex_lock(&root->fs_info->trans_mutex); | |
927 | ||
2c90e5d6 | 928 | cur_trans->commit_done = 1; |
15ee9bc7 | 929 | root->fs_info->last_trans_committed = cur_trans->transid; |
2c90e5d6 | 930 | wake_up(&cur_trans->commit_wait); |
78fae27e | 931 | put_transaction(cur_trans); |
79154b1b | 932 | put_transaction(cur_trans); |
58176a96 | 933 | |
bcc63abb | 934 | list_splice_init(&dirty_fs_roots, &root->fs_info->dead_roots); |
facda1e7 CM |
935 | if (root->fs_info->closing) |
936 | list_splice_init(&root->fs_info->dead_roots, &dirty_fs_roots); | |
58176a96 | 937 | |
78fae27e | 938 | mutex_unlock(&root->fs_info->trans_mutex); |
2c90e5d6 | 939 | kmem_cache_free(btrfs_trans_handle_cachep, trans); |
79154b1b | 940 | |
facda1e7 | 941 | if (root->fs_info->closing) { |
facda1e7 | 942 | drop_dirty_roots(root->fs_info->tree_root, &dirty_fs_roots); |
facda1e7 | 943 | } |
79154b1b CM |
944 | return ret; |
945 | } | |
946 | ||
e9d0b13b CM |
947 | int btrfs_clean_old_snapshots(struct btrfs_root *root) |
948 | { | |
949 | struct list_head dirty_roots; | |
950 | INIT_LIST_HEAD(&dirty_roots); | |
a74a4b97 | 951 | again: |
e9d0b13b CM |
952 | mutex_lock(&root->fs_info->trans_mutex); |
953 | list_splice_init(&root->fs_info->dead_roots, &dirty_roots); | |
954 | mutex_unlock(&root->fs_info->trans_mutex); | |
955 | ||
956 | if (!list_empty(&dirty_roots)) { | |
957 | drop_dirty_roots(root, &dirty_roots); | |
a74a4b97 | 958 | goto again; |
e9d0b13b CM |
959 | } |
960 | return 0; | |
961 | } |