blob: f749a5447b2ace6dc90ab8a797aab5e238910f0e [file] [log] [blame]
Miao Xie16cdcec2011-04-22 18:12:22 +08001/*
2 * Copyright (C) 2011 Fujitsu. All rights reserved.
3 * Written by Miao Xie <miaox@cn.fujitsu.com>
4 *
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public
7 * License v2 as published by the Free Software Foundation.
8 *
9 * This program is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
13 *
14 * You should have received a copy of the GNU General Public
15 * License along with this program; if not, write to the
16 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17 * Boston, MA 021110-1307, USA.
18 */
19
20#include <linux/slab.h>
21#include "delayed-inode.h"
22#include "disk-io.h"
23#include "transaction.h"
Qu Wenruo3cae2102013-07-16 11:19:18 +080024#include "ctree.h"
Miao Xie16cdcec2011-04-22 18:12:22 +080025
Chris Masonde3cb942013-03-04 17:13:31 -050026#define BTRFS_DELAYED_WRITEBACK 512
27#define BTRFS_DELAYED_BACKGROUND 128
28#define BTRFS_DELAYED_BATCH 16
Miao Xie16cdcec2011-04-22 18:12:22 +080029
30static struct kmem_cache *delayed_node_cache;
31
32int __init btrfs_delayed_inode_init(void)
33{
David Sterba837e1972012-09-07 03:00:48 -060034 delayed_node_cache = kmem_cache_create("btrfs_delayed_node",
Miao Xie16cdcec2011-04-22 18:12:22 +080035 sizeof(struct btrfs_delayed_node),
36 0,
37 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD,
38 NULL);
39 if (!delayed_node_cache)
40 return -ENOMEM;
41 return 0;
42}
43
44void btrfs_delayed_inode_exit(void)
45{
Kinglong Mee5598e902016-01-29 21:36:35 +080046 kmem_cache_destroy(delayed_node_cache);
Miao Xie16cdcec2011-04-22 18:12:22 +080047}
48
49static inline void btrfs_init_delayed_node(
50 struct btrfs_delayed_node *delayed_node,
51 struct btrfs_root *root, u64 inode_id)
52{
53 delayed_node->root = root;
54 delayed_node->inode_id = inode_id;
55 atomic_set(&delayed_node->refs, 0);
Miao Xie16cdcec2011-04-22 18:12:22 +080056 delayed_node->ins_root = RB_ROOT;
57 delayed_node->del_root = RB_ROOT;
58 mutex_init(&delayed_node->mutex);
Miao Xie16cdcec2011-04-22 18:12:22 +080059 INIT_LIST_HEAD(&delayed_node->n_list);
60 INIT_LIST_HEAD(&delayed_node->p_list);
Miao Xie16cdcec2011-04-22 18:12:22 +080061}
62
63static inline int btrfs_is_continuous_delayed_item(
64 struct btrfs_delayed_item *item1,
65 struct btrfs_delayed_item *item2)
66{
67 if (item1->key.type == BTRFS_DIR_INDEX_KEY &&
68 item1->key.objectid == item2->key.objectid &&
69 item1->key.type == item2->key.type &&
70 item1->key.offset + 1 == item2->key.offset)
71 return 1;
72 return 0;
73}
74
75static inline struct btrfs_delayed_root *btrfs_get_delayed_root(
76 struct btrfs_root *root)
77{
78 return root->fs_info->delayed_root;
79}
80
Miao Xie2f7e33d2011-06-23 07:27:13 +000081static struct btrfs_delayed_node *btrfs_get_delayed_node(struct inode *inode)
82{
83 struct btrfs_inode *btrfs_inode = BTRFS_I(inode);
84 struct btrfs_root *root = btrfs_inode->root;
85 u64 ino = btrfs_ino(inode);
86 struct btrfs_delayed_node *node;
87
88 node = ACCESS_ONCE(btrfs_inode->delayed_node);
89 if (node) {
90 atomic_inc(&node->refs);
91 return node;
92 }
93
94 spin_lock(&root->inode_lock);
95 node = radix_tree_lookup(&root->delayed_nodes_tree, ino);
96 if (node) {
97 if (btrfs_inode->delayed_node) {
98 atomic_inc(&node->refs); /* can be accessed */
99 BUG_ON(btrfs_inode->delayed_node != node);
100 spin_unlock(&root->inode_lock);
101 return node;
102 }
103 btrfs_inode->delayed_node = node;
Rashika95e94d12013-10-31 03:12:42 +0530104 /* can be accessed and cached in the inode */
105 atomic_add(2, &node->refs);
Miao Xie2f7e33d2011-06-23 07:27:13 +0000106 spin_unlock(&root->inode_lock);
107 return node;
108 }
109 spin_unlock(&root->inode_lock);
110
111 return NULL;
112}
113
Jeff Mahoney79787ea2012-03-12 16:03:00 +0100114/* Will return either the node or PTR_ERR(-ENOMEM) */
Miao Xie16cdcec2011-04-22 18:12:22 +0800115static struct btrfs_delayed_node *btrfs_get_or_create_delayed_node(
116 struct inode *inode)
117{
118 struct btrfs_delayed_node *node;
119 struct btrfs_inode *btrfs_inode = BTRFS_I(inode);
120 struct btrfs_root *root = btrfs_inode->root;
Chris Mason0d0ca302011-05-22 07:11:22 -0400121 u64 ino = btrfs_ino(inode);
Miao Xie16cdcec2011-04-22 18:12:22 +0800122 int ret;
123
124again:
Miao Xie2f7e33d2011-06-23 07:27:13 +0000125 node = btrfs_get_delayed_node(inode);
126 if (node)
Miao Xie16cdcec2011-04-22 18:12:22 +0800127 return node;
Miao Xie16cdcec2011-04-22 18:12:22 +0800128
Alexandru Moise352dd9c2015-10-25 20:15:06 +0000129 node = kmem_cache_zalloc(delayed_node_cache, GFP_NOFS);
Miao Xie16cdcec2011-04-22 18:12:22 +0800130 if (!node)
131 return ERR_PTR(-ENOMEM);
Chris Mason0d0ca302011-05-22 07:11:22 -0400132 btrfs_init_delayed_node(node, root, ino);
Miao Xie16cdcec2011-04-22 18:12:22 +0800133
Rashika95e94d12013-10-31 03:12:42 +0530134 /* cached in the btrfs inode and can be accessed */
135 atomic_add(2, &node->refs);
Miao Xie16cdcec2011-04-22 18:12:22 +0800136
David Sterbae1860a72016-05-09 14:11:38 +0200137 ret = radix_tree_preload(GFP_NOFS);
Miao Xie16cdcec2011-04-22 18:12:22 +0800138 if (ret) {
139 kmem_cache_free(delayed_node_cache, node);
140 return ERR_PTR(ret);
141 }
142
143 spin_lock(&root->inode_lock);
Chris Mason0d0ca302011-05-22 07:11:22 -0400144 ret = radix_tree_insert(&root->delayed_nodes_tree, ino, node);
Miao Xie16cdcec2011-04-22 18:12:22 +0800145 if (ret == -EEXIST) {
Miao Xie16cdcec2011-04-22 18:12:22 +0800146 spin_unlock(&root->inode_lock);
Jeff Mahoney96493032014-05-27 13:53:20 -0400147 kmem_cache_free(delayed_node_cache, node);
Miao Xie16cdcec2011-04-22 18:12:22 +0800148 radix_tree_preload_end();
149 goto again;
150 }
151 btrfs_inode->delayed_node = node;
152 spin_unlock(&root->inode_lock);
153 radix_tree_preload_end();
154
155 return node;
156}
157
158/*
159 * Call it when holding delayed_node->mutex
160 *
161 * If mod = 1, add this node into the prepared list.
162 */
163static void btrfs_queue_delayed_node(struct btrfs_delayed_root *root,
164 struct btrfs_delayed_node *node,
165 int mod)
166{
167 spin_lock(&root->lock);
Miao Xie7cf35d92013-12-26 13:07:05 +0800168 if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) {
Miao Xie16cdcec2011-04-22 18:12:22 +0800169 if (!list_empty(&node->p_list))
170 list_move_tail(&node->p_list, &root->prepare_list);
171 else if (mod)
172 list_add_tail(&node->p_list, &root->prepare_list);
173 } else {
174 list_add_tail(&node->n_list, &root->node_list);
175 list_add_tail(&node->p_list, &root->prepare_list);
176 atomic_inc(&node->refs); /* inserted into list */
177 root->nodes++;
Miao Xie7cf35d92013-12-26 13:07:05 +0800178 set_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags);
Miao Xie16cdcec2011-04-22 18:12:22 +0800179 }
180 spin_unlock(&root->lock);
181}
182
183/* Call it when holding delayed_node->mutex */
184static void btrfs_dequeue_delayed_node(struct btrfs_delayed_root *root,
185 struct btrfs_delayed_node *node)
186{
187 spin_lock(&root->lock);
Miao Xie7cf35d92013-12-26 13:07:05 +0800188 if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) {
Miao Xie16cdcec2011-04-22 18:12:22 +0800189 root->nodes--;
190 atomic_dec(&node->refs); /* not in the list */
191 list_del_init(&node->n_list);
192 if (!list_empty(&node->p_list))
193 list_del_init(&node->p_list);
Miao Xie7cf35d92013-12-26 13:07:05 +0800194 clear_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags);
Miao Xie16cdcec2011-04-22 18:12:22 +0800195 }
196 spin_unlock(&root->lock);
197}
198
Eric Sandeen48a3b632013-04-25 20:41:01 +0000199static struct btrfs_delayed_node *btrfs_first_delayed_node(
Miao Xie16cdcec2011-04-22 18:12:22 +0800200 struct btrfs_delayed_root *delayed_root)
201{
202 struct list_head *p;
203 struct btrfs_delayed_node *node = NULL;
204
205 spin_lock(&delayed_root->lock);
206 if (list_empty(&delayed_root->node_list))
207 goto out;
208
209 p = delayed_root->node_list.next;
210 node = list_entry(p, struct btrfs_delayed_node, n_list);
211 atomic_inc(&node->refs);
212out:
213 spin_unlock(&delayed_root->lock);
214
215 return node;
216}
217
Eric Sandeen48a3b632013-04-25 20:41:01 +0000218static struct btrfs_delayed_node *btrfs_next_delayed_node(
Miao Xie16cdcec2011-04-22 18:12:22 +0800219 struct btrfs_delayed_node *node)
220{
221 struct btrfs_delayed_root *delayed_root;
222 struct list_head *p;
223 struct btrfs_delayed_node *next = NULL;
224
225 delayed_root = node->root->fs_info->delayed_root;
226 spin_lock(&delayed_root->lock);
Miao Xie7cf35d92013-12-26 13:07:05 +0800227 if (!test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) {
228 /* not in the list */
Miao Xie16cdcec2011-04-22 18:12:22 +0800229 if (list_empty(&delayed_root->node_list))
230 goto out;
231 p = delayed_root->node_list.next;
232 } else if (list_is_last(&node->n_list, &delayed_root->node_list))
233 goto out;
234 else
235 p = node->n_list.next;
236
237 next = list_entry(p, struct btrfs_delayed_node, n_list);
238 atomic_inc(&next->refs);
239out:
240 spin_unlock(&delayed_root->lock);
241
242 return next;
243}
244
245static void __btrfs_release_delayed_node(
246 struct btrfs_delayed_node *delayed_node,
247 int mod)
248{
249 struct btrfs_delayed_root *delayed_root;
250
251 if (!delayed_node)
252 return;
253
254 delayed_root = delayed_node->root->fs_info->delayed_root;
255
256 mutex_lock(&delayed_node->mutex);
257 if (delayed_node->count)
258 btrfs_queue_delayed_node(delayed_root, delayed_node, mod);
259 else
260 btrfs_dequeue_delayed_node(delayed_root, delayed_node);
261 mutex_unlock(&delayed_node->mutex);
262
263 if (atomic_dec_and_test(&delayed_node->refs)) {
Jeff Mahoney96493032014-05-27 13:53:20 -0400264 bool free = false;
Miao Xie16cdcec2011-04-22 18:12:22 +0800265 struct btrfs_root *root = delayed_node->root;
266 spin_lock(&root->inode_lock);
267 if (atomic_read(&delayed_node->refs) == 0) {
268 radix_tree_delete(&root->delayed_nodes_tree,
269 delayed_node->inode_id);
Jeff Mahoney96493032014-05-27 13:53:20 -0400270 free = true;
Miao Xie16cdcec2011-04-22 18:12:22 +0800271 }
272 spin_unlock(&root->inode_lock);
Jeff Mahoney96493032014-05-27 13:53:20 -0400273 if (free)
274 kmem_cache_free(delayed_node_cache, delayed_node);
Miao Xie16cdcec2011-04-22 18:12:22 +0800275 }
276}
277
278static inline void btrfs_release_delayed_node(struct btrfs_delayed_node *node)
279{
280 __btrfs_release_delayed_node(node, 0);
281}
282
Eric Sandeen48a3b632013-04-25 20:41:01 +0000283static struct btrfs_delayed_node *btrfs_first_prepared_delayed_node(
Miao Xie16cdcec2011-04-22 18:12:22 +0800284 struct btrfs_delayed_root *delayed_root)
285{
286 struct list_head *p;
287 struct btrfs_delayed_node *node = NULL;
288
289 spin_lock(&delayed_root->lock);
290 if (list_empty(&delayed_root->prepare_list))
291 goto out;
292
293 p = delayed_root->prepare_list.next;
294 list_del_init(p);
295 node = list_entry(p, struct btrfs_delayed_node, p_list);
296 atomic_inc(&node->refs);
297out:
298 spin_unlock(&delayed_root->lock);
299
300 return node;
301}
302
303static inline void btrfs_release_prepared_delayed_node(
304 struct btrfs_delayed_node *node)
305{
306 __btrfs_release_delayed_node(node, 1);
307}
308
Eric Sandeen48a3b632013-04-25 20:41:01 +0000309static struct btrfs_delayed_item *btrfs_alloc_delayed_item(u32 data_len)
Miao Xie16cdcec2011-04-22 18:12:22 +0800310{
311 struct btrfs_delayed_item *item;
312 item = kmalloc(sizeof(*item) + data_len, GFP_NOFS);
313 if (item) {
314 item->data_len = data_len;
315 item->ins_or_del = 0;
316 item->bytes_reserved = 0;
Miao Xie16cdcec2011-04-22 18:12:22 +0800317 item->delayed_node = NULL;
318 atomic_set(&item->refs, 1);
319 }
320 return item;
321}
322
323/*
324 * __btrfs_lookup_delayed_item - look up the delayed item by key
325 * @delayed_node: pointer to the delayed node
326 * @key: the key to look up
327 * @prev: used to store the prev item if the right item isn't found
328 * @next: used to store the next item if the right item isn't found
329 *
330 * Note: if we don't find the right item, we will return the prev item and
331 * the next item.
332 */
333static struct btrfs_delayed_item *__btrfs_lookup_delayed_item(
334 struct rb_root *root,
335 struct btrfs_key *key,
336 struct btrfs_delayed_item **prev,
337 struct btrfs_delayed_item **next)
338{
339 struct rb_node *node, *prev_node = NULL;
340 struct btrfs_delayed_item *delayed_item = NULL;
341 int ret = 0;
342
343 node = root->rb_node;
344
345 while (node) {
346 delayed_item = rb_entry(node, struct btrfs_delayed_item,
347 rb_node);
348 prev_node = node;
349 ret = btrfs_comp_cpu_keys(&delayed_item->key, key);
350 if (ret < 0)
351 node = node->rb_right;
352 else if (ret > 0)
353 node = node->rb_left;
354 else
355 return delayed_item;
356 }
357
358 if (prev) {
359 if (!prev_node)
360 *prev = NULL;
361 else if (ret < 0)
362 *prev = delayed_item;
363 else if ((node = rb_prev(prev_node)) != NULL) {
364 *prev = rb_entry(node, struct btrfs_delayed_item,
365 rb_node);
366 } else
367 *prev = NULL;
368 }
369
370 if (next) {
371 if (!prev_node)
372 *next = NULL;
373 else if (ret > 0)
374 *next = delayed_item;
375 else if ((node = rb_next(prev_node)) != NULL) {
376 *next = rb_entry(node, struct btrfs_delayed_item,
377 rb_node);
378 } else
379 *next = NULL;
380 }
381 return NULL;
382}
383
Eric Sandeen48a3b632013-04-25 20:41:01 +0000384static struct btrfs_delayed_item *__btrfs_lookup_delayed_insertion_item(
Miao Xie16cdcec2011-04-22 18:12:22 +0800385 struct btrfs_delayed_node *delayed_node,
386 struct btrfs_key *key)
387{
388 struct btrfs_delayed_item *item;
389
390 item = __btrfs_lookup_delayed_item(&delayed_node->ins_root, key,
391 NULL, NULL);
392 return item;
393}
394
Miao Xie16cdcec2011-04-22 18:12:22 +0800395static int __btrfs_add_delayed_item(struct btrfs_delayed_node *delayed_node,
396 struct btrfs_delayed_item *ins,
397 int action)
398{
399 struct rb_node **p, *node;
400 struct rb_node *parent_node = NULL;
401 struct rb_root *root;
402 struct btrfs_delayed_item *item;
403 int cmp;
404
405 if (action == BTRFS_DELAYED_INSERTION_ITEM)
406 root = &delayed_node->ins_root;
407 else if (action == BTRFS_DELAYED_DELETION_ITEM)
408 root = &delayed_node->del_root;
409 else
410 BUG();
411 p = &root->rb_node;
412 node = &ins->rb_node;
413
414 while (*p) {
415 parent_node = *p;
416 item = rb_entry(parent_node, struct btrfs_delayed_item,
417 rb_node);
418
419 cmp = btrfs_comp_cpu_keys(&item->key, &ins->key);
420 if (cmp < 0)
421 p = &(*p)->rb_right;
422 else if (cmp > 0)
423 p = &(*p)->rb_left;
424 else
425 return -EEXIST;
426 }
427
428 rb_link_node(node, parent_node, p);
429 rb_insert_color(node, root);
430 ins->delayed_node = delayed_node;
431 ins->ins_or_del = action;
432
433 if (ins->key.type == BTRFS_DIR_INDEX_KEY &&
434 action == BTRFS_DELAYED_INSERTION_ITEM &&
435 ins->key.offset >= delayed_node->index_cnt)
436 delayed_node->index_cnt = ins->key.offset + 1;
437
438 delayed_node->count++;
439 atomic_inc(&delayed_node->root->fs_info->delayed_root->items);
440 return 0;
441}
442
443static int __btrfs_add_delayed_insertion_item(struct btrfs_delayed_node *node,
444 struct btrfs_delayed_item *item)
445{
446 return __btrfs_add_delayed_item(node, item,
447 BTRFS_DELAYED_INSERTION_ITEM);
448}
449
450static int __btrfs_add_delayed_deletion_item(struct btrfs_delayed_node *node,
451 struct btrfs_delayed_item *item)
452{
453 return __btrfs_add_delayed_item(node, item,
454 BTRFS_DELAYED_DELETION_ITEM);
455}
456
Chris Masonde3cb942013-03-04 17:13:31 -0500457static void finish_one_item(struct btrfs_delayed_root *delayed_root)
458{
459 int seq = atomic_inc_return(&delayed_root->items_seq);
David Sterbaee863952015-02-16 19:41:40 +0100460
461 /*
462 * atomic_dec_return implies a barrier for waitqueue_active
463 */
Chris Masonde3cb942013-03-04 17:13:31 -0500464 if ((atomic_dec_return(&delayed_root->items) <
465 BTRFS_DELAYED_BACKGROUND || seq % BTRFS_DELAYED_BATCH == 0) &&
466 waitqueue_active(&delayed_root->wait))
467 wake_up(&delayed_root->wait);
468}
469
Miao Xie16cdcec2011-04-22 18:12:22 +0800470static void __btrfs_remove_delayed_item(struct btrfs_delayed_item *delayed_item)
471{
472 struct rb_root *root;
473 struct btrfs_delayed_root *delayed_root;
474
475 delayed_root = delayed_item->delayed_node->root->fs_info->delayed_root;
476
477 BUG_ON(!delayed_root);
478 BUG_ON(delayed_item->ins_or_del != BTRFS_DELAYED_DELETION_ITEM &&
479 delayed_item->ins_or_del != BTRFS_DELAYED_INSERTION_ITEM);
480
481 if (delayed_item->ins_or_del == BTRFS_DELAYED_INSERTION_ITEM)
482 root = &delayed_item->delayed_node->ins_root;
483 else
484 root = &delayed_item->delayed_node->del_root;
485
486 rb_erase(&delayed_item->rb_node, root);
487 delayed_item->delayed_node->count--;
Chris Masonde3cb942013-03-04 17:13:31 -0500488
489 finish_one_item(delayed_root);
Miao Xie16cdcec2011-04-22 18:12:22 +0800490}
491
492static void btrfs_release_delayed_item(struct btrfs_delayed_item *item)
493{
494 if (item) {
495 __btrfs_remove_delayed_item(item);
496 if (atomic_dec_and_test(&item->refs))
497 kfree(item);
498 }
499}
500
Eric Sandeen48a3b632013-04-25 20:41:01 +0000501static struct btrfs_delayed_item *__btrfs_first_delayed_insertion_item(
Miao Xie16cdcec2011-04-22 18:12:22 +0800502 struct btrfs_delayed_node *delayed_node)
503{
504 struct rb_node *p;
505 struct btrfs_delayed_item *item = NULL;
506
507 p = rb_first(&delayed_node->ins_root);
508 if (p)
509 item = rb_entry(p, struct btrfs_delayed_item, rb_node);
510
511 return item;
512}
513
Eric Sandeen48a3b632013-04-25 20:41:01 +0000514static struct btrfs_delayed_item *__btrfs_first_delayed_deletion_item(
Miao Xie16cdcec2011-04-22 18:12:22 +0800515 struct btrfs_delayed_node *delayed_node)
516{
517 struct rb_node *p;
518 struct btrfs_delayed_item *item = NULL;
519
520 p = rb_first(&delayed_node->del_root);
521 if (p)
522 item = rb_entry(p, struct btrfs_delayed_item, rb_node);
523
524 return item;
525}
526
Eric Sandeen48a3b632013-04-25 20:41:01 +0000527static struct btrfs_delayed_item *__btrfs_next_delayed_item(
Miao Xie16cdcec2011-04-22 18:12:22 +0800528 struct btrfs_delayed_item *item)
529{
530 struct rb_node *p;
531 struct btrfs_delayed_item *next = NULL;
532
533 p = rb_next(&item->rb_node);
534 if (p)
535 next = rb_entry(p, struct btrfs_delayed_item, rb_node);
536
537 return next;
538}
539
Miao Xie16cdcec2011-04-22 18:12:22 +0800540static int btrfs_delayed_item_reserve_metadata(struct btrfs_trans_handle *trans,
541 struct btrfs_root *root,
542 struct btrfs_delayed_item *item)
543{
544 struct btrfs_block_rsv *src_rsv;
545 struct btrfs_block_rsv *dst_rsv;
546 u64 num_bytes;
547 int ret;
548
549 if (!trans->bytes_reserved)
550 return 0;
551
552 src_rsv = trans->block_rsv;
Josef Bacik6d668dd2011-11-03 22:54:25 -0400553 dst_rsv = &root->fs_info->delayed_block_rsv;
Miao Xie16cdcec2011-04-22 18:12:22 +0800554
555 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
Josef Bacik25d609f2016-03-25 13:25:48 -0400556 ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes, 1);
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500557 if (!ret) {
558 trace_btrfs_space_reservation(root->fs_info, "delayed_item",
559 item->key.objectid,
560 num_bytes, 1);
Miao Xie16cdcec2011-04-22 18:12:22 +0800561 item->bytes_reserved = num_bytes;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500562 }
Miao Xie16cdcec2011-04-22 18:12:22 +0800563
564 return ret;
565}
566
567static void btrfs_delayed_item_release_metadata(struct btrfs_root *root,
568 struct btrfs_delayed_item *item)
569{
Miao Xie19fd2942011-06-15 10:47:30 +0000570 struct btrfs_block_rsv *rsv;
571
Miao Xie16cdcec2011-04-22 18:12:22 +0800572 if (!item->bytes_reserved)
573 return;
574
Josef Bacik6d668dd2011-11-03 22:54:25 -0400575 rsv = &root->fs_info->delayed_block_rsv;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500576 trace_btrfs_space_reservation(root->fs_info, "delayed_item",
577 item->key.objectid, item->bytes_reserved,
578 0);
Miao Xie19fd2942011-06-15 10:47:30 +0000579 btrfs_block_rsv_release(root, rsv,
Miao Xie16cdcec2011-04-22 18:12:22 +0800580 item->bytes_reserved);
581}
582
583static int btrfs_delayed_inode_reserve_metadata(
584 struct btrfs_trans_handle *trans,
585 struct btrfs_root *root,
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500586 struct inode *inode,
Miao Xie16cdcec2011-04-22 18:12:22 +0800587 struct btrfs_delayed_node *node)
588{
589 struct btrfs_block_rsv *src_rsv;
590 struct btrfs_block_rsv *dst_rsv;
591 u64 num_bytes;
592 int ret;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500593 bool release = false;
Miao Xie16cdcec2011-04-22 18:12:22 +0800594
Miao Xie16cdcec2011-04-22 18:12:22 +0800595 src_rsv = trans->block_rsv;
Josef Bacik6d668dd2011-11-03 22:54:25 -0400596 dst_rsv = &root->fs_info->delayed_block_rsv;
Miao Xie16cdcec2011-04-22 18:12:22 +0800597
598 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
Josef Bacikc06a0e12011-11-04 19:56:02 -0400599
600 /*
601 * btrfs_dirty_inode will update the inode under btrfs_join_transaction
602 * which doesn't reserve space for speed. This is a problem since we
603 * still need to reserve space for this update, so try to reserve the
604 * space.
605 *
606 * Now if src_rsv == delalloc_block_rsv we'll let it just steal since
607 * we're accounted for.
608 */
Chris Masone755d9a2011-12-15 13:36:29 -0500609 if (!src_rsv || (!trans->bytes_reserved &&
Miao Xie66d8f3d2012-09-06 04:02:28 -0600610 src_rsv->type != BTRFS_BLOCK_RSV_DELALLOC)) {
Miao Xie08e007d2012-10-16 11:33:38 +0000611 ret = btrfs_block_rsv_add(root, dst_rsv, num_bytes,
612 BTRFS_RESERVE_NO_FLUSH);
Josef Bacikc06a0e12011-11-04 19:56:02 -0400613 /*
614 * Since we're under a transaction reserve_metadata_bytes could
615 * try to commit the transaction which will make it return
616 * EAGAIN to make us stop the transaction we have, so return
617 * ENOSPC instead so that btrfs_dirty_inode knows what to do.
618 */
619 if (ret == -EAGAIN)
620 ret = -ENOSPC;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500621 if (!ret) {
Josef Bacikc06a0e12011-11-04 19:56:02 -0400622 node->bytes_reserved = num_bytes;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500623 trace_btrfs_space_reservation(root->fs_info,
624 "delayed_inode",
625 btrfs_ino(inode),
626 num_bytes, 1);
627 }
Josef Bacikc06a0e12011-11-04 19:56:02 -0400628 return ret;
Miao Xie66d8f3d2012-09-06 04:02:28 -0600629 } else if (src_rsv->type == BTRFS_BLOCK_RSV_DELALLOC) {
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500630 spin_lock(&BTRFS_I(inode)->lock);
Josef Bacik72ac3c02012-05-23 14:13:11 -0400631 if (test_and_clear_bit(BTRFS_INODE_DELALLOC_META_RESERVED,
632 &BTRFS_I(inode)->runtime_flags)) {
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500633 spin_unlock(&BTRFS_I(inode)->lock);
634 release = true;
635 goto migrate;
636 }
637 spin_unlock(&BTRFS_I(inode)->lock);
638
639 /* Ok we didn't have space pre-reserved. This shouldn't happen
640 * too often but it can happen if we do delalloc to an existing
641 * inode which gets dirtied because of the time update, and then
642 * isn't touched again until after the transaction commits and
643 * then we try to write out the data. First try to be nice and
644 * reserve something strictly for us. If not be a pain and try
645 * to steal from the delalloc block rsv.
646 */
Miao Xie08e007d2012-10-16 11:33:38 +0000647 ret = btrfs_block_rsv_add(root, dst_rsv, num_bytes,
648 BTRFS_RESERVE_NO_FLUSH);
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500649 if (!ret)
650 goto out;
651
Josef Bacik25d609f2016-03-25 13:25:48 -0400652 ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes, 1);
Ashish Samant2e3fcb12016-03-11 14:54:05 -0800653 if (!ret)
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500654 goto out;
655
Ashish Samant2e3fcb12016-03-11 14:54:05 -0800656 if (btrfs_test_opt(root, ENOSPC_DEBUG)) {
657 btrfs_debug(root->fs_info,
658 "block rsv migrate returned %d", ret);
659 WARN_ON(1);
660 }
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500661 /*
662 * Ok this is a problem, let's just steal from the global rsv
663 * since this really shouldn't happen that often.
664 */
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500665 ret = btrfs_block_rsv_migrate(&root->fs_info->global_block_rsv,
Josef Bacik25d609f2016-03-25 13:25:48 -0400666 dst_rsv, num_bytes, 1);
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500667 goto out;
Josef Bacikc06a0e12011-11-04 19:56:02 -0400668 }
669
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500670migrate:
Josef Bacik25d609f2016-03-25 13:25:48 -0400671 ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes, 1);
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500672
673out:
674 /*
675 * Migrate only takes a reservation, it doesn't touch the size of the
676 * block_rsv. This is to simplify people who don't normally have things
677 * migrated from their block rsv. If they go to release their
678 * reservation, that will decrease the size as well, so if migrate
679 * reduced size we'd end up with a negative size. But for the
680 * delalloc_meta_reserved stuff we will only know to drop 1 reservation,
681 * but we could in fact do this reserve/migrate dance several times
682 * between the time we did the original reservation and we'd clean it
683 * up. So to take care of this, release the space for the meta
684 * reservation here. I think it may be time for a documentation page on
685 * how block rsvs. work.
686 */
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500687 if (!ret) {
688 trace_btrfs_space_reservation(root->fs_info, "delayed_inode",
689 btrfs_ino(inode), num_bytes, 1);
Miao Xie16cdcec2011-04-22 18:12:22 +0800690 node->bytes_reserved = num_bytes;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500691 }
Miao Xie16cdcec2011-04-22 18:12:22 +0800692
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500693 if (release) {
694 trace_btrfs_space_reservation(root->fs_info, "delalloc",
695 btrfs_ino(inode), num_bytes, 0);
Josef Bacik7fd2ae22011-11-08 15:47:34 -0500696 btrfs_block_rsv_release(root, src_rsv, num_bytes);
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500697 }
Miao Xie16cdcec2011-04-22 18:12:22 +0800698
699 return ret;
700}
701
702static void btrfs_delayed_inode_release_metadata(struct btrfs_root *root,
703 struct btrfs_delayed_node *node)
704{
705 struct btrfs_block_rsv *rsv;
706
707 if (!node->bytes_reserved)
708 return;
709
Josef Bacik6d668dd2011-11-03 22:54:25 -0400710 rsv = &root->fs_info->delayed_block_rsv;
Josef Bacik8c2a3ca2012-01-10 10:31:31 -0500711 trace_btrfs_space_reservation(root->fs_info, "delayed_inode",
712 node->inode_id, node->bytes_reserved, 0);
Miao Xie16cdcec2011-04-22 18:12:22 +0800713 btrfs_block_rsv_release(root, rsv,
714 node->bytes_reserved);
715 node->bytes_reserved = 0;
716}
717
718/*
719 * This helper will insert some continuous items into the same leaf according
720 * to the free space of the leaf.
721 */
Tsutomu Itohafe5fea2013-04-16 05:18:22 +0000722static int btrfs_batch_insert_items(struct btrfs_root *root,
723 struct btrfs_path *path,
724 struct btrfs_delayed_item *item)
Miao Xie16cdcec2011-04-22 18:12:22 +0800725{
726 struct btrfs_delayed_item *curr, *next;
727 int free_space;
728 int total_data_size = 0, total_size = 0;
729 struct extent_buffer *leaf;
730 char *data_ptr;
731 struct btrfs_key *keys;
732 u32 *data_size;
733 struct list_head head;
734 int slot;
735 int nitems;
736 int i;
737 int ret = 0;
738
739 BUG_ON(!path->nodes[0]);
740
741 leaf = path->nodes[0];
742 free_space = btrfs_leaf_free_space(root, leaf);
743 INIT_LIST_HEAD(&head);
744
745 next = item;
Chris Mason17aca1c2011-06-03 01:13:45 -0400746 nitems = 0;
Miao Xie16cdcec2011-04-22 18:12:22 +0800747
748 /*
749 * count the number of the continuous items that we can insert in batch
750 */
751 while (total_size + next->data_len + sizeof(struct btrfs_item) <=
752 free_space) {
753 total_data_size += next->data_len;
754 total_size += next->data_len + sizeof(struct btrfs_item);
755 list_add_tail(&next->tree_list, &head);
756 nitems++;
757
758 curr = next;
759 next = __btrfs_next_delayed_item(curr);
760 if (!next)
761 break;
762
763 if (!btrfs_is_continuous_delayed_item(curr, next))
764 break;
765 }
766
767 if (!nitems) {
768 ret = 0;
769 goto out;
770 }
771
772 /*
773 * we need allocate some memory space, but it might cause the task
774 * to sleep, so we set all locked nodes in the path to blocking locks
775 * first.
776 */
777 btrfs_set_path_blocking(path);
778
Dulshani Gunawardhanad9b0d9b2013-10-31 10:32:18 +0530779 keys = kmalloc_array(nitems, sizeof(struct btrfs_key), GFP_NOFS);
Miao Xie16cdcec2011-04-22 18:12:22 +0800780 if (!keys) {
781 ret = -ENOMEM;
782 goto out;
783 }
784
Dulshani Gunawardhanad9b0d9b2013-10-31 10:32:18 +0530785 data_size = kmalloc_array(nitems, sizeof(u32), GFP_NOFS);
Miao Xie16cdcec2011-04-22 18:12:22 +0800786 if (!data_size) {
787 ret = -ENOMEM;
788 goto error;
789 }
790
791 /* get keys of all the delayed items */
792 i = 0;
793 list_for_each_entry(next, &head, tree_list) {
794 keys[i] = next->key;
795 data_size[i] = next->data_len;
796 i++;
797 }
798
799 /* reset all the locked nodes in the patch to spinning locks. */
Chris Masonbd681512011-07-16 15:23:14 -0400800 btrfs_clear_path_blocking(path, NULL, 0);
Miao Xie16cdcec2011-04-22 18:12:22 +0800801
802 /* insert the keys of the items */
Tsutomu Itohafe5fea2013-04-16 05:18:22 +0000803 setup_items_for_insert(root, path, keys, data_size,
Jeff Mahoney143bede2012-03-01 14:56:26 +0100804 total_data_size, total_size, nitems);
Miao Xie16cdcec2011-04-22 18:12:22 +0800805
806 /* insert the dir index items */
807 slot = path->slots[0];
808 list_for_each_entry_safe(curr, next, &head, tree_list) {
809 data_ptr = btrfs_item_ptr(leaf, slot, char);
810 write_extent_buffer(leaf, &curr->data,
811 (unsigned long)data_ptr,
812 curr->data_len);
813 slot++;
814
815 btrfs_delayed_item_release_metadata(root, curr);
816
817 list_del(&curr->tree_list);
818 btrfs_release_delayed_item(curr);
819 }
820
821error:
822 kfree(data_size);
823 kfree(keys);
824out:
825 return ret;
826}
827
828/*
829 * This helper can just do simple insertion that needn't extend item for new
830 * data, such as directory name index insertion, inode insertion.
831 */
832static int btrfs_insert_delayed_item(struct btrfs_trans_handle *trans,
833 struct btrfs_root *root,
834 struct btrfs_path *path,
835 struct btrfs_delayed_item *delayed_item)
836{
837 struct extent_buffer *leaf;
Miao Xie16cdcec2011-04-22 18:12:22 +0800838 char *ptr;
839 int ret;
840
841 ret = btrfs_insert_empty_item(trans, root, path, &delayed_item->key,
842 delayed_item->data_len);
843 if (ret < 0 && ret != -EEXIST)
844 return ret;
845
846 leaf = path->nodes[0];
847
Miao Xie16cdcec2011-04-22 18:12:22 +0800848 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
849
850 write_extent_buffer(leaf, delayed_item->data, (unsigned long)ptr,
851 delayed_item->data_len);
852 btrfs_mark_buffer_dirty(leaf);
853
854 btrfs_delayed_item_release_metadata(root, delayed_item);
855 return 0;
856}
857
858/*
859 * we insert an item first, then if there are some continuous items, we try
860 * to insert those items into the same leaf.
861 */
862static int btrfs_insert_delayed_items(struct btrfs_trans_handle *trans,
863 struct btrfs_path *path,
864 struct btrfs_root *root,
865 struct btrfs_delayed_node *node)
866{
867 struct btrfs_delayed_item *curr, *prev;
868 int ret = 0;
869
870do_again:
871 mutex_lock(&node->mutex);
872 curr = __btrfs_first_delayed_insertion_item(node);
873 if (!curr)
874 goto insert_end;
875
876 ret = btrfs_insert_delayed_item(trans, root, path, curr);
877 if (ret < 0) {
Chris Mason945d8962011-05-22 12:33:42 -0400878 btrfs_release_path(path);
Miao Xie16cdcec2011-04-22 18:12:22 +0800879 goto insert_end;
880 }
881
882 prev = curr;
883 curr = __btrfs_next_delayed_item(prev);
884 if (curr && btrfs_is_continuous_delayed_item(prev, curr)) {
885 /* insert the continuous items into the same leaf */
886 path->slots[0]++;
Tsutomu Itohafe5fea2013-04-16 05:18:22 +0000887 btrfs_batch_insert_items(root, path, curr);
Miao Xie16cdcec2011-04-22 18:12:22 +0800888 }
889 btrfs_release_delayed_item(prev);
890 btrfs_mark_buffer_dirty(path->nodes[0]);
891
Chris Mason945d8962011-05-22 12:33:42 -0400892 btrfs_release_path(path);
Miao Xie16cdcec2011-04-22 18:12:22 +0800893 mutex_unlock(&node->mutex);
894 goto do_again;
895
896insert_end:
897 mutex_unlock(&node->mutex);
898 return ret;
899}
900
901static int btrfs_batch_delete_items(struct btrfs_trans_handle *trans,
902 struct btrfs_root *root,
903 struct btrfs_path *path,
904 struct btrfs_delayed_item *item)
905{
906 struct btrfs_delayed_item *curr, *next;
907 struct extent_buffer *leaf;
908 struct btrfs_key key;
909 struct list_head head;
910 int nitems, i, last_item;
911 int ret = 0;
912
913 BUG_ON(!path->nodes[0]);
914
915 leaf = path->nodes[0];
916
917 i = path->slots[0];
918 last_item = btrfs_header_nritems(leaf) - 1;
919 if (i > last_item)
920 return -ENOENT; /* FIXME: Is errno suitable? */
921
922 next = item;
923 INIT_LIST_HEAD(&head);
924 btrfs_item_key_to_cpu(leaf, &key, i);
925 nitems = 0;
926 /*
927 * count the number of the dir index items that we can delete in batch
928 */
929 while (btrfs_comp_cpu_keys(&next->key, &key) == 0) {
930 list_add_tail(&next->tree_list, &head);
931 nitems++;
932
933 curr = next;
934 next = __btrfs_next_delayed_item(curr);
935 if (!next)
936 break;
937
938 if (!btrfs_is_continuous_delayed_item(curr, next))
939 break;
940
941 i++;
942 if (i > last_item)
943 break;
944 btrfs_item_key_to_cpu(leaf, &key, i);
945 }
946
947 if (!nitems)
948 return 0;
949
950 ret = btrfs_del_items(trans, root, path, path->slots[0], nitems);
951 if (ret)
952 goto out;
953
954 list_for_each_entry_safe(curr, next, &head, tree_list) {
955 btrfs_delayed_item_release_metadata(root, curr);
956 list_del(&curr->tree_list);
957 btrfs_release_delayed_item(curr);
958 }
959
960out:
961 return ret;
962}
963
964static int btrfs_delete_delayed_items(struct btrfs_trans_handle *trans,
965 struct btrfs_path *path,
966 struct btrfs_root *root,
967 struct btrfs_delayed_node *node)
968{
969 struct btrfs_delayed_item *curr, *prev;
970 int ret = 0;
971
972do_again:
973 mutex_lock(&node->mutex);
974 curr = __btrfs_first_delayed_deletion_item(node);
975 if (!curr)
976 goto delete_fail;
977
978 ret = btrfs_search_slot(trans, root, &curr->key, path, -1, 1);
979 if (ret < 0)
980 goto delete_fail;
981 else if (ret > 0) {
982 /*
983 * can't find the item which the node points to, so this node
984 * is invalid, just drop it.
985 */
986 prev = curr;
987 curr = __btrfs_next_delayed_item(prev);
988 btrfs_release_delayed_item(prev);
989 ret = 0;
Chris Mason945d8962011-05-22 12:33:42 -0400990 btrfs_release_path(path);
Fengguang Wu62095262012-08-04 01:45:02 -0600991 if (curr) {
992 mutex_unlock(&node->mutex);
Miao Xie16cdcec2011-04-22 18:12:22 +0800993 goto do_again;
Fengguang Wu62095262012-08-04 01:45:02 -0600994 } else
Miao Xie16cdcec2011-04-22 18:12:22 +0800995 goto delete_fail;
996 }
997
998 btrfs_batch_delete_items(trans, root, path, curr);
Chris Mason945d8962011-05-22 12:33:42 -0400999 btrfs_release_path(path);
Miao Xie16cdcec2011-04-22 18:12:22 +08001000 mutex_unlock(&node->mutex);
1001 goto do_again;
1002
1003delete_fail:
Chris Mason945d8962011-05-22 12:33:42 -04001004 btrfs_release_path(path);
Miao Xie16cdcec2011-04-22 18:12:22 +08001005 mutex_unlock(&node->mutex);
1006 return ret;
1007}
1008
1009static void btrfs_release_delayed_inode(struct btrfs_delayed_node *delayed_node)
1010{
1011 struct btrfs_delayed_root *delayed_root;
1012
Miao Xie7cf35d92013-12-26 13:07:05 +08001013 if (delayed_node &&
1014 test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
Miao Xie16cdcec2011-04-22 18:12:22 +08001015 BUG_ON(!delayed_node->root);
Miao Xie7cf35d92013-12-26 13:07:05 +08001016 clear_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags);
Miao Xie16cdcec2011-04-22 18:12:22 +08001017 delayed_node->count--;
1018
1019 delayed_root = delayed_node->root->fs_info->delayed_root;
Chris Masonde3cb942013-03-04 17:13:31 -05001020 finish_one_item(delayed_root);
Miao Xie16cdcec2011-04-22 18:12:22 +08001021 }
1022}
1023
Miao Xie67de1172013-12-26 13:07:06 +08001024static void btrfs_release_delayed_iref(struct btrfs_delayed_node *delayed_node)
1025{
1026 struct btrfs_delayed_root *delayed_root;
1027
1028 ASSERT(delayed_node->root);
1029 clear_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags);
1030 delayed_node->count--;
1031
1032 delayed_root = delayed_node->root->fs_info->delayed_root;
1033 finish_one_item(delayed_root);
1034}
1035
Miao Xie0e8c36a2012-12-19 06:59:51 +00001036static int __btrfs_update_delayed_inode(struct btrfs_trans_handle *trans,
1037 struct btrfs_root *root,
1038 struct btrfs_path *path,
1039 struct btrfs_delayed_node *node)
Miao Xie16cdcec2011-04-22 18:12:22 +08001040{
1041 struct btrfs_key key;
1042 struct btrfs_inode_item *inode_item;
1043 struct extent_buffer *leaf;
Miao Xie67de1172013-12-26 13:07:06 +08001044 int mod;
Miao Xie16cdcec2011-04-22 18:12:22 +08001045 int ret;
1046
Miao Xie16cdcec2011-04-22 18:12:22 +08001047 key.objectid = node->inode_id;
David Sterba962a2982014-06-04 18:41:45 +02001048 key.type = BTRFS_INODE_ITEM_KEY;
Miao Xie16cdcec2011-04-22 18:12:22 +08001049 key.offset = 0;
Miao Xie0e8c36a2012-12-19 06:59:51 +00001050
Miao Xie67de1172013-12-26 13:07:06 +08001051 if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &node->flags))
1052 mod = -1;
1053 else
1054 mod = 1;
1055
1056 ret = btrfs_lookup_inode(trans, root, path, &key, mod);
Miao Xie16cdcec2011-04-22 18:12:22 +08001057 if (ret > 0) {
Chris Mason945d8962011-05-22 12:33:42 -04001058 btrfs_release_path(path);
Miao Xie16cdcec2011-04-22 18:12:22 +08001059 return -ENOENT;
1060 } else if (ret < 0) {
Miao Xie16cdcec2011-04-22 18:12:22 +08001061 return ret;
1062 }
1063
Miao Xie16cdcec2011-04-22 18:12:22 +08001064 leaf = path->nodes[0];
1065 inode_item = btrfs_item_ptr(leaf, path->slots[0],
1066 struct btrfs_inode_item);
1067 write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item,
1068 sizeof(struct btrfs_inode_item));
1069 btrfs_mark_buffer_dirty(leaf);
Miao Xie16cdcec2011-04-22 18:12:22 +08001070
Miao Xie67de1172013-12-26 13:07:06 +08001071 if (!test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &node->flags))
1072 goto no_iref;
1073
1074 path->slots[0]++;
1075 if (path->slots[0] >= btrfs_header_nritems(leaf))
1076 goto search;
1077again:
1078 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
1079 if (key.objectid != node->inode_id)
1080 goto out;
1081
1082 if (key.type != BTRFS_INODE_REF_KEY &&
1083 key.type != BTRFS_INODE_EXTREF_KEY)
1084 goto out;
1085
1086 /*
1087 * Delayed iref deletion is for the inode who has only one link,
1088 * so there is only one iref. The case that several irefs are
1089 * in the same item doesn't exist.
1090 */
1091 btrfs_del_item(trans, root, path);
1092out:
1093 btrfs_release_delayed_iref(node);
1094no_iref:
1095 btrfs_release_path(path);
1096err_out:
Miao Xie16cdcec2011-04-22 18:12:22 +08001097 btrfs_delayed_inode_release_metadata(root, node);
1098 btrfs_release_delayed_inode(node);
Miao Xie16cdcec2011-04-22 18:12:22 +08001099
Miao Xie67de1172013-12-26 13:07:06 +08001100 return ret;
1101
1102search:
1103 btrfs_release_path(path);
1104
David Sterba962a2982014-06-04 18:41:45 +02001105 key.type = BTRFS_INODE_EXTREF_KEY;
Miao Xie67de1172013-12-26 13:07:06 +08001106 key.offset = -1;
1107 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1108 if (ret < 0)
1109 goto err_out;
1110 ASSERT(ret);
1111
1112 ret = 0;
1113 leaf = path->nodes[0];
1114 path->slots[0]--;
1115 goto again;
Miao Xie16cdcec2011-04-22 18:12:22 +08001116}
1117
Miao Xie0e8c36a2012-12-19 06:59:51 +00001118static inline int btrfs_update_delayed_inode(struct btrfs_trans_handle *trans,
1119 struct btrfs_root *root,
1120 struct btrfs_path *path,
1121 struct btrfs_delayed_node *node)
1122{
1123 int ret;
1124
1125 mutex_lock(&node->mutex);
Miao Xie7cf35d92013-12-26 13:07:05 +08001126 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &node->flags)) {
Miao Xie0e8c36a2012-12-19 06:59:51 +00001127 mutex_unlock(&node->mutex);
1128 return 0;
1129 }
1130
1131 ret = __btrfs_update_delayed_inode(trans, root, path, node);
1132 mutex_unlock(&node->mutex);
1133 return ret;
1134}
1135
Miao Xie4ea41ce2012-12-19 06:59:03 +00001136static inline int
1137__btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
1138 struct btrfs_path *path,
1139 struct btrfs_delayed_node *node)
1140{
1141 int ret;
1142
1143 ret = btrfs_insert_delayed_items(trans, path, node->root, node);
1144 if (ret)
1145 return ret;
1146
1147 ret = btrfs_delete_delayed_items(trans, path, node->root, node);
1148 if (ret)
1149 return ret;
1150
1151 ret = btrfs_update_delayed_inode(trans, node->root, path, node);
1152 return ret;
1153}
1154
Jeff Mahoney79787ea2012-03-12 16:03:00 +01001155/*
1156 * Called when committing the transaction.
1157 * Returns 0 on success.
1158 * Returns < 0 on error and returns with an aborted transaction with any
1159 * outstanding delayed items cleaned up.
1160 */
Josef Bacik96c3f432012-06-21 14:05:49 -04001161static int __btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
1162 struct btrfs_root *root, int nr)
Miao Xie16cdcec2011-04-22 18:12:22 +08001163{
1164 struct btrfs_delayed_root *delayed_root;
1165 struct btrfs_delayed_node *curr_node, *prev_node;
1166 struct btrfs_path *path;
Miao Xie19fd2942011-06-15 10:47:30 +00001167 struct btrfs_block_rsv *block_rsv;
Miao Xie16cdcec2011-04-22 18:12:22 +08001168 int ret = 0;
Josef Bacik96c3f432012-06-21 14:05:49 -04001169 bool count = (nr > 0);
Miao Xie16cdcec2011-04-22 18:12:22 +08001170
Jeff Mahoney79787ea2012-03-12 16:03:00 +01001171 if (trans->aborted)
1172 return -EIO;
1173
Miao Xie16cdcec2011-04-22 18:12:22 +08001174 path = btrfs_alloc_path();
1175 if (!path)
1176 return -ENOMEM;
1177 path->leave_spinning = 1;
1178
Miao Xie19fd2942011-06-15 10:47:30 +00001179 block_rsv = trans->block_rsv;
Josef Bacik6d668dd2011-11-03 22:54:25 -04001180 trans->block_rsv = &root->fs_info->delayed_block_rsv;
Miao Xie19fd2942011-06-15 10:47:30 +00001181
Miao Xie16cdcec2011-04-22 18:12:22 +08001182 delayed_root = btrfs_get_delayed_root(root);
1183
1184 curr_node = btrfs_first_delayed_node(delayed_root);
Josef Bacik96c3f432012-06-21 14:05:49 -04001185 while (curr_node && (!count || (count && nr--))) {
Miao Xie4ea41ce2012-12-19 06:59:03 +00001186 ret = __btrfs_commit_inode_delayed_items(trans, path,
1187 curr_node);
Miao Xie16cdcec2011-04-22 18:12:22 +08001188 if (ret) {
1189 btrfs_release_delayed_node(curr_node);
Josef Bacik96c3f432012-06-21 14:05:49 -04001190 curr_node = NULL;
Jeff Mahoney79787ea2012-03-12 16:03:00 +01001191 btrfs_abort_transaction(trans, root, ret);
Miao Xie16cdcec2011-04-22 18:12:22 +08001192 break;
1193 }
1194
1195 prev_node = curr_node;
1196 curr_node = btrfs_next_delayed_node(curr_node);
1197 btrfs_release_delayed_node(prev_node);
1198 }
1199
Josef Bacik96c3f432012-06-21 14:05:49 -04001200 if (curr_node)
1201 btrfs_release_delayed_node(curr_node);
Miao Xie16cdcec2011-04-22 18:12:22 +08001202 btrfs_free_path(path);
Miao Xie19fd2942011-06-15 10:47:30 +00001203 trans->block_rsv = block_rsv;
Jeff Mahoney79787ea2012-03-12 16:03:00 +01001204
Miao Xie16cdcec2011-04-22 18:12:22 +08001205 return ret;
1206}
1207
Josef Bacik96c3f432012-06-21 14:05:49 -04001208int btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
1209 struct btrfs_root *root)
1210{
1211 return __btrfs_run_delayed_items(trans, root, -1);
1212}
1213
1214int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans,
1215 struct btrfs_root *root, int nr)
1216{
1217 return __btrfs_run_delayed_items(trans, root, nr);
1218}
1219
Miao Xie16cdcec2011-04-22 18:12:22 +08001220int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
1221 struct inode *inode)
1222{
1223 struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode);
Miao Xie4ea41ce2012-12-19 06:59:03 +00001224 struct btrfs_path *path;
1225 struct btrfs_block_rsv *block_rsv;
Miao Xie16cdcec2011-04-22 18:12:22 +08001226 int ret;
1227
1228 if (!delayed_node)
1229 return 0;
1230
1231 mutex_lock(&delayed_node->mutex);
1232 if (!delayed_node->count) {
1233 mutex_unlock(&delayed_node->mutex);
1234 btrfs_release_delayed_node(delayed_node);
1235 return 0;
1236 }
1237 mutex_unlock(&delayed_node->mutex);
1238
Miao Xie4ea41ce2012-12-19 06:59:03 +00001239 path = btrfs_alloc_path();
Filipe David Borba Manana3c77bd92013-10-12 20:32:59 +01001240 if (!path) {
1241 btrfs_release_delayed_node(delayed_node);
Miao Xie4ea41ce2012-12-19 06:59:03 +00001242 return -ENOMEM;
Filipe David Borba Manana3c77bd92013-10-12 20:32:59 +01001243 }
Miao Xie4ea41ce2012-12-19 06:59:03 +00001244 path->leave_spinning = 1;
1245
1246 block_rsv = trans->block_rsv;
1247 trans->block_rsv = &delayed_node->root->fs_info->delayed_block_rsv;
1248
1249 ret = __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1250
Miao Xie16cdcec2011-04-22 18:12:22 +08001251 btrfs_release_delayed_node(delayed_node);
Miao Xie4ea41ce2012-12-19 06:59:03 +00001252 btrfs_free_path(path);
1253 trans->block_rsv = block_rsv;
1254
Miao Xie16cdcec2011-04-22 18:12:22 +08001255 return ret;
1256}
1257
Miao Xie0e8c36a2012-12-19 06:59:51 +00001258int btrfs_commit_inode_delayed_inode(struct inode *inode)
1259{
1260 struct btrfs_trans_handle *trans;
1261 struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode);
1262 struct btrfs_path *path;
1263 struct btrfs_block_rsv *block_rsv;
1264 int ret;
1265
1266 if (!delayed_node)
1267 return 0;
1268
1269 mutex_lock(&delayed_node->mutex);
Miao Xie7cf35d92013-12-26 13:07:05 +08001270 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
Miao Xie0e8c36a2012-12-19 06:59:51 +00001271 mutex_unlock(&delayed_node->mutex);
1272 btrfs_release_delayed_node(delayed_node);
1273 return 0;
1274 }
1275 mutex_unlock(&delayed_node->mutex);
1276
1277 trans = btrfs_join_transaction(delayed_node->root);
1278 if (IS_ERR(trans)) {
1279 ret = PTR_ERR(trans);
1280 goto out;
1281 }
1282
1283 path = btrfs_alloc_path();
1284 if (!path) {
1285 ret = -ENOMEM;
1286 goto trans_out;
1287 }
1288 path->leave_spinning = 1;
1289
1290 block_rsv = trans->block_rsv;
1291 trans->block_rsv = &delayed_node->root->fs_info->delayed_block_rsv;
1292
1293 mutex_lock(&delayed_node->mutex);
Miao Xie7cf35d92013-12-26 13:07:05 +08001294 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags))
Miao Xie0e8c36a2012-12-19 06:59:51 +00001295 ret = __btrfs_update_delayed_inode(trans, delayed_node->root,
1296 path, delayed_node);
1297 else
1298 ret = 0;
1299 mutex_unlock(&delayed_node->mutex);
1300
1301 btrfs_free_path(path);
1302 trans->block_rsv = block_rsv;
1303trans_out:
1304 btrfs_end_transaction(trans, delayed_node->root);
1305 btrfs_btree_balance_dirty(delayed_node->root);
1306out:
1307 btrfs_release_delayed_node(delayed_node);
1308
1309 return ret;
1310}
1311
Miao Xie16cdcec2011-04-22 18:12:22 +08001312void btrfs_remove_delayed_node(struct inode *inode)
1313{
1314 struct btrfs_delayed_node *delayed_node;
1315
1316 delayed_node = ACCESS_ONCE(BTRFS_I(inode)->delayed_node);
1317 if (!delayed_node)
1318 return;
1319
1320 BTRFS_I(inode)->delayed_node = NULL;
1321 btrfs_release_delayed_node(delayed_node);
1322}
1323
Chris Masonde3cb942013-03-04 17:13:31 -05001324struct btrfs_async_delayed_work {
1325 struct btrfs_delayed_root *delayed_root;
1326 int nr;
Qu Wenruod458b052014-02-28 10:46:19 +08001327 struct btrfs_work work;
Miao Xie16cdcec2011-04-22 18:12:22 +08001328};
1329
Qu Wenruod458b052014-02-28 10:46:19 +08001330static void btrfs_async_run_delayed_root(struct btrfs_work *work)
Miao Xie16cdcec2011-04-22 18:12:22 +08001331{
Chris Masonde3cb942013-03-04 17:13:31 -05001332 struct btrfs_async_delayed_work *async_work;
1333 struct btrfs_delayed_root *delayed_root;
Miao Xie16cdcec2011-04-22 18:12:22 +08001334 struct btrfs_trans_handle *trans;
1335 struct btrfs_path *path;
1336 struct btrfs_delayed_node *delayed_node = NULL;
1337 struct btrfs_root *root;
Miao Xie19fd2942011-06-15 10:47:30 +00001338 struct btrfs_block_rsv *block_rsv;
Chris Masonde3cb942013-03-04 17:13:31 -05001339 int total_done = 0;
Miao Xie16cdcec2011-04-22 18:12:22 +08001340
Chris Masonde3cb942013-03-04 17:13:31 -05001341 async_work = container_of(work, struct btrfs_async_delayed_work, work);
1342 delayed_root = async_work->delayed_root;
Miao Xie16cdcec2011-04-22 18:12:22 +08001343
1344 path = btrfs_alloc_path();
1345 if (!path)
1346 goto out;
Miao Xie16cdcec2011-04-22 18:12:22 +08001347
Chris Masonde3cb942013-03-04 17:13:31 -05001348again:
1349 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND / 2)
1350 goto free_path;
1351
1352 delayed_node = btrfs_first_prepared_delayed_node(delayed_root);
1353 if (!delayed_node)
1354 goto free_path;
1355
1356 path->leave_spinning = 1;
Miao Xie16cdcec2011-04-22 18:12:22 +08001357 root = delayed_node->root;
1358
Chris Masonff5714c2011-05-28 07:00:39 -04001359 trans = btrfs_join_transaction(root);
Miao Xie16cdcec2011-04-22 18:12:22 +08001360 if (IS_ERR(trans))
Chris Masonde3cb942013-03-04 17:13:31 -05001361 goto release_path;
Miao Xie16cdcec2011-04-22 18:12:22 +08001362
Miao Xie19fd2942011-06-15 10:47:30 +00001363 block_rsv = trans->block_rsv;
Josef Bacik6d668dd2011-11-03 22:54:25 -04001364 trans->block_rsv = &root->fs_info->delayed_block_rsv;
Miao Xie19fd2942011-06-15 10:47:30 +00001365
Miao Xie4ea41ce2012-12-19 06:59:03 +00001366 __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
Miao Xie16cdcec2011-04-22 18:12:22 +08001367
Miao Xie19fd2942011-06-15 10:47:30 +00001368 trans->block_rsv = block_rsv;
Miao Xiea56dbd82013-12-26 13:07:04 +08001369 btrfs_end_transaction(trans, root);
Liu Bob53d3f52012-11-14 14:34:34 +00001370 btrfs_btree_balance_dirty_nodelay(root);
Chris Masonde3cb942013-03-04 17:13:31 -05001371
1372release_path:
1373 btrfs_release_path(path);
1374 total_done++;
1375
1376 btrfs_release_prepared_delayed_node(delayed_node);
1377 if (async_work->nr == 0 || total_done < async_work->nr)
1378 goto again;
1379
Miao Xie16cdcec2011-04-22 18:12:22 +08001380free_path:
1381 btrfs_free_path(path);
1382out:
Chris Masonde3cb942013-03-04 17:13:31 -05001383 wake_up(&delayed_root->wait);
1384 kfree(async_work);
Miao Xie16cdcec2011-04-22 18:12:22 +08001385}
1386
Miao Xie16cdcec2011-04-22 18:12:22 +08001387
Chris Masonde3cb942013-03-04 17:13:31 -05001388static int btrfs_wq_run_delayed_node(struct btrfs_delayed_root *delayed_root,
Daniel Dresslera585e942014-11-17 22:05:02 +09001389 struct btrfs_fs_info *fs_info, int nr)
Chris Masonde3cb942013-03-04 17:13:31 -05001390{
1391 struct btrfs_async_delayed_work *async_work;
1392
1393 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND)
Miao Xie16cdcec2011-04-22 18:12:22 +08001394 return 0;
1395
Chris Masonde3cb942013-03-04 17:13:31 -05001396 async_work = kmalloc(sizeof(*async_work), GFP_NOFS);
1397 if (!async_work)
Miao Xie16cdcec2011-04-22 18:12:22 +08001398 return -ENOMEM;
Miao Xie16cdcec2011-04-22 18:12:22 +08001399
Chris Masonde3cb942013-03-04 17:13:31 -05001400 async_work->delayed_root = delayed_root;
Liu Bo9e0af232014-08-15 23:36:53 +08001401 btrfs_init_work(&async_work->work, btrfs_delayed_meta_helper,
1402 btrfs_async_run_delayed_root, NULL, NULL);
Chris Masonde3cb942013-03-04 17:13:31 -05001403 async_work->nr = nr;
Miao Xie16cdcec2011-04-22 18:12:22 +08001404
Daniel Dresslera585e942014-11-17 22:05:02 +09001405 btrfs_queue_work(fs_info->delayed_workers, &async_work->work);
Miao Xie16cdcec2011-04-22 18:12:22 +08001406 return 0;
1407}
1408
Chris Masone9993762011-06-17 16:14:09 -04001409void btrfs_assert_delayed_root_empty(struct btrfs_root *root)
1410{
1411 struct btrfs_delayed_root *delayed_root;
1412 delayed_root = btrfs_get_delayed_root(root);
1413 WARN_ON(btrfs_first_delayed_node(delayed_root));
1414}
1415
Miao Xie03538082013-12-26 13:07:03 +08001416static int could_end_wait(struct btrfs_delayed_root *delayed_root, int seq)
Chris Masonde3cb942013-03-04 17:13:31 -05001417{
1418 int val = atomic_read(&delayed_root->items_seq);
1419
Miao Xie03538082013-12-26 13:07:03 +08001420 if (val < seq || val >= seq + BTRFS_DELAYED_BATCH)
Chris Masonde3cb942013-03-04 17:13:31 -05001421 return 1;
Miao Xie03538082013-12-26 13:07:03 +08001422
1423 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND)
1424 return 1;
1425
Chris Masonde3cb942013-03-04 17:13:31 -05001426 return 0;
1427}
1428
Miao Xie16cdcec2011-04-22 18:12:22 +08001429void btrfs_balance_delayed_items(struct btrfs_root *root)
1430{
1431 struct btrfs_delayed_root *delayed_root;
Daniel Dresslera585e942014-11-17 22:05:02 +09001432 struct btrfs_fs_info *fs_info = root->fs_info;
Miao Xie16cdcec2011-04-22 18:12:22 +08001433
1434 delayed_root = btrfs_get_delayed_root(root);
1435
1436 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND)
1437 return;
1438
1439 if (atomic_read(&delayed_root->items) >= BTRFS_DELAYED_WRITEBACK) {
Miao Xie03538082013-12-26 13:07:03 +08001440 int seq;
Miao Xie16cdcec2011-04-22 18:12:22 +08001441 int ret;
Miao Xie03538082013-12-26 13:07:03 +08001442
1443 seq = atomic_read(&delayed_root->items_seq);
Chris Masonde3cb942013-03-04 17:13:31 -05001444
Daniel Dresslera585e942014-11-17 22:05:02 +09001445 ret = btrfs_wq_run_delayed_node(delayed_root, fs_info, 0);
Miao Xie16cdcec2011-04-22 18:12:22 +08001446 if (ret)
1447 return;
1448
Miao Xie03538082013-12-26 13:07:03 +08001449 wait_event_interruptible(delayed_root->wait,
1450 could_end_wait(delayed_root, seq));
Miao Xie4dd466d2013-12-26 13:07:02 +08001451 return;
Miao Xie16cdcec2011-04-22 18:12:22 +08001452 }
1453
Daniel Dresslera585e942014-11-17 22:05:02 +09001454 btrfs_wq_run_delayed_node(delayed_root, fs_info, BTRFS_DELAYED_BATCH);
Miao Xie16cdcec2011-04-22 18:12:22 +08001455}
1456
Jeff Mahoney79787ea2012-03-12 16:03:00 +01001457/* Will return 0 or -ENOMEM */
Miao Xie16cdcec2011-04-22 18:12:22 +08001458int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
1459 struct btrfs_root *root, const char *name,
1460 int name_len, struct inode *dir,
1461 struct btrfs_disk_key *disk_key, u8 type,
1462 u64 index)
1463{
1464 struct btrfs_delayed_node *delayed_node;
1465 struct btrfs_delayed_item *delayed_item;
1466 struct btrfs_dir_item *dir_item;
1467 int ret;
1468
1469 delayed_node = btrfs_get_or_create_delayed_node(dir);
1470 if (IS_ERR(delayed_node))
1471 return PTR_ERR(delayed_node);
1472
1473 delayed_item = btrfs_alloc_delayed_item(sizeof(*dir_item) + name_len);
1474 if (!delayed_item) {
1475 ret = -ENOMEM;
1476 goto release_node;
1477 }
1478
Chris Mason0d0ca302011-05-22 07:11:22 -04001479 delayed_item->key.objectid = btrfs_ino(dir);
David Sterba962a2982014-06-04 18:41:45 +02001480 delayed_item->key.type = BTRFS_DIR_INDEX_KEY;
Miao Xie16cdcec2011-04-22 18:12:22 +08001481 delayed_item->key.offset = index;
1482
1483 dir_item = (struct btrfs_dir_item *)delayed_item->data;
1484 dir_item->location = *disk_key;
Qu Wenruo3cae2102013-07-16 11:19:18 +08001485 btrfs_set_stack_dir_transid(dir_item, trans->transid);
1486 btrfs_set_stack_dir_data_len(dir_item, 0);
1487 btrfs_set_stack_dir_name_len(dir_item, name_len);
1488 btrfs_set_stack_dir_type(dir_item, type);
Miao Xie16cdcec2011-04-22 18:12:22 +08001489 memcpy((char *)(dir_item + 1), name, name_len);
1490
Josef Bacik8c2a3ca2012-01-10 10:31:31 -05001491 ret = btrfs_delayed_item_reserve_metadata(trans, root, delayed_item);
1492 /*
1493 * we have reserved enough space when we start a new transaction,
1494 * so reserving metadata failure is impossible
1495 */
1496 BUG_ON(ret);
1497
1498
Miao Xie16cdcec2011-04-22 18:12:22 +08001499 mutex_lock(&delayed_node->mutex);
1500 ret = __btrfs_add_delayed_insertion_item(delayed_node, delayed_item);
1501 if (unlikely(ret)) {
Frank Holtonefe120a2013-12-20 11:37:06 -05001502 btrfs_err(root->fs_info, "err add delayed dir index item(name: %.*s) "
Filipe David Borba Mananabdab49d2013-08-20 17:51:48 +01001503 "into the insertion tree of the delayed node"
Frank Holtonefe120a2013-12-20 11:37:06 -05001504 "(root id: %llu, inode id: %llu, errno: %d)",
Filipe David Borba Mananabdab49d2013-08-20 17:51:48 +01001505 name_len, name, delayed_node->root->objectid,
Geert Uytterhoevenc1c9ff72013-08-20 13:20:07 +02001506 delayed_node->inode_id, ret);
Miao Xie16cdcec2011-04-22 18:12:22 +08001507 BUG();
1508 }
1509 mutex_unlock(&delayed_node->mutex);
1510
1511release_node:
1512 btrfs_release_delayed_node(delayed_node);
1513 return ret;
1514}
1515
1516static int btrfs_delete_delayed_insertion_item(struct btrfs_root *root,
1517 struct btrfs_delayed_node *node,
1518 struct btrfs_key *key)
1519{
1520 struct btrfs_delayed_item *item;
1521
1522 mutex_lock(&node->mutex);
1523 item = __btrfs_lookup_delayed_insertion_item(node, key);
1524 if (!item) {
1525 mutex_unlock(&node->mutex);
1526 return 1;
1527 }
1528
1529 btrfs_delayed_item_release_metadata(root, item);
1530 btrfs_release_delayed_item(item);
1531 mutex_unlock(&node->mutex);
1532 return 0;
1533}
1534
1535int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
1536 struct btrfs_root *root, struct inode *dir,
1537 u64 index)
1538{
1539 struct btrfs_delayed_node *node;
1540 struct btrfs_delayed_item *item;
1541 struct btrfs_key item_key;
1542 int ret;
1543
1544 node = btrfs_get_or_create_delayed_node(dir);
1545 if (IS_ERR(node))
1546 return PTR_ERR(node);
1547
Chris Mason0d0ca302011-05-22 07:11:22 -04001548 item_key.objectid = btrfs_ino(dir);
David Sterba962a2982014-06-04 18:41:45 +02001549 item_key.type = BTRFS_DIR_INDEX_KEY;
Miao Xie16cdcec2011-04-22 18:12:22 +08001550 item_key.offset = index;
1551
1552 ret = btrfs_delete_delayed_insertion_item(root, node, &item_key);
1553 if (!ret)
1554 goto end;
1555
1556 item = btrfs_alloc_delayed_item(0);
1557 if (!item) {
1558 ret = -ENOMEM;
1559 goto end;
1560 }
1561
1562 item->key = item_key;
1563
1564 ret = btrfs_delayed_item_reserve_metadata(trans, root, item);
1565 /*
1566 * we have reserved enough space when we start a new transaction,
1567 * so reserving metadata failure is impossible.
1568 */
1569 BUG_ON(ret);
1570
1571 mutex_lock(&node->mutex);
1572 ret = __btrfs_add_delayed_deletion_item(node, item);
1573 if (unlikely(ret)) {
Frank Holtonefe120a2013-12-20 11:37:06 -05001574 btrfs_err(root->fs_info, "err add delayed dir index item(index: %llu) "
Miao Xie16cdcec2011-04-22 18:12:22 +08001575 "into the deletion tree of the delayed node"
Frank Holtonefe120a2013-12-20 11:37:06 -05001576 "(root id: %llu, inode id: %llu, errno: %d)",
Geert Uytterhoevenc1c9ff72013-08-20 13:20:07 +02001577 index, node->root->objectid, node->inode_id,
Miao Xie16cdcec2011-04-22 18:12:22 +08001578 ret);
1579 BUG();
1580 }
1581 mutex_unlock(&node->mutex);
1582end:
1583 btrfs_release_delayed_node(node);
1584 return ret;
1585}
1586
1587int btrfs_inode_delayed_dir_index_count(struct inode *inode)
1588{
Miao Xie2f7e33d2011-06-23 07:27:13 +00001589 struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode);
Miao Xie16cdcec2011-04-22 18:12:22 +08001590
1591 if (!delayed_node)
1592 return -ENOENT;
1593
1594 /*
1595 * Since we have held i_mutex of this directory, it is impossible that
1596 * a new directory index is added into the delayed node and index_cnt
1597 * is updated now. So we needn't lock the delayed node.
1598 */
Miao Xie2f7e33d2011-06-23 07:27:13 +00001599 if (!delayed_node->index_cnt) {
1600 btrfs_release_delayed_node(delayed_node);
Miao Xie16cdcec2011-04-22 18:12:22 +08001601 return -EINVAL;
Miao Xie2f7e33d2011-06-23 07:27:13 +00001602 }
Miao Xie16cdcec2011-04-22 18:12:22 +08001603
1604 BTRFS_I(inode)->index_cnt = delayed_node->index_cnt;
Miao Xie2f7e33d2011-06-23 07:27:13 +00001605 btrfs_release_delayed_node(delayed_node);
1606 return 0;
Miao Xie16cdcec2011-04-22 18:12:22 +08001607}
1608
Omar Sandoval02dbfc92016-05-20 13:50:33 -07001609bool btrfs_readdir_get_delayed_items(struct inode *inode,
1610 struct list_head *ins_list,
1611 struct list_head *del_list)
Miao Xie16cdcec2011-04-22 18:12:22 +08001612{
1613 struct btrfs_delayed_node *delayed_node;
1614 struct btrfs_delayed_item *item;
1615
1616 delayed_node = btrfs_get_delayed_node(inode);
1617 if (!delayed_node)
Omar Sandoval02dbfc92016-05-20 13:50:33 -07001618 return false;
1619
1620 /*
1621 * We can only do one readdir with delayed items at a time because of
1622 * item->readdir_list.
1623 */
1624 inode_unlock_shared(inode);
1625 inode_lock(inode);
Miao Xie16cdcec2011-04-22 18:12:22 +08001626
1627 mutex_lock(&delayed_node->mutex);
1628 item = __btrfs_first_delayed_insertion_item(delayed_node);
1629 while (item) {
1630 atomic_inc(&item->refs);
1631 list_add_tail(&item->readdir_list, ins_list);
1632 item = __btrfs_next_delayed_item(item);
1633 }
1634
1635 item = __btrfs_first_delayed_deletion_item(delayed_node);
1636 while (item) {
1637 atomic_inc(&item->refs);
1638 list_add_tail(&item->readdir_list, del_list);
1639 item = __btrfs_next_delayed_item(item);
1640 }
1641 mutex_unlock(&delayed_node->mutex);
1642 /*
1643 * This delayed node is still cached in the btrfs inode, so refs
1644 * must be > 1 now, and we needn't check it is going to be freed
1645 * or not.
1646 *
1647 * Besides that, this function is used to read dir, we do not
1648 * insert/delete delayed items in this period. So we also needn't
1649 * requeue or dequeue this delayed node.
1650 */
1651 atomic_dec(&delayed_node->refs);
Omar Sandoval02dbfc92016-05-20 13:50:33 -07001652
1653 return true;
Miao Xie16cdcec2011-04-22 18:12:22 +08001654}
1655
Omar Sandoval02dbfc92016-05-20 13:50:33 -07001656void btrfs_readdir_put_delayed_items(struct inode *inode,
1657 struct list_head *ins_list,
1658 struct list_head *del_list)
Miao Xie16cdcec2011-04-22 18:12:22 +08001659{
1660 struct btrfs_delayed_item *curr, *next;
1661
1662 list_for_each_entry_safe(curr, next, ins_list, readdir_list) {
1663 list_del(&curr->readdir_list);
1664 if (atomic_dec_and_test(&curr->refs))
1665 kfree(curr);
1666 }
1667
1668 list_for_each_entry_safe(curr, next, del_list, readdir_list) {
1669 list_del(&curr->readdir_list);
1670 if (atomic_dec_and_test(&curr->refs))
1671 kfree(curr);
1672 }
Omar Sandoval02dbfc92016-05-20 13:50:33 -07001673
1674 /*
1675 * The VFS is going to do up_read(), so we need to downgrade back to a
1676 * read lock.
1677 */
1678 downgrade_write(&inode->i_rwsem);
Miao Xie16cdcec2011-04-22 18:12:22 +08001679}
1680
1681int btrfs_should_delete_dir_index(struct list_head *del_list,
1682 u64 index)
1683{
1684 struct btrfs_delayed_item *curr, *next;
1685 int ret;
1686
1687 if (list_empty(del_list))
1688 return 0;
1689
1690 list_for_each_entry_safe(curr, next, del_list, readdir_list) {
1691 if (curr->key.offset > index)
1692 break;
1693
1694 list_del(&curr->readdir_list);
1695 ret = (curr->key.offset == index);
1696
1697 if (atomic_dec_and_test(&curr->refs))
1698 kfree(curr);
1699
1700 if (ret)
1701 return 1;
1702 else
1703 continue;
1704 }
1705 return 0;
1706}
1707
1708/*
1709 * btrfs_readdir_delayed_dir_index - read dir info stored in the delayed tree
1710 *
1711 */
Al Viro9cdda8d2013-05-22 16:48:09 -04001712int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
David Sterbabc4ef752015-11-13 13:44:28 +01001713 struct list_head *ins_list, bool *emitted)
Miao Xie16cdcec2011-04-22 18:12:22 +08001714{
1715 struct btrfs_dir_item *di;
1716 struct btrfs_delayed_item *curr, *next;
1717 struct btrfs_key location;
1718 char *name;
1719 int name_len;
1720 int over = 0;
1721 unsigned char d_type;
1722
1723 if (list_empty(ins_list))
1724 return 0;
1725
1726 /*
1727 * Changing the data of the delayed item is impossible. So
1728 * we needn't lock them. And we have held i_mutex of the
1729 * directory, nobody can delete any directory indexes now.
1730 */
1731 list_for_each_entry_safe(curr, next, ins_list, readdir_list) {
1732 list_del(&curr->readdir_list);
1733
Al Viro9cdda8d2013-05-22 16:48:09 -04001734 if (curr->key.offset < ctx->pos) {
Miao Xie16cdcec2011-04-22 18:12:22 +08001735 if (atomic_dec_and_test(&curr->refs))
1736 kfree(curr);
1737 continue;
1738 }
1739
Al Viro9cdda8d2013-05-22 16:48:09 -04001740 ctx->pos = curr->key.offset;
Miao Xie16cdcec2011-04-22 18:12:22 +08001741
1742 di = (struct btrfs_dir_item *)curr->data;
1743 name = (char *)(di + 1);
Qu Wenruo3cae2102013-07-16 11:19:18 +08001744 name_len = btrfs_stack_dir_name_len(di);
Miao Xie16cdcec2011-04-22 18:12:22 +08001745
1746 d_type = btrfs_filetype_table[di->type];
1747 btrfs_disk_key_to_cpu(&location, &di->location);
1748
Al Viro9cdda8d2013-05-22 16:48:09 -04001749 over = !dir_emit(ctx, name, name_len,
Miao Xie16cdcec2011-04-22 18:12:22 +08001750 location.objectid, d_type);
1751
1752 if (atomic_dec_and_test(&curr->refs))
1753 kfree(curr);
1754
1755 if (over)
1756 return 1;
David Sterbabc4ef752015-11-13 13:44:28 +01001757 *emitted = true;
Miao Xie16cdcec2011-04-22 18:12:22 +08001758 }
1759 return 0;
1760}
1761
Miao Xie16cdcec2011-04-22 18:12:22 +08001762static void fill_stack_inode_item(struct btrfs_trans_handle *trans,
1763 struct btrfs_inode_item *inode_item,
1764 struct inode *inode)
1765{
Eric W. Biederman2f2f43d2012-02-10 11:05:07 -08001766 btrfs_set_stack_inode_uid(inode_item, i_uid_read(inode));
1767 btrfs_set_stack_inode_gid(inode_item, i_gid_read(inode));
Miao Xie16cdcec2011-04-22 18:12:22 +08001768 btrfs_set_stack_inode_size(inode_item, BTRFS_I(inode)->disk_i_size);
1769 btrfs_set_stack_inode_mode(inode_item, inode->i_mode);
1770 btrfs_set_stack_inode_nlink(inode_item, inode->i_nlink);
1771 btrfs_set_stack_inode_nbytes(inode_item, inode_get_bytes(inode));
1772 btrfs_set_stack_inode_generation(inode_item,
1773 BTRFS_I(inode)->generation);
Josef Bacik0c4d2d92012-04-05 15:03:02 -04001774 btrfs_set_stack_inode_sequence(inode_item, inode->i_version);
Miao Xie16cdcec2011-04-22 18:12:22 +08001775 btrfs_set_stack_inode_transid(inode_item, trans->transid);
1776 btrfs_set_stack_inode_rdev(inode_item, inode->i_rdev);
1777 btrfs_set_stack_inode_flags(inode_item, BTRFS_I(inode)->flags);
Chris Masonff5714c2011-05-28 07:00:39 -04001778 btrfs_set_stack_inode_block_group(inode_item, 0);
Miao Xie16cdcec2011-04-22 18:12:22 +08001779
David Sterbaa937b972014-12-12 17:39:12 +01001780 btrfs_set_stack_timespec_sec(&inode_item->atime,
Miao Xie16cdcec2011-04-22 18:12:22 +08001781 inode->i_atime.tv_sec);
David Sterbaa937b972014-12-12 17:39:12 +01001782 btrfs_set_stack_timespec_nsec(&inode_item->atime,
Miao Xie16cdcec2011-04-22 18:12:22 +08001783 inode->i_atime.tv_nsec);
1784
David Sterbaa937b972014-12-12 17:39:12 +01001785 btrfs_set_stack_timespec_sec(&inode_item->mtime,
Miao Xie16cdcec2011-04-22 18:12:22 +08001786 inode->i_mtime.tv_sec);
David Sterbaa937b972014-12-12 17:39:12 +01001787 btrfs_set_stack_timespec_nsec(&inode_item->mtime,
Miao Xie16cdcec2011-04-22 18:12:22 +08001788 inode->i_mtime.tv_nsec);
1789
David Sterbaa937b972014-12-12 17:39:12 +01001790 btrfs_set_stack_timespec_sec(&inode_item->ctime,
Miao Xie16cdcec2011-04-22 18:12:22 +08001791 inode->i_ctime.tv_sec);
David Sterbaa937b972014-12-12 17:39:12 +01001792 btrfs_set_stack_timespec_nsec(&inode_item->ctime,
Miao Xie16cdcec2011-04-22 18:12:22 +08001793 inode->i_ctime.tv_nsec);
chandan r9cc97d62012-07-04 12:48:07 +05301794
1795 btrfs_set_stack_timespec_sec(&inode_item->otime,
1796 BTRFS_I(inode)->i_otime.tv_sec);
1797 btrfs_set_stack_timespec_nsec(&inode_item->otime,
1798 BTRFS_I(inode)->i_otime.tv_nsec);
Miao Xie16cdcec2011-04-22 18:12:22 +08001799}
1800
Miao Xie2f7e33d2011-06-23 07:27:13 +00001801int btrfs_fill_inode(struct inode *inode, u32 *rdev)
1802{
1803 struct btrfs_delayed_node *delayed_node;
1804 struct btrfs_inode_item *inode_item;
Miao Xie2f7e33d2011-06-23 07:27:13 +00001805
1806 delayed_node = btrfs_get_delayed_node(inode);
1807 if (!delayed_node)
1808 return -ENOENT;
1809
1810 mutex_lock(&delayed_node->mutex);
Miao Xie7cf35d92013-12-26 13:07:05 +08001811 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
Miao Xie2f7e33d2011-06-23 07:27:13 +00001812 mutex_unlock(&delayed_node->mutex);
1813 btrfs_release_delayed_node(delayed_node);
1814 return -ENOENT;
1815 }
1816
1817 inode_item = &delayed_node->inode_item;
1818
Eric W. Biederman2f2f43d2012-02-10 11:05:07 -08001819 i_uid_write(inode, btrfs_stack_inode_uid(inode_item));
1820 i_gid_write(inode, btrfs_stack_inode_gid(inode_item));
Miao Xie2f7e33d2011-06-23 07:27:13 +00001821 btrfs_i_size_write(inode, btrfs_stack_inode_size(inode_item));
1822 inode->i_mode = btrfs_stack_inode_mode(inode_item);
Miklos Szeredibfe86842011-10-28 14:13:29 +02001823 set_nlink(inode, btrfs_stack_inode_nlink(inode_item));
Miao Xie2f7e33d2011-06-23 07:27:13 +00001824 inode_set_bytes(inode, btrfs_stack_inode_nbytes(inode_item));
1825 BTRFS_I(inode)->generation = btrfs_stack_inode_generation(inode_item);
Yang Dongsheng6e17d302015-04-09 12:08:43 +08001826 BTRFS_I(inode)->last_trans = btrfs_stack_inode_transid(inode_item);
1827
Josef Bacik0c4d2d92012-04-05 15:03:02 -04001828 inode->i_version = btrfs_stack_inode_sequence(inode_item);
Miao Xie2f7e33d2011-06-23 07:27:13 +00001829 inode->i_rdev = 0;
1830 *rdev = btrfs_stack_inode_rdev(inode_item);
1831 BTRFS_I(inode)->flags = btrfs_stack_inode_flags(inode_item);
1832
David Sterbaa937b972014-12-12 17:39:12 +01001833 inode->i_atime.tv_sec = btrfs_stack_timespec_sec(&inode_item->atime);
1834 inode->i_atime.tv_nsec = btrfs_stack_timespec_nsec(&inode_item->atime);
Miao Xie2f7e33d2011-06-23 07:27:13 +00001835
David Sterbaa937b972014-12-12 17:39:12 +01001836 inode->i_mtime.tv_sec = btrfs_stack_timespec_sec(&inode_item->mtime);
1837 inode->i_mtime.tv_nsec = btrfs_stack_timespec_nsec(&inode_item->mtime);
Miao Xie2f7e33d2011-06-23 07:27:13 +00001838
David Sterbaa937b972014-12-12 17:39:12 +01001839 inode->i_ctime.tv_sec = btrfs_stack_timespec_sec(&inode_item->ctime);
1840 inode->i_ctime.tv_nsec = btrfs_stack_timespec_nsec(&inode_item->ctime);
Miao Xie2f7e33d2011-06-23 07:27:13 +00001841
chandan r9cc97d62012-07-04 12:48:07 +05301842 BTRFS_I(inode)->i_otime.tv_sec =
1843 btrfs_stack_timespec_sec(&inode_item->otime);
1844 BTRFS_I(inode)->i_otime.tv_nsec =
1845 btrfs_stack_timespec_nsec(&inode_item->otime);
1846
Miao Xie2f7e33d2011-06-23 07:27:13 +00001847 inode->i_generation = BTRFS_I(inode)->generation;
1848 BTRFS_I(inode)->index_cnt = (u64)-1;
1849
1850 mutex_unlock(&delayed_node->mutex);
1851 btrfs_release_delayed_node(delayed_node);
1852 return 0;
1853}
1854
Miao Xie16cdcec2011-04-22 18:12:22 +08001855int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
1856 struct btrfs_root *root, struct inode *inode)
1857{
1858 struct btrfs_delayed_node *delayed_node;
David Sterbaaa0467d2011-06-03 16:29:08 +02001859 int ret = 0;
Miao Xie16cdcec2011-04-22 18:12:22 +08001860
1861 delayed_node = btrfs_get_or_create_delayed_node(inode);
1862 if (IS_ERR(delayed_node))
1863 return PTR_ERR(delayed_node);
1864
1865 mutex_lock(&delayed_node->mutex);
Miao Xie7cf35d92013-12-26 13:07:05 +08001866 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
Miao Xie16cdcec2011-04-22 18:12:22 +08001867 fill_stack_inode_item(trans, &delayed_node->inode_item, inode);
1868 goto release_node;
1869 }
1870
Josef Bacik7fd2ae22011-11-08 15:47:34 -05001871 ret = btrfs_delayed_inode_reserve_metadata(trans, root, inode,
1872 delayed_node);
Josef Bacikc06a0e12011-11-04 19:56:02 -04001873 if (ret)
1874 goto release_node;
Miao Xie16cdcec2011-04-22 18:12:22 +08001875
1876 fill_stack_inode_item(trans, &delayed_node->inode_item, inode);
Miao Xie7cf35d92013-12-26 13:07:05 +08001877 set_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags);
Miao Xie16cdcec2011-04-22 18:12:22 +08001878 delayed_node->count++;
1879 atomic_inc(&root->fs_info->delayed_root->items);
1880release_node:
1881 mutex_unlock(&delayed_node->mutex);
1882 btrfs_release_delayed_node(delayed_node);
1883 return ret;
1884}
1885
Miao Xie67de1172013-12-26 13:07:06 +08001886int btrfs_delayed_delete_inode_ref(struct inode *inode)
1887{
1888 struct btrfs_delayed_node *delayed_node;
1889
Chris Mason6f896052014-12-31 12:18:29 -05001890 /*
1891 * we don't do delayed inode updates during log recovery because it
1892 * leads to enospc problems. This means we also can't do
1893 * delayed inode refs
1894 */
1895 if (BTRFS_I(inode)->root->fs_info->log_root_recovering)
1896 return -EAGAIN;
1897
Miao Xie67de1172013-12-26 13:07:06 +08001898 delayed_node = btrfs_get_or_create_delayed_node(inode);
1899 if (IS_ERR(delayed_node))
1900 return PTR_ERR(delayed_node);
1901
1902 /*
1903 * We don't reserve space for inode ref deletion is because:
1904 * - We ONLY do async inode ref deletion for the inode who has only
1905 * one link(i_nlink == 1), it means there is only one inode ref.
1906 * And in most case, the inode ref and the inode item are in the
1907 * same leaf, and we will deal with them at the same time.
1908 * Since we are sure we will reserve the space for the inode item,
1909 * it is unnecessary to reserve space for inode ref deletion.
1910 * - If the inode ref and the inode item are not in the same leaf,
1911 * We also needn't worry about enospc problem, because we reserve
1912 * much more space for the inode update than it needs.
1913 * - At the worst, we can steal some space from the global reservation.
1914 * It is very rare.
1915 */
1916 mutex_lock(&delayed_node->mutex);
1917 if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags))
1918 goto release_node;
1919
1920 set_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags);
1921 delayed_node->count++;
1922 atomic_inc(&BTRFS_I(inode)->root->fs_info->delayed_root->items);
1923release_node:
1924 mutex_unlock(&delayed_node->mutex);
1925 btrfs_release_delayed_node(delayed_node);
1926 return 0;
1927}
1928
Miao Xie16cdcec2011-04-22 18:12:22 +08001929static void __btrfs_kill_delayed_node(struct btrfs_delayed_node *delayed_node)
1930{
1931 struct btrfs_root *root = delayed_node->root;
1932 struct btrfs_delayed_item *curr_item, *prev_item;
1933
1934 mutex_lock(&delayed_node->mutex);
1935 curr_item = __btrfs_first_delayed_insertion_item(delayed_node);
1936 while (curr_item) {
1937 btrfs_delayed_item_release_metadata(root, curr_item);
1938 prev_item = curr_item;
1939 curr_item = __btrfs_next_delayed_item(prev_item);
1940 btrfs_release_delayed_item(prev_item);
1941 }
1942
1943 curr_item = __btrfs_first_delayed_deletion_item(delayed_node);
1944 while (curr_item) {
1945 btrfs_delayed_item_release_metadata(root, curr_item);
1946 prev_item = curr_item;
1947 curr_item = __btrfs_next_delayed_item(prev_item);
1948 btrfs_release_delayed_item(prev_item);
1949 }
1950
Miao Xie67de1172013-12-26 13:07:06 +08001951 if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags))
1952 btrfs_release_delayed_iref(delayed_node);
1953
Miao Xie7cf35d92013-12-26 13:07:05 +08001954 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
Miao Xie16cdcec2011-04-22 18:12:22 +08001955 btrfs_delayed_inode_release_metadata(root, delayed_node);
1956 btrfs_release_delayed_inode(delayed_node);
1957 }
1958 mutex_unlock(&delayed_node->mutex);
1959}
1960
1961void btrfs_kill_delayed_inode_items(struct inode *inode)
1962{
1963 struct btrfs_delayed_node *delayed_node;
1964
1965 delayed_node = btrfs_get_delayed_node(inode);
1966 if (!delayed_node)
1967 return;
1968
1969 __btrfs_kill_delayed_node(delayed_node);
1970 btrfs_release_delayed_node(delayed_node);
1971}
1972
1973void btrfs_kill_all_delayed_nodes(struct btrfs_root *root)
1974{
1975 u64 inode_id = 0;
1976 struct btrfs_delayed_node *delayed_nodes[8];
1977 int i, n;
1978
1979 while (1) {
1980 spin_lock(&root->inode_lock);
1981 n = radix_tree_gang_lookup(&root->delayed_nodes_tree,
1982 (void **)delayed_nodes, inode_id,
1983 ARRAY_SIZE(delayed_nodes));
1984 if (!n) {
1985 spin_unlock(&root->inode_lock);
1986 break;
1987 }
1988
1989 inode_id = delayed_nodes[n - 1]->inode_id + 1;
1990
1991 for (i = 0; i < n; i++)
1992 atomic_inc(&delayed_nodes[i]->refs);
1993 spin_unlock(&root->inode_lock);
1994
1995 for (i = 0; i < n; i++) {
1996 __btrfs_kill_delayed_node(delayed_nodes[i]);
1997 btrfs_release_delayed_node(delayed_nodes[i]);
1998 }
1999 }
2000}
Miao Xie67cde342012-06-14 02:23:22 -06002001
2002void btrfs_destroy_delayed_inodes(struct btrfs_root *root)
2003{
2004 struct btrfs_delayed_root *delayed_root;
2005 struct btrfs_delayed_node *curr_node, *prev_node;
2006
2007 delayed_root = btrfs_get_delayed_root(root);
2008
2009 curr_node = btrfs_first_delayed_node(delayed_root);
2010 while (curr_node) {
2011 __btrfs_kill_delayed_node(curr_node);
2012
2013 prev_node = curr_node;
2014 curr_node = btrfs_next_delayed_node(curr_node);
2015 btrfs_release_delayed_node(prev_node);
2016 }
2017}
2018