1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18#ifndef __DELAYED_REF__
19#define __DELAYED_REF__
20
21
22#define BTRFS_ADD_DELAYED_REF 1
23#define BTRFS_DROP_DELAYED_REF 2
24#define BTRFS_ADD_DELAYED_EXTENT 3
25#define BTRFS_UPDATE_DELAYED_HEAD 4
26
27
28
29
30
31
32
33
34
35
36struct btrfs_delayed_ref_node {
37
38
39
40
41 struct rb_node rb_node;
42
43
44 struct list_head list;
45
46
47 u64 bytenr;
48
49
50 u64 num_bytes;
51
52
53 u64 seq;
54
55
56 atomic_t refs;
57
58
59
60
61
62
63
64
65
66
67 int ref_mod;
68
69 unsigned int action:8;
70 unsigned int type:8;
71
72 unsigned int is_head:1;
73 unsigned int in_tree:1;
74};
75
76struct btrfs_delayed_extent_op {
77 struct btrfs_disk_key key;
78 u64 flags_to_set;
79 int level;
80 unsigned int update_key:1;
81 unsigned int update_flags:1;
82 unsigned int is_data:1;
83};
84
85
86
87
88
89
90
91struct btrfs_delayed_ref_head {
92 struct btrfs_delayed_ref_node node;
93
94
95
96
97
98 struct mutex mutex;
99
100 spinlock_t lock;
101 struct list_head ref_list;
102
103 struct rb_node href_node;
104
105 struct btrfs_delayed_extent_op *extent_op;
106
107
108
109
110
111
112 int total_ref_mod;
113
114
115
116
117
118
119
120
121
122 u64 qgroup_ref_root;
123 u64 qgroup_reserved;
124
125
126
127
128
129
130
131
132
133
134
135
136
137 unsigned int must_insert_reserved:1;
138 unsigned int is_data:1;
139 unsigned int processing:1;
140};
141
142struct btrfs_delayed_tree_ref {
143 struct btrfs_delayed_ref_node node;
144 u64 root;
145 u64 parent;
146 int level;
147};
148
149struct btrfs_delayed_data_ref {
150 struct btrfs_delayed_ref_node node;
151 u64 root;
152 u64 parent;
153 u64 objectid;
154 u64 offset;
155};
156
157struct btrfs_delayed_ref_root {
158
159 struct rb_root href_root;
160
161
162 struct rb_root dirty_extent_root;
163
164
165 spinlock_t lock;
166
167
168
169
170 atomic_t num_entries;
171
172
173 unsigned long num_heads;
174
175
176 unsigned long num_heads_ready;
177
178 u64 pending_csums;
179
180
181
182
183
184
185 int flushing;
186
187 u64 run_delayed_start;
188
189
190
191
192
193
194
195 u64 qgroup_to_skip;
196};
197
198extern struct kmem_cache *btrfs_delayed_ref_head_cachep;
199extern struct kmem_cache *btrfs_delayed_tree_ref_cachep;
200extern struct kmem_cache *btrfs_delayed_data_ref_cachep;
201extern struct kmem_cache *btrfs_delayed_extent_op_cachep;
202
203int btrfs_delayed_ref_init(void);
204void btrfs_delayed_ref_exit(void);
205
206static inline struct btrfs_delayed_extent_op *
207btrfs_alloc_delayed_extent_op(void)
208{
209 return kmem_cache_alloc(btrfs_delayed_extent_op_cachep, GFP_NOFS);
210}
211
212static inline void
213btrfs_free_delayed_extent_op(struct btrfs_delayed_extent_op *op)
214{
215 if (op)
216 kmem_cache_free(btrfs_delayed_extent_op_cachep, op);
217}
218
219static inline void btrfs_put_delayed_ref(struct btrfs_delayed_ref_node *ref)
220{
221 WARN_ON(atomic_read(&ref->refs) == 0);
222 if (atomic_dec_and_test(&ref->refs)) {
223 WARN_ON(ref->in_tree);
224 switch (ref->type) {
225 case BTRFS_TREE_BLOCK_REF_KEY:
226 case BTRFS_SHARED_BLOCK_REF_KEY:
227 kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);
228 break;
229 case BTRFS_EXTENT_DATA_REF_KEY:
230 case BTRFS_SHARED_DATA_REF_KEY:
231 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);
232 break;
233 case 0:
234 kmem_cache_free(btrfs_delayed_ref_head_cachep, ref);
235 break;
236 default:
237 BUG();
238 }
239 }
240}
241
242int btrfs_add_delayed_tree_ref(struct btrfs_fs_info *fs_info,
243 struct btrfs_trans_handle *trans,
244 u64 bytenr, u64 num_bytes, u64 parent,
245 u64 ref_root, int level, int action,
246 struct btrfs_delayed_extent_op *extent_op);
247int btrfs_add_delayed_data_ref(struct btrfs_fs_info *fs_info,
248 struct btrfs_trans_handle *trans,
249 u64 bytenr, u64 num_bytes,
250 u64 parent, u64 ref_root,
251 u64 owner, u64 offset, u64 reserved, int action,
252 struct btrfs_delayed_extent_op *extent_op);
253int btrfs_add_delayed_qgroup_reserve(struct btrfs_fs_info *fs_info,
254 struct btrfs_trans_handle *trans,
255 u64 ref_root, u64 bytenr, u64 num_bytes);
256int btrfs_add_delayed_extent_op(struct btrfs_fs_info *fs_info,
257 struct btrfs_trans_handle *trans,
258 u64 bytenr, u64 num_bytes,
259 struct btrfs_delayed_extent_op *extent_op);
260void btrfs_merge_delayed_refs(struct btrfs_trans_handle *trans,
261 struct btrfs_fs_info *fs_info,
262 struct btrfs_delayed_ref_root *delayed_refs,
263 struct btrfs_delayed_ref_head *head);
264
265struct btrfs_delayed_ref_head *
266btrfs_find_delayed_ref_head(struct btrfs_trans_handle *trans, u64 bytenr);
267int btrfs_delayed_ref_lock(struct btrfs_trans_handle *trans,
268 struct btrfs_delayed_ref_head *head);
269static inline void btrfs_delayed_ref_unlock(struct btrfs_delayed_ref_head *head)
270{
271 mutex_unlock(&head->mutex);
272}
273
274
275struct btrfs_delayed_ref_head *
276btrfs_select_ref_head(struct btrfs_trans_handle *trans);
277
278int btrfs_check_delayed_seq(struct btrfs_fs_info *fs_info,
279 struct btrfs_delayed_ref_root *delayed_refs,
280 u64 seq);
281
282
283
284
285
286static int btrfs_delayed_ref_is_head(struct btrfs_delayed_ref_node *node)
287{
288 return node->is_head;
289}
290
291
292
293
294static inline struct btrfs_delayed_tree_ref *
295btrfs_delayed_node_to_tree_ref(struct btrfs_delayed_ref_node *node)
296{
297 WARN_ON(btrfs_delayed_ref_is_head(node));
298 return container_of(node, struct btrfs_delayed_tree_ref, node);
299}
300
301static inline struct btrfs_delayed_data_ref *
302btrfs_delayed_node_to_data_ref(struct btrfs_delayed_ref_node *node)
303{
304 WARN_ON(btrfs_delayed_ref_is_head(node));
305 return container_of(node, struct btrfs_delayed_data_ref, node);
306}
307
308static inline struct btrfs_delayed_ref_head *
309btrfs_delayed_node_to_head(struct btrfs_delayed_ref_node *node)
310{
311 WARN_ON(!btrfs_delayed_ref_is_head(node));
312 return container_of(node, struct btrfs_delayed_ref_head, node);
313}
314#endif
315