Loading...
1/* SPDX-License-Identifier: GPL-2.0 */
2/*
3 * Copyright (C) 2011 Fujitsu. All rights reserved.
4 * Written by Miao Xie <miaox@cn.fujitsu.com>
5 */
6
7#ifndef BTRFS_DELAYED_INODE_H
8#define BTRFS_DELAYED_INODE_H
9
10#include <linux/rbtree.h>
11#include <linux/spinlock.h>
12#include <linux/mutex.h>
13#include <linux/list.h>
14#include <linux/wait.h>
15#include <linux/atomic.h>
16#include <linux/refcount.h>
17#include "ctree.h"
18
19/* types of the delayed item */
20#define BTRFS_DELAYED_INSERTION_ITEM 1
21#define BTRFS_DELAYED_DELETION_ITEM 2
22
23struct btrfs_delayed_root {
24 spinlock_t lock;
25 struct list_head node_list;
26 /*
27 * Used for delayed nodes which is waiting to be dealt with by the
28 * worker. If the delayed node is inserted into the work queue, we
29 * drop it from this list.
30 */
31 struct list_head prepare_list;
32 atomic_t items; /* for delayed items */
33 atomic_t items_seq; /* for delayed items */
34 int nodes; /* for delayed nodes */
35 wait_queue_head_t wait;
36};
37
38#define BTRFS_DELAYED_NODE_IN_LIST 0
39#define BTRFS_DELAYED_NODE_INODE_DIRTY 1
40#define BTRFS_DELAYED_NODE_DEL_IREF 2
41
42struct btrfs_delayed_node {
43 u64 inode_id;
44 u64 bytes_reserved;
45 struct btrfs_root *root;
46 /* Used to add the node into the delayed root's node list. */
47 struct list_head n_list;
48 /*
49 * Used to add the node into the prepare list, the nodes in this list
50 * is waiting to be dealt with by the async worker.
51 */
52 struct list_head p_list;
53 struct rb_root_cached ins_root;
54 struct rb_root_cached del_root;
55 struct mutex mutex;
56 struct btrfs_inode_item inode_item;
57 refcount_t refs;
58 u64 index_cnt;
59 unsigned long flags;
60 int count;
61};
62
63struct btrfs_delayed_item {
64 struct rb_node rb_node;
65 struct btrfs_key key;
66 struct list_head tree_list; /* used for batch insert/delete items */
67 struct list_head readdir_list; /* used for readdir items */
68 u64 bytes_reserved;
69 struct btrfs_delayed_node *delayed_node;
70 refcount_t refs;
71 int ins_or_del;
72 u32 data_len;
73 char data[0];
74};
75
76static inline void btrfs_init_delayed_root(
77 struct btrfs_delayed_root *delayed_root)
78{
79 atomic_set(&delayed_root->items, 0);
80 atomic_set(&delayed_root->items_seq, 0);
81 delayed_root->nodes = 0;
82 spin_lock_init(&delayed_root->lock);
83 init_waitqueue_head(&delayed_root->wait);
84 INIT_LIST_HEAD(&delayed_root->node_list);
85 INIT_LIST_HEAD(&delayed_root->prepare_list);
86}
87
88int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
89 const char *name, int name_len,
90 struct btrfs_inode *dir,
91 struct btrfs_disk_key *disk_key, u8 type,
92 u64 index);
93
94int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
95 struct btrfs_inode *dir, u64 index);
96
97int btrfs_inode_delayed_dir_index_count(struct btrfs_inode *inode);
98
99int btrfs_run_delayed_items(struct btrfs_trans_handle *trans);
100int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans, int nr);
101
102void btrfs_balance_delayed_items(struct btrfs_fs_info *fs_info);
103
104int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
105 struct btrfs_inode *inode);
106/* Used for evicting the inode. */
107void btrfs_remove_delayed_node(struct btrfs_inode *inode);
108void btrfs_kill_delayed_inode_items(struct btrfs_inode *inode);
109int btrfs_commit_inode_delayed_inode(struct btrfs_inode *inode);
110
111
112int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
113 struct btrfs_root *root, struct inode *inode);
114int btrfs_fill_inode(struct inode *inode, u32 *rdev);
115int btrfs_delayed_delete_inode_ref(struct btrfs_inode *inode);
116
117/* Used for drop dead root */
118void btrfs_kill_all_delayed_nodes(struct btrfs_root *root);
119
120/* Used for clean the transaction */
121void btrfs_destroy_delayed_inodes(struct btrfs_fs_info *fs_info);
122
123/* Used for readdir() */
124bool btrfs_readdir_get_delayed_items(struct inode *inode,
125 struct list_head *ins_list,
126 struct list_head *del_list);
127void btrfs_readdir_put_delayed_items(struct inode *inode,
128 struct list_head *ins_list,
129 struct list_head *del_list);
130int btrfs_should_delete_dir_index(struct list_head *del_list,
131 u64 index);
132int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
133 struct list_head *ins_list);
134
135/* for init */
136int __init btrfs_delayed_inode_init(void);
137void __cold btrfs_delayed_inode_exit(void);
138
139/* for debugging */
140void btrfs_assert_delayed_root_empty(struct btrfs_fs_info *fs_info);
141
142#endif
1/* SPDX-License-Identifier: GPL-2.0 */
2/*
3 * Copyright (C) 2011 Fujitsu. All rights reserved.
4 * Written by Miao Xie <miaox@cn.fujitsu.com>
5 */
6
7#ifndef BTRFS_DELAYED_INODE_H
8#define BTRFS_DELAYED_INODE_H
9
10#include <linux/types.h>
11#include <linux/rbtree.h>
12#include <linux/spinlock.h>
13#include <linux/mutex.h>
14#include <linux/list.h>
15#include <linux/wait.h>
16#include <linux/fs.h>
17#include <linux/atomic.h>
18#include <linux/refcount.h>
19#include "ctree.h"
20
21struct btrfs_disk_key;
22struct btrfs_fs_info;
23struct btrfs_inode;
24struct btrfs_root;
25struct btrfs_trans_handle;
26
27enum btrfs_delayed_item_type {
28 BTRFS_DELAYED_INSERTION_ITEM,
29 BTRFS_DELAYED_DELETION_ITEM
30};
31
32struct btrfs_delayed_root {
33 spinlock_t lock;
34 struct list_head node_list;
35 /*
36 * Used for delayed nodes which is waiting to be dealt with by the
37 * worker. If the delayed node is inserted into the work queue, we
38 * drop it from this list.
39 */
40 struct list_head prepare_list;
41 atomic_t items; /* for delayed items */
42 atomic_t items_seq; /* for delayed items */
43 int nodes; /* for delayed nodes */
44 wait_queue_head_t wait;
45};
46
47#define BTRFS_DELAYED_NODE_IN_LIST 0
48#define BTRFS_DELAYED_NODE_INODE_DIRTY 1
49#define BTRFS_DELAYED_NODE_DEL_IREF 2
50
51struct btrfs_delayed_node {
52 u64 inode_id;
53 u64 bytes_reserved;
54 struct btrfs_root *root;
55 /* Used to add the node into the delayed root's node list. */
56 struct list_head n_list;
57 /*
58 * Used to add the node into the prepare list, the nodes in this list
59 * is waiting to be dealt with by the async worker.
60 */
61 struct list_head p_list;
62 struct rb_root_cached ins_root;
63 struct rb_root_cached del_root;
64 struct mutex mutex;
65 struct btrfs_inode_item inode_item;
66 refcount_t refs;
67 u64 index_cnt;
68 unsigned long flags;
69 int count;
70 /*
71 * The size of the next batch of dir index items to insert (if this
72 * node is from a directory inode). Protected by @mutex.
73 */
74 u32 curr_index_batch_size;
75 /*
76 * Number of leaves reserved for inserting dir index items (if this
77 * node belongs to a directory inode). This may be larger then the
78 * actual number of leaves we end up using. Protected by @mutex.
79 */
80 u32 index_item_leaves;
81};
82
83struct btrfs_delayed_item {
84 struct rb_node rb_node;
85 /* Offset value of the corresponding dir index key. */
86 u64 index;
87 struct list_head tree_list; /* used for batch insert/delete items */
88 struct list_head readdir_list; /* used for readdir items */
89 /*
90 * Used when logging a directory.
91 * Insertions and deletions to this list are protected by the parent
92 * delayed node's mutex.
93 */
94 struct list_head log_list;
95 u64 bytes_reserved;
96 struct btrfs_delayed_node *delayed_node;
97 refcount_t refs;
98 enum btrfs_delayed_item_type type:8;
99 /*
100 * Track if this delayed item was already logged.
101 * Protected by the mutex of the parent delayed inode.
102 */
103 bool logged;
104 /* The maximum leaf size is 64K, so u16 is more than enough. */
105 u16 data_len;
106 char data[] __counted_by(data_len);
107};
108
109void btrfs_init_delayed_root(struct btrfs_delayed_root *delayed_root);
110int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans,
111 const char *name, int name_len,
112 struct btrfs_inode *dir,
113 struct btrfs_disk_key *disk_key, u8 flags,
114 u64 index);
115
116int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans,
117 struct btrfs_inode *dir, u64 index);
118
119int btrfs_inode_delayed_dir_index_count(struct btrfs_inode *inode);
120
121int btrfs_run_delayed_items(struct btrfs_trans_handle *trans);
122int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans, int nr);
123
124void btrfs_balance_delayed_items(struct btrfs_fs_info *fs_info);
125
126int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans,
127 struct btrfs_inode *inode);
128/* Used for evicting the inode. */
129void btrfs_remove_delayed_node(struct btrfs_inode *inode);
130void btrfs_kill_delayed_inode_items(struct btrfs_inode *inode);
131int btrfs_commit_inode_delayed_inode(struct btrfs_inode *inode);
132
133
134int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans,
135 struct btrfs_inode *inode);
136int btrfs_fill_inode(struct inode *inode, u32 *rdev);
137int btrfs_delayed_delete_inode_ref(struct btrfs_inode *inode);
138
139/* Used for drop dead root */
140void btrfs_kill_all_delayed_nodes(struct btrfs_root *root);
141
142/* Used for clean the transaction */
143void btrfs_destroy_delayed_inodes(struct btrfs_fs_info *fs_info);
144
145/* Used for readdir() */
146bool btrfs_readdir_get_delayed_items(struct inode *inode,
147 u64 last_index,
148 struct list_head *ins_list,
149 struct list_head *del_list);
150void btrfs_readdir_put_delayed_items(struct inode *inode,
151 struct list_head *ins_list,
152 struct list_head *del_list);
153int btrfs_should_delete_dir_index(struct list_head *del_list,
154 u64 index);
155int btrfs_readdir_delayed_dir_index(struct dir_context *ctx,
156 struct list_head *ins_list);
157
158/* Used during directory logging. */
159void btrfs_log_get_delayed_items(struct btrfs_inode *inode,
160 struct list_head *ins_list,
161 struct list_head *del_list);
162void btrfs_log_put_delayed_items(struct btrfs_inode *inode,
163 struct list_head *ins_list,
164 struct list_head *del_list);
165
166/* for init */
167int __init btrfs_delayed_inode_init(void);
168void __cold btrfs_delayed_inode_exit(void);
169
170/* for debugging */
171void btrfs_assert_delayed_root_empty(struct btrfs_fs_info *fs_info);
172
173#endif