Lines Matching +full:root +full:- +full:node
1 // SPDX-License-Identifier: GPL-2.0
13 #include "delayed-inode.h"
14 #include "disk-io.h"
18 #include "inode-item.h"
19 #include "space-info.h"
21 #include "file-item.h"
33 return -ENOMEM; in btrfs_delayed_inode_init()
44 atomic_set(&delayed_root->items, 0); in btrfs_init_delayed_root()
45 atomic_set(&delayed_root->items_seq, 0); in btrfs_init_delayed_root()
46 delayed_root->nodes = 0; in btrfs_init_delayed_root()
47 spin_lock_init(&delayed_root->lock); in btrfs_init_delayed_root()
48 init_waitqueue_head(&delayed_root->wait); in btrfs_init_delayed_root()
49 INIT_LIST_HEAD(&delayed_root->node_list); in btrfs_init_delayed_root()
50 INIT_LIST_HEAD(&delayed_root->prepare_list); in btrfs_init_delayed_root()
55 struct btrfs_root *root, u64 inode_id) in btrfs_init_delayed_node() argument
57 delayed_node->root = root; in btrfs_init_delayed_node()
58 delayed_node->inode_id = inode_id; in btrfs_init_delayed_node()
59 refcount_set(&delayed_node->refs, 0); in btrfs_init_delayed_node()
60 delayed_node->ins_root = RB_ROOT_CACHED; in btrfs_init_delayed_node()
61 delayed_node->del_root = RB_ROOT_CACHED; in btrfs_init_delayed_node()
62 mutex_init(&delayed_node->mutex); in btrfs_init_delayed_node()
63 INIT_LIST_HEAD(&delayed_node->n_list); in btrfs_init_delayed_node()
64 INIT_LIST_HEAD(&delayed_node->p_list); in btrfs_init_delayed_node()
70 struct btrfs_root *root = btrfs_inode->root; in btrfs_get_delayed_node() local
72 struct btrfs_delayed_node *node; in btrfs_get_delayed_node() local
74 node = READ_ONCE(btrfs_inode->delayed_node); in btrfs_get_delayed_node()
75 if (node) { in btrfs_get_delayed_node()
76 refcount_inc(&node->refs); in btrfs_get_delayed_node()
77 return node; in btrfs_get_delayed_node()
80 xa_lock(&root->delayed_nodes); in btrfs_get_delayed_node()
81 node = xa_load(&root->delayed_nodes, ino); in btrfs_get_delayed_node()
83 if (node) { in btrfs_get_delayed_node()
84 if (btrfs_inode->delayed_node) { in btrfs_get_delayed_node()
85 refcount_inc(&node->refs); /* can be accessed */ in btrfs_get_delayed_node()
86 BUG_ON(btrfs_inode->delayed_node != node); in btrfs_get_delayed_node()
87 xa_unlock(&root->delayed_nodes); in btrfs_get_delayed_node()
88 return node; in btrfs_get_delayed_node()
93 * this node from the xarray. In this case, the refcount in btrfs_get_delayed_node()
103 * If this node is properly in the xarray, we want to bump the in btrfs_get_delayed_node()
107 if (refcount_inc_not_zero(&node->refs)) { in btrfs_get_delayed_node()
108 refcount_inc(&node->refs); in btrfs_get_delayed_node()
109 btrfs_inode->delayed_node = node; in btrfs_get_delayed_node()
111 node = NULL; in btrfs_get_delayed_node()
114 xa_unlock(&root->delayed_nodes); in btrfs_get_delayed_node()
115 return node; in btrfs_get_delayed_node()
117 xa_unlock(&root->delayed_nodes); in btrfs_get_delayed_node()
122 /* Will return either the node or PTR_ERR(-ENOMEM) */
126 struct btrfs_delayed_node *node; in btrfs_get_or_create_delayed_node() local
127 struct btrfs_root *root = btrfs_inode->root; in btrfs_get_or_create_delayed_node() local
133 node = btrfs_get_delayed_node(btrfs_inode); in btrfs_get_or_create_delayed_node()
134 if (node) in btrfs_get_or_create_delayed_node()
135 return node; in btrfs_get_or_create_delayed_node()
137 node = kmem_cache_zalloc(delayed_node_cache, GFP_NOFS); in btrfs_get_or_create_delayed_node()
138 if (!node) in btrfs_get_or_create_delayed_node()
139 return ERR_PTR(-ENOMEM); in btrfs_get_or_create_delayed_node()
140 btrfs_init_delayed_node(node, root, ino); in btrfs_get_or_create_delayed_node()
143 refcount_set(&node->refs, 2); in btrfs_get_or_create_delayed_node()
146 ret = xa_reserve(&root->delayed_nodes, ino, GFP_NOFS); in btrfs_get_or_create_delayed_node()
147 if (ret == -ENOMEM) { in btrfs_get_or_create_delayed_node()
148 kmem_cache_free(delayed_node_cache, node); in btrfs_get_or_create_delayed_node()
149 return ERR_PTR(-ENOMEM); in btrfs_get_or_create_delayed_node()
151 xa_lock(&root->delayed_nodes); in btrfs_get_or_create_delayed_node()
152 ptr = xa_load(&root->delayed_nodes, ino); in btrfs_get_or_create_delayed_node()
155 xa_unlock(&root->delayed_nodes); in btrfs_get_or_create_delayed_node()
156 kmem_cache_free(delayed_node_cache, node); in btrfs_get_or_create_delayed_node()
157 node = NULL; in btrfs_get_or_create_delayed_node()
160 ptr = __xa_store(&root->delayed_nodes, ino, node, GFP_ATOMIC); in btrfs_get_or_create_delayed_node()
161 ASSERT(xa_err(ptr) != -EINVAL); in btrfs_get_or_create_delayed_node()
162 ASSERT(xa_err(ptr) != -ENOMEM); in btrfs_get_or_create_delayed_node()
164 btrfs_inode->delayed_node = node; in btrfs_get_or_create_delayed_node()
165 xa_unlock(&root->delayed_nodes); in btrfs_get_or_create_delayed_node()
167 return node; in btrfs_get_or_create_delayed_node()
171 * Call it when holding delayed_node->mutex
173 * If mod = 1, add this node into the prepared list.
175 static void btrfs_queue_delayed_node(struct btrfs_delayed_root *root, in btrfs_queue_delayed_node() argument
176 struct btrfs_delayed_node *node, in btrfs_queue_delayed_node() argument
179 spin_lock(&root->lock); in btrfs_queue_delayed_node()
180 if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) { in btrfs_queue_delayed_node()
181 if (!list_empty(&node->p_list)) in btrfs_queue_delayed_node()
182 list_move_tail(&node->p_list, &root->prepare_list); in btrfs_queue_delayed_node()
184 list_add_tail(&node->p_list, &root->prepare_list); in btrfs_queue_delayed_node()
186 list_add_tail(&node->n_list, &root->node_list); in btrfs_queue_delayed_node()
187 list_add_tail(&node->p_list, &root->prepare_list); in btrfs_queue_delayed_node()
188 refcount_inc(&node->refs); /* inserted into list */ in btrfs_queue_delayed_node()
189 root->nodes++; in btrfs_queue_delayed_node()
190 set_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags); in btrfs_queue_delayed_node()
192 spin_unlock(&root->lock); in btrfs_queue_delayed_node()
195 /* Call it when holding delayed_node->mutex */
196 static void btrfs_dequeue_delayed_node(struct btrfs_delayed_root *root, in btrfs_dequeue_delayed_node() argument
197 struct btrfs_delayed_node *node) in btrfs_dequeue_delayed_node() argument
199 spin_lock(&root->lock); in btrfs_dequeue_delayed_node()
200 if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) { in btrfs_dequeue_delayed_node()
201 root->nodes--; in btrfs_dequeue_delayed_node()
202 refcount_dec(&node->refs); /* not in the list */ in btrfs_dequeue_delayed_node()
203 list_del_init(&node->n_list); in btrfs_dequeue_delayed_node()
204 if (!list_empty(&node->p_list)) in btrfs_dequeue_delayed_node()
205 list_del_init(&node->p_list); in btrfs_dequeue_delayed_node()
206 clear_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags); in btrfs_dequeue_delayed_node()
208 spin_unlock(&root->lock); in btrfs_dequeue_delayed_node()
215 struct btrfs_delayed_node *node = NULL; in btrfs_first_delayed_node() local
217 spin_lock(&delayed_root->lock); in btrfs_first_delayed_node()
218 if (list_empty(&delayed_root->node_list)) in btrfs_first_delayed_node()
221 p = delayed_root->node_list.next; in btrfs_first_delayed_node()
222 node = list_entry(p, struct btrfs_delayed_node, n_list); in btrfs_first_delayed_node()
223 refcount_inc(&node->refs); in btrfs_first_delayed_node()
225 spin_unlock(&delayed_root->lock); in btrfs_first_delayed_node()
227 return node; in btrfs_first_delayed_node()
231 struct btrfs_delayed_node *node) in btrfs_next_delayed_node() argument
237 delayed_root = node->root->fs_info->delayed_root; in btrfs_next_delayed_node()
238 spin_lock(&delayed_root->lock); in btrfs_next_delayed_node()
239 if (!test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) { in btrfs_next_delayed_node()
241 if (list_empty(&delayed_root->node_list)) in btrfs_next_delayed_node()
243 p = delayed_root->node_list.next; in btrfs_next_delayed_node()
244 } else if (list_is_last(&node->n_list, &delayed_root->node_list)) in btrfs_next_delayed_node()
247 p = node->n_list.next; in btrfs_next_delayed_node()
250 refcount_inc(&next->refs); in btrfs_next_delayed_node()
252 spin_unlock(&delayed_root->lock); in btrfs_next_delayed_node()
266 delayed_root = delayed_node->root->fs_info->delayed_root; in __btrfs_release_delayed_node()
268 mutex_lock(&delayed_node->mutex); in __btrfs_release_delayed_node()
269 if (delayed_node->count) in __btrfs_release_delayed_node()
273 mutex_unlock(&delayed_node->mutex); in __btrfs_release_delayed_node()
275 if (refcount_dec_and_test(&delayed_node->refs)) { in __btrfs_release_delayed_node()
276 struct btrfs_root *root = delayed_node->root; in __btrfs_release_delayed_node() local
278 xa_erase(&root->delayed_nodes, delayed_node->inode_id); in __btrfs_release_delayed_node()
283 ASSERT(refcount_read(&delayed_node->refs) == 0); in __btrfs_release_delayed_node()
288 static inline void btrfs_release_delayed_node(struct btrfs_delayed_node *node) in btrfs_release_delayed_node() argument
290 __btrfs_release_delayed_node(node, 0); in btrfs_release_delayed_node()
297 struct btrfs_delayed_node *node = NULL; in btrfs_first_prepared_delayed_node() local
299 spin_lock(&delayed_root->lock); in btrfs_first_prepared_delayed_node()
300 if (list_empty(&delayed_root->prepare_list)) in btrfs_first_prepared_delayed_node()
303 p = delayed_root->prepare_list.next; in btrfs_first_prepared_delayed_node()
305 node = list_entry(p, struct btrfs_delayed_node, p_list); in btrfs_first_prepared_delayed_node()
306 refcount_inc(&node->refs); in btrfs_first_prepared_delayed_node()
308 spin_unlock(&delayed_root->lock); in btrfs_first_prepared_delayed_node()
310 return node; in btrfs_first_prepared_delayed_node()
314 struct btrfs_delayed_node *node) in btrfs_release_prepared_delayed_node() argument
316 __btrfs_release_delayed_node(node, 1); in btrfs_release_prepared_delayed_node()
320 struct btrfs_delayed_node *node, in btrfs_alloc_delayed_item() argument
327 item->data_len = data_len; in btrfs_alloc_delayed_item()
328 item->type = type; in btrfs_alloc_delayed_item()
329 item->bytes_reserved = 0; in btrfs_alloc_delayed_item()
330 item->delayed_node = node; in btrfs_alloc_delayed_item()
331 RB_CLEAR_NODE(&item->rb_node); in btrfs_alloc_delayed_item()
332 INIT_LIST_HEAD(&item->log_list); in btrfs_alloc_delayed_item()
333 item->logged = false; in btrfs_alloc_delayed_item()
334 refcount_set(&item->refs, 1); in btrfs_alloc_delayed_item()
342 * @delayed_node: pointer to the delayed node
349 struct rb_root *root, in __btrfs_lookup_delayed_item() argument
352 struct rb_node *node = root->rb_node; in __btrfs_lookup_delayed_item() local
355 while (node) { in __btrfs_lookup_delayed_item()
356 delayed_item = rb_entry(node, struct btrfs_delayed_item, in __btrfs_lookup_delayed_item()
358 if (delayed_item->index < index) in __btrfs_lookup_delayed_item()
359 node = node->rb_right; in __btrfs_lookup_delayed_item()
360 else if (delayed_item->index > index) in __btrfs_lookup_delayed_item()
361 node = node->rb_left; in __btrfs_lookup_delayed_item()
377 if (new_item->index < exist_item->index) in btrfs_delayed_item_cmp()
378 return -1; in btrfs_delayed_item_cmp()
379 if (new_item->index > exist_item->index) in btrfs_delayed_item_cmp()
387 struct rb_root_cached *root; in __btrfs_add_delayed_item() local
390 if (ins->type == BTRFS_DELAYED_INSERTION_ITEM) in __btrfs_add_delayed_item()
391 root = &delayed_node->ins_root; in __btrfs_add_delayed_item()
393 root = &delayed_node->del_root; in __btrfs_add_delayed_item()
395 exist = rb_find_add_cached(&ins->rb_node, root, btrfs_delayed_item_cmp); in __btrfs_add_delayed_item()
397 return -EEXIST; in __btrfs_add_delayed_item()
399 if (ins->type == BTRFS_DELAYED_INSERTION_ITEM && in __btrfs_add_delayed_item()
400 ins->index >= delayed_node->index_cnt) in __btrfs_add_delayed_item()
401 delayed_node->index_cnt = ins->index + 1; in __btrfs_add_delayed_item()
403 delayed_node->count++; in __btrfs_add_delayed_item()
404 atomic_inc(&delayed_node->root->fs_info->delayed_root->items); in __btrfs_add_delayed_item()
410 int seq = atomic_inc_return(&delayed_root->items_seq); in finish_one_item()
413 if ((atomic_dec_return(&delayed_root->items) < in finish_one_item()
415 cond_wake_up_nomb(&delayed_root->wait); in finish_one_item()
420 struct btrfs_delayed_node *delayed_node = delayed_item->delayed_node; in __btrfs_remove_delayed_item()
421 struct rb_root_cached *root; in __btrfs_remove_delayed_item() local
425 if (RB_EMPTY_NODE(&delayed_item->rb_node)) in __btrfs_remove_delayed_item()
428 /* If it's in a rbtree, then we need to have delayed node locked. */ in __btrfs_remove_delayed_item()
429 lockdep_assert_held(&delayed_node->mutex); in __btrfs_remove_delayed_item()
431 delayed_root = delayed_node->root->fs_info->delayed_root; in __btrfs_remove_delayed_item()
433 if (delayed_item->type == BTRFS_DELAYED_INSERTION_ITEM) in __btrfs_remove_delayed_item()
434 root = &delayed_node->ins_root; in __btrfs_remove_delayed_item()
436 root = &delayed_node->del_root; in __btrfs_remove_delayed_item()
438 rb_erase_cached(&delayed_item->rb_node, root); in __btrfs_remove_delayed_item()
439 RB_CLEAR_NODE(&delayed_item->rb_node); in __btrfs_remove_delayed_item()
440 delayed_node->count--; in __btrfs_remove_delayed_item()
449 if (refcount_dec_and_test(&item->refs)) in btrfs_release_delayed_item()
460 p = rb_first_cached(&delayed_node->ins_root); in __btrfs_first_delayed_insertion_item()
473 p = rb_first_cached(&delayed_node->del_root); in __btrfs_first_delayed_deletion_item()
486 p = rb_next(&item->rb_node); in __btrfs_next_delayed_item()
498 struct btrfs_fs_info *fs_info = trans->fs_info; in btrfs_delayed_item_reserve_metadata()
502 if (!trans->bytes_reserved) in btrfs_delayed_item_reserve_metadata()
505 src_rsv = trans->block_rsv; in btrfs_delayed_item_reserve_metadata()
506 dst_rsv = &fs_info->delayed_block_rsv; in btrfs_delayed_item_reserve_metadata()
518 item->delayed_node->inode_id, in btrfs_delayed_item_reserve_metadata()
523 * node's curr_index_batch_size and index_item_leaves fields. in btrfs_delayed_item_reserve_metadata()
525 if (item->type == BTRFS_DELAYED_DELETION_ITEM) in btrfs_delayed_item_reserve_metadata()
526 item->bytes_reserved = num_bytes; in btrfs_delayed_item_reserve_metadata()
532 static void btrfs_delayed_item_release_metadata(struct btrfs_root *root, in btrfs_delayed_item_release_metadata() argument
536 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_delayed_item_release_metadata()
538 if (!item->bytes_reserved) in btrfs_delayed_item_release_metadata()
541 rsv = &fs_info->delayed_block_rsv; in btrfs_delayed_item_release_metadata()
547 item->delayed_node->inode_id, in btrfs_delayed_item_release_metadata()
548 item->bytes_reserved, 0); in btrfs_delayed_item_release_metadata()
549 btrfs_block_rsv_release(fs_info, rsv, item->bytes_reserved, NULL); in btrfs_delayed_item_release_metadata()
552 static void btrfs_delayed_item_release_leaves(struct btrfs_delayed_node *node, in btrfs_delayed_item_release_leaves() argument
555 struct btrfs_fs_info *fs_info = node->root->fs_info; in btrfs_delayed_item_release_leaves()
559 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) in btrfs_delayed_item_release_leaves()
562 trace_btrfs_space_reservation(fs_info, "delayed_item", node->inode_id, in btrfs_delayed_item_release_leaves()
564 btrfs_block_rsv_release(fs_info, &fs_info->delayed_block_rsv, bytes, NULL); in btrfs_delayed_item_release_leaves()
569 struct btrfs_root *root, in btrfs_delayed_inode_reserve_metadata() argument
570 struct btrfs_delayed_node *node) in btrfs_delayed_inode_reserve_metadata() argument
572 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_delayed_inode_reserve_metadata()
578 src_rsv = trans->block_rsv; in btrfs_delayed_inode_reserve_metadata()
579 dst_rsv = &fs_info->delayed_block_rsv; in btrfs_delayed_inode_reserve_metadata()
592 if (!src_rsv || (!trans->bytes_reserved && in btrfs_delayed_inode_reserve_metadata()
593 src_rsv->type != BTRFS_BLOCK_RSV_DELALLOC)) { in btrfs_delayed_inode_reserve_metadata()
594 ret = btrfs_qgroup_reserve_meta(root, num_bytes, in btrfs_delayed_inode_reserve_metadata()
600 /* NO_FLUSH could only fail with -ENOSPC */ in btrfs_delayed_inode_reserve_metadata()
601 ASSERT(ret == 0 || ret == -ENOSPC); in btrfs_delayed_inode_reserve_metadata()
603 btrfs_qgroup_free_meta_prealloc(root, num_bytes); in btrfs_delayed_inode_reserve_metadata()
610 node->inode_id, num_bytes, 1); in btrfs_delayed_inode_reserve_metadata()
611 node->bytes_reserved = num_bytes; in btrfs_delayed_inode_reserve_metadata()
618 struct btrfs_delayed_node *node, in btrfs_delayed_inode_release_metadata() argument
623 if (!node->bytes_reserved) in btrfs_delayed_inode_release_metadata()
626 rsv = &fs_info->delayed_block_rsv; in btrfs_delayed_inode_release_metadata()
628 node->inode_id, node->bytes_reserved, 0); in btrfs_delayed_inode_release_metadata()
629 btrfs_block_rsv_release(fs_info, rsv, node->bytes_reserved, NULL); in btrfs_delayed_inode_release_metadata()
631 btrfs_qgroup_free_meta_prealloc(node->root, in btrfs_delayed_inode_release_metadata()
632 node->bytes_reserved); in btrfs_delayed_inode_release_metadata()
634 btrfs_qgroup_convert_reserved_meta(node->root, in btrfs_delayed_inode_release_metadata()
635 node->bytes_reserved); in btrfs_delayed_inode_release_metadata()
636 node->bytes_reserved = 0; in btrfs_delayed_inode_release_metadata()
650 struct btrfs_root *root, in btrfs_insert_delayed_item() argument
654 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_insert_delayed_item()
655 struct btrfs_delayed_node *node = first_item->delayed_node; in btrfs_insert_delayed_item() local
662 const u32 first_data_size = first_item->data_len; in btrfs_insert_delayed_item()
668 lockdep_assert_held(&node->mutex); in btrfs_insert_delayed_item()
679 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) in btrfs_insert_delayed_item()
688 ASSERT(first_item->bytes_reserved == 0); in btrfs_insert_delayed_item()
690 list_add_tail(&first_item->tree_list, &item_list); in btrfs_insert_delayed_item()
707 if (continuous_keys_only && (next->index != curr->index + 1)) in btrfs_insert_delayed_item()
710 ASSERT(next->bytes_reserved == 0); in btrfs_insert_delayed_item()
712 next_size = next->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_item()
716 list_add_tail(&next->tree_list, &item_list); in btrfs_insert_delayed_item()
719 batch.total_data_size += next->data_len; in btrfs_insert_delayed_item()
724 first_key.objectid = node->inode_id; in btrfs_insert_delayed_item()
726 first_key.offset = first_item->index; in btrfs_insert_delayed_item()
737 ret = -ENOMEM; in btrfs_insert_delayed_item()
745 ins_keys[i].objectid = node->inode_id; in btrfs_insert_delayed_item()
747 ins_keys[i].offset = curr->index; in btrfs_insert_delayed_item()
748 ins_sizes[i] = curr->data_len; in btrfs_insert_delayed_item()
753 ret = btrfs_insert_empty_items(trans, root, path, &batch); in btrfs_insert_delayed_item()
760 data_ptr = btrfs_item_ptr(path->nodes[0], path->slots[0], char); in btrfs_insert_delayed_item()
761 write_extent_buffer(path->nodes[0], &curr->data, in btrfs_insert_delayed_item()
762 (unsigned long)data_ptr, curr->data_len); in btrfs_insert_delayed_item()
763 path->slots[0]++; in btrfs_insert_delayed_item()
773 ASSERT(node->index_item_leaves > 0); in btrfs_insert_delayed_item()
792 btrfs_delayed_item_release_leaves(node, 1); in btrfs_insert_delayed_item()
793 node->index_item_leaves--; in btrfs_insert_delayed_item()
797 * reserved leaves > 1 here - this happens when many dir index in btrfs_insert_delayed_item()
802 btrfs_delayed_item_release_leaves(node, node->index_item_leaves); in btrfs_insert_delayed_item()
803 node->index_item_leaves = 0; in btrfs_insert_delayed_item()
807 list_del(&curr->tree_list); in btrfs_insert_delayed_item()
817 struct btrfs_root *root, in btrfs_insert_delayed_items() argument
818 struct btrfs_delayed_node *node) in btrfs_insert_delayed_items() argument
825 mutex_lock(&node->mutex); in btrfs_insert_delayed_items()
826 curr = __btrfs_first_delayed_insertion_item(node); in btrfs_insert_delayed_items()
828 mutex_unlock(&node->mutex); in btrfs_insert_delayed_items()
831 ret = btrfs_insert_delayed_item(trans, root, path, curr); in btrfs_insert_delayed_items()
832 mutex_unlock(&node->mutex); in btrfs_insert_delayed_items()
839 struct btrfs_root *root, in btrfs_batch_delete_items() argument
843 const u64 ino = item->delayed_node->inode_id; in btrfs_batch_delete_items()
844 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_batch_delete_items()
846 struct extent_buffer *leaf = path->nodes[0]; in btrfs_batch_delete_items()
850 u64 total_reserved_size = item->bytes_reserved; in btrfs_batch_delete_items()
854 slot = path->slots[0]; in btrfs_batch_delete_items()
855 last_slot = btrfs_header_nritems(leaf) - 1; in btrfs_batch_delete_items()
862 return -ENOENT; in btrfs_batch_delete_items()
866 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
870 * leaf - if so, we can add it to the batch of items to delete from the in btrfs_batch_delete_items()
884 key.offset != next->index) in btrfs_batch_delete_items()
888 list_add_tail(&curr->tree_list, &batch_list); in btrfs_batch_delete_items()
889 total_reserved_size += curr->bytes_reserved; in btrfs_batch_delete_items()
892 ret = btrfs_del_items(trans, root, path, path->slots[0], nitems); in btrfs_batch_delete_items()
904 btrfs_block_rsv_release(fs_info, &fs_info->delayed_block_rsv, in btrfs_batch_delete_items()
909 list_del(&curr->tree_list); in btrfs_batch_delete_items()
918 struct btrfs_root *root, in btrfs_delete_delayed_items() argument
919 struct btrfs_delayed_node *node) in btrfs_delete_delayed_items() argument
924 key.objectid = node->inode_id; in btrfs_delete_delayed_items()
930 mutex_lock(&node->mutex); in btrfs_delete_delayed_items()
931 item = __btrfs_first_delayed_deletion_item(node); in btrfs_delete_delayed_items()
933 mutex_unlock(&node->mutex); in btrfs_delete_delayed_items()
937 key.offset = item->index; in btrfs_delete_delayed_items()
938 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in btrfs_delete_delayed_items()
958 ret = btrfs_batch_delete_items(trans, root, path, item); in btrfs_delete_delayed_items()
967 * need to add delayed items to this delayed node. in btrfs_delete_delayed_items()
969 mutex_unlock(&node->mutex); in btrfs_delete_delayed_items()
980 test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { in btrfs_release_delayed_inode()
981 ASSERT(delayed_node->root); in btrfs_release_delayed_inode()
982 clear_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags); in btrfs_release_delayed_inode()
983 delayed_node->count--; in btrfs_release_delayed_inode()
985 delayed_root = delayed_node->root->fs_info->delayed_root; in btrfs_release_delayed_inode()
993 if (test_and_clear_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags)) { in btrfs_release_delayed_iref()
996 ASSERT(delayed_node->root); in btrfs_release_delayed_iref()
997 delayed_node->count--; in btrfs_release_delayed_iref()
999 delayed_root = delayed_node->root->fs_info->delayed_root; in btrfs_release_delayed_iref()
1005 struct btrfs_root *root, in __btrfs_update_delayed_inode() argument
1007 struct btrfs_delayed_node *node) in __btrfs_update_delayed_inode() argument
1009 struct btrfs_fs_info *fs_info = root->fs_info; in __btrfs_update_delayed_inode()
1016 key.objectid = node->inode_id; in __btrfs_update_delayed_inode()
1020 if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &node->flags)) in __btrfs_update_delayed_inode()
1021 mod = -1; in __btrfs_update_delayed_inode()
1025 ret = btrfs_lookup_inode(trans, root, path, &key, mod); in __btrfs_update_delayed_inode()
1027 ret = -ENOENT; in __btrfs_update_delayed_inode()
1031 leaf = path->nodes[0]; in __btrfs_update_delayed_inode()
1032 inode_item = btrfs_item_ptr(leaf, path->slots[0], in __btrfs_update_delayed_inode()
1034 write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item, in __btrfs_update_delayed_inode()
1037 if (!test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &node->flags)) in __btrfs_update_delayed_inode()
1047 if (path->slots[0] + 1 >= btrfs_header_nritems(leaf)) { in __btrfs_update_delayed_inode()
1048 key.objectid = node->inode_id; in __btrfs_update_delayed_inode()
1050 key.offset = (u64)-1; in __btrfs_update_delayed_inode()
1053 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in __btrfs_update_delayed_inode()
1057 ASSERT(path->slots[0] > 0); in __btrfs_update_delayed_inode()
1059 path->slots[0]--; in __btrfs_update_delayed_inode()
1060 leaf = path->nodes[0]; in __btrfs_update_delayed_inode()
1062 path->slots[0]++; in __btrfs_update_delayed_inode()
1064 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); in __btrfs_update_delayed_inode()
1065 if (key.objectid != node->inode_id) in __btrfs_update_delayed_inode()
1076 ret = btrfs_del_item(trans, root, path); in __btrfs_update_delayed_inode()
1078 btrfs_release_delayed_iref(node); in __btrfs_update_delayed_inode()
1081 btrfs_delayed_inode_release_metadata(fs_info, node, (ret < 0)); in __btrfs_update_delayed_inode()
1082 btrfs_release_delayed_inode(node); in __btrfs_update_delayed_inode()
1089 if (ret && ret != -ENOENT) in __btrfs_update_delayed_inode()
1096 struct btrfs_root *root, in btrfs_update_delayed_inode() argument
1098 struct btrfs_delayed_node *node) in btrfs_update_delayed_inode() argument
1102 mutex_lock(&node->mutex); in btrfs_update_delayed_inode()
1103 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &node->flags)) { in btrfs_update_delayed_inode()
1104 mutex_unlock(&node->mutex); in btrfs_update_delayed_inode()
1108 ret = __btrfs_update_delayed_inode(trans, root, path, node); in btrfs_update_delayed_inode()
1109 mutex_unlock(&node->mutex); in btrfs_update_delayed_inode()
1116 struct btrfs_delayed_node *node) in __btrfs_commit_inode_delayed_items() argument
1120 ret = btrfs_insert_delayed_items(trans, path, node->root, node); in __btrfs_commit_inode_delayed_items()
1124 ret = btrfs_delete_delayed_items(trans, path, node->root, node); in __btrfs_commit_inode_delayed_items()
1128 ret = btrfs_record_root_in_trans(trans, node->root); in __btrfs_commit_inode_delayed_items()
1131 ret = btrfs_update_delayed_inode(trans, node->root, path, node); in __btrfs_commit_inode_delayed_items()
1143 struct btrfs_fs_info *fs_info = trans->fs_info; in __btrfs_run_delayed_items()
1152 return -EIO; in __btrfs_run_delayed_items()
1156 return -ENOMEM; in __btrfs_run_delayed_items()
1158 block_rsv = trans->block_rsv; in __btrfs_run_delayed_items()
1159 trans->block_rsv = &fs_info->delayed_block_rsv; in __btrfs_run_delayed_items()
1161 delayed_root = fs_info->delayed_root; in __btrfs_run_delayed_items()
1164 while (curr_node && (!count || nr--)) { in __btrfs_run_delayed_items()
1176 * node. If the commit of delayed items was successful the path in __btrfs_run_delayed_items()
1180 ASSERT(path->nodes[0] == NULL); in __btrfs_run_delayed_items()
1186 * releasing the delayed node, as that requires taking the delayed node's in __btrfs_run_delayed_items()
1195 trans->block_rsv = block_rsv; in __btrfs_run_delayed_items()
1202 return __btrfs_run_delayed_items(trans, -1); in btrfs_run_delayed_items()
1221 mutex_lock(&delayed_node->mutex); in btrfs_commit_inode_delayed_items()
1222 if (!delayed_node->count) { in btrfs_commit_inode_delayed_items()
1223 mutex_unlock(&delayed_node->mutex); in btrfs_commit_inode_delayed_items()
1227 mutex_unlock(&delayed_node->mutex); in btrfs_commit_inode_delayed_items()
1232 return -ENOMEM; in btrfs_commit_inode_delayed_items()
1235 block_rsv = trans->block_rsv; in btrfs_commit_inode_delayed_items()
1236 trans->block_rsv = &delayed_node->root->fs_info->delayed_block_rsv; in btrfs_commit_inode_delayed_items()
1242 trans->block_rsv = block_rsv; in btrfs_commit_inode_delayed_items()
1249 struct btrfs_fs_info *fs_info = inode->root->fs_info; in btrfs_commit_inode_delayed_inode()
1259 mutex_lock(&delayed_node->mutex); in btrfs_commit_inode_delayed_inode()
1260 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { in btrfs_commit_inode_delayed_inode()
1261 mutex_unlock(&delayed_node->mutex); in btrfs_commit_inode_delayed_inode()
1265 mutex_unlock(&delayed_node->mutex); in btrfs_commit_inode_delayed_inode()
1267 trans = btrfs_join_transaction(delayed_node->root); in btrfs_commit_inode_delayed_inode()
1275 ret = -ENOMEM; in btrfs_commit_inode_delayed_inode()
1279 block_rsv = trans->block_rsv; in btrfs_commit_inode_delayed_inode()
1280 trans->block_rsv = &fs_info->delayed_block_rsv; in btrfs_commit_inode_delayed_inode()
1282 mutex_lock(&delayed_node->mutex); in btrfs_commit_inode_delayed_inode()
1283 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) in btrfs_commit_inode_delayed_inode()
1284 ret = __btrfs_update_delayed_inode(trans, delayed_node->root, in btrfs_commit_inode_delayed_inode()
1288 mutex_unlock(&delayed_node->mutex); in btrfs_commit_inode_delayed_inode()
1291 trans->block_rsv = block_rsv; in btrfs_commit_inode_delayed_inode()
1305 delayed_node = READ_ONCE(inode->delayed_node); in btrfs_remove_delayed_node()
1309 inode->delayed_node = NULL; in btrfs_remove_delayed_node()
1326 struct btrfs_root *root; in btrfs_async_run_delayed_root() local
1331 delayed_root = async_work->delayed_root; in btrfs_async_run_delayed_root()
1338 if (atomic_read(&delayed_root->items) < in btrfs_async_run_delayed_root()
1346 root = delayed_node->root; in btrfs_async_run_delayed_root()
1348 trans = btrfs_join_transaction(root); in btrfs_async_run_delayed_root()
1356 block_rsv = trans->block_rsv; in btrfs_async_run_delayed_root()
1357 trans->block_rsv = &root->fs_info->delayed_block_rsv; in btrfs_async_run_delayed_root()
1361 trans->block_rsv = block_rsv; in btrfs_async_run_delayed_root()
1363 btrfs_btree_balance_dirty_nodelay(root->fs_info); in btrfs_async_run_delayed_root()
1369 } while ((async_work->nr == 0 && total_done < BTRFS_DELAYED_WRITEBACK) in btrfs_async_run_delayed_root()
1370 || total_done < async_work->nr); in btrfs_async_run_delayed_root()
1374 wake_up(&delayed_root->wait); in btrfs_async_run_delayed_root()
1386 return -ENOMEM; in btrfs_wq_run_delayed_node()
1388 async_work->delayed_root = delayed_root; in btrfs_wq_run_delayed_node()
1389 btrfs_init_work(&async_work->work, btrfs_async_run_delayed_root, NULL); in btrfs_wq_run_delayed_node()
1390 async_work->nr = nr; in btrfs_wq_run_delayed_node()
1392 btrfs_queue_work(fs_info->delayed_workers, &async_work->work); in btrfs_wq_run_delayed_node()
1398 WARN_ON(btrfs_first_delayed_node(fs_info->delayed_root)); in btrfs_assert_delayed_root_empty()
1403 int val = atomic_read(&delayed_root->items_seq); in could_end_wait()
1408 if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) in could_end_wait()
1416 struct btrfs_delayed_root *delayed_root = fs_info->delayed_root; in btrfs_balance_delayed_items()
1418 if ((atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) || in btrfs_balance_delayed_items()
1419 btrfs_workqueue_normal_congested(fs_info->delayed_workers)) in btrfs_balance_delayed_items()
1422 if (atomic_read(&delayed_root->items) >= BTRFS_DELAYED_WRITEBACK) { in btrfs_balance_delayed_items()
1426 seq = atomic_read(&delayed_root->items_seq); in btrfs_balance_delayed_items()
1432 wait_event_interruptible(delayed_root->wait, in btrfs_balance_delayed_items()
1442 struct btrfs_fs_info *fs_info = trans->fs_info; in btrfs_release_dir_index_item_space()
1445 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) in btrfs_release_dir_index_item_space()
1456 trans->transid, bytes, 0); in btrfs_release_dir_index_item_space()
1457 btrfs_block_rsv_release(fs_info, trans->block_rsv, bytes, NULL); in btrfs_release_dir_index_item_space()
1458 ASSERT(trans->bytes_reserved >= bytes); in btrfs_release_dir_index_item_space()
1459 trans->bytes_reserved -= bytes; in btrfs_release_dir_index_item_space()
1462 /* Will return 0, -ENOMEM or -EEXIST (index number collision, unexpected). */
1469 struct btrfs_fs_info *fs_info = trans->fs_info; in btrfs_insert_delayed_dir_index()
1486 ret = -ENOMEM; in btrfs_insert_delayed_dir_index()
1490 delayed_item->index = index; in btrfs_insert_delayed_dir_index()
1492 dir_item = (struct btrfs_dir_item *)delayed_item->data; in btrfs_insert_delayed_dir_index()
1493 dir_item->location = *disk_key; in btrfs_insert_delayed_dir_index()
1494 btrfs_set_stack_dir_transid(dir_item, trans->transid); in btrfs_insert_delayed_dir_index()
1500 data_len = delayed_item->data_len + sizeof(struct btrfs_item); in btrfs_insert_delayed_dir_index()
1502 mutex_lock(&delayed_node->mutex); in btrfs_insert_delayed_dir_index()
1506 * handling path simpler in case we fail (-EEXIST). There's no risk of in btrfs_insert_delayed_dir_index()
1509 * delayed node's mutex and that mutex must also be locked before the in btrfs_insert_delayed_dir_index()
1510 * node's delayed items can be run. in btrfs_insert_delayed_dir_index()
1514 btrfs_err(trans->fs_info, in btrfs_insert_delayed_dir_index()
1515 …layed dir index item, name: %.*s, index: %llu, root: %llu, dir: %llu, dir->index_cnt: %llu, delaye… in btrfs_insert_delayed_dir_index()
1516 name_len, name, index, btrfs_root_id(delayed_node->root), in btrfs_insert_delayed_dir_index()
1517 delayed_node->inode_id, dir->index_cnt, in btrfs_insert_delayed_dir_index()
1518 delayed_node->index_cnt, ret); in btrfs_insert_delayed_dir_index()
1521 mutex_unlock(&delayed_node->mutex); in btrfs_insert_delayed_dir_index()
1525 if (delayed_node->index_item_leaves == 0 || in btrfs_insert_delayed_dir_index()
1526 delayed_node->curr_index_batch_size + data_len > leaf_data_size) { in btrfs_insert_delayed_dir_index()
1527 delayed_node->curr_index_batch_size = data_len; in btrfs_insert_delayed_dir_index()
1530 delayed_node->curr_index_batch_size += data_len; in btrfs_insert_delayed_dir_index()
1543 mutex_unlock(&delayed_node->mutex); in btrfs_insert_delayed_dir_index()
1547 delayed_node->index_item_leaves++; in btrfs_insert_delayed_dir_index()
1551 mutex_unlock(&delayed_node->mutex); in btrfs_insert_delayed_dir_index()
1558 static int btrfs_delete_delayed_insertion_item(struct btrfs_delayed_node *node, in btrfs_delete_delayed_insertion_item() argument
1563 mutex_lock(&node->mutex); in btrfs_delete_delayed_insertion_item()
1564 item = __btrfs_lookup_delayed_item(&node->ins_root.rb_root, index); in btrfs_delete_delayed_insertion_item()
1566 mutex_unlock(&node->mutex); in btrfs_delete_delayed_insertion_item()
1576 ASSERT(item->bytes_reserved == 0); in btrfs_delete_delayed_insertion_item()
1577 ASSERT(node->index_item_leaves > 0); in btrfs_delete_delayed_insertion_item()
1586 if (node->index_item_leaves == 1) { in btrfs_delete_delayed_insertion_item()
1587 const u32 data_len = item->data_len + sizeof(struct btrfs_item); in btrfs_delete_delayed_insertion_item()
1589 ASSERT(node->curr_index_batch_size >= data_len); in btrfs_delete_delayed_insertion_item()
1590 node->curr_index_batch_size -= data_len; in btrfs_delete_delayed_insertion_item()
1596 if (RB_EMPTY_ROOT(&node->ins_root.rb_root)) { in btrfs_delete_delayed_insertion_item()
1597 btrfs_delayed_item_release_leaves(node, node->index_item_leaves); in btrfs_delete_delayed_insertion_item()
1598 node->index_item_leaves = 0; in btrfs_delete_delayed_insertion_item()
1601 mutex_unlock(&node->mutex); in btrfs_delete_delayed_insertion_item()
1608 struct btrfs_delayed_node *node; in btrfs_delete_delayed_dir_index() local
1612 node = btrfs_get_or_create_delayed_node(dir); in btrfs_delete_delayed_dir_index()
1613 if (IS_ERR(node)) in btrfs_delete_delayed_dir_index()
1614 return PTR_ERR(node); in btrfs_delete_delayed_dir_index()
1616 ret = btrfs_delete_delayed_insertion_item(node, index); in btrfs_delete_delayed_dir_index()
1620 item = btrfs_alloc_delayed_item(0, node, BTRFS_DELAYED_DELETION_ITEM); in btrfs_delete_delayed_dir_index()
1622 ret = -ENOMEM; in btrfs_delete_delayed_dir_index()
1626 item->index = index; in btrfs_delete_delayed_dir_index()
1634 btrfs_err(trans->fs_info, in btrfs_delete_delayed_dir_index()
1640 mutex_lock(&node->mutex); in btrfs_delete_delayed_dir_index()
1641 ret = __btrfs_add_delayed_item(node, item); in btrfs_delete_delayed_dir_index()
1643 btrfs_err(trans->fs_info, in btrfs_delete_delayed_dir_index()
1644 …"err add delayed dir index item(index: %llu) into the deletion tree of the delayed node(root id: %… in btrfs_delete_delayed_dir_index()
1645 index, btrfs_root_id(node->root), in btrfs_delete_delayed_dir_index()
1646 node->inode_id, ret); in btrfs_delete_delayed_dir_index()
1647 btrfs_delayed_item_release_metadata(dir->root, item); in btrfs_delete_delayed_dir_index()
1650 mutex_unlock(&node->mutex); in btrfs_delete_delayed_dir_index()
1652 btrfs_release_delayed_node(node); in btrfs_delete_delayed_dir_index()
1661 return -ENOENT; in btrfs_inode_delayed_dir_index_count()
1665 * a new directory index is added into the delayed node and index_cnt in btrfs_inode_delayed_dir_index_count()
1666 * is updated now. So we needn't lock the delayed node. in btrfs_inode_delayed_dir_index_count()
1668 if (!delayed_node->index_cnt) { in btrfs_inode_delayed_dir_index_count()
1670 return -EINVAL; in btrfs_inode_delayed_dir_index_count()
1673 inode->index_cnt = delayed_node->index_cnt; in btrfs_inode_delayed_dir_index_count()
1692 * item->readdir_list. in btrfs_readdir_get_delayed_items()
1697 mutex_lock(&delayed_node->mutex); in btrfs_readdir_get_delayed_items()
1699 while (item && item->index <= last_index) { in btrfs_readdir_get_delayed_items()
1700 refcount_inc(&item->refs); in btrfs_readdir_get_delayed_items()
1701 list_add_tail(&item->readdir_list, ins_list); in btrfs_readdir_get_delayed_items()
1706 while (item && item->index <= last_index) { in btrfs_readdir_get_delayed_items()
1707 refcount_inc(&item->refs); in btrfs_readdir_get_delayed_items()
1708 list_add_tail(&item->readdir_list, del_list); in btrfs_readdir_get_delayed_items()
1711 mutex_unlock(&delayed_node->mutex); in btrfs_readdir_get_delayed_items()
1713 * This delayed node is still cached in the btrfs inode, so refs in btrfs_readdir_get_delayed_items()
1719 * requeue or dequeue this delayed node. in btrfs_readdir_get_delayed_items()
1721 refcount_dec(&delayed_node->refs); in btrfs_readdir_get_delayed_items()
1733 list_del(&curr->readdir_list); in btrfs_readdir_put_delayed_items()
1734 if (refcount_dec_and_test(&curr->refs)) in btrfs_readdir_put_delayed_items()
1739 list_del(&curr->readdir_list); in btrfs_readdir_put_delayed_items()
1740 if (refcount_dec_and_test(&curr->refs)) in btrfs_readdir_put_delayed_items()
1748 downgrade_write(&inode->vfs_inode.i_rwsem); in btrfs_readdir_put_delayed_items()
1758 if (curr->index > index) in btrfs_should_delete_dir_index()
1760 if (curr->index == index) { in btrfs_should_delete_dir_index()
1788 list_del(&curr->readdir_list); in btrfs_readdir_delayed_dir_index()
1790 if (curr->index < ctx->pos) { in btrfs_readdir_delayed_dir_index()
1791 if (refcount_dec_and_test(&curr->refs)) in btrfs_readdir_delayed_dir_index()
1796 ctx->pos = curr->index; in btrfs_readdir_delayed_dir_index()
1798 di = (struct btrfs_dir_item *)curr->data; in btrfs_readdir_delayed_dir_index()
1802 d_type = fs_ftype_to_dtype(btrfs_dir_flags_to_ftype(di->type)); in btrfs_readdir_delayed_dir_index()
1803 btrfs_disk_key_to_cpu(&location, &di->location); in btrfs_readdir_delayed_dir_index()
1808 if (refcount_dec_and_test(&curr->refs)) in btrfs_readdir_delayed_dir_index()
1813 ctx->pos++; in btrfs_readdir_delayed_dir_index()
1826 btrfs_set_stack_inode_size(inode_item, BTRFS_I(inode)->disk_i_size); in fill_stack_inode_item()
1827 btrfs_set_stack_inode_mode(inode_item, inode->i_mode); in fill_stack_inode_item()
1828 btrfs_set_stack_inode_nlink(inode_item, inode->i_nlink); in fill_stack_inode_item()
1831 BTRFS_I(inode)->generation); in fill_stack_inode_item()
1834 btrfs_set_stack_inode_transid(inode_item, trans->transid); in fill_stack_inode_item()
1835 btrfs_set_stack_inode_rdev(inode_item, inode->i_rdev); in fill_stack_inode_item()
1836 flags = btrfs_inode_combine_flags(BTRFS_I(inode)->flags, in fill_stack_inode_item()
1837 BTRFS_I(inode)->ro_flags); in fill_stack_inode_item()
1841 btrfs_set_stack_timespec_sec(&inode_item->atime, in fill_stack_inode_item()
1843 btrfs_set_stack_timespec_nsec(&inode_item->atime, in fill_stack_inode_item()
1846 btrfs_set_stack_timespec_sec(&inode_item->mtime, in fill_stack_inode_item()
1848 btrfs_set_stack_timespec_nsec(&inode_item->mtime, in fill_stack_inode_item()
1851 btrfs_set_stack_timespec_sec(&inode_item->ctime, in fill_stack_inode_item()
1853 btrfs_set_stack_timespec_nsec(&inode_item->ctime, in fill_stack_inode_item()
1856 btrfs_set_stack_timespec_sec(&inode_item->otime, BTRFS_I(inode)->i_otime_sec); in fill_stack_inode_item()
1857 btrfs_set_stack_timespec_nsec(&inode_item->otime, BTRFS_I(inode)->i_otime_nsec); in fill_stack_inode_item()
1862 struct btrfs_fs_info *fs_info = BTRFS_I(inode)->root->fs_info; in btrfs_fill_inode()
1868 return -ENOENT; in btrfs_fill_inode()
1870 mutex_lock(&delayed_node->mutex); in btrfs_fill_inode()
1871 if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { in btrfs_fill_inode()
1872 mutex_unlock(&delayed_node->mutex); in btrfs_fill_inode()
1874 return -ENOENT; in btrfs_fill_inode()
1877 inode_item = &delayed_node->inode_item; in btrfs_fill_inode()
1883 round_up(i_size_read(inode), fs_info->sectorsize)); in btrfs_fill_inode()
1884 inode->i_mode = btrfs_stack_inode_mode(inode_item); in btrfs_fill_inode()
1887 BTRFS_I(inode)->generation = btrfs_stack_inode_generation(inode_item); in btrfs_fill_inode()
1888 BTRFS_I(inode)->last_trans = btrfs_stack_inode_transid(inode_item); in btrfs_fill_inode()
1892 inode->i_rdev = 0; in btrfs_fill_inode()
1895 &BTRFS_I(inode)->flags, &BTRFS_I(inode)->ro_flags); in btrfs_fill_inode()
1897 inode_set_atime(inode, btrfs_stack_timespec_sec(&inode_item->atime), in btrfs_fill_inode()
1898 btrfs_stack_timespec_nsec(&inode_item->atime)); in btrfs_fill_inode()
1900 inode_set_mtime(inode, btrfs_stack_timespec_sec(&inode_item->mtime), in btrfs_fill_inode()
1901 btrfs_stack_timespec_nsec(&inode_item->mtime)); in btrfs_fill_inode()
1903 inode_set_ctime(inode, btrfs_stack_timespec_sec(&inode_item->ctime), in btrfs_fill_inode()
1904 btrfs_stack_timespec_nsec(&inode_item->ctime)); in btrfs_fill_inode()
1906 BTRFS_I(inode)->i_otime_sec = btrfs_stack_timespec_sec(&inode_item->otime); in btrfs_fill_inode()
1907 BTRFS_I(inode)->i_otime_nsec = btrfs_stack_timespec_nsec(&inode_item->otime); in btrfs_fill_inode()
1909 inode->i_generation = BTRFS_I(inode)->generation; in btrfs_fill_inode()
1910 if (S_ISDIR(inode->i_mode)) in btrfs_fill_inode()
1911 BTRFS_I(inode)->index_cnt = (u64)-1; in btrfs_fill_inode()
1913 mutex_unlock(&delayed_node->mutex); in btrfs_fill_inode()
1921 struct btrfs_root *root = inode->root; in btrfs_delayed_update_inode() local
1929 mutex_lock(&delayed_node->mutex); in btrfs_delayed_update_inode()
1930 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { in btrfs_delayed_update_inode()
1931 fill_stack_inode_item(trans, &delayed_node->inode_item, in btrfs_delayed_update_inode()
1932 &inode->vfs_inode); in btrfs_delayed_update_inode()
1936 ret = btrfs_delayed_inode_reserve_metadata(trans, root, delayed_node); in btrfs_delayed_update_inode()
1940 fill_stack_inode_item(trans, &delayed_node->inode_item, &inode->vfs_inode); in btrfs_delayed_update_inode()
1941 set_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags); in btrfs_delayed_update_inode()
1942 delayed_node->count++; in btrfs_delayed_update_inode()
1943 atomic_inc(&root->fs_info->delayed_root->items); in btrfs_delayed_update_inode()
1945 mutex_unlock(&delayed_node->mutex); in btrfs_delayed_update_inode()
1952 struct btrfs_fs_info *fs_info = inode->root->fs_info; in btrfs_delayed_delete_inode_ref()
1960 if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) in btrfs_delayed_delete_inode_ref()
1961 return -EAGAIN; in btrfs_delayed_delete_inode_ref()
1969 * - We ONLY do async inode ref deletion for the inode who has only in btrfs_delayed_delete_inode_ref()
1975 * - If the inode ref and the inode item are not in the same leaf, in btrfs_delayed_delete_inode_ref()
1978 * - At the worst, we can steal some space from the global reservation. in btrfs_delayed_delete_inode_ref()
1981 mutex_lock(&delayed_node->mutex); in btrfs_delayed_delete_inode_ref()
1982 if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags)) in btrfs_delayed_delete_inode_ref()
1985 set_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags); in btrfs_delayed_delete_inode_ref()
1986 delayed_node->count++; in btrfs_delayed_delete_inode_ref()
1987 atomic_inc(&fs_info->delayed_root->items); in btrfs_delayed_delete_inode_ref()
1989 mutex_unlock(&delayed_node->mutex); in btrfs_delayed_delete_inode_ref()
1996 struct btrfs_root *root = delayed_node->root; in __btrfs_kill_delayed_node() local
1997 struct btrfs_fs_info *fs_info = root->fs_info; in __btrfs_kill_delayed_node()
2000 mutex_lock(&delayed_node->mutex); in __btrfs_kill_delayed_node()
2008 if (delayed_node->index_item_leaves > 0) { in __btrfs_kill_delayed_node()
2010 delayed_node->index_item_leaves); in __btrfs_kill_delayed_node()
2011 delayed_node->index_item_leaves = 0; in __btrfs_kill_delayed_node()
2016 btrfs_delayed_item_release_metadata(root, curr_item); in __btrfs_kill_delayed_node()
2024 if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { in __btrfs_kill_delayed_node()
2028 mutex_unlock(&delayed_node->mutex); in __btrfs_kill_delayed_node()
2043 void btrfs_kill_all_delayed_nodes(struct btrfs_root *root) in btrfs_kill_all_delayed_nodes() argument
2049 struct btrfs_delayed_node *node; in btrfs_kill_all_delayed_nodes() local
2052 xa_lock(&root->delayed_nodes); in btrfs_kill_all_delayed_nodes()
2053 if (xa_empty(&root->delayed_nodes)) { in btrfs_kill_all_delayed_nodes()
2054 xa_unlock(&root->delayed_nodes); in btrfs_kill_all_delayed_nodes()
2059 xa_for_each_start(&root->delayed_nodes, index, node, index) { in btrfs_kill_all_delayed_nodes()
2061 * Don't increase refs in case the node is dead and in btrfs_kill_all_delayed_nodes()
2064 if (refcount_inc_not_zero(&node->refs)) { in btrfs_kill_all_delayed_nodes()
2065 delayed_nodes[count] = node; in btrfs_kill_all_delayed_nodes()
2071 xa_unlock(&root->delayed_nodes); in btrfs_kill_all_delayed_nodes()
2085 curr_node = btrfs_first_delayed_node(fs_info->delayed_root); in btrfs_destroy_delayed_inodes()
2099 struct btrfs_delayed_node *node; in btrfs_log_get_delayed_items() local
2102 node = btrfs_get_delayed_node(inode); in btrfs_log_get_delayed_items()
2103 if (!node) in btrfs_log_get_delayed_items()
2106 mutex_lock(&node->mutex); in btrfs_log_get_delayed_items()
2107 item = __btrfs_first_delayed_insertion_item(node); in btrfs_log_get_delayed_items()
2132 if (!item->logged && list_empty(&item->log_list)) { in btrfs_log_get_delayed_items()
2133 refcount_inc(&item->refs); in btrfs_log_get_delayed_items()
2134 list_add_tail(&item->log_list, ins_list); in btrfs_log_get_delayed_items()
2139 item = __btrfs_first_delayed_deletion_item(node); in btrfs_log_get_delayed_items()
2141 /* It may be non-empty, for the same reason mentioned above. */ in btrfs_log_get_delayed_items()
2142 if (!item->logged && list_empty(&item->log_list)) { in btrfs_log_get_delayed_items()
2143 refcount_inc(&item->refs); in btrfs_log_get_delayed_items()
2144 list_add_tail(&item->log_list, del_list); in btrfs_log_get_delayed_items()
2148 mutex_unlock(&node->mutex); in btrfs_log_get_delayed_items()
2159 ASSERT(refcount_read(&node->refs) > 1); in btrfs_log_get_delayed_items()
2160 refcount_dec(&node->refs); in btrfs_log_get_delayed_items()
2167 struct btrfs_delayed_node *node; in btrfs_log_put_delayed_items() local
2171 node = btrfs_get_delayed_node(inode); in btrfs_log_put_delayed_items()
2172 if (!node) in btrfs_log_put_delayed_items()
2175 mutex_lock(&node->mutex); in btrfs_log_put_delayed_items()
2178 item->logged = true; in btrfs_log_put_delayed_items()
2179 list_del_init(&item->log_list); in btrfs_log_put_delayed_items()
2180 if (refcount_dec_and_test(&item->refs)) in btrfs_log_put_delayed_items()
2185 item->logged = true; in btrfs_log_put_delayed_items()
2186 list_del_init(&item->log_list); in btrfs_log_put_delayed_items()
2187 if (refcount_dec_and_test(&item->refs)) in btrfs_log_put_delayed_items()
2191 mutex_unlock(&node->mutex); in btrfs_log_put_delayed_items()
2202 ASSERT(refcount_read(&node->refs) > 1); in btrfs_log_put_delayed_items()
2203 refcount_dec(&node->refs); in btrfs_log_put_delayed_items()