2 * Copyright (C) 2011 Fujitsu. All rights reserved.
3 * Written by Miao Xie <miaox@cn.fujitsu.com>
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.
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.
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.
20 #include <linux/slab.h>
21 #include "delayed-inode.h"
23 #include "transaction.h"
26 #define BTRFS_DELAYED_WRITEBACK 512
27 #define BTRFS_DELAYED_BACKGROUND 128
28 #define BTRFS_DELAYED_BATCH 16
30 static struct kmem_cache *delayed_node_cache;
32 int __init btrfs_delayed_inode_init(void)
34 delayed_node_cache = kmem_cache_create("btrfs_delayed_node",
35 sizeof(struct btrfs_delayed_node),
37 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD,
39 if (!delayed_node_cache)
44 void btrfs_delayed_inode_exit(void)
46 if (delayed_node_cache)
47 kmem_cache_destroy(delayed_node_cache);
50 static inline void btrfs_init_delayed_node(
51 struct btrfs_delayed_node *delayed_node,
52 struct btrfs_root *root, u64 inode_id)
54 delayed_node->root = root;
55 delayed_node->inode_id = inode_id;
56 atomic_set(&delayed_node->refs, 0);
57 delayed_node->count = 0;
58 delayed_node->flags = 0;
59 delayed_node->ins_root = RB_ROOT;
60 delayed_node->del_root = RB_ROOT;
61 mutex_init(&delayed_node->mutex);
62 delayed_node->index_cnt = 0;
63 INIT_LIST_HEAD(&delayed_node->n_list);
64 INIT_LIST_HEAD(&delayed_node->p_list);
65 delayed_node->bytes_reserved = 0;
66 memset(&delayed_node->inode_item, 0, sizeof(delayed_node->inode_item));
69 static inline int btrfs_is_continuous_delayed_item(
70 struct btrfs_delayed_item *item1,
71 struct btrfs_delayed_item *item2)
73 if (item1->key.type == BTRFS_DIR_INDEX_KEY &&
74 item1->key.objectid == item2->key.objectid &&
75 item1->key.type == item2->key.type &&
76 item1->key.offset + 1 == item2->key.offset)
81 static inline struct btrfs_delayed_root *btrfs_get_delayed_root(
82 struct btrfs_root *root)
84 return root->fs_info->delayed_root;
87 static struct btrfs_delayed_node *btrfs_get_delayed_node(struct inode *inode)
89 struct btrfs_inode *btrfs_inode = BTRFS_I(inode);
90 struct btrfs_root *root = btrfs_inode->root;
91 u64 ino = btrfs_ino(inode);
92 struct btrfs_delayed_node *node;
94 node = ACCESS_ONCE(btrfs_inode->delayed_node);
96 atomic_inc(&node->refs);
100 spin_lock(&root->inode_lock);
101 node = radix_tree_lookup(&root->delayed_nodes_tree, ino);
103 if (btrfs_inode->delayed_node) {
104 atomic_inc(&node->refs); /* can be accessed */
105 BUG_ON(btrfs_inode->delayed_node != node);
106 spin_unlock(&root->inode_lock);
109 btrfs_inode->delayed_node = node;
110 /* can be accessed and cached in the inode */
111 atomic_add(2, &node->refs);
112 spin_unlock(&root->inode_lock);
115 spin_unlock(&root->inode_lock);
120 /* Will return either the node or PTR_ERR(-ENOMEM) */
121 static struct btrfs_delayed_node *btrfs_get_or_create_delayed_node(
124 struct btrfs_delayed_node *node;
125 struct btrfs_inode *btrfs_inode = BTRFS_I(inode);
126 struct btrfs_root *root = btrfs_inode->root;
127 u64 ino = btrfs_ino(inode);
131 node = btrfs_get_delayed_node(inode);
135 node = kmem_cache_alloc(delayed_node_cache, GFP_NOFS);
137 return ERR_PTR(-ENOMEM);
138 btrfs_init_delayed_node(node, root, ino);
140 /* cached in the btrfs inode and can be accessed */
141 atomic_add(2, &node->refs);
143 ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM);
145 kmem_cache_free(delayed_node_cache, node);
149 spin_lock(&root->inode_lock);
150 ret = radix_tree_insert(&root->delayed_nodes_tree, ino, node);
151 if (ret == -EEXIST) {
152 kmem_cache_free(delayed_node_cache, node);
153 spin_unlock(&root->inode_lock);
154 radix_tree_preload_end();
157 btrfs_inode->delayed_node = node;
158 spin_unlock(&root->inode_lock);
159 radix_tree_preload_end();
165 * Call it when holding delayed_node->mutex
167 * If mod = 1, add this node into the prepared list.
169 static void btrfs_queue_delayed_node(struct btrfs_delayed_root *root,
170 struct btrfs_delayed_node *node,
173 spin_lock(&root->lock);
174 if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) {
175 if (!list_empty(&node->p_list))
176 list_move_tail(&node->p_list, &root->prepare_list);
178 list_add_tail(&node->p_list, &root->prepare_list);
180 list_add_tail(&node->n_list, &root->node_list);
181 list_add_tail(&node->p_list, &root->prepare_list);
182 atomic_inc(&node->refs); /* inserted into list */
184 set_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags);
186 spin_unlock(&root->lock);
189 /* Call it when holding delayed_node->mutex */
190 static void btrfs_dequeue_delayed_node(struct btrfs_delayed_root *root,
191 struct btrfs_delayed_node *node)
193 spin_lock(&root->lock);
194 if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) {
196 atomic_dec(&node->refs); /* not in the list */
197 list_del_init(&node->n_list);
198 if (!list_empty(&node->p_list))
199 list_del_init(&node->p_list);
200 clear_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags);
202 spin_unlock(&root->lock);
205 static struct btrfs_delayed_node *btrfs_first_delayed_node(
206 struct btrfs_delayed_root *delayed_root)
209 struct btrfs_delayed_node *node = NULL;
211 spin_lock(&delayed_root->lock);
212 if (list_empty(&delayed_root->node_list))
215 p = delayed_root->node_list.next;
216 node = list_entry(p, struct btrfs_delayed_node, n_list);
217 atomic_inc(&node->refs);
219 spin_unlock(&delayed_root->lock);
224 static struct btrfs_delayed_node *btrfs_next_delayed_node(
225 struct btrfs_delayed_node *node)
227 struct btrfs_delayed_root *delayed_root;
229 struct btrfs_delayed_node *next = NULL;
231 delayed_root = node->root->fs_info->delayed_root;
232 spin_lock(&delayed_root->lock);
233 if (!test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) {
234 /* not in the list */
235 if (list_empty(&delayed_root->node_list))
237 p = delayed_root->node_list.next;
238 } else if (list_is_last(&node->n_list, &delayed_root->node_list))
241 p = node->n_list.next;
243 next = list_entry(p, struct btrfs_delayed_node, n_list);
244 atomic_inc(&next->refs);
246 spin_unlock(&delayed_root->lock);
251 static void __btrfs_release_delayed_node(
252 struct btrfs_delayed_node *delayed_node,
255 struct btrfs_delayed_root *delayed_root;
260 delayed_root = delayed_node->root->fs_info->delayed_root;
262 mutex_lock(&delayed_node->mutex);
263 if (delayed_node->count)
264 btrfs_queue_delayed_node(delayed_root, delayed_node, mod);
266 btrfs_dequeue_delayed_node(delayed_root, delayed_node);
267 mutex_unlock(&delayed_node->mutex);
269 if (atomic_dec_and_test(&delayed_node->refs)) {
270 struct btrfs_root *root = delayed_node->root;
271 spin_lock(&root->inode_lock);
272 if (atomic_read(&delayed_node->refs) == 0) {
273 radix_tree_delete(&root->delayed_nodes_tree,
274 delayed_node->inode_id);
275 kmem_cache_free(delayed_node_cache, delayed_node);
277 spin_unlock(&root->inode_lock);
281 static inline void btrfs_release_delayed_node(struct btrfs_delayed_node *node)
283 __btrfs_release_delayed_node(node, 0);
286 static struct btrfs_delayed_node *btrfs_first_prepared_delayed_node(
287 struct btrfs_delayed_root *delayed_root)
290 struct btrfs_delayed_node *node = NULL;
292 spin_lock(&delayed_root->lock);
293 if (list_empty(&delayed_root->prepare_list))
296 p = delayed_root->prepare_list.next;
298 node = list_entry(p, struct btrfs_delayed_node, p_list);
299 atomic_inc(&node->refs);
301 spin_unlock(&delayed_root->lock);
306 static inline void btrfs_release_prepared_delayed_node(
307 struct btrfs_delayed_node *node)
309 __btrfs_release_delayed_node(node, 1);
312 static struct btrfs_delayed_item *btrfs_alloc_delayed_item(u32 data_len)
314 struct btrfs_delayed_item *item;
315 item = kmalloc(sizeof(*item) + data_len, GFP_NOFS);
317 item->data_len = data_len;
318 item->ins_or_del = 0;
319 item->bytes_reserved = 0;
320 item->delayed_node = NULL;
321 atomic_set(&item->refs, 1);
327 * __btrfs_lookup_delayed_item - look up the delayed item by key
328 * @delayed_node: pointer to the delayed node
329 * @key: the key to look up
330 * @prev: used to store the prev item if the right item isn't found
331 * @next: used to store the next item if the right item isn't found
333 * Note: if we don't find the right item, we will return the prev item and
336 static struct btrfs_delayed_item *__btrfs_lookup_delayed_item(
337 struct rb_root *root,
338 struct btrfs_key *key,
339 struct btrfs_delayed_item **prev,
340 struct btrfs_delayed_item **next)
342 struct rb_node *node, *prev_node = NULL;
343 struct btrfs_delayed_item *delayed_item = NULL;
346 node = root->rb_node;
349 delayed_item = rb_entry(node, struct btrfs_delayed_item,
352 ret = btrfs_comp_cpu_keys(&delayed_item->key, key);
354 node = node->rb_right;
356 node = node->rb_left;
365 *prev = delayed_item;
366 else if ((node = rb_prev(prev_node)) != NULL) {
367 *prev = rb_entry(node, struct btrfs_delayed_item,
377 *next = delayed_item;
378 else if ((node = rb_next(prev_node)) != NULL) {
379 *next = rb_entry(node, struct btrfs_delayed_item,
387 static struct btrfs_delayed_item *__btrfs_lookup_delayed_insertion_item(
388 struct btrfs_delayed_node *delayed_node,
389 struct btrfs_key *key)
391 struct btrfs_delayed_item *item;
393 item = __btrfs_lookup_delayed_item(&delayed_node->ins_root, key,
398 static int __btrfs_add_delayed_item(struct btrfs_delayed_node *delayed_node,
399 struct btrfs_delayed_item *ins,
402 struct rb_node **p, *node;
403 struct rb_node *parent_node = NULL;
404 struct rb_root *root;
405 struct btrfs_delayed_item *item;
408 if (action == BTRFS_DELAYED_INSERTION_ITEM)
409 root = &delayed_node->ins_root;
410 else if (action == BTRFS_DELAYED_DELETION_ITEM)
411 root = &delayed_node->del_root;
415 node = &ins->rb_node;
419 item = rb_entry(parent_node, struct btrfs_delayed_item,
422 cmp = btrfs_comp_cpu_keys(&item->key, &ins->key);
431 rb_link_node(node, parent_node, p);
432 rb_insert_color(node, root);
433 ins->delayed_node = delayed_node;
434 ins->ins_or_del = action;
436 if (ins->key.type == BTRFS_DIR_INDEX_KEY &&
437 action == BTRFS_DELAYED_INSERTION_ITEM &&
438 ins->key.offset >= delayed_node->index_cnt)
439 delayed_node->index_cnt = ins->key.offset + 1;
441 delayed_node->count++;
442 atomic_inc(&delayed_node->root->fs_info->delayed_root->items);
446 static int __btrfs_add_delayed_insertion_item(struct btrfs_delayed_node *node,
447 struct btrfs_delayed_item *item)
449 return __btrfs_add_delayed_item(node, item,
450 BTRFS_DELAYED_INSERTION_ITEM);
453 static int __btrfs_add_delayed_deletion_item(struct btrfs_delayed_node *node,
454 struct btrfs_delayed_item *item)
456 return __btrfs_add_delayed_item(node, item,
457 BTRFS_DELAYED_DELETION_ITEM);
460 static void finish_one_item(struct btrfs_delayed_root *delayed_root)
462 int seq = atomic_inc_return(&delayed_root->items_seq);
463 if ((atomic_dec_return(&delayed_root->items) <
464 BTRFS_DELAYED_BACKGROUND || seq % BTRFS_DELAYED_BATCH == 0) &&
465 waitqueue_active(&delayed_root->wait))
466 wake_up(&delayed_root->wait);
469 static void __btrfs_remove_delayed_item(struct btrfs_delayed_item *delayed_item)
471 struct rb_root *root;
472 struct btrfs_delayed_root *delayed_root;
474 delayed_root = delayed_item->delayed_node->root->fs_info->delayed_root;
476 BUG_ON(!delayed_root);
477 BUG_ON(delayed_item->ins_or_del != BTRFS_DELAYED_DELETION_ITEM &&
478 delayed_item->ins_or_del != BTRFS_DELAYED_INSERTION_ITEM);
480 if (delayed_item->ins_or_del == BTRFS_DELAYED_INSERTION_ITEM)
481 root = &delayed_item->delayed_node->ins_root;
483 root = &delayed_item->delayed_node->del_root;
485 rb_erase(&delayed_item->rb_node, root);
486 delayed_item->delayed_node->count--;
488 finish_one_item(delayed_root);
491 static void btrfs_release_delayed_item(struct btrfs_delayed_item *item)
494 __btrfs_remove_delayed_item(item);
495 if (atomic_dec_and_test(&item->refs))
500 static struct btrfs_delayed_item *__btrfs_first_delayed_insertion_item(
501 struct btrfs_delayed_node *delayed_node)
504 struct btrfs_delayed_item *item = NULL;
506 p = rb_first(&delayed_node->ins_root);
508 item = rb_entry(p, struct btrfs_delayed_item, rb_node);
513 static struct btrfs_delayed_item *__btrfs_first_delayed_deletion_item(
514 struct btrfs_delayed_node *delayed_node)
517 struct btrfs_delayed_item *item = NULL;
519 p = rb_first(&delayed_node->del_root);
521 item = rb_entry(p, struct btrfs_delayed_item, rb_node);
526 static struct btrfs_delayed_item *__btrfs_next_delayed_item(
527 struct btrfs_delayed_item *item)
530 struct btrfs_delayed_item *next = NULL;
532 p = rb_next(&item->rb_node);
534 next = rb_entry(p, struct btrfs_delayed_item, rb_node);
539 static int btrfs_delayed_item_reserve_metadata(struct btrfs_trans_handle *trans,
540 struct btrfs_root *root,
541 struct btrfs_delayed_item *item)
543 struct btrfs_block_rsv *src_rsv;
544 struct btrfs_block_rsv *dst_rsv;
548 if (!trans->bytes_reserved)
551 src_rsv = trans->block_rsv;
552 dst_rsv = &root->fs_info->delayed_block_rsv;
554 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
555 ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes);
557 trace_btrfs_space_reservation(root->fs_info, "delayed_item",
560 item->bytes_reserved = num_bytes;
566 static void btrfs_delayed_item_release_metadata(struct btrfs_root *root,
567 struct btrfs_delayed_item *item)
569 struct btrfs_block_rsv *rsv;
571 if (!item->bytes_reserved)
574 rsv = &root->fs_info->delayed_block_rsv;
575 trace_btrfs_space_reservation(root->fs_info, "delayed_item",
576 item->key.objectid, item->bytes_reserved,
578 btrfs_block_rsv_release(root, rsv,
579 item->bytes_reserved);
582 static int btrfs_delayed_inode_reserve_metadata(
583 struct btrfs_trans_handle *trans,
584 struct btrfs_root *root,
586 struct btrfs_delayed_node *node)
588 struct btrfs_block_rsv *src_rsv;
589 struct btrfs_block_rsv *dst_rsv;
592 bool release = false;
594 src_rsv = trans->block_rsv;
595 dst_rsv = &root->fs_info->delayed_block_rsv;
597 num_bytes = btrfs_calc_trans_metadata_size(root, 1);
600 * btrfs_dirty_inode will update the inode under btrfs_join_transaction
601 * which doesn't reserve space for speed. This is a problem since we
602 * still need to reserve space for this update, so try to reserve the
605 * Now if src_rsv == delalloc_block_rsv we'll let it just steal since
606 * we're accounted for.
608 if (!src_rsv || (!trans->bytes_reserved &&
609 src_rsv->type != BTRFS_BLOCK_RSV_DELALLOC)) {
610 ret = btrfs_block_rsv_add(root, dst_rsv, num_bytes,
611 BTRFS_RESERVE_NO_FLUSH);
613 * Since we're under a transaction reserve_metadata_bytes could
614 * try to commit the transaction which will make it return
615 * EAGAIN to make us stop the transaction we have, so return
616 * ENOSPC instead so that btrfs_dirty_inode knows what to do.
621 node->bytes_reserved = num_bytes;
622 trace_btrfs_space_reservation(root->fs_info,
628 } else if (src_rsv->type == BTRFS_BLOCK_RSV_DELALLOC) {
629 spin_lock(&BTRFS_I(inode)->lock);
630 if (test_and_clear_bit(BTRFS_INODE_DELALLOC_META_RESERVED,
631 &BTRFS_I(inode)->runtime_flags)) {
632 spin_unlock(&BTRFS_I(inode)->lock);
636 spin_unlock(&BTRFS_I(inode)->lock);
638 /* Ok we didn't have space pre-reserved. This shouldn't happen
639 * too often but it can happen if we do delalloc to an existing
640 * inode which gets dirtied because of the time update, and then
641 * isn't touched again until after the transaction commits and
642 * then we try to write out the data. First try to be nice and
643 * reserve something strictly for us. If not be a pain and try
644 * to steal from the delalloc block rsv.
646 ret = btrfs_block_rsv_add(root, dst_rsv, num_bytes,
647 BTRFS_RESERVE_NO_FLUSH);
651 ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes);
656 * Ok this is a problem, let's just steal from the global rsv
657 * since this really shouldn't happen that often.
659 ret = btrfs_block_rsv_migrate(&root->fs_info->global_block_rsv,
665 ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes);
669 * Migrate only takes a reservation, it doesn't touch the size of the
670 * block_rsv. This is to simplify people who don't normally have things
671 * migrated from their block rsv. If they go to release their
672 * reservation, that will decrease the size as well, so if migrate
673 * reduced size we'd end up with a negative size. But for the
674 * delalloc_meta_reserved stuff we will only know to drop 1 reservation,
675 * but we could in fact do this reserve/migrate dance several times
676 * between the time we did the original reservation and we'd clean it
677 * up. So to take care of this, release the space for the meta
678 * reservation here. I think it may be time for a documentation page on
679 * how block rsvs. work.
682 trace_btrfs_space_reservation(root->fs_info, "delayed_inode",
683 btrfs_ino(inode), num_bytes, 1);
684 node->bytes_reserved = num_bytes;
688 trace_btrfs_space_reservation(root->fs_info, "delalloc",
689 btrfs_ino(inode), num_bytes, 0);
690 btrfs_block_rsv_release(root, src_rsv, num_bytes);
696 static void btrfs_delayed_inode_release_metadata(struct btrfs_root *root,
697 struct btrfs_delayed_node *node)
699 struct btrfs_block_rsv *rsv;
701 if (!node->bytes_reserved)
704 rsv = &root->fs_info->delayed_block_rsv;
705 trace_btrfs_space_reservation(root->fs_info, "delayed_inode",
706 node->inode_id, node->bytes_reserved, 0);
707 btrfs_block_rsv_release(root, rsv,
708 node->bytes_reserved);
709 node->bytes_reserved = 0;
713 * This helper will insert some continuous items into the same leaf according
714 * to the free space of the leaf.
716 static int btrfs_batch_insert_items(struct btrfs_root *root,
717 struct btrfs_path *path,
718 struct btrfs_delayed_item *item)
720 struct btrfs_delayed_item *curr, *next;
722 int total_data_size = 0, total_size = 0;
723 struct extent_buffer *leaf;
725 struct btrfs_key *keys;
727 struct list_head head;
733 BUG_ON(!path->nodes[0]);
735 leaf = path->nodes[0];
736 free_space = btrfs_leaf_free_space(root, leaf);
737 INIT_LIST_HEAD(&head);
743 * count the number of the continuous items that we can insert in batch
745 while (total_size + next->data_len + sizeof(struct btrfs_item) <=
747 total_data_size += next->data_len;
748 total_size += next->data_len + sizeof(struct btrfs_item);
749 list_add_tail(&next->tree_list, &head);
753 next = __btrfs_next_delayed_item(curr);
757 if (!btrfs_is_continuous_delayed_item(curr, next))
767 * we need allocate some memory space, but it might cause the task
768 * to sleep, so we set all locked nodes in the path to blocking locks
771 btrfs_set_path_blocking(path);
773 keys = kmalloc_array(nitems, sizeof(struct btrfs_key), GFP_NOFS);
779 data_size = kmalloc_array(nitems, sizeof(u32), GFP_NOFS);
785 /* get keys of all the delayed items */
787 list_for_each_entry(next, &head, tree_list) {
789 data_size[i] = next->data_len;
793 /* reset all the locked nodes in the patch to spinning locks. */
794 btrfs_clear_path_blocking(path, NULL, 0);
796 /* insert the keys of the items */
797 setup_items_for_insert(root, path, keys, data_size,
798 total_data_size, total_size, nitems);
800 /* insert the dir index items */
801 slot = path->slots[0];
802 list_for_each_entry_safe(curr, next, &head, tree_list) {
803 data_ptr = btrfs_item_ptr(leaf, slot, char);
804 write_extent_buffer(leaf, &curr->data,
805 (unsigned long)data_ptr,
809 btrfs_delayed_item_release_metadata(root, curr);
811 list_del(&curr->tree_list);
812 btrfs_release_delayed_item(curr);
823 * This helper can just do simple insertion that needn't extend item for new
824 * data, such as directory name index insertion, inode insertion.
826 static int btrfs_insert_delayed_item(struct btrfs_trans_handle *trans,
827 struct btrfs_root *root,
828 struct btrfs_path *path,
829 struct btrfs_delayed_item *delayed_item)
831 struct extent_buffer *leaf;
835 ret = btrfs_insert_empty_item(trans, root, path, &delayed_item->key,
836 delayed_item->data_len);
837 if (ret < 0 && ret != -EEXIST)
840 leaf = path->nodes[0];
842 ptr = btrfs_item_ptr(leaf, path->slots[0], char);
844 write_extent_buffer(leaf, delayed_item->data, (unsigned long)ptr,
845 delayed_item->data_len);
846 btrfs_mark_buffer_dirty(leaf);
848 btrfs_delayed_item_release_metadata(root, delayed_item);
853 * we insert an item first, then if there are some continuous items, we try
854 * to insert those items into the same leaf.
856 static int btrfs_insert_delayed_items(struct btrfs_trans_handle *trans,
857 struct btrfs_path *path,
858 struct btrfs_root *root,
859 struct btrfs_delayed_node *node)
861 struct btrfs_delayed_item *curr, *prev;
865 mutex_lock(&node->mutex);
866 curr = __btrfs_first_delayed_insertion_item(node);
870 ret = btrfs_insert_delayed_item(trans, root, path, curr);
872 btrfs_release_path(path);
877 curr = __btrfs_next_delayed_item(prev);
878 if (curr && btrfs_is_continuous_delayed_item(prev, curr)) {
879 /* insert the continuous items into the same leaf */
881 btrfs_batch_insert_items(root, path, curr);
883 btrfs_release_delayed_item(prev);
884 btrfs_mark_buffer_dirty(path->nodes[0]);
886 btrfs_release_path(path);
887 mutex_unlock(&node->mutex);
891 mutex_unlock(&node->mutex);
895 static int btrfs_batch_delete_items(struct btrfs_trans_handle *trans,
896 struct btrfs_root *root,
897 struct btrfs_path *path,
898 struct btrfs_delayed_item *item)
900 struct btrfs_delayed_item *curr, *next;
901 struct extent_buffer *leaf;
902 struct btrfs_key key;
903 struct list_head head;
904 int nitems, i, last_item;
907 BUG_ON(!path->nodes[0]);
909 leaf = path->nodes[0];
912 last_item = btrfs_header_nritems(leaf) - 1;
914 return -ENOENT; /* FIXME: Is errno suitable? */
917 INIT_LIST_HEAD(&head);
918 btrfs_item_key_to_cpu(leaf, &key, i);
921 * count the number of the dir index items that we can delete in batch
923 while (btrfs_comp_cpu_keys(&next->key, &key) == 0) {
924 list_add_tail(&next->tree_list, &head);
928 next = __btrfs_next_delayed_item(curr);
932 if (!btrfs_is_continuous_delayed_item(curr, next))
938 btrfs_item_key_to_cpu(leaf, &key, i);
944 ret = btrfs_del_items(trans, root, path, path->slots[0], nitems);
948 list_for_each_entry_safe(curr, next, &head, tree_list) {
949 btrfs_delayed_item_release_metadata(root, curr);
950 list_del(&curr->tree_list);
951 btrfs_release_delayed_item(curr);
958 static int btrfs_delete_delayed_items(struct btrfs_trans_handle *trans,
959 struct btrfs_path *path,
960 struct btrfs_root *root,
961 struct btrfs_delayed_node *node)
963 struct btrfs_delayed_item *curr, *prev;
967 mutex_lock(&node->mutex);
968 curr = __btrfs_first_delayed_deletion_item(node);
972 ret = btrfs_search_slot(trans, root, &curr->key, path, -1, 1);
977 * can't find the item which the node points to, so this node
978 * is invalid, just drop it.
981 curr = __btrfs_next_delayed_item(prev);
982 btrfs_release_delayed_item(prev);
984 btrfs_release_path(path);
986 mutex_unlock(&node->mutex);
992 btrfs_batch_delete_items(trans, root, path, curr);
993 btrfs_release_path(path);
994 mutex_unlock(&node->mutex);
998 btrfs_release_path(path);
999 mutex_unlock(&node->mutex);
1003 static void btrfs_release_delayed_inode(struct btrfs_delayed_node *delayed_node)
1005 struct btrfs_delayed_root *delayed_root;
1008 test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
1009 BUG_ON(!delayed_node->root);
1010 clear_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags);
1011 delayed_node->count--;
1013 delayed_root = delayed_node->root->fs_info->delayed_root;
1014 finish_one_item(delayed_root);
1018 static int __btrfs_update_delayed_inode(struct btrfs_trans_handle *trans,
1019 struct btrfs_root *root,
1020 struct btrfs_path *path,
1021 struct btrfs_delayed_node *node)
1023 struct btrfs_key key;
1024 struct btrfs_inode_item *inode_item;
1025 struct extent_buffer *leaf;
1028 key.objectid = node->inode_id;
1029 btrfs_set_key_type(&key, BTRFS_INODE_ITEM_KEY);
1032 ret = btrfs_lookup_inode(trans, root, path, &key, 1);
1034 btrfs_release_path(path);
1036 } else if (ret < 0) {
1040 btrfs_unlock_up_safe(path, 1);
1041 leaf = path->nodes[0];
1042 inode_item = btrfs_item_ptr(leaf, path->slots[0],
1043 struct btrfs_inode_item);
1044 write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item,
1045 sizeof(struct btrfs_inode_item));
1046 btrfs_mark_buffer_dirty(leaf);
1047 btrfs_release_path(path);
1049 btrfs_delayed_inode_release_metadata(root, node);
1050 btrfs_release_delayed_inode(node);
1055 static inline int btrfs_update_delayed_inode(struct btrfs_trans_handle *trans,
1056 struct btrfs_root *root,
1057 struct btrfs_path *path,
1058 struct btrfs_delayed_node *node)
1062 mutex_lock(&node->mutex);
1063 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &node->flags)) {
1064 mutex_unlock(&node->mutex);
1068 ret = __btrfs_update_delayed_inode(trans, root, path, node);
1069 mutex_unlock(&node->mutex);
1074 __btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
1075 struct btrfs_path *path,
1076 struct btrfs_delayed_node *node)
1080 ret = btrfs_insert_delayed_items(trans, path, node->root, node);
1084 ret = btrfs_delete_delayed_items(trans, path, node->root, node);
1088 ret = btrfs_update_delayed_inode(trans, node->root, path, node);
1093 * Called when committing the transaction.
1094 * Returns 0 on success.
1095 * Returns < 0 on error and returns with an aborted transaction with any
1096 * outstanding delayed items cleaned up.
1098 static int __btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
1099 struct btrfs_root *root, int nr)
1101 struct btrfs_delayed_root *delayed_root;
1102 struct btrfs_delayed_node *curr_node, *prev_node;
1103 struct btrfs_path *path;
1104 struct btrfs_block_rsv *block_rsv;
1106 bool count = (nr > 0);
1111 path = btrfs_alloc_path();
1114 path->leave_spinning = 1;
1116 block_rsv = trans->block_rsv;
1117 trans->block_rsv = &root->fs_info->delayed_block_rsv;
1119 delayed_root = btrfs_get_delayed_root(root);
1121 curr_node = btrfs_first_delayed_node(delayed_root);
1122 while (curr_node && (!count || (count && nr--))) {
1123 ret = __btrfs_commit_inode_delayed_items(trans, path,
1126 btrfs_release_delayed_node(curr_node);
1128 btrfs_abort_transaction(trans, root, ret);
1132 prev_node = curr_node;
1133 curr_node = btrfs_next_delayed_node(curr_node);
1134 btrfs_release_delayed_node(prev_node);
1138 btrfs_release_delayed_node(curr_node);
1139 btrfs_free_path(path);
1140 trans->block_rsv = block_rsv;
1145 int btrfs_run_delayed_items(struct btrfs_trans_handle *trans,
1146 struct btrfs_root *root)
1148 return __btrfs_run_delayed_items(trans, root, -1);
1151 int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans,
1152 struct btrfs_root *root, int nr)
1154 return __btrfs_run_delayed_items(trans, root, nr);
1157 int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
1158 struct inode *inode)
1160 struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode);
1161 struct btrfs_path *path;
1162 struct btrfs_block_rsv *block_rsv;
1168 mutex_lock(&delayed_node->mutex);
1169 if (!delayed_node->count) {
1170 mutex_unlock(&delayed_node->mutex);
1171 btrfs_release_delayed_node(delayed_node);
1174 mutex_unlock(&delayed_node->mutex);
1176 path = btrfs_alloc_path();
1178 btrfs_release_delayed_node(delayed_node);
1181 path->leave_spinning = 1;
1183 block_rsv = trans->block_rsv;
1184 trans->block_rsv = &delayed_node->root->fs_info->delayed_block_rsv;
1186 ret = __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1188 btrfs_release_delayed_node(delayed_node);
1189 btrfs_free_path(path);
1190 trans->block_rsv = block_rsv;
1195 int btrfs_commit_inode_delayed_inode(struct inode *inode)
1197 struct btrfs_trans_handle *trans;
1198 struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode);
1199 struct btrfs_path *path;
1200 struct btrfs_block_rsv *block_rsv;
1206 mutex_lock(&delayed_node->mutex);
1207 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
1208 mutex_unlock(&delayed_node->mutex);
1209 btrfs_release_delayed_node(delayed_node);
1212 mutex_unlock(&delayed_node->mutex);
1214 trans = btrfs_join_transaction(delayed_node->root);
1215 if (IS_ERR(trans)) {
1216 ret = PTR_ERR(trans);
1220 path = btrfs_alloc_path();
1225 path->leave_spinning = 1;
1227 block_rsv = trans->block_rsv;
1228 trans->block_rsv = &delayed_node->root->fs_info->delayed_block_rsv;
1230 mutex_lock(&delayed_node->mutex);
1231 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags))
1232 ret = __btrfs_update_delayed_inode(trans, delayed_node->root,
1233 path, delayed_node);
1236 mutex_unlock(&delayed_node->mutex);
1238 btrfs_free_path(path);
1239 trans->block_rsv = block_rsv;
1241 btrfs_end_transaction(trans, delayed_node->root);
1242 btrfs_btree_balance_dirty(delayed_node->root);
1244 btrfs_release_delayed_node(delayed_node);
1249 void btrfs_remove_delayed_node(struct inode *inode)
1251 struct btrfs_delayed_node *delayed_node;
1253 delayed_node = ACCESS_ONCE(BTRFS_I(inode)->delayed_node);
1257 BTRFS_I(inode)->delayed_node = NULL;
1258 btrfs_release_delayed_node(delayed_node);
1261 struct btrfs_async_delayed_work {
1262 struct btrfs_delayed_root *delayed_root;
1264 struct btrfs_work work;
1267 static void btrfs_async_run_delayed_root(struct btrfs_work *work)
1269 struct btrfs_async_delayed_work *async_work;
1270 struct btrfs_delayed_root *delayed_root;
1271 struct btrfs_trans_handle *trans;
1272 struct btrfs_path *path;
1273 struct btrfs_delayed_node *delayed_node = NULL;
1274 struct btrfs_root *root;
1275 struct btrfs_block_rsv *block_rsv;
1278 async_work = container_of(work, struct btrfs_async_delayed_work, work);
1279 delayed_root = async_work->delayed_root;
1281 path = btrfs_alloc_path();
1286 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND / 2)
1289 delayed_node = btrfs_first_prepared_delayed_node(delayed_root);
1293 path->leave_spinning = 1;
1294 root = delayed_node->root;
1296 trans = btrfs_join_transaction(root);
1300 block_rsv = trans->block_rsv;
1301 trans->block_rsv = &root->fs_info->delayed_block_rsv;
1303 __btrfs_commit_inode_delayed_items(trans, path, delayed_node);
1305 trans->block_rsv = block_rsv;
1306 btrfs_end_transaction(trans, root);
1307 btrfs_btree_balance_dirty_nodelay(root);
1310 btrfs_release_path(path);
1313 btrfs_release_prepared_delayed_node(delayed_node);
1314 if (async_work->nr == 0 || total_done < async_work->nr)
1318 btrfs_free_path(path);
1320 wake_up(&delayed_root->wait);
1325 static int btrfs_wq_run_delayed_node(struct btrfs_delayed_root *delayed_root,
1326 struct btrfs_root *root, int nr)
1328 struct btrfs_async_delayed_work *async_work;
1330 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND)
1333 async_work = kmalloc(sizeof(*async_work), GFP_NOFS);
1337 async_work->delayed_root = delayed_root;
1338 async_work->work.func = btrfs_async_run_delayed_root;
1339 async_work->work.flags = 0;
1340 async_work->nr = nr;
1342 btrfs_queue_worker(&root->fs_info->delayed_workers, &async_work->work);
1346 void btrfs_assert_delayed_root_empty(struct btrfs_root *root)
1348 struct btrfs_delayed_root *delayed_root;
1349 delayed_root = btrfs_get_delayed_root(root);
1350 WARN_ON(btrfs_first_delayed_node(delayed_root));
1353 static int could_end_wait(struct btrfs_delayed_root *delayed_root, int seq)
1355 int val = atomic_read(&delayed_root->items_seq);
1357 if (val < seq || val >= seq + BTRFS_DELAYED_BATCH)
1360 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND)
1366 void btrfs_balance_delayed_items(struct btrfs_root *root)
1368 struct btrfs_delayed_root *delayed_root;
1370 delayed_root = btrfs_get_delayed_root(root);
1372 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND)
1375 if (atomic_read(&delayed_root->items) >= BTRFS_DELAYED_WRITEBACK) {
1379 seq = atomic_read(&delayed_root->items_seq);
1381 ret = btrfs_wq_run_delayed_node(delayed_root, root, 0);
1385 wait_event_interruptible(delayed_root->wait,
1386 could_end_wait(delayed_root, seq));
1390 btrfs_wq_run_delayed_node(delayed_root, root, BTRFS_DELAYED_BATCH);
1393 /* Will return 0 or -ENOMEM */
1394 int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
1395 struct btrfs_root *root, const char *name,
1396 int name_len, struct inode *dir,
1397 struct btrfs_disk_key *disk_key, u8 type,
1400 struct btrfs_delayed_node *delayed_node;
1401 struct btrfs_delayed_item *delayed_item;
1402 struct btrfs_dir_item *dir_item;
1405 delayed_node = btrfs_get_or_create_delayed_node(dir);
1406 if (IS_ERR(delayed_node))
1407 return PTR_ERR(delayed_node);
1409 delayed_item = btrfs_alloc_delayed_item(sizeof(*dir_item) + name_len);
1410 if (!delayed_item) {
1415 delayed_item->key.objectid = btrfs_ino(dir);
1416 btrfs_set_key_type(&delayed_item->key, BTRFS_DIR_INDEX_KEY);
1417 delayed_item->key.offset = index;
1419 dir_item = (struct btrfs_dir_item *)delayed_item->data;
1420 dir_item->location = *disk_key;
1421 btrfs_set_stack_dir_transid(dir_item, trans->transid);
1422 btrfs_set_stack_dir_data_len(dir_item, 0);
1423 btrfs_set_stack_dir_name_len(dir_item, name_len);
1424 btrfs_set_stack_dir_type(dir_item, type);
1425 memcpy((char *)(dir_item + 1), name, name_len);
1427 ret = btrfs_delayed_item_reserve_metadata(trans, root, delayed_item);
1429 * we have reserved enough space when we start a new transaction,
1430 * so reserving metadata failure is impossible
1435 mutex_lock(&delayed_node->mutex);
1436 ret = __btrfs_add_delayed_insertion_item(delayed_node, delayed_item);
1437 if (unlikely(ret)) {
1438 btrfs_err(root->fs_info, "err add delayed dir index item(name: %.*s) "
1439 "into the insertion tree of the delayed node"
1440 "(root id: %llu, inode id: %llu, errno: %d)",
1441 name_len, name, delayed_node->root->objectid,
1442 delayed_node->inode_id, ret);
1445 mutex_unlock(&delayed_node->mutex);
1448 btrfs_release_delayed_node(delayed_node);
1452 static int btrfs_delete_delayed_insertion_item(struct btrfs_root *root,
1453 struct btrfs_delayed_node *node,
1454 struct btrfs_key *key)
1456 struct btrfs_delayed_item *item;
1458 mutex_lock(&node->mutex);
1459 item = __btrfs_lookup_delayed_insertion_item(node, key);
1461 mutex_unlock(&node->mutex);
1465 btrfs_delayed_item_release_metadata(root, item);
1466 btrfs_release_delayed_item(item);
1467 mutex_unlock(&node->mutex);
1471 int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
1472 struct btrfs_root *root, struct inode *dir,
1475 struct btrfs_delayed_node *node;
1476 struct btrfs_delayed_item *item;
1477 struct btrfs_key item_key;
1480 node = btrfs_get_or_create_delayed_node(dir);
1482 return PTR_ERR(node);
1484 item_key.objectid = btrfs_ino(dir);
1485 btrfs_set_key_type(&item_key, BTRFS_DIR_INDEX_KEY);
1486 item_key.offset = index;
1488 ret = btrfs_delete_delayed_insertion_item(root, node, &item_key);
1492 item = btrfs_alloc_delayed_item(0);
1498 item->key = item_key;
1500 ret = btrfs_delayed_item_reserve_metadata(trans, root, item);
1502 * we have reserved enough space when we start a new transaction,
1503 * so reserving metadata failure is impossible.
1507 mutex_lock(&node->mutex);
1508 ret = __btrfs_add_delayed_deletion_item(node, item);
1509 if (unlikely(ret)) {
1510 btrfs_err(root->fs_info, "err add delayed dir index item(index: %llu) "
1511 "into the deletion tree of the delayed node"
1512 "(root id: %llu, inode id: %llu, errno: %d)",
1513 index, node->root->objectid, node->inode_id,
1517 mutex_unlock(&node->mutex);
1519 btrfs_release_delayed_node(node);
1523 int btrfs_inode_delayed_dir_index_count(struct inode *inode)
1525 struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode);
1531 * Since we have held i_mutex of this directory, it is impossible that
1532 * a new directory index is added into the delayed node and index_cnt
1533 * is updated now. So we needn't lock the delayed node.
1535 if (!delayed_node->index_cnt) {
1536 btrfs_release_delayed_node(delayed_node);
1540 BTRFS_I(inode)->index_cnt = delayed_node->index_cnt;
1541 btrfs_release_delayed_node(delayed_node);
1545 void btrfs_get_delayed_items(struct inode *inode, struct list_head *ins_list,
1546 struct list_head *del_list)
1548 struct btrfs_delayed_node *delayed_node;
1549 struct btrfs_delayed_item *item;
1551 delayed_node = btrfs_get_delayed_node(inode);
1555 mutex_lock(&delayed_node->mutex);
1556 item = __btrfs_first_delayed_insertion_item(delayed_node);
1558 atomic_inc(&item->refs);
1559 list_add_tail(&item->readdir_list, ins_list);
1560 item = __btrfs_next_delayed_item(item);
1563 item = __btrfs_first_delayed_deletion_item(delayed_node);
1565 atomic_inc(&item->refs);
1566 list_add_tail(&item->readdir_list, del_list);
1567 item = __btrfs_next_delayed_item(item);
1569 mutex_unlock(&delayed_node->mutex);
1571 * This delayed node is still cached in the btrfs inode, so refs
1572 * must be > 1 now, and we needn't check it is going to be freed
1575 * Besides that, this function is used to read dir, we do not
1576 * insert/delete delayed items in this period. So we also needn't
1577 * requeue or dequeue this delayed node.
1579 atomic_dec(&delayed_node->refs);
1582 void btrfs_put_delayed_items(struct list_head *ins_list,
1583 struct list_head *del_list)
1585 struct btrfs_delayed_item *curr, *next;
1587 list_for_each_entry_safe(curr, next, ins_list, readdir_list) {
1588 list_del(&curr->readdir_list);
1589 if (atomic_dec_and_test(&curr->refs))
1593 list_for_each_entry_safe(curr, next, del_list, readdir_list) {
1594 list_del(&curr->readdir_list);
1595 if (atomic_dec_and_test(&curr->refs))
1600 int btrfs_should_delete_dir_index(struct list_head *del_list,
1603 struct btrfs_delayed_item *curr, *next;
1606 if (list_empty(del_list))
1609 list_for_each_entry_safe(curr, next, del_list, readdir_list) {
1610 if (curr->key.offset > index)
1613 list_del(&curr->readdir_list);
1614 ret = (curr->key.offset == index);
1616 if (atomic_dec_and_test(&curr->refs))
1628 * btrfs_readdir_delayed_dir_index - read dir info stored in the delayed tree
1631 int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
1632 struct list_head *ins_list)
1634 struct btrfs_dir_item *di;
1635 struct btrfs_delayed_item *curr, *next;
1636 struct btrfs_key location;
1640 unsigned char d_type;
1642 if (list_empty(ins_list))
1646 * Changing the data of the delayed item is impossible. So
1647 * we needn't lock them. And we have held i_mutex of the
1648 * directory, nobody can delete any directory indexes now.
1650 list_for_each_entry_safe(curr, next, ins_list, readdir_list) {
1651 list_del(&curr->readdir_list);
1653 if (curr->key.offset < ctx->pos) {
1654 if (atomic_dec_and_test(&curr->refs))
1659 ctx->pos = curr->key.offset;
1661 di = (struct btrfs_dir_item *)curr->data;
1662 name = (char *)(di + 1);
1663 name_len = btrfs_stack_dir_name_len(di);
1665 d_type = btrfs_filetype_table[di->type];
1666 btrfs_disk_key_to_cpu(&location, &di->location);
1668 over = !dir_emit(ctx, name, name_len,
1669 location.objectid, d_type);
1671 if (atomic_dec_and_test(&curr->refs))
1680 static void fill_stack_inode_item(struct btrfs_trans_handle *trans,
1681 struct btrfs_inode_item *inode_item,
1682 struct inode *inode)
1684 btrfs_set_stack_inode_uid(inode_item, i_uid_read(inode));
1685 btrfs_set_stack_inode_gid(inode_item, i_gid_read(inode));
1686 btrfs_set_stack_inode_size(inode_item, BTRFS_I(inode)->disk_i_size);
1687 btrfs_set_stack_inode_mode(inode_item, inode->i_mode);
1688 btrfs_set_stack_inode_nlink(inode_item, inode->i_nlink);
1689 btrfs_set_stack_inode_nbytes(inode_item, inode_get_bytes(inode));
1690 btrfs_set_stack_inode_generation(inode_item,
1691 BTRFS_I(inode)->generation);
1692 btrfs_set_stack_inode_sequence(inode_item, inode->i_version);
1693 btrfs_set_stack_inode_transid(inode_item, trans->transid);
1694 btrfs_set_stack_inode_rdev(inode_item, inode->i_rdev);
1695 btrfs_set_stack_inode_flags(inode_item, BTRFS_I(inode)->flags);
1696 btrfs_set_stack_inode_block_group(inode_item, 0);
1698 btrfs_set_stack_timespec_sec(btrfs_inode_atime(inode_item),
1699 inode->i_atime.tv_sec);
1700 btrfs_set_stack_timespec_nsec(btrfs_inode_atime(inode_item),
1701 inode->i_atime.tv_nsec);
1703 btrfs_set_stack_timespec_sec(btrfs_inode_mtime(inode_item),
1704 inode->i_mtime.tv_sec);
1705 btrfs_set_stack_timespec_nsec(btrfs_inode_mtime(inode_item),
1706 inode->i_mtime.tv_nsec);
1708 btrfs_set_stack_timespec_sec(btrfs_inode_ctime(inode_item),
1709 inode->i_ctime.tv_sec);
1710 btrfs_set_stack_timespec_nsec(btrfs_inode_ctime(inode_item),
1711 inode->i_ctime.tv_nsec);
1714 int btrfs_fill_inode(struct inode *inode, u32 *rdev)
1716 struct btrfs_delayed_node *delayed_node;
1717 struct btrfs_inode_item *inode_item;
1718 struct btrfs_timespec *tspec;
1720 delayed_node = btrfs_get_delayed_node(inode);
1724 mutex_lock(&delayed_node->mutex);
1725 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
1726 mutex_unlock(&delayed_node->mutex);
1727 btrfs_release_delayed_node(delayed_node);
1731 inode_item = &delayed_node->inode_item;
1733 i_uid_write(inode, btrfs_stack_inode_uid(inode_item));
1734 i_gid_write(inode, btrfs_stack_inode_gid(inode_item));
1735 btrfs_i_size_write(inode, btrfs_stack_inode_size(inode_item));
1736 inode->i_mode = btrfs_stack_inode_mode(inode_item);
1737 set_nlink(inode, btrfs_stack_inode_nlink(inode_item));
1738 inode_set_bytes(inode, btrfs_stack_inode_nbytes(inode_item));
1739 BTRFS_I(inode)->generation = btrfs_stack_inode_generation(inode_item);
1740 inode->i_version = btrfs_stack_inode_sequence(inode_item);
1742 *rdev = btrfs_stack_inode_rdev(inode_item);
1743 BTRFS_I(inode)->flags = btrfs_stack_inode_flags(inode_item);
1745 tspec = btrfs_inode_atime(inode_item);
1746 inode->i_atime.tv_sec = btrfs_stack_timespec_sec(tspec);
1747 inode->i_atime.tv_nsec = btrfs_stack_timespec_nsec(tspec);
1749 tspec = btrfs_inode_mtime(inode_item);
1750 inode->i_mtime.tv_sec = btrfs_stack_timespec_sec(tspec);
1751 inode->i_mtime.tv_nsec = btrfs_stack_timespec_nsec(tspec);
1753 tspec = btrfs_inode_ctime(inode_item);
1754 inode->i_ctime.tv_sec = btrfs_stack_timespec_sec(tspec);
1755 inode->i_ctime.tv_nsec = btrfs_stack_timespec_nsec(tspec);
1757 inode->i_generation = BTRFS_I(inode)->generation;
1758 BTRFS_I(inode)->index_cnt = (u64)-1;
1760 mutex_unlock(&delayed_node->mutex);
1761 btrfs_release_delayed_node(delayed_node);
1765 int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
1766 struct btrfs_root *root, struct inode *inode)
1768 struct btrfs_delayed_node *delayed_node;
1771 delayed_node = btrfs_get_or_create_delayed_node(inode);
1772 if (IS_ERR(delayed_node))
1773 return PTR_ERR(delayed_node);
1775 mutex_lock(&delayed_node->mutex);
1776 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
1777 fill_stack_inode_item(trans, &delayed_node->inode_item, inode);
1781 ret = btrfs_delayed_inode_reserve_metadata(trans, root, inode,
1786 fill_stack_inode_item(trans, &delayed_node->inode_item, inode);
1787 set_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags);
1788 delayed_node->count++;
1789 atomic_inc(&root->fs_info->delayed_root->items);
1791 mutex_unlock(&delayed_node->mutex);
1792 btrfs_release_delayed_node(delayed_node);
1796 static void __btrfs_kill_delayed_node(struct btrfs_delayed_node *delayed_node)
1798 struct btrfs_root *root = delayed_node->root;
1799 struct btrfs_delayed_item *curr_item, *prev_item;
1801 mutex_lock(&delayed_node->mutex);
1802 curr_item = __btrfs_first_delayed_insertion_item(delayed_node);
1804 btrfs_delayed_item_release_metadata(root, curr_item);
1805 prev_item = curr_item;
1806 curr_item = __btrfs_next_delayed_item(prev_item);
1807 btrfs_release_delayed_item(prev_item);
1810 curr_item = __btrfs_first_delayed_deletion_item(delayed_node);
1812 btrfs_delayed_item_release_metadata(root, curr_item);
1813 prev_item = curr_item;
1814 curr_item = __btrfs_next_delayed_item(prev_item);
1815 btrfs_release_delayed_item(prev_item);
1818 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) {
1819 btrfs_delayed_inode_release_metadata(root, delayed_node);
1820 btrfs_release_delayed_inode(delayed_node);
1822 mutex_unlock(&delayed_node->mutex);
1825 void btrfs_kill_delayed_inode_items(struct inode *inode)
1827 struct btrfs_delayed_node *delayed_node;
1829 delayed_node = btrfs_get_delayed_node(inode);
1833 __btrfs_kill_delayed_node(delayed_node);
1834 btrfs_release_delayed_node(delayed_node);
1837 void btrfs_kill_all_delayed_nodes(struct btrfs_root *root)
1840 struct btrfs_delayed_node *delayed_nodes[8];
1844 spin_lock(&root->inode_lock);
1845 n = radix_tree_gang_lookup(&root->delayed_nodes_tree,
1846 (void **)delayed_nodes, inode_id,
1847 ARRAY_SIZE(delayed_nodes));
1849 spin_unlock(&root->inode_lock);
1853 inode_id = delayed_nodes[n - 1]->inode_id + 1;
1855 for (i = 0; i < n; i++)
1856 atomic_inc(&delayed_nodes[i]->refs);
1857 spin_unlock(&root->inode_lock);
1859 for (i = 0; i < n; i++) {
1860 __btrfs_kill_delayed_node(delayed_nodes[i]);
1861 btrfs_release_delayed_node(delayed_nodes[i]);
1866 void btrfs_destroy_delayed_inodes(struct btrfs_root *root)
1868 struct btrfs_delayed_root *delayed_root;
1869 struct btrfs_delayed_node *curr_node, *prev_node;
1871 delayed_root = btrfs_get_delayed_root(root);
1873 curr_node = btrfs_first_delayed_node(delayed_root);
1875 __btrfs_kill_delayed_node(curr_node);
1877 prev_node = curr_node;
1878 curr_node = btrfs_next_delayed_node(curr_node);
1879 btrfs_release_delayed_node(prev_node);