Commit | Line | Data |
---|---|---|
16cdcec7 MX |
1 | /* |
2 | * Copyright (C) 2011 Fujitsu. All rights reserved. | |
3 | * Written by Miao Xie <miaox@cn.fujitsu.com> | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or | |
6 | * modify it under the terms of the GNU General Public | |
7 | * License v2 as published by the Free Software Foundation. | |
8 | * | |
9 | * This program is distributed in the hope that it will be useful, | |
10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
12 | * General Public License for more details. | |
13 | * | |
14 | * You should have received a copy of the GNU General Public | |
15 | * License along with this program; if not, write to the | |
16 | * Free Software Foundation, Inc., 59 Temple Place - Suite 330, | |
17 | * Boston, MA 021110-1307, USA. | |
18 | */ | |
19 | ||
20 | #include <linux/slab.h> | |
c7f88c4e | 21 | #include <linux/iversion.h> |
16cdcec7 MX |
22 | #include "delayed-inode.h" |
23 | #include "disk-io.h" | |
24 | #include "transaction.h" | |
3cae210f | 25 | #include "ctree.h" |
16cdcec7 | 26 | |
de3cb945 CM |
27 | #define BTRFS_DELAYED_WRITEBACK 512 |
28 | #define BTRFS_DELAYED_BACKGROUND 128 | |
29 | #define BTRFS_DELAYED_BATCH 16 | |
16cdcec7 MX |
30 | |
31 | static struct kmem_cache *delayed_node_cache; | |
32 | ||
33 | int __init btrfs_delayed_inode_init(void) | |
34 | { | |
837e1972 | 35 | delayed_node_cache = kmem_cache_create("btrfs_delayed_node", |
16cdcec7 MX |
36 | sizeof(struct btrfs_delayed_node), |
37 | 0, | |
fba4b697 | 38 | SLAB_MEM_SPREAD, |
16cdcec7 MX |
39 | NULL); |
40 | if (!delayed_node_cache) | |
41 | return -ENOMEM; | |
42 | return 0; | |
43 | } | |
44 | ||
45 | void btrfs_delayed_inode_exit(void) | |
46 | { | |
5598e900 | 47 | kmem_cache_destroy(delayed_node_cache); |
16cdcec7 MX |
48 | } |
49 | ||
50 | static inline void btrfs_init_delayed_node( | |
51 | struct btrfs_delayed_node *delayed_node, | |
52 | struct btrfs_root *root, u64 inode_id) | |
53 | { | |
54 | delayed_node->root = root; | |
55 | delayed_node->inode_id = inode_id; | |
6de5f18e | 56 | refcount_set(&delayed_node->refs, 0); |
16cdcec7 MX |
57 | delayed_node->ins_root = RB_ROOT; |
58 | delayed_node->del_root = RB_ROOT; | |
59 | mutex_init(&delayed_node->mutex); | |
16cdcec7 MX |
60 | INIT_LIST_HEAD(&delayed_node->n_list); |
61 | INIT_LIST_HEAD(&delayed_node->p_list); | |
16cdcec7 MX |
62 | } |
63 | ||
64 | static inline int btrfs_is_continuous_delayed_item( | |
65 | struct btrfs_delayed_item *item1, | |
66 | struct btrfs_delayed_item *item2) | |
67 | { | |
68 | if (item1->key.type == BTRFS_DIR_INDEX_KEY && | |
69 | item1->key.objectid == item2->key.objectid && | |
70 | item1->key.type == item2->key.type && | |
71 | item1->key.offset + 1 == item2->key.offset) | |
72 | return 1; | |
73 | return 0; | |
74 | } | |
75 | ||
f85b7379 DS |
76 | static struct btrfs_delayed_node *btrfs_get_delayed_node( |
77 | struct btrfs_inode *btrfs_inode) | |
16cdcec7 | 78 | { |
16cdcec7 | 79 | struct btrfs_root *root = btrfs_inode->root; |
4a0cc7ca | 80 | u64 ino = btrfs_ino(btrfs_inode); |
2f7e33d4 | 81 | struct btrfs_delayed_node *node; |
16cdcec7 | 82 | |
20c7bcec | 83 | node = READ_ONCE(btrfs_inode->delayed_node); |
16cdcec7 | 84 | if (node) { |
6de5f18e | 85 | refcount_inc(&node->refs); |
16cdcec7 MX |
86 | return node; |
87 | } | |
88 | ||
89 | spin_lock(&root->inode_lock); | |
0d0ca30f | 90 | node = radix_tree_lookup(&root->delayed_nodes_tree, ino); |
ec35e48b | 91 | |
16cdcec7 MX |
92 | if (node) { |
93 | if (btrfs_inode->delayed_node) { | |
6de5f18e | 94 | refcount_inc(&node->refs); /* can be accessed */ |
2f7e33d4 | 95 | BUG_ON(btrfs_inode->delayed_node != node); |
16cdcec7 | 96 | spin_unlock(&root->inode_lock); |
2f7e33d4 | 97 | return node; |
16cdcec7 | 98 | } |
ec35e48b CM |
99 | |
100 | /* | |
101 | * It's possible that we're racing into the middle of removing | |
102 | * this node from the radix tree. In this case, the refcount | |
103 | * was zero and it should never go back to one. Just return | |
104 | * NULL like it was never in the radix at all; our release | |
105 | * function is in the process of removing it. | |
106 | * | |
107 | * Some implementations of refcount_inc refuse to bump the | |
108 | * refcount once it has hit zero. If we don't do this dance | |
109 | * here, refcount_inc() may decide to just WARN_ONCE() instead | |
110 | * of actually bumping the refcount. | |
111 | * | |
112 | * If this node is properly in the radix, we want to bump the | |
113 | * refcount twice, once for the inode and once for this get | |
114 | * operation. | |
115 | */ | |
116 | if (refcount_inc_not_zero(&node->refs)) { | |
117 | refcount_inc(&node->refs); | |
118 | btrfs_inode->delayed_node = node; | |
119 | } else { | |
120 | node = NULL; | |
121 | } | |
122 | ||
16cdcec7 MX |
123 | spin_unlock(&root->inode_lock); |
124 | return node; | |
125 | } | |
126 | spin_unlock(&root->inode_lock); | |
127 | ||
2f7e33d4 MX |
128 | return NULL; |
129 | } | |
130 | ||
79787eaa | 131 | /* Will return either the node or PTR_ERR(-ENOMEM) */ |
2f7e33d4 | 132 | static struct btrfs_delayed_node *btrfs_get_or_create_delayed_node( |
f85b7379 | 133 | struct btrfs_inode *btrfs_inode) |
2f7e33d4 MX |
134 | { |
135 | struct btrfs_delayed_node *node; | |
2f7e33d4 | 136 | struct btrfs_root *root = btrfs_inode->root; |
4a0cc7ca | 137 | u64 ino = btrfs_ino(btrfs_inode); |
2f7e33d4 MX |
138 | int ret; |
139 | ||
140 | again: | |
340c6ca9 | 141 | node = btrfs_get_delayed_node(btrfs_inode); |
2f7e33d4 MX |
142 | if (node) |
143 | return node; | |
144 | ||
352dd9c8 | 145 | node = kmem_cache_zalloc(delayed_node_cache, GFP_NOFS); |
16cdcec7 MX |
146 | if (!node) |
147 | return ERR_PTR(-ENOMEM); | |
0d0ca30f | 148 | btrfs_init_delayed_node(node, root, ino); |
16cdcec7 | 149 | |
95e94d14 | 150 | /* cached in the btrfs inode and can be accessed */ |
6de5f18e | 151 | refcount_set(&node->refs, 2); |
16cdcec7 | 152 | |
e1860a77 | 153 | ret = radix_tree_preload(GFP_NOFS); |
16cdcec7 MX |
154 | if (ret) { |
155 | kmem_cache_free(delayed_node_cache, node); | |
156 | return ERR_PTR(ret); | |
157 | } | |
158 | ||
159 | spin_lock(&root->inode_lock); | |
0d0ca30f | 160 | ret = radix_tree_insert(&root->delayed_nodes_tree, ino, node); |
16cdcec7 | 161 | if (ret == -EEXIST) { |
16cdcec7 | 162 | spin_unlock(&root->inode_lock); |
96493031 | 163 | kmem_cache_free(delayed_node_cache, node); |
16cdcec7 MX |
164 | radix_tree_preload_end(); |
165 | goto again; | |
166 | } | |
167 | btrfs_inode->delayed_node = node; | |
168 | spin_unlock(&root->inode_lock); | |
169 | radix_tree_preload_end(); | |
170 | ||
171 | return node; | |
172 | } | |
173 | ||
174 | /* | |
175 | * Call it when holding delayed_node->mutex | |
176 | * | |
177 | * If mod = 1, add this node into the prepared list. | |
178 | */ | |
179 | static void btrfs_queue_delayed_node(struct btrfs_delayed_root *root, | |
180 | struct btrfs_delayed_node *node, | |
181 | int mod) | |
182 | { | |
183 | spin_lock(&root->lock); | |
7cf35d91 | 184 | if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) { |
16cdcec7 MX |
185 | if (!list_empty(&node->p_list)) |
186 | list_move_tail(&node->p_list, &root->prepare_list); | |
187 | else if (mod) | |
188 | list_add_tail(&node->p_list, &root->prepare_list); | |
189 | } else { | |
190 | list_add_tail(&node->n_list, &root->node_list); | |
191 | list_add_tail(&node->p_list, &root->prepare_list); | |
6de5f18e | 192 | refcount_inc(&node->refs); /* inserted into list */ |
16cdcec7 | 193 | root->nodes++; |
7cf35d91 | 194 | set_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags); |
16cdcec7 MX |
195 | } |
196 | spin_unlock(&root->lock); | |
197 | } | |
198 | ||
199 | /* Call it when holding delayed_node->mutex */ | |
200 | static void btrfs_dequeue_delayed_node(struct btrfs_delayed_root *root, | |
201 | struct btrfs_delayed_node *node) | |
202 | { | |
203 | spin_lock(&root->lock); | |
7cf35d91 | 204 | if (test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) { |
16cdcec7 | 205 | root->nodes--; |
6de5f18e | 206 | refcount_dec(&node->refs); /* not in the list */ |
16cdcec7 MX |
207 | list_del_init(&node->n_list); |
208 | if (!list_empty(&node->p_list)) | |
209 | list_del_init(&node->p_list); | |
7cf35d91 | 210 | clear_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags); |
16cdcec7 MX |
211 | } |
212 | spin_unlock(&root->lock); | |
213 | } | |
214 | ||
48a3b636 | 215 | static struct btrfs_delayed_node *btrfs_first_delayed_node( |
16cdcec7 MX |
216 | struct btrfs_delayed_root *delayed_root) |
217 | { | |
218 | struct list_head *p; | |
219 | struct btrfs_delayed_node *node = NULL; | |
220 | ||
221 | spin_lock(&delayed_root->lock); | |
222 | if (list_empty(&delayed_root->node_list)) | |
223 | goto out; | |
224 | ||
225 | p = delayed_root->node_list.next; | |
226 | node = list_entry(p, struct btrfs_delayed_node, n_list); | |
6de5f18e | 227 | refcount_inc(&node->refs); |
16cdcec7 MX |
228 | out: |
229 | spin_unlock(&delayed_root->lock); | |
230 | ||
231 | return node; | |
232 | } | |
233 | ||
48a3b636 | 234 | static struct btrfs_delayed_node *btrfs_next_delayed_node( |
16cdcec7 MX |
235 | struct btrfs_delayed_node *node) |
236 | { | |
237 | struct btrfs_delayed_root *delayed_root; | |
238 | struct list_head *p; | |
239 | struct btrfs_delayed_node *next = NULL; | |
240 | ||
241 | delayed_root = node->root->fs_info->delayed_root; | |
242 | spin_lock(&delayed_root->lock); | |
7cf35d91 MX |
243 | if (!test_bit(BTRFS_DELAYED_NODE_IN_LIST, &node->flags)) { |
244 | /* not in the list */ | |
16cdcec7 MX |
245 | if (list_empty(&delayed_root->node_list)) |
246 | goto out; | |
247 | p = delayed_root->node_list.next; | |
248 | } else if (list_is_last(&node->n_list, &delayed_root->node_list)) | |
249 | goto out; | |
250 | else | |
251 | p = node->n_list.next; | |
252 | ||
253 | next = list_entry(p, struct btrfs_delayed_node, n_list); | |
6de5f18e | 254 | refcount_inc(&next->refs); |
16cdcec7 MX |
255 | out: |
256 | spin_unlock(&delayed_root->lock); | |
257 | ||
258 | return next; | |
259 | } | |
260 | ||
261 | static void __btrfs_release_delayed_node( | |
262 | struct btrfs_delayed_node *delayed_node, | |
263 | int mod) | |
264 | { | |
265 | struct btrfs_delayed_root *delayed_root; | |
266 | ||
267 | if (!delayed_node) | |
268 | return; | |
269 | ||
270 | delayed_root = delayed_node->root->fs_info->delayed_root; | |
271 | ||
272 | mutex_lock(&delayed_node->mutex); | |
273 | if (delayed_node->count) | |
274 | btrfs_queue_delayed_node(delayed_root, delayed_node, mod); | |
275 | else | |
276 | btrfs_dequeue_delayed_node(delayed_root, delayed_node); | |
277 | mutex_unlock(&delayed_node->mutex); | |
278 | ||
6de5f18e | 279 | if (refcount_dec_and_test(&delayed_node->refs)) { |
16cdcec7 | 280 | struct btrfs_root *root = delayed_node->root; |
ec35e48b | 281 | |
16cdcec7 | 282 | spin_lock(&root->inode_lock); |
ec35e48b CM |
283 | /* |
284 | * Once our refcount goes to zero, nobody is allowed to bump it | |
285 | * back up. We can delete it now. | |
286 | */ | |
287 | ASSERT(refcount_read(&delayed_node->refs) == 0); | |
288 | radix_tree_delete(&root->delayed_nodes_tree, | |
289 | delayed_node->inode_id); | |
16cdcec7 | 290 | spin_unlock(&root->inode_lock); |
ec35e48b | 291 | kmem_cache_free(delayed_node_cache, delayed_node); |
16cdcec7 MX |
292 | } |
293 | } | |
294 | ||
295 | static inline void btrfs_release_delayed_node(struct btrfs_delayed_node *node) | |
296 | { | |
297 | __btrfs_release_delayed_node(node, 0); | |
298 | } | |
299 | ||
48a3b636 | 300 | static struct btrfs_delayed_node *btrfs_first_prepared_delayed_node( |
16cdcec7 MX |
301 | struct btrfs_delayed_root *delayed_root) |
302 | { | |
303 | struct list_head *p; | |
304 | struct btrfs_delayed_node *node = NULL; | |
305 | ||
306 | spin_lock(&delayed_root->lock); | |
307 | if (list_empty(&delayed_root->prepare_list)) | |
308 | goto out; | |
309 | ||
310 | p = delayed_root->prepare_list.next; | |
311 | list_del_init(p); | |
312 | node = list_entry(p, struct btrfs_delayed_node, p_list); | |
6de5f18e | 313 | refcount_inc(&node->refs); |
16cdcec7 MX |
314 | out: |
315 | spin_unlock(&delayed_root->lock); | |
316 | ||
317 | return node; | |
318 | } | |
319 | ||
320 | static inline void btrfs_release_prepared_delayed_node( | |
321 | struct btrfs_delayed_node *node) | |
322 | { | |
323 | __btrfs_release_delayed_node(node, 1); | |
324 | } | |
325 | ||
48a3b636 | 326 | static struct btrfs_delayed_item *btrfs_alloc_delayed_item(u32 data_len) |
16cdcec7 MX |
327 | { |
328 | struct btrfs_delayed_item *item; | |
329 | item = kmalloc(sizeof(*item) + data_len, GFP_NOFS); | |
330 | if (item) { | |
331 | item->data_len = data_len; | |
332 | item->ins_or_del = 0; | |
333 | item->bytes_reserved = 0; | |
16cdcec7 | 334 | item->delayed_node = NULL; |
089e77e1 | 335 | refcount_set(&item->refs, 1); |
16cdcec7 MX |
336 | } |
337 | return item; | |
338 | } | |
339 | ||
340 | /* | |
341 | * __btrfs_lookup_delayed_item - look up the delayed item by key | |
342 | * @delayed_node: pointer to the delayed node | |
343 | * @key: the key to look up | |
344 | * @prev: used to store the prev item if the right item isn't found | |
345 | * @next: used to store the next item if the right item isn't found | |
346 | * | |
347 | * Note: if we don't find the right item, we will return the prev item and | |
348 | * the next item. | |
349 | */ | |
350 | static struct btrfs_delayed_item *__btrfs_lookup_delayed_item( | |
351 | struct rb_root *root, | |
352 | struct btrfs_key *key, | |
353 | struct btrfs_delayed_item **prev, | |
354 | struct btrfs_delayed_item **next) | |
355 | { | |
356 | struct rb_node *node, *prev_node = NULL; | |
357 | struct btrfs_delayed_item *delayed_item = NULL; | |
358 | int ret = 0; | |
359 | ||
360 | node = root->rb_node; | |
361 | ||
362 | while (node) { | |
363 | delayed_item = rb_entry(node, struct btrfs_delayed_item, | |
364 | rb_node); | |
365 | prev_node = node; | |
366 | ret = btrfs_comp_cpu_keys(&delayed_item->key, key); | |
367 | if (ret < 0) | |
368 | node = node->rb_right; | |
369 | else if (ret > 0) | |
370 | node = node->rb_left; | |
371 | else | |
372 | return delayed_item; | |
373 | } | |
374 | ||
375 | if (prev) { | |
376 | if (!prev_node) | |
377 | *prev = NULL; | |
378 | else if (ret < 0) | |
379 | *prev = delayed_item; | |
380 | else if ((node = rb_prev(prev_node)) != NULL) { | |
381 | *prev = rb_entry(node, struct btrfs_delayed_item, | |
382 | rb_node); | |
383 | } else | |
384 | *prev = NULL; | |
385 | } | |
386 | ||
387 | if (next) { | |
388 | if (!prev_node) | |
389 | *next = NULL; | |
390 | else if (ret > 0) | |
391 | *next = delayed_item; | |
392 | else if ((node = rb_next(prev_node)) != NULL) { | |
393 | *next = rb_entry(node, struct btrfs_delayed_item, | |
394 | rb_node); | |
395 | } else | |
396 | *next = NULL; | |
397 | } | |
398 | return NULL; | |
399 | } | |
400 | ||
48a3b636 | 401 | static struct btrfs_delayed_item *__btrfs_lookup_delayed_insertion_item( |
16cdcec7 MX |
402 | struct btrfs_delayed_node *delayed_node, |
403 | struct btrfs_key *key) | |
404 | { | |
e2c89907 | 405 | return __btrfs_lookup_delayed_item(&delayed_node->ins_root, key, |
16cdcec7 | 406 | NULL, NULL); |
16cdcec7 MX |
407 | } |
408 | ||
16cdcec7 MX |
409 | static int __btrfs_add_delayed_item(struct btrfs_delayed_node *delayed_node, |
410 | struct btrfs_delayed_item *ins, | |
411 | int action) | |
412 | { | |
413 | struct rb_node **p, *node; | |
414 | struct rb_node *parent_node = NULL; | |
415 | struct rb_root *root; | |
416 | struct btrfs_delayed_item *item; | |
417 | int cmp; | |
418 | ||
419 | if (action == BTRFS_DELAYED_INSERTION_ITEM) | |
420 | root = &delayed_node->ins_root; | |
421 | else if (action == BTRFS_DELAYED_DELETION_ITEM) | |
422 | root = &delayed_node->del_root; | |
423 | else | |
424 | BUG(); | |
425 | p = &root->rb_node; | |
426 | node = &ins->rb_node; | |
427 | ||
428 | while (*p) { | |
429 | parent_node = *p; | |
430 | item = rb_entry(parent_node, struct btrfs_delayed_item, | |
431 | rb_node); | |
432 | ||
433 | cmp = btrfs_comp_cpu_keys(&item->key, &ins->key); | |
434 | if (cmp < 0) | |
435 | p = &(*p)->rb_right; | |
436 | else if (cmp > 0) | |
437 | p = &(*p)->rb_left; | |
438 | else | |
439 | return -EEXIST; | |
440 | } | |
441 | ||
442 | rb_link_node(node, parent_node, p); | |
443 | rb_insert_color(node, root); | |
444 | ins->delayed_node = delayed_node; | |
445 | ins->ins_or_del = action; | |
446 | ||
447 | if (ins->key.type == BTRFS_DIR_INDEX_KEY && | |
448 | action == BTRFS_DELAYED_INSERTION_ITEM && | |
449 | ins->key.offset >= delayed_node->index_cnt) | |
450 | delayed_node->index_cnt = ins->key.offset + 1; | |
451 | ||
452 | delayed_node->count++; | |
453 | atomic_inc(&delayed_node->root->fs_info->delayed_root->items); | |
454 | return 0; | |
455 | } | |
456 | ||
457 | static int __btrfs_add_delayed_insertion_item(struct btrfs_delayed_node *node, | |
458 | struct btrfs_delayed_item *item) | |
459 | { | |
460 | return __btrfs_add_delayed_item(node, item, | |
461 | BTRFS_DELAYED_INSERTION_ITEM); | |
462 | } | |
463 | ||
464 | static int __btrfs_add_delayed_deletion_item(struct btrfs_delayed_node *node, | |
465 | struct btrfs_delayed_item *item) | |
466 | { | |
467 | return __btrfs_add_delayed_item(node, item, | |
468 | BTRFS_DELAYED_DELETION_ITEM); | |
469 | } | |
470 | ||
de3cb945 CM |
471 | static void finish_one_item(struct btrfs_delayed_root *delayed_root) |
472 | { | |
473 | int seq = atomic_inc_return(&delayed_root->items_seq); | |
ee863954 DS |
474 | |
475 | /* | |
476 | * atomic_dec_return implies a barrier for waitqueue_active | |
477 | */ | |
de3cb945 CM |
478 | if ((atomic_dec_return(&delayed_root->items) < |
479 | BTRFS_DELAYED_BACKGROUND || seq % BTRFS_DELAYED_BATCH == 0) && | |
480 | waitqueue_active(&delayed_root->wait)) | |
481 | wake_up(&delayed_root->wait); | |
482 | } | |
483 | ||
16cdcec7 MX |
484 | static void __btrfs_remove_delayed_item(struct btrfs_delayed_item *delayed_item) |
485 | { | |
486 | struct rb_root *root; | |
487 | struct btrfs_delayed_root *delayed_root; | |
488 | ||
489 | delayed_root = delayed_item->delayed_node->root->fs_info->delayed_root; | |
490 | ||
491 | BUG_ON(!delayed_root); | |
492 | BUG_ON(delayed_item->ins_or_del != BTRFS_DELAYED_DELETION_ITEM && | |
493 | delayed_item->ins_or_del != BTRFS_DELAYED_INSERTION_ITEM); | |
494 | ||
495 | if (delayed_item->ins_or_del == BTRFS_DELAYED_INSERTION_ITEM) | |
496 | root = &delayed_item->delayed_node->ins_root; | |
497 | else | |
498 | root = &delayed_item->delayed_node->del_root; | |
499 | ||
500 | rb_erase(&delayed_item->rb_node, root); | |
501 | delayed_item->delayed_node->count--; | |
de3cb945 CM |
502 | |
503 | finish_one_item(delayed_root); | |
16cdcec7 MX |
504 | } |
505 | ||
506 | static void btrfs_release_delayed_item(struct btrfs_delayed_item *item) | |
507 | { | |
508 | if (item) { | |
509 | __btrfs_remove_delayed_item(item); | |
089e77e1 | 510 | if (refcount_dec_and_test(&item->refs)) |
16cdcec7 MX |
511 | kfree(item); |
512 | } | |
513 | } | |
514 | ||
48a3b636 | 515 | static struct btrfs_delayed_item *__btrfs_first_delayed_insertion_item( |
16cdcec7 MX |
516 | struct btrfs_delayed_node *delayed_node) |
517 | { | |
518 | struct rb_node *p; | |
519 | struct btrfs_delayed_item *item = NULL; | |
520 | ||
521 | p = rb_first(&delayed_node->ins_root); | |
522 | if (p) | |
523 | item = rb_entry(p, struct btrfs_delayed_item, rb_node); | |
524 | ||
525 | return item; | |
526 | } | |
527 | ||
48a3b636 | 528 | static struct btrfs_delayed_item *__btrfs_first_delayed_deletion_item( |
16cdcec7 MX |
529 | struct btrfs_delayed_node *delayed_node) |
530 | { | |
531 | struct rb_node *p; | |
532 | struct btrfs_delayed_item *item = NULL; | |
533 | ||
534 | p = rb_first(&delayed_node->del_root); | |
535 | if (p) | |
536 | item = rb_entry(p, struct btrfs_delayed_item, rb_node); | |
537 | ||
538 | return item; | |
539 | } | |
540 | ||
48a3b636 | 541 | static struct btrfs_delayed_item *__btrfs_next_delayed_item( |
16cdcec7 MX |
542 | struct btrfs_delayed_item *item) |
543 | { | |
544 | struct rb_node *p; | |
545 | struct btrfs_delayed_item *next = NULL; | |
546 | ||
547 | p = rb_next(&item->rb_node); | |
548 | if (p) | |
549 | next = rb_entry(p, struct btrfs_delayed_item, rb_node); | |
550 | ||
551 | return next; | |
552 | } | |
553 | ||
16cdcec7 | 554 | static int btrfs_delayed_item_reserve_metadata(struct btrfs_trans_handle *trans, |
2ff7e61e | 555 | struct btrfs_fs_info *fs_info, |
16cdcec7 MX |
556 | struct btrfs_delayed_item *item) |
557 | { | |
558 | struct btrfs_block_rsv *src_rsv; | |
559 | struct btrfs_block_rsv *dst_rsv; | |
560 | u64 num_bytes; | |
561 | int ret; | |
562 | ||
563 | if (!trans->bytes_reserved) | |
564 | return 0; | |
565 | ||
566 | src_rsv = trans->block_rsv; | |
0b246afa | 567 | dst_rsv = &fs_info->delayed_block_rsv; |
16cdcec7 | 568 | |
0b246afa | 569 | num_bytes = btrfs_calc_trans_metadata_size(fs_info, 1); |
25d609f8 | 570 | ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes, 1); |
8c2a3ca2 | 571 | if (!ret) { |
0b246afa | 572 | trace_btrfs_space_reservation(fs_info, "delayed_item", |
8c2a3ca2 JB |
573 | item->key.objectid, |
574 | num_bytes, 1); | |
16cdcec7 | 575 | item->bytes_reserved = num_bytes; |
8c2a3ca2 | 576 | } |
16cdcec7 MX |
577 | |
578 | return ret; | |
579 | } | |
580 | ||
2ff7e61e | 581 | static void btrfs_delayed_item_release_metadata(struct btrfs_fs_info *fs_info, |
16cdcec7 MX |
582 | struct btrfs_delayed_item *item) |
583 | { | |
19fd2949 MX |
584 | struct btrfs_block_rsv *rsv; |
585 | ||
16cdcec7 MX |
586 | if (!item->bytes_reserved) |
587 | return; | |
588 | ||
0b246afa JM |
589 | rsv = &fs_info->delayed_block_rsv; |
590 | trace_btrfs_space_reservation(fs_info, "delayed_item", | |
8c2a3ca2 JB |
591 | item->key.objectid, item->bytes_reserved, |
592 | 0); | |
2ff7e61e | 593 | btrfs_block_rsv_release(fs_info, rsv, |
16cdcec7 MX |
594 | item->bytes_reserved); |
595 | } | |
596 | ||
597 | static int btrfs_delayed_inode_reserve_metadata( | |
598 | struct btrfs_trans_handle *trans, | |
599 | struct btrfs_root *root, | |
fcabdd1c | 600 | struct btrfs_inode *inode, |
16cdcec7 MX |
601 | struct btrfs_delayed_node *node) |
602 | { | |
0b246afa | 603 | struct btrfs_fs_info *fs_info = root->fs_info; |
16cdcec7 MX |
604 | struct btrfs_block_rsv *src_rsv; |
605 | struct btrfs_block_rsv *dst_rsv; | |
606 | u64 num_bytes; | |
607 | int ret; | |
608 | ||
16cdcec7 | 609 | src_rsv = trans->block_rsv; |
0b246afa | 610 | dst_rsv = &fs_info->delayed_block_rsv; |
16cdcec7 | 611 | |
0b246afa | 612 | num_bytes = btrfs_calc_trans_metadata_size(fs_info, 1); |
c06a0e12 JB |
613 | |
614 | /* | |
615 | * btrfs_dirty_inode will update the inode under btrfs_join_transaction | |
616 | * which doesn't reserve space for speed. This is a problem since we | |
617 | * still need to reserve space for this update, so try to reserve the | |
618 | * space. | |
619 | * | |
620 | * Now if src_rsv == delalloc_block_rsv we'll let it just steal since | |
69fe2d75 | 621 | * we always reserve enough to update the inode item. |
c06a0e12 | 622 | */ |
e755d9ab | 623 | if (!src_rsv || (!trans->bytes_reserved && |
66d8f3dd | 624 | src_rsv->type != BTRFS_BLOCK_RSV_DELALLOC)) { |
08e007d2 MX |
625 | ret = btrfs_block_rsv_add(root, dst_rsv, num_bytes, |
626 | BTRFS_RESERVE_NO_FLUSH); | |
c06a0e12 JB |
627 | /* |
628 | * Since we're under a transaction reserve_metadata_bytes could | |
629 | * try to commit the transaction which will make it return | |
630 | * EAGAIN to make us stop the transaction we have, so return | |
631 | * ENOSPC instead so that btrfs_dirty_inode knows what to do. | |
632 | */ | |
633 | if (ret == -EAGAIN) | |
634 | ret = -ENOSPC; | |
8c2a3ca2 | 635 | if (!ret) { |
c06a0e12 | 636 | node->bytes_reserved = num_bytes; |
0b246afa | 637 | trace_btrfs_space_reservation(fs_info, |
8c2a3ca2 | 638 | "delayed_inode", |
fcabdd1c | 639 | btrfs_ino(inode), |
8c2a3ca2 JB |
640 | num_bytes, 1); |
641 | } | |
c06a0e12 JB |
642 | return ret; |
643 | } | |
644 | ||
25d609f8 | 645 | ret = btrfs_block_rsv_migrate(src_rsv, dst_rsv, num_bytes, 1); |
8c2a3ca2 | 646 | if (!ret) { |
0b246afa | 647 | trace_btrfs_space_reservation(fs_info, "delayed_inode", |
fcabdd1c | 648 | btrfs_ino(inode), num_bytes, 1); |
16cdcec7 | 649 | node->bytes_reserved = num_bytes; |
8c2a3ca2 | 650 | } |
16cdcec7 MX |
651 | |
652 | return ret; | |
653 | } | |
654 | ||
2ff7e61e | 655 | static void btrfs_delayed_inode_release_metadata(struct btrfs_fs_info *fs_info, |
16cdcec7 MX |
656 | struct btrfs_delayed_node *node) |
657 | { | |
658 | struct btrfs_block_rsv *rsv; | |
659 | ||
660 | if (!node->bytes_reserved) | |
661 | return; | |
662 | ||
0b246afa JM |
663 | rsv = &fs_info->delayed_block_rsv; |
664 | trace_btrfs_space_reservation(fs_info, "delayed_inode", | |
8c2a3ca2 | 665 | node->inode_id, node->bytes_reserved, 0); |
2ff7e61e | 666 | btrfs_block_rsv_release(fs_info, rsv, |
16cdcec7 MX |
667 | node->bytes_reserved); |
668 | node->bytes_reserved = 0; | |
669 | } | |
670 | ||
671 | /* | |
672 | * This helper will insert some continuous items into the same leaf according | |
673 | * to the free space of the leaf. | |
674 | */ | |
afe5fea7 TI |
675 | static int btrfs_batch_insert_items(struct btrfs_root *root, |
676 | struct btrfs_path *path, | |
677 | struct btrfs_delayed_item *item) | |
16cdcec7 | 678 | { |
2ff7e61e | 679 | struct btrfs_fs_info *fs_info = root->fs_info; |
16cdcec7 MX |
680 | struct btrfs_delayed_item *curr, *next; |
681 | int free_space; | |
682 | int total_data_size = 0, total_size = 0; | |
683 | struct extent_buffer *leaf; | |
684 | char *data_ptr; | |
685 | struct btrfs_key *keys; | |
686 | u32 *data_size; | |
687 | struct list_head head; | |
688 | int slot; | |
689 | int nitems; | |
690 | int i; | |
691 | int ret = 0; | |
692 | ||
693 | BUG_ON(!path->nodes[0]); | |
694 | ||
695 | leaf = path->nodes[0]; | |
2ff7e61e | 696 | free_space = btrfs_leaf_free_space(fs_info, leaf); |
16cdcec7 MX |
697 | INIT_LIST_HEAD(&head); |
698 | ||
699 | next = item; | |
17aca1c9 | 700 | nitems = 0; |
16cdcec7 MX |
701 | |
702 | /* | |
703 | * count the number of the continuous items that we can insert in batch | |
704 | */ | |
705 | while (total_size + next->data_len + sizeof(struct btrfs_item) <= | |
706 | free_space) { | |
707 | total_data_size += next->data_len; | |
708 | total_size += next->data_len + sizeof(struct btrfs_item); | |
709 | list_add_tail(&next->tree_list, &head); | |
710 | nitems++; | |
711 | ||
712 | curr = next; | |
713 | next = __btrfs_next_delayed_item(curr); | |
714 | if (!next) | |
715 | break; | |
716 | ||
717 | if (!btrfs_is_continuous_delayed_item(curr, next)) | |
718 | break; | |
719 | } | |
720 | ||
721 | if (!nitems) { | |
722 | ret = 0; | |
723 | goto out; | |
724 | } | |
725 | ||
726 | /* | |
727 | * we need allocate some memory space, but it might cause the task | |
728 | * to sleep, so we set all locked nodes in the path to blocking locks | |
729 | * first. | |
730 | */ | |
731 | btrfs_set_path_blocking(path); | |
732 | ||
d9b0d9ba | 733 | keys = kmalloc_array(nitems, sizeof(struct btrfs_key), GFP_NOFS); |
16cdcec7 MX |
734 | if (!keys) { |
735 | ret = -ENOMEM; | |
736 | goto out; | |
737 | } | |
738 | ||
d9b0d9ba | 739 | data_size = kmalloc_array(nitems, sizeof(u32), GFP_NOFS); |
16cdcec7 MX |
740 | if (!data_size) { |
741 | ret = -ENOMEM; | |
742 | goto error; | |
743 | } | |
744 | ||
745 | /* get keys of all the delayed items */ | |
746 | i = 0; | |
747 | list_for_each_entry(next, &head, tree_list) { | |
748 | keys[i] = next->key; | |
749 | data_size[i] = next->data_len; | |
750 | i++; | |
751 | } | |
752 | ||
753 | /* reset all the locked nodes in the patch to spinning locks. */ | |
bd681513 | 754 | btrfs_clear_path_blocking(path, NULL, 0); |
16cdcec7 MX |
755 | |
756 | /* insert the keys of the items */ | |
afe5fea7 | 757 | setup_items_for_insert(root, path, keys, data_size, |
143bede5 | 758 | total_data_size, total_size, nitems); |
16cdcec7 MX |
759 | |
760 | /* insert the dir index items */ | |
761 | slot = path->slots[0]; | |
762 | list_for_each_entry_safe(curr, next, &head, tree_list) { | |
763 | data_ptr = btrfs_item_ptr(leaf, slot, char); | |
764 | write_extent_buffer(leaf, &curr->data, | |
765 | (unsigned long)data_ptr, | |
766 | curr->data_len); | |
767 | slot++; | |
768 | ||
2ff7e61e | 769 | btrfs_delayed_item_release_metadata(fs_info, curr); |
16cdcec7 MX |
770 | |
771 | list_del(&curr->tree_list); | |
772 | btrfs_release_delayed_item(curr); | |
773 | } | |
774 | ||
775 | error: | |
776 | kfree(data_size); | |
777 | kfree(keys); | |
778 | out: | |
779 | return ret; | |
780 | } | |
781 | ||
782 | /* | |
783 | * This helper can just do simple insertion that needn't extend item for new | |
784 | * data, such as directory name index insertion, inode insertion. | |
785 | */ | |
786 | static int btrfs_insert_delayed_item(struct btrfs_trans_handle *trans, | |
787 | struct btrfs_root *root, | |
788 | struct btrfs_path *path, | |
789 | struct btrfs_delayed_item *delayed_item) | |
790 | { | |
2ff7e61e | 791 | struct btrfs_fs_info *fs_info = root->fs_info; |
16cdcec7 | 792 | struct extent_buffer *leaf; |
16cdcec7 MX |
793 | char *ptr; |
794 | int ret; | |
795 | ||
796 | ret = btrfs_insert_empty_item(trans, root, path, &delayed_item->key, | |
797 | delayed_item->data_len); | |
798 | if (ret < 0 && ret != -EEXIST) | |
799 | return ret; | |
800 | ||
801 | leaf = path->nodes[0]; | |
802 | ||
16cdcec7 MX |
803 | ptr = btrfs_item_ptr(leaf, path->slots[0], char); |
804 | ||
805 | write_extent_buffer(leaf, delayed_item->data, (unsigned long)ptr, | |
806 | delayed_item->data_len); | |
807 | btrfs_mark_buffer_dirty(leaf); | |
808 | ||
2ff7e61e | 809 | btrfs_delayed_item_release_metadata(fs_info, delayed_item); |
16cdcec7 MX |
810 | return 0; |
811 | } | |
812 | ||
813 | /* | |
814 | * we insert an item first, then if there are some continuous items, we try | |
815 | * to insert those items into the same leaf. | |
816 | */ | |
817 | static int btrfs_insert_delayed_items(struct btrfs_trans_handle *trans, | |
818 | struct btrfs_path *path, | |
819 | struct btrfs_root *root, | |
820 | struct btrfs_delayed_node *node) | |
821 | { | |
822 | struct btrfs_delayed_item *curr, *prev; | |
823 | int ret = 0; | |
824 | ||
825 | do_again: | |
826 | mutex_lock(&node->mutex); | |
827 | curr = __btrfs_first_delayed_insertion_item(node); | |
828 | if (!curr) | |
829 | goto insert_end; | |
830 | ||
831 | ret = btrfs_insert_delayed_item(trans, root, path, curr); | |
832 | if (ret < 0) { | |
945d8962 | 833 | btrfs_release_path(path); |
16cdcec7 MX |
834 | goto insert_end; |
835 | } | |
836 | ||
837 | prev = curr; | |
838 | curr = __btrfs_next_delayed_item(prev); | |
839 | if (curr && btrfs_is_continuous_delayed_item(prev, curr)) { | |
840 | /* insert the continuous items into the same leaf */ | |
841 | path->slots[0]++; | |
afe5fea7 | 842 | btrfs_batch_insert_items(root, path, curr); |
16cdcec7 MX |
843 | } |
844 | btrfs_release_delayed_item(prev); | |
845 | btrfs_mark_buffer_dirty(path->nodes[0]); | |
846 | ||
945d8962 | 847 | btrfs_release_path(path); |
16cdcec7 MX |
848 | mutex_unlock(&node->mutex); |
849 | goto do_again; | |
850 | ||
851 | insert_end: | |
852 | mutex_unlock(&node->mutex); | |
853 | return ret; | |
854 | } | |
855 | ||
856 | static int btrfs_batch_delete_items(struct btrfs_trans_handle *trans, | |
857 | struct btrfs_root *root, | |
858 | struct btrfs_path *path, | |
859 | struct btrfs_delayed_item *item) | |
860 | { | |
2ff7e61e | 861 | struct btrfs_fs_info *fs_info = root->fs_info; |
16cdcec7 MX |
862 | struct btrfs_delayed_item *curr, *next; |
863 | struct extent_buffer *leaf; | |
864 | struct btrfs_key key; | |
865 | struct list_head head; | |
866 | int nitems, i, last_item; | |
867 | int ret = 0; | |
868 | ||
869 | BUG_ON(!path->nodes[0]); | |
870 | ||
871 | leaf = path->nodes[0]; | |
872 | ||
873 | i = path->slots[0]; | |
874 | last_item = btrfs_header_nritems(leaf) - 1; | |
875 | if (i > last_item) | |
876 | return -ENOENT; /* FIXME: Is errno suitable? */ | |
877 | ||
878 | next = item; | |
879 | INIT_LIST_HEAD(&head); | |
880 | btrfs_item_key_to_cpu(leaf, &key, i); | |
881 | nitems = 0; | |
882 | /* | |
883 | * count the number of the dir index items that we can delete in batch | |
884 | */ | |
885 | while (btrfs_comp_cpu_keys(&next->key, &key) == 0) { | |
886 | list_add_tail(&next->tree_list, &head); | |
887 | nitems++; | |
888 | ||
889 | curr = next; | |
890 | next = __btrfs_next_delayed_item(curr); | |
891 | if (!next) | |
892 | break; | |
893 | ||
894 | if (!btrfs_is_continuous_delayed_item(curr, next)) | |
895 | break; | |
896 | ||
897 | i++; | |
898 | if (i > last_item) | |
899 | break; | |
900 | btrfs_item_key_to_cpu(leaf, &key, i); | |
901 | } | |
902 | ||
903 | if (!nitems) | |
904 | return 0; | |
905 | ||
906 | ret = btrfs_del_items(trans, root, path, path->slots[0], nitems); | |
907 | if (ret) | |
908 | goto out; | |
909 | ||
910 | list_for_each_entry_safe(curr, next, &head, tree_list) { | |
2ff7e61e | 911 | btrfs_delayed_item_release_metadata(fs_info, curr); |
16cdcec7 MX |
912 | list_del(&curr->tree_list); |
913 | btrfs_release_delayed_item(curr); | |
914 | } | |
915 | ||
916 | out: | |
917 | return ret; | |
918 | } | |
919 | ||
920 | static int btrfs_delete_delayed_items(struct btrfs_trans_handle *trans, | |
921 | struct btrfs_path *path, | |
922 | struct btrfs_root *root, | |
923 | struct btrfs_delayed_node *node) | |
924 | { | |
925 | struct btrfs_delayed_item *curr, *prev; | |
926 | int ret = 0; | |
927 | ||
928 | do_again: | |
929 | mutex_lock(&node->mutex); | |
930 | curr = __btrfs_first_delayed_deletion_item(node); | |
931 | if (!curr) | |
932 | goto delete_fail; | |
933 | ||
934 | ret = btrfs_search_slot(trans, root, &curr->key, path, -1, 1); | |
935 | if (ret < 0) | |
936 | goto delete_fail; | |
937 | else if (ret > 0) { | |
938 | /* | |
939 | * can't find the item which the node points to, so this node | |
940 | * is invalid, just drop it. | |
941 | */ | |
942 | prev = curr; | |
943 | curr = __btrfs_next_delayed_item(prev); | |
944 | btrfs_release_delayed_item(prev); | |
945 | ret = 0; | |
945d8962 | 946 | btrfs_release_path(path); |
62095265 FW |
947 | if (curr) { |
948 | mutex_unlock(&node->mutex); | |
16cdcec7 | 949 | goto do_again; |
62095265 | 950 | } else |
16cdcec7 MX |
951 | goto delete_fail; |
952 | } | |
953 | ||
954 | btrfs_batch_delete_items(trans, root, path, curr); | |
945d8962 | 955 | btrfs_release_path(path); |
16cdcec7 MX |
956 | mutex_unlock(&node->mutex); |
957 | goto do_again; | |
958 | ||
959 | delete_fail: | |
945d8962 | 960 | btrfs_release_path(path); |
16cdcec7 MX |
961 | mutex_unlock(&node->mutex); |
962 | return ret; | |
963 | } | |
964 | ||
965 | static void btrfs_release_delayed_inode(struct btrfs_delayed_node *delayed_node) | |
966 | { | |
967 | struct btrfs_delayed_root *delayed_root; | |
968 | ||
7cf35d91 MX |
969 | if (delayed_node && |
970 | test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { | |
16cdcec7 | 971 | BUG_ON(!delayed_node->root); |
7cf35d91 | 972 | clear_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags); |
16cdcec7 MX |
973 | delayed_node->count--; |
974 | ||
975 | delayed_root = delayed_node->root->fs_info->delayed_root; | |
de3cb945 | 976 | finish_one_item(delayed_root); |
16cdcec7 MX |
977 | } |
978 | } | |
979 | ||
67de1176 MX |
980 | static void btrfs_release_delayed_iref(struct btrfs_delayed_node *delayed_node) |
981 | { | |
982 | struct btrfs_delayed_root *delayed_root; | |
983 | ||
984 | ASSERT(delayed_node->root); | |
985 | clear_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags); | |
986 | delayed_node->count--; | |
987 | ||
988 | delayed_root = delayed_node->root->fs_info->delayed_root; | |
989 | finish_one_item(delayed_root); | |
990 | } | |
991 | ||
0e8c36a9 MX |
992 | static int __btrfs_update_delayed_inode(struct btrfs_trans_handle *trans, |
993 | struct btrfs_root *root, | |
994 | struct btrfs_path *path, | |
995 | struct btrfs_delayed_node *node) | |
16cdcec7 | 996 | { |
2ff7e61e | 997 | struct btrfs_fs_info *fs_info = root->fs_info; |
16cdcec7 MX |
998 | struct btrfs_key key; |
999 | struct btrfs_inode_item *inode_item; | |
1000 | struct extent_buffer *leaf; | |
67de1176 | 1001 | int mod; |
16cdcec7 MX |
1002 | int ret; |
1003 | ||
16cdcec7 | 1004 | key.objectid = node->inode_id; |
962a298f | 1005 | key.type = BTRFS_INODE_ITEM_KEY; |
16cdcec7 | 1006 | key.offset = 0; |
0e8c36a9 | 1007 | |
67de1176 MX |
1008 | if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &node->flags)) |
1009 | mod = -1; | |
1010 | else | |
1011 | mod = 1; | |
1012 | ||
1013 | ret = btrfs_lookup_inode(trans, root, path, &key, mod); | |
16cdcec7 | 1014 | if (ret > 0) { |
945d8962 | 1015 | btrfs_release_path(path); |
16cdcec7 MX |
1016 | return -ENOENT; |
1017 | } else if (ret < 0) { | |
16cdcec7 MX |
1018 | return ret; |
1019 | } | |
1020 | ||
16cdcec7 MX |
1021 | leaf = path->nodes[0]; |
1022 | inode_item = btrfs_item_ptr(leaf, path->slots[0], | |
1023 | struct btrfs_inode_item); | |
1024 | write_extent_buffer(leaf, &node->inode_item, (unsigned long)inode_item, | |
1025 | sizeof(struct btrfs_inode_item)); | |
1026 | btrfs_mark_buffer_dirty(leaf); | |
16cdcec7 | 1027 | |
67de1176 MX |
1028 | if (!test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &node->flags)) |
1029 | goto no_iref; | |
1030 | ||
1031 | path->slots[0]++; | |
1032 | if (path->slots[0] >= btrfs_header_nritems(leaf)) | |
1033 | goto search; | |
1034 | again: | |
1035 | btrfs_item_key_to_cpu(leaf, &key, path->slots[0]); | |
1036 | if (key.objectid != node->inode_id) | |
1037 | goto out; | |
1038 | ||
1039 | if (key.type != BTRFS_INODE_REF_KEY && | |
1040 | key.type != BTRFS_INODE_EXTREF_KEY) | |
1041 | goto out; | |
1042 | ||
1043 | /* | |
1044 | * Delayed iref deletion is for the inode who has only one link, | |
1045 | * so there is only one iref. The case that several irefs are | |
1046 | * in the same item doesn't exist. | |
1047 | */ | |
1048 | btrfs_del_item(trans, root, path); | |
1049 | out: | |
1050 | btrfs_release_delayed_iref(node); | |
1051 | no_iref: | |
1052 | btrfs_release_path(path); | |
1053 | err_out: | |
2ff7e61e | 1054 | btrfs_delayed_inode_release_metadata(fs_info, node); |
16cdcec7 | 1055 | btrfs_release_delayed_inode(node); |
16cdcec7 | 1056 | |
67de1176 MX |
1057 | return ret; |
1058 | ||
1059 | search: | |
1060 | btrfs_release_path(path); | |
1061 | ||
962a298f | 1062 | key.type = BTRFS_INODE_EXTREF_KEY; |
67de1176 MX |
1063 | key.offset = -1; |
1064 | ret = btrfs_search_slot(trans, root, &key, path, -1, 1); | |
1065 | if (ret < 0) | |
1066 | goto err_out; | |
1067 | ASSERT(ret); | |
1068 | ||
1069 | ret = 0; | |
1070 | leaf = path->nodes[0]; | |
1071 | path->slots[0]--; | |
1072 | goto again; | |
16cdcec7 MX |
1073 | } |
1074 | ||
0e8c36a9 MX |
1075 | static inline int btrfs_update_delayed_inode(struct btrfs_trans_handle *trans, |
1076 | struct btrfs_root *root, | |
1077 | struct btrfs_path *path, | |
1078 | struct btrfs_delayed_node *node) | |
1079 | { | |
1080 | int ret; | |
1081 | ||
1082 | mutex_lock(&node->mutex); | |
7cf35d91 | 1083 | if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &node->flags)) { |
0e8c36a9 MX |
1084 | mutex_unlock(&node->mutex); |
1085 | return 0; | |
1086 | } | |
1087 | ||
1088 | ret = __btrfs_update_delayed_inode(trans, root, path, node); | |
1089 | mutex_unlock(&node->mutex); | |
1090 | return ret; | |
1091 | } | |
1092 | ||
4ea41ce0 MX |
1093 | static inline int |
1094 | __btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans, | |
1095 | struct btrfs_path *path, | |
1096 | struct btrfs_delayed_node *node) | |
1097 | { | |
1098 | int ret; | |
1099 | ||
1100 | ret = btrfs_insert_delayed_items(trans, path, node->root, node); | |
1101 | if (ret) | |
1102 | return ret; | |
1103 | ||
1104 | ret = btrfs_delete_delayed_items(trans, path, node->root, node); | |
1105 | if (ret) | |
1106 | return ret; | |
1107 | ||
1108 | ret = btrfs_update_delayed_inode(trans, node->root, path, node); | |
1109 | return ret; | |
1110 | } | |
1111 | ||
79787eaa JM |
1112 | /* |
1113 | * Called when committing the transaction. | |
1114 | * Returns 0 on success. | |
1115 | * Returns < 0 on error and returns with an aborted transaction with any | |
1116 | * outstanding delayed items cleaned up. | |
1117 | */ | |
b84acab3 | 1118 | static int __btrfs_run_delayed_items(struct btrfs_trans_handle *trans, int nr) |
16cdcec7 | 1119 | { |
b84acab3 | 1120 | struct btrfs_fs_info *fs_info = trans->fs_info; |
16cdcec7 MX |
1121 | struct btrfs_delayed_root *delayed_root; |
1122 | struct btrfs_delayed_node *curr_node, *prev_node; | |
1123 | struct btrfs_path *path; | |
19fd2949 | 1124 | struct btrfs_block_rsv *block_rsv; |
16cdcec7 | 1125 | int ret = 0; |
96c3f433 | 1126 | bool count = (nr > 0); |
16cdcec7 | 1127 | |
79787eaa JM |
1128 | if (trans->aborted) |
1129 | return -EIO; | |
1130 | ||
16cdcec7 MX |
1131 | path = btrfs_alloc_path(); |
1132 | if (!path) | |
1133 | return -ENOMEM; | |
1134 | path->leave_spinning = 1; | |
1135 | ||
19fd2949 | 1136 | block_rsv = trans->block_rsv; |
0b246afa | 1137 | trans->block_rsv = &fs_info->delayed_block_rsv; |
19fd2949 | 1138 | |
ccdf9b30 | 1139 | delayed_root = fs_info->delayed_root; |
16cdcec7 MX |
1140 | |
1141 | curr_node = btrfs_first_delayed_node(delayed_root); | |
96c3f433 | 1142 | while (curr_node && (!count || (count && nr--))) { |
4ea41ce0 MX |
1143 | ret = __btrfs_commit_inode_delayed_items(trans, path, |
1144 | curr_node); | |
16cdcec7 MX |
1145 | if (ret) { |
1146 | btrfs_release_delayed_node(curr_node); | |
96c3f433 | 1147 | curr_node = NULL; |
66642832 | 1148 | btrfs_abort_transaction(trans, ret); |
16cdcec7 MX |
1149 | break; |
1150 | } | |
1151 | ||
1152 | prev_node = curr_node; | |
1153 | curr_node = btrfs_next_delayed_node(curr_node); | |
1154 | btrfs_release_delayed_node(prev_node); | |
1155 | } | |
1156 | ||
96c3f433 JB |
1157 | if (curr_node) |
1158 | btrfs_release_delayed_node(curr_node); | |
16cdcec7 | 1159 | btrfs_free_path(path); |
19fd2949 | 1160 | trans->block_rsv = block_rsv; |
79787eaa | 1161 | |
16cdcec7 MX |
1162 | return ret; |
1163 | } | |
1164 | ||
e5c304e6 | 1165 | int btrfs_run_delayed_items(struct btrfs_trans_handle *trans) |
96c3f433 | 1166 | { |
b84acab3 | 1167 | return __btrfs_run_delayed_items(trans, -1); |
96c3f433 JB |
1168 | } |
1169 | ||
e5c304e6 | 1170 | int btrfs_run_delayed_items_nr(struct btrfs_trans_handle *trans, int nr) |
96c3f433 | 1171 | { |
b84acab3 | 1172 | return __btrfs_run_delayed_items(trans, nr); |
96c3f433 JB |
1173 | } |
1174 | ||
16cdcec7 | 1175 | int btrfs_commit_inode_delayed_items(struct btrfs_trans_handle *trans, |
5f4b32e9 | 1176 | struct btrfs_inode *inode) |
16cdcec7 | 1177 | { |
5f4b32e9 | 1178 | struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode); |
4ea41ce0 MX |
1179 | struct btrfs_path *path; |
1180 | struct btrfs_block_rsv *block_rsv; | |
16cdcec7 MX |
1181 | int ret; |
1182 | ||
1183 | if (!delayed_node) | |
1184 | return 0; | |
1185 | ||
1186 | mutex_lock(&delayed_node->mutex); | |
1187 | if (!delayed_node->count) { | |
1188 | mutex_unlock(&delayed_node->mutex); | |
1189 | btrfs_release_delayed_node(delayed_node); | |
1190 | return 0; | |
1191 | } | |
1192 | mutex_unlock(&delayed_node->mutex); | |
1193 | ||
4ea41ce0 | 1194 | path = btrfs_alloc_path(); |
3c77bd94 FDBM |
1195 | if (!path) { |
1196 | btrfs_release_delayed_node(delayed_node); | |
4ea41ce0 | 1197 | return -ENOMEM; |
3c77bd94 | 1198 | } |
4ea41ce0 MX |
1199 | path->leave_spinning = 1; |
1200 | ||
1201 | block_rsv = trans->block_rsv; | |
1202 | trans->block_rsv = &delayed_node->root->fs_info->delayed_block_rsv; | |
1203 | ||
1204 | ret = __btrfs_commit_inode_delayed_items(trans, path, delayed_node); | |
1205 | ||
16cdcec7 | 1206 | btrfs_release_delayed_node(delayed_node); |
4ea41ce0 MX |
1207 | btrfs_free_path(path); |
1208 | trans->block_rsv = block_rsv; | |
1209 | ||
16cdcec7 MX |
1210 | return ret; |
1211 | } | |
1212 | ||
aa79021f | 1213 | int btrfs_commit_inode_delayed_inode(struct btrfs_inode *inode) |
0e8c36a9 | 1214 | { |
aa79021f | 1215 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
0e8c36a9 | 1216 | struct btrfs_trans_handle *trans; |
aa79021f | 1217 | struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode); |
0e8c36a9 MX |
1218 | struct btrfs_path *path; |
1219 | struct btrfs_block_rsv *block_rsv; | |
1220 | int ret; | |
1221 | ||
1222 | if (!delayed_node) | |
1223 | return 0; | |
1224 | ||
1225 | mutex_lock(&delayed_node->mutex); | |
7cf35d91 | 1226 | if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { |
0e8c36a9 MX |
1227 | mutex_unlock(&delayed_node->mutex); |
1228 | btrfs_release_delayed_node(delayed_node); | |
1229 | return 0; | |
1230 | } | |
1231 | mutex_unlock(&delayed_node->mutex); | |
1232 | ||
1233 | trans = btrfs_join_transaction(delayed_node->root); | |
1234 | if (IS_ERR(trans)) { | |
1235 | ret = PTR_ERR(trans); | |
1236 | goto out; | |
1237 | } | |
1238 | ||
1239 | path = btrfs_alloc_path(); | |
1240 | if (!path) { | |
1241 | ret = -ENOMEM; | |
1242 | goto trans_out; | |
1243 | } | |
1244 | path->leave_spinning = 1; | |
1245 | ||
1246 | block_rsv = trans->block_rsv; | |
2ff7e61e | 1247 | trans->block_rsv = &fs_info->delayed_block_rsv; |
0e8c36a9 MX |
1248 | |
1249 | mutex_lock(&delayed_node->mutex); | |
7cf35d91 | 1250 | if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) |
0e8c36a9 MX |
1251 | ret = __btrfs_update_delayed_inode(trans, delayed_node->root, |
1252 | path, delayed_node); | |
1253 | else | |
1254 | ret = 0; | |
1255 | mutex_unlock(&delayed_node->mutex); | |
1256 | ||
1257 | btrfs_free_path(path); | |
1258 | trans->block_rsv = block_rsv; | |
1259 | trans_out: | |
3a45bb20 | 1260 | btrfs_end_transaction(trans); |
2ff7e61e | 1261 | btrfs_btree_balance_dirty(fs_info); |
0e8c36a9 MX |
1262 | out: |
1263 | btrfs_release_delayed_node(delayed_node); | |
1264 | ||
1265 | return ret; | |
1266 | } | |
1267 | ||
f48d1cf5 | 1268 | void btrfs_remove_delayed_node(struct btrfs_inode *inode) |
16cdcec7 MX |
1269 | { |
1270 | struct btrfs_delayed_node *delayed_node; | |
1271 | ||
f48d1cf5 | 1272 | delayed_node = READ_ONCE(inode->delayed_node); |
16cdcec7 MX |
1273 | if (!delayed_node) |
1274 | return; | |
1275 | ||
f48d1cf5 | 1276 | inode->delayed_node = NULL; |
16cdcec7 MX |
1277 | btrfs_release_delayed_node(delayed_node); |
1278 | } | |
1279 | ||
de3cb945 CM |
1280 | struct btrfs_async_delayed_work { |
1281 | struct btrfs_delayed_root *delayed_root; | |
1282 | int nr; | |
d458b054 | 1283 | struct btrfs_work work; |
16cdcec7 MX |
1284 | }; |
1285 | ||
d458b054 | 1286 | static void btrfs_async_run_delayed_root(struct btrfs_work *work) |
16cdcec7 | 1287 | { |
de3cb945 CM |
1288 | struct btrfs_async_delayed_work *async_work; |
1289 | struct btrfs_delayed_root *delayed_root; | |
16cdcec7 MX |
1290 | struct btrfs_trans_handle *trans; |
1291 | struct btrfs_path *path; | |
1292 | struct btrfs_delayed_node *delayed_node = NULL; | |
1293 | struct btrfs_root *root; | |
19fd2949 | 1294 | struct btrfs_block_rsv *block_rsv; |
de3cb945 | 1295 | int total_done = 0; |
16cdcec7 | 1296 | |
de3cb945 CM |
1297 | async_work = container_of(work, struct btrfs_async_delayed_work, work); |
1298 | delayed_root = async_work->delayed_root; | |
16cdcec7 MX |
1299 | |
1300 | path = btrfs_alloc_path(); | |
1301 | if (!path) | |
1302 | goto out; | |
16cdcec7 | 1303 | |
617c54a8 NB |
1304 | do { |
1305 | if (atomic_read(&delayed_root->items) < | |
1306 | BTRFS_DELAYED_BACKGROUND / 2) | |
1307 | break; | |
de3cb945 | 1308 | |
617c54a8 NB |
1309 | delayed_node = btrfs_first_prepared_delayed_node(delayed_root); |
1310 | if (!delayed_node) | |
1311 | break; | |
de3cb945 | 1312 | |
617c54a8 NB |
1313 | path->leave_spinning = 1; |
1314 | root = delayed_node->root; | |
16cdcec7 | 1315 | |
617c54a8 NB |
1316 | trans = btrfs_join_transaction(root); |
1317 | if (IS_ERR(trans)) { | |
1318 | btrfs_release_path(path); | |
1319 | btrfs_release_prepared_delayed_node(delayed_node); | |
1320 | total_done++; | |
1321 | continue; | |
1322 | } | |
16cdcec7 | 1323 | |
617c54a8 NB |
1324 | block_rsv = trans->block_rsv; |
1325 | trans->block_rsv = &root->fs_info->delayed_block_rsv; | |
19fd2949 | 1326 | |
617c54a8 | 1327 | __btrfs_commit_inode_delayed_items(trans, path, delayed_node); |
16cdcec7 | 1328 | |
617c54a8 NB |
1329 | trans->block_rsv = block_rsv; |
1330 | btrfs_end_transaction(trans); | |
1331 | btrfs_btree_balance_dirty_nodelay(root->fs_info); | |
de3cb945 | 1332 | |
617c54a8 NB |
1333 | btrfs_release_path(path); |
1334 | btrfs_release_prepared_delayed_node(delayed_node); | |
1335 | total_done++; | |
de3cb945 | 1336 | |
617c54a8 NB |
1337 | } while ((async_work->nr == 0 && total_done < BTRFS_DELAYED_WRITEBACK) |
1338 | || total_done < async_work->nr); | |
de3cb945 | 1339 | |
16cdcec7 MX |
1340 | btrfs_free_path(path); |
1341 | out: | |
de3cb945 CM |
1342 | wake_up(&delayed_root->wait); |
1343 | kfree(async_work); | |
16cdcec7 MX |
1344 | } |
1345 | ||
de3cb945 | 1346 | |
16cdcec7 | 1347 | static int btrfs_wq_run_delayed_node(struct btrfs_delayed_root *delayed_root, |
a585e948 | 1348 | struct btrfs_fs_info *fs_info, int nr) |
16cdcec7 | 1349 | { |
de3cb945 | 1350 | struct btrfs_async_delayed_work *async_work; |
16cdcec7 | 1351 | |
de3cb945 CM |
1352 | async_work = kmalloc(sizeof(*async_work), GFP_NOFS); |
1353 | if (!async_work) | |
16cdcec7 | 1354 | return -ENOMEM; |
16cdcec7 | 1355 | |
de3cb945 | 1356 | async_work->delayed_root = delayed_root; |
9e0af237 LB |
1357 | btrfs_init_work(&async_work->work, btrfs_delayed_meta_helper, |
1358 | btrfs_async_run_delayed_root, NULL, NULL); | |
de3cb945 | 1359 | async_work->nr = nr; |
16cdcec7 | 1360 | |
a585e948 | 1361 | btrfs_queue_work(fs_info->delayed_workers, &async_work->work); |
16cdcec7 MX |
1362 | return 0; |
1363 | } | |
1364 | ||
ccdf9b30 | 1365 | void btrfs_assert_delayed_root_empty(struct btrfs_fs_info *fs_info) |
e999376f | 1366 | { |
ccdf9b30 | 1367 | WARN_ON(btrfs_first_delayed_node(fs_info->delayed_root)); |
e999376f CM |
1368 | } |
1369 | ||
0353808c | 1370 | static int could_end_wait(struct btrfs_delayed_root *delayed_root, int seq) |
de3cb945 CM |
1371 | { |
1372 | int val = atomic_read(&delayed_root->items_seq); | |
1373 | ||
0353808c | 1374 | if (val < seq || val >= seq + BTRFS_DELAYED_BATCH) |
de3cb945 | 1375 | return 1; |
0353808c MX |
1376 | |
1377 | if (atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) | |
1378 | return 1; | |
1379 | ||
de3cb945 CM |
1380 | return 0; |
1381 | } | |
1382 | ||
2ff7e61e | 1383 | void btrfs_balance_delayed_items(struct btrfs_fs_info *fs_info) |
16cdcec7 | 1384 | { |
2ff7e61e | 1385 | struct btrfs_delayed_root *delayed_root = fs_info->delayed_root; |
16cdcec7 | 1386 | |
8577787f NB |
1387 | if ((atomic_read(&delayed_root->items) < BTRFS_DELAYED_BACKGROUND) || |
1388 | btrfs_workqueue_normal_congested(fs_info->delayed_workers)) | |
16cdcec7 MX |
1389 | return; |
1390 | ||
1391 | if (atomic_read(&delayed_root->items) >= BTRFS_DELAYED_WRITEBACK) { | |
0353808c | 1392 | int seq; |
16cdcec7 | 1393 | int ret; |
0353808c MX |
1394 | |
1395 | seq = atomic_read(&delayed_root->items_seq); | |
de3cb945 | 1396 | |
a585e948 | 1397 | ret = btrfs_wq_run_delayed_node(delayed_root, fs_info, 0); |
16cdcec7 MX |
1398 | if (ret) |
1399 | return; | |
1400 | ||
0353808c MX |
1401 | wait_event_interruptible(delayed_root->wait, |
1402 | could_end_wait(delayed_root, seq)); | |
4dd466d3 | 1403 | return; |
16cdcec7 MX |
1404 | } |
1405 | ||
a585e948 | 1406 | btrfs_wq_run_delayed_node(delayed_root, fs_info, BTRFS_DELAYED_BATCH); |
16cdcec7 MX |
1407 | } |
1408 | ||
79787eaa | 1409 | /* Will return 0 or -ENOMEM */ |
16cdcec7 | 1410 | int btrfs_insert_delayed_dir_index(struct btrfs_trans_handle *trans, |
2ff7e61e JM |
1411 | struct btrfs_fs_info *fs_info, |
1412 | const char *name, int name_len, | |
6f45d185 | 1413 | struct btrfs_inode *dir, |
16cdcec7 MX |
1414 | struct btrfs_disk_key *disk_key, u8 type, |
1415 | u64 index) | |
1416 | { | |
1417 | struct btrfs_delayed_node *delayed_node; | |
1418 | struct btrfs_delayed_item *delayed_item; | |
1419 | struct btrfs_dir_item *dir_item; | |
1420 | int ret; | |
1421 | ||
6f45d185 | 1422 | delayed_node = btrfs_get_or_create_delayed_node(dir); |
16cdcec7 MX |
1423 | if (IS_ERR(delayed_node)) |
1424 | return PTR_ERR(delayed_node); | |
1425 | ||
1426 | delayed_item = btrfs_alloc_delayed_item(sizeof(*dir_item) + name_len); | |
1427 | if (!delayed_item) { | |
1428 | ret = -ENOMEM; | |
1429 | goto release_node; | |
1430 | } | |
1431 | ||
6f45d185 | 1432 | delayed_item->key.objectid = btrfs_ino(dir); |
962a298f | 1433 | delayed_item->key.type = BTRFS_DIR_INDEX_KEY; |
16cdcec7 MX |
1434 | delayed_item->key.offset = index; |
1435 | ||
1436 | dir_item = (struct btrfs_dir_item *)delayed_item->data; | |
1437 | dir_item->location = *disk_key; | |
3cae210f QW |
1438 | btrfs_set_stack_dir_transid(dir_item, trans->transid); |
1439 | btrfs_set_stack_dir_data_len(dir_item, 0); | |
1440 | btrfs_set_stack_dir_name_len(dir_item, name_len); | |
1441 | btrfs_set_stack_dir_type(dir_item, type); | |
16cdcec7 MX |
1442 | memcpy((char *)(dir_item + 1), name, name_len); |
1443 | ||
2ff7e61e | 1444 | ret = btrfs_delayed_item_reserve_metadata(trans, fs_info, delayed_item); |
8c2a3ca2 JB |
1445 | /* |
1446 | * we have reserved enough space when we start a new transaction, | |
1447 | * so reserving metadata failure is impossible | |
1448 | */ | |
1449 | BUG_ON(ret); | |
1450 | ||
1451 | ||
16cdcec7 MX |
1452 | mutex_lock(&delayed_node->mutex); |
1453 | ret = __btrfs_add_delayed_insertion_item(delayed_node, delayed_item); | |
1454 | if (unlikely(ret)) { | |
2ff7e61e | 1455 | btrfs_err(fs_info, |
5d163e0e JM |
1456 | "err add delayed dir index item(name: %.*s) into the insertion tree of the delayed node(root id: %llu, inode id: %llu, errno: %d)", |
1457 | name_len, name, delayed_node->root->objectid, | |
1458 | delayed_node->inode_id, ret); | |
16cdcec7 MX |
1459 | BUG(); |
1460 | } | |
1461 | mutex_unlock(&delayed_node->mutex); | |
1462 | ||
1463 | release_node: | |
1464 | btrfs_release_delayed_node(delayed_node); | |
1465 | return ret; | |
1466 | } | |
1467 | ||
2ff7e61e | 1468 | static int btrfs_delete_delayed_insertion_item(struct btrfs_fs_info *fs_info, |
16cdcec7 MX |
1469 | struct btrfs_delayed_node *node, |
1470 | struct btrfs_key *key) | |
1471 | { | |
1472 | struct btrfs_delayed_item *item; | |
1473 | ||
1474 | mutex_lock(&node->mutex); | |
1475 | item = __btrfs_lookup_delayed_insertion_item(node, key); | |
1476 | if (!item) { | |
1477 | mutex_unlock(&node->mutex); | |
1478 | return 1; | |
1479 | } | |
1480 | ||
2ff7e61e | 1481 | btrfs_delayed_item_release_metadata(fs_info, item); |
16cdcec7 MX |
1482 | btrfs_release_delayed_item(item); |
1483 | mutex_unlock(&node->mutex); | |
1484 | return 0; | |
1485 | } | |
1486 | ||
1487 | int btrfs_delete_delayed_dir_index(struct btrfs_trans_handle *trans, | |
2ff7e61e | 1488 | struct btrfs_fs_info *fs_info, |
e67bbbb9 | 1489 | struct btrfs_inode *dir, u64 index) |
16cdcec7 MX |
1490 | { |
1491 | struct btrfs_delayed_node *node; | |
1492 | struct btrfs_delayed_item *item; | |
1493 | struct btrfs_key item_key; | |
1494 | int ret; | |
1495 | ||
e67bbbb9 | 1496 | node = btrfs_get_or_create_delayed_node(dir); |
16cdcec7 MX |
1497 | if (IS_ERR(node)) |
1498 | return PTR_ERR(node); | |
1499 | ||
e67bbbb9 | 1500 | item_key.objectid = btrfs_ino(dir); |
962a298f | 1501 | item_key.type = BTRFS_DIR_INDEX_KEY; |
16cdcec7 MX |
1502 | item_key.offset = index; |
1503 | ||
2ff7e61e | 1504 | ret = btrfs_delete_delayed_insertion_item(fs_info, node, &item_key); |
16cdcec7 MX |
1505 | if (!ret) |
1506 | goto end; | |
1507 | ||
1508 | item = btrfs_alloc_delayed_item(0); | |
1509 | if (!item) { | |
1510 | ret = -ENOMEM; | |
1511 | goto end; | |
1512 | } | |
1513 | ||
1514 | item->key = item_key; | |
1515 | ||
2ff7e61e | 1516 | ret = btrfs_delayed_item_reserve_metadata(trans, fs_info, item); |
16cdcec7 MX |
1517 | /* |
1518 | * we have reserved enough space when we start a new transaction, | |
1519 | * so reserving metadata failure is impossible. | |
1520 | */ | |
1521 | BUG_ON(ret); | |
1522 | ||
1523 | mutex_lock(&node->mutex); | |
1524 | ret = __btrfs_add_delayed_deletion_item(node, item); | |
1525 | if (unlikely(ret)) { | |
2ff7e61e | 1526 | btrfs_err(fs_info, |
5d163e0e JM |
1527 | "err add delayed dir index item(index: %llu) into the deletion tree of the delayed node(root id: %llu, inode id: %llu, errno: %d)", |
1528 | index, node->root->objectid, node->inode_id, ret); | |
16cdcec7 MX |
1529 | BUG(); |
1530 | } | |
1531 | mutex_unlock(&node->mutex); | |
1532 | end: | |
1533 | btrfs_release_delayed_node(node); | |
1534 | return ret; | |
1535 | } | |
1536 | ||
f5cc7b80 | 1537 | int btrfs_inode_delayed_dir_index_count(struct btrfs_inode *inode) |
16cdcec7 | 1538 | { |
f5cc7b80 | 1539 | struct btrfs_delayed_node *delayed_node = btrfs_get_delayed_node(inode); |
16cdcec7 MX |
1540 | |
1541 | if (!delayed_node) | |
1542 | return -ENOENT; | |
1543 | ||
1544 | /* | |
1545 | * Since we have held i_mutex of this directory, it is impossible that | |
1546 | * a new directory index is added into the delayed node and index_cnt | |
1547 | * is updated now. So we needn't lock the delayed node. | |
1548 | */ | |
2f7e33d4 MX |
1549 | if (!delayed_node->index_cnt) { |
1550 | btrfs_release_delayed_node(delayed_node); | |
16cdcec7 | 1551 | return -EINVAL; |
2f7e33d4 | 1552 | } |
16cdcec7 | 1553 | |
f5cc7b80 | 1554 | inode->index_cnt = delayed_node->index_cnt; |
2f7e33d4 MX |
1555 | btrfs_release_delayed_node(delayed_node); |
1556 | return 0; | |
16cdcec7 MX |
1557 | } |
1558 | ||
02dbfc99 OS |
1559 | bool btrfs_readdir_get_delayed_items(struct inode *inode, |
1560 | struct list_head *ins_list, | |
1561 | struct list_head *del_list) | |
16cdcec7 MX |
1562 | { |
1563 | struct btrfs_delayed_node *delayed_node; | |
1564 | struct btrfs_delayed_item *item; | |
1565 | ||
340c6ca9 | 1566 | delayed_node = btrfs_get_delayed_node(BTRFS_I(inode)); |
16cdcec7 | 1567 | if (!delayed_node) |
02dbfc99 OS |
1568 | return false; |
1569 | ||
1570 | /* | |
1571 | * We can only do one readdir with delayed items at a time because of | |
1572 | * item->readdir_list. | |
1573 | */ | |
1574 | inode_unlock_shared(inode); | |
1575 | inode_lock(inode); | |
16cdcec7 MX |
1576 | |
1577 | mutex_lock(&delayed_node->mutex); | |
1578 | item = __btrfs_first_delayed_insertion_item(delayed_node); | |
1579 | while (item) { | |
089e77e1 | 1580 | refcount_inc(&item->refs); |
16cdcec7 MX |
1581 | list_add_tail(&item->readdir_list, ins_list); |
1582 | item = __btrfs_next_delayed_item(item); | |
1583 | } | |
1584 | ||
1585 | item = __btrfs_first_delayed_deletion_item(delayed_node); | |
1586 | while (item) { | |
089e77e1 | 1587 | refcount_inc(&item->refs); |
16cdcec7 MX |
1588 | list_add_tail(&item->readdir_list, del_list); |
1589 | item = __btrfs_next_delayed_item(item); | |
1590 | } | |
1591 | mutex_unlock(&delayed_node->mutex); | |
1592 | /* | |
1593 | * This delayed node is still cached in the btrfs inode, so refs | |
1594 | * must be > 1 now, and we needn't check it is going to be freed | |
1595 | * or not. | |
1596 | * | |
1597 | * Besides that, this function is used to read dir, we do not | |
1598 | * insert/delete delayed items in this period. So we also needn't | |
1599 | * requeue or dequeue this delayed node. | |
1600 | */ | |
6de5f18e | 1601 | refcount_dec(&delayed_node->refs); |
02dbfc99 OS |
1602 | |
1603 | return true; | |
16cdcec7 MX |
1604 | } |
1605 | ||
02dbfc99 OS |
1606 | void btrfs_readdir_put_delayed_items(struct inode *inode, |
1607 | struct list_head *ins_list, | |
1608 | struct list_head *del_list) | |
16cdcec7 MX |
1609 | { |
1610 | struct btrfs_delayed_item *curr, *next; | |
1611 | ||
1612 | list_for_each_entry_safe(curr, next, ins_list, readdir_list) { | |
1613 | list_del(&curr->readdir_list); | |
089e77e1 | 1614 | if (refcount_dec_and_test(&curr->refs)) |
16cdcec7 MX |
1615 | kfree(curr); |
1616 | } | |
1617 | ||
1618 | list_for_each_entry_safe(curr, next, del_list, readdir_list) { | |
1619 | list_del(&curr->readdir_list); | |
089e77e1 | 1620 | if (refcount_dec_and_test(&curr->refs)) |
16cdcec7 MX |
1621 | kfree(curr); |
1622 | } | |
02dbfc99 OS |
1623 | |
1624 | /* | |
1625 | * The VFS is going to do up_read(), so we need to downgrade back to a | |
1626 | * read lock. | |
1627 | */ | |
1628 | downgrade_write(&inode->i_rwsem); | |
16cdcec7 MX |
1629 | } |
1630 | ||
1631 | int btrfs_should_delete_dir_index(struct list_head *del_list, | |
1632 | u64 index) | |
1633 | { | |
e4fd493c JB |
1634 | struct btrfs_delayed_item *curr; |
1635 | int ret = 0; | |
16cdcec7 | 1636 | |
e4fd493c | 1637 | list_for_each_entry(curr, del_list, readdir_list) { |
16cdcec7 MX |
1638 | if (curr->key.offset > index) |
1639 | break; | |
e4fd493c JB |
1640 | if (curr->key.offset == index) { |
1641 | ret = 1; | |
1642 | break; | |
1643 | } | |
16cdcec7 | 1644 | } |
e4fd493c | 1645 | return ret; |
16cdcec7 MX |
1646 | } |
1647 | ||
1648 | /* | |
1649 | * btrfs_readdir_delayed_dir_index - read dir info stored in the delayed tree | |
1650 | * | |
1651 | */ | |
9cdda8d3 | 1652 | int btrfs_readdir_delayed_dir_index(struct dir_context *ctx, |
d2fbb2b5 | 1653 | struct list_head *ins_list) |
16cdcec7 MX |
1654 | { |
1655 | struct btrfs_dir_item *di; | |
1656 | struct btrfs_delayed_item *curr, *next; | |
1657 | struct btrfs_key location; | |
1658 | char *name; | |
1659 | int name_len; | |
1660 | int over = 0; | |
1661 | unsigned char d_type; | |
1662 | ||
1663 | if (list_empty(ins_list)) | |
1664 | return 0; | |
1665 | ||
1666 | /* | |
1667 | * Changing the data of the delayed item is impossible. So | |
1668 | * we needn't lock them. And we have held i_mutex of the | |
1669 | * directory, nobody can delete any directory indexes now. | |
1670 | */ | |
1671 | list_for_each_entry_safe(curr, next, ins_list, readdir_list) { | |
1672 | list_del(&curr->readdir_list); | |
1673 | ||
9cdda8d3 | 1674 | if (curr->key.offset < ctx->pos) { |
089e77e1 | 1675 | if (refcount_dec_and_test(&curr->refs)) |
16cdcec7 MX |
1676 | kfree(curr); |
1677 | continue; | |
1678 | } | |
1679 | ||
9cdda8d3 | 1680 | ctx->pos = curr->key.offset; |
16cdcec7 MX |
1681 | |
1682 | di = (struct btrfs_dir_item *)curr->data; | |
1683 | name = (char *)(di + 1); | |
3cae210f | 1684 | name_len = btrfs_stack_dir_name_len(di); |
16cdcec7 MX |
1685 | |
1686 | d_type = btrfs_filetype_table[di->type]; | |
1687 | btrfs_disk_key_to_cpu(&location, &di->location); | |
1688 | ||
9cdda8d3 | 1689 | over = !dir_emit(ctx, name, name_len, |
16cdcec7 MX |
1690 | location.objectid, d_type); |
1691 | ||
089e77e1 | 1692 | if (refcount_dec_and_test(&curr->refs)) |
16cdcec7 MX |
1693 | kfree(curr); |
1694 | ||
1695 | if (over) | |
1696 | return 1; | |
42e9cc46 | 1697 | ctx->pos++; |
16cdcec7 MX |
1698 | } |
1699 | return 0; | |
1700 | } | |
1701 | ||
16cdcec7 MX |
1702 | static void fill_stack_inode_item(struct btrfs_trans_handle *trans, |
1703 | struct btrfs_inode_item *inode_item, | |
1704 | struct inode *inode) | |
1705 | { | |
2f2f43d3 EB |
1706 | btrfs_set_stack_inode_uid(inode_item, i_uid_read(inode)); |
1707 | btrfs_set_stack_inode_gid(inode_item, i_gid_read(inode)); | |
16cdcec7 MX |
1708 | btrfs_set_stack_inode_size(inode_item, BTRFS_I(inode)->disk_i_size); |
1709 | btrfs_set_stack_inode_mode(inode_item, inode->i_mode); | |
1710 | btrfs_set_stack_inode_nlink(inode_item, inode->i_nlink); | |
1711 | btrfs_set_stack_inode_nbytes(inode_item, inode_get_bytes(inode)); | |
1712 | btrfs_set_stack_inode_generation(inode_item, | |
1713 | BTRFS_I(inode)->generation); | |
c7f88c4e JL |
1714 | btrfs_set_stack_inode_sequence(inode_item, |
1715 | inode_peek_iversion(inode)); | |
16cdcec7 MX |
1716 | btrfs_set_stack_inode_transid(inode_item, trans->transid); |
1717 | btrfs_set_stack_inode_rdev(inode_item, inode->i_rdev); | |
1718 | btrfs_set_stack_inode_flags(inode_item, BTRFS_I(inode)->flags); | |
ff5714cc | 1719 | btrfs_set_stack_inode_block_group(inode_item, 0); |
16cdcec7 | 1720 | |
a937b979 | 1721 | btrfs_set_stack_timespec_sec(&inode_item->atime, |
16cdcec7 | 1722 | inode->i_atime.tv_sec); |
a937b979 | 1723 | btrfs_set_stack_timespec_nsec(&inode_item->atime, |
16cdcec7 MX |
1724 | inode->i_atime.tv_nsec); |
1725 | ||
a937b979 | 1726 | btrfs_set_stack_timespec_sec(&inode_item->mtime, |
16cdcec7 | 1727 | inode->i_mtime.tv_sec); |
a937b979 | 1728 | btrfs_set_stack_timespec_nsec(&inode_item->mtime, |
16cdcec7 MX |
1729 | inode->i_mtime.tv_nsec); |
1730 | ||
a937b979 | 1731 | btrfs_set_stack_timespec_sec(&inode_item->ctime, |
16cdcec7 | 1732 | inode->i_ctime.tv_sec); |
a937b979 | 1733 | btrfs_set_stack_timespec_nsec(&inode_item->ctime, |
16cdcec7 | 1734 | inode->i_ctime.tv_nsec); |
9cc97d64 | 1735 | |
1736 | btrfs_set_stack_timespec_sec(&inode_item->otime, | |
1737 | BTRFS_I(inode)->i_otime.tv_sec); | |
1738 | btrfs_set_stack_timespec_nsec(&inode_item->otime, | |
1739 | BTRFS_I(inode)->i_otime.tv_nsec); | |
16cdcec7 MX |
1740 | } |
1741 | ||
2f7e33d4 MX |
1742 | int btrfs_fill_inode(struct inode *inode, u32 *rdev) |
1743 | { | |
1744 | struct btrfs_delayed_node *delayed_node; | |
1745 | struct btrfs_inode_item *inode_item; | |
2f7e33d4 | 1746 | |
340c6ca9 | 1747 | delayed_node = btrfs_get_delayed_node(BTRFS_I(inode)); |
2f7e33d4 MX |
1748 | if (!delayed_node) |
1749 | return -ENOENT; | |
1750 | ||
1751 | mutex_lock(&delayed_node->mutex); | |
7cf35d91 | 1752 | if (!test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { |
2f7e33d4 MX |
1753 | mutex_unlock(&delayed_node->mutex); |
1754 | btrfs_release_delayed_node(delayed_node); | |
1755 | return -ENOENT; | |
1756 | } | |
1757 | ||
1758 | inode_item = &delayed_node->inode_item; | |
1759 | ||
2f2f43d3 EB |
1760 | i_uid_write(inode, btrfs_stack_inode_uid(inode_item)); |
1761 | i_gid_write(inode, btrfs_stack_inode_gid(inode_item)); | |
6ef06d27 | 1762 | btrfs_i_size_write(BTRFS_I(inode), btrfs_stack_inode_size(inode_item)); |
2f7e33d4 | 1763 | inode->i_mode = btrfs_stack_inode_mode(inode_item); |
bfe86848 | 1764 | set_nlink(inode, btrfs_stack_inode_nlink(inode_item)); |
2f7e33d4 MX |
1765 | inode_set_bytes(inode, btrfs_stack_inode_nbytes(inode_item)); |
1766 | BTRFS_I(inode)->generation = btrfs_stack_inode_generation(inode_item); | |
6e17d30b YD |
1767 | BTRFS_I(inode)->last_trans = btrfs_stack_inode_transid(inode_item); |
1768 | ||
c7f88c4e JL |
1769 | inode_set_iversion_queried(inode, |
1770 | btrfs_stack_inode_sequence(inode_item)); | |
2f7e33d4 MX |
1771 | inode->i_rdev = 0; |
1772 | *rdev = btrfs_stack_inode_rdev(inode_item); | |
1773 | BTRFS_I(inode)->flags = btrfs_stack_inode_flags(inode_item); | |
1774 | ||
a937b979 DS |
1775 | inode->i_atime.tv_sec = btrfs_stack_timespec_sec(&inode_item->atime); |
1776 | inode->i_atime.tv_nsec = btrfs_stack_timespec_nsec(&inode_item->atime); | |
2f7e33d4 | 1777 | |
a937b979 DS |
1778 | inode->i_mtime.tv_sec = btrfs_stack_timespec_sec(&inode_item->mtime); |
1779 | inode->i_mtime.tv_nsec = btrfs_stack_timespec_nsec(&inode_item->mtime); | |
2f7e33d4 | 1780 | |
a937b979 DS |
1781 | inode->i_ctime.tv_sec = btrfs_stack_timespec_sec(&inode_item->ctime); |
1782 | inode->i_ctime.tv_nsec = btrfs_stack_timespec_nsec(&inode_item->ctime); | |
2f7e33d4 | 1783 | |
9cc97d64 | 1784 | BTRFS_I(inode)->i_otime.tv_sec = |
1785 | btrfs_stack_timespec_sec(&inode_item->otime); | |
1786 | BTRFS_I(inode)->i_otime.tv_nsec = | |
1787 | btrfs_stack_timespec_nsec(&inode_item->otime); | |
1788 | ||
2f7e33d4 MX |
1789 | inode->i_generation = BTRFS_I(inode)->generation; |
1790 | BTRFS_I(inode)->index_cnt = (u64)-1; | |
1791 | ||
1792 | mutex_unlock(&delayed_node->mutex); | |
1793 | btrfs_release_delayed_node(delayed_node); | |
1794 | return 0; | |
1795 | } | |
1796 | ||
16cdcec7 MX |
1797 | int btrfs_delayed_update_inode(struct btrfs_trans_handle *trans, |
1798 | struct btrfs_root *root, struct inode *inode) | |
1799 | { | |
1800 | struct btrfs_delayed_node *delayed_node; | |
aa0467d8 | 1801 | int ret = 0; |
16cdcec7 | 1802 | |
e5517a7b | 1803 | delayed_node = btrfs_get_or_create_delayed_node(BTRFS_I(inode)); |
16cdcec7 MX |
1804 | if (IS_ERR(delayed_node)) |
1805 | return PTR_ERR(delayed_node); | |
1806 | ||
1807 | mutex_lock(&delayed_node->mutex); | |
7cf35d91 | 1808 | if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { |
16cdcec7 MX |
1809 | fill_stack_inode_item(trans, &delayed_node->inode_item, inode); |
1810 | goto release_node; | |
1811 | } | |
1812 | ||
fcabdd1c | 1813 | ret = btrfs_delayed_inode_reserve_metadata(trans, root, BTRFS_I(inode), |
7fd2ae21 | 1814 | delayed_node); |
c06a0e12 JB |
1815 | if (ret) |
1816 | goto release_node; | |
16cdcec7 MX |
1817 | |
1818 | fill_stack_inode_item(trans, &delayed_node->inode_item, inode); | |
7cf35d91 | 1819 | set_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags); |
16cdcec7 MX |
1820 | delayed_node->count++; |
1821 | atomic_inc(&root->fs_info->delayed_root->items); | |
1822 | release_node: | |
1823 | mutex_unlock(&delayed_node->mutex); | |
1824 | btrfs_release_delayed_node(delayed_node); | |
1825 | return ret; | |
1826 | } | |
1827 | ||
e07222c7 | 1828 | int btrfs_delayed_delete_inode_ref(struct btrfs_inode *inode) |
67de1176 | 1829 | { |
e07222c7 | 1830 | struct btrfs_fs_info *fs_info = btrfs_sb(inode->vfs_inode.i_sb); |
67de1176 MX |
1831 | struct btrfs_delayed_node *delayed_node; |
1832 | ||
6f896054 CM |
1833 | /* |
1834 | * we don't do delayed inode updates during log recovery because it | |
1835 | * leads to enospc problems. This means we also can't do | |
1836 | * delayed inode refs | |
1837 | */ | |
0b246afa | 1838 | if (test_bit(BTRFS_FS_LOG_RECOVERING, &fs_info->flags)) |
6f896054 CM |
1839 | return -EAGAIN; |
1840 | ||
e07222c7 | 1841 | delayed_node = btrfs_get_or_create_delayed_node(inode); |
67de1176 MX |
1842 | if (IS_ERR(delayed_node)) |
1843 | return PTR_ERR(delayed_node); | |
1844 | ||
1845 | /* | |
1846 | * We don't reserve space for inode ref deletion is because: | |
1847 | * - We ONLY do async inode ref deletion for the inode who has only | |
1848 | * one link(i_nlink == 1), it means there is only one inode ref. | |
1849 | * And in most case, the inode ref and the inode item are in the | |
1850 | * same leaf, and we will deal with them at the same time. | |
1851 | * Since we are sure we will reserve the space for the inode item, | |
1852 | * it is unnecessary to reserve space for inode ref deletion. | |
1853 | * - If the inode ref and the inode item are not in the same leaf, | |
1854 | * We also needn't worry about enospc problem, because we reserve | |
1855 | * much more space for the inode update than it needs. | |
1856 | * - At the worst, we can steal some space from the global reservation. | |
1857 | * It is very rare. | |
1858 | */ | |
1859 | mutex_lock(&delayed_node->mutex); | |
1860 | if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags)) | |
1861 | goto release_node; | |
1862 | ||
1863 | set_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags); | |
1864 | delayed_node->count++; | |
0b246afa | 1865 | atomic_inc(&fs_info->delayed_root->items); |
67de1176 MX |
1866 | release_node: |
1867 | mutex_unlock(&delayed_node->mutex); | |
1868 | btrfs_release_delayed_node(delayed_node); | |
1869 | return 0; | |
1870 | } | |
1871 | ||
16cdcec7 MX |
1872 | static void __btrfs_kill_delayed_node(struct btrfs_delayed_node *delayed_node) |
1873 | { | |
1874 | struct btrfs_root *root = delayed_node->root; | |
2ff7e61e | 1875 | struct btrfs_fs_info *fs_info = root->fs_info; |
16cdcec7 MX |
1876 | struct btrfs_delayed_item *curr_item, *prev_item; |
1877 | ||
1878 | mutex_lock(&delayed_node->mutex); | |
1879 | curr_item = __btrfs_first_delayed_insertion_item(delayed_node); | |
1880 | while (curr_item) { | |
2ff7e61e | 1881 | btrfs_delayed_item_release_metadata(fs_info, curr_item); |
16cdcec7 MX |
1882 | prev_item = curr_item; |
1883 | curr_item = __btrfs_next_delayed_item(prev_item); | |
1884 | btrfs_release_delayed_item(prev_item); | |
1885 | } | |
1886 | ||
1887 | curr_item = __btrfs_first_delayed_deletion_item(delayed_node); | |
1888 | while (curr_item) { | |
2ff7e61e | 1889 | btrfs_delayed_item_release_metadata(fs_info, curr_item); |
16cdcec7 MX |
1890 | prev_item = curr_item; |
1891 | curr_item = __btrfs_next_delayed_item(prev_item); | |
1892 | btrfs_release_delayed_item(prev_item); | |
1893 | } | |
1894 | ||
67de1176 MX |
1895 | if (test_bit(BTRFS_DELAYED_NODE_DEL_IREF, &delayed_node->flags)) |
1896 | btrfs_release_delayed_iref(delayed_node); | |
1897 | ||
7cf35d91 | 1898 | if (test_bit(BTRFS_DELAYED_NODE_INODE_DIRTY, &delayed_node->flags)) { |
2ff7e61e | 1899 | btrfs_delayed_inode_release_metadata(fs_info, delayed_node); |
16cdcec7 MX |
1900 | btrfs_release_delayed_inode(delayed_node); |
1901 | } | |
1902 | mutex_unlock(&delayed_node->mutex); | |
1903 | } | |
1904 | ||
4ccb5c72 | 1905 | void btrfs_kill_delayed_inode_items(struct btrfs_inode *inode) |
16cdcec7 MX |
1906 | { |
1907 | struct btrfs_delayed_node *delayed_node; | |
1908 | ||
4ccb5c72 | 1909 | delayed_node = btrfs_get_delayed_node(inode); |
16cdcec7 MX |
1910 | if (!delayed_node) |
1911 | return; | |
1912 | ||
1913 | __btrfs_kill_delayed_node(delayed_node); | |
1914 | btrfs_release_delayed_node(delayed_node); | |
1915 | } | |
1916 | ||
1917 | void btrfs_kill_all_delayed_nodes(struct btrfs_root *root) | |
1918 | { | |
1919 | u64 inode_id = 0; | |
1920 | struct btrfs_delayed_node *delayed_nodes[8]; | |
1921 | int i, n; | |
1922 | ||
1923 | while (1) { | |
1924 | spin_lock(&root->inode_lock); | |
1925 | n = radix_tree_gang_lookup(&root->delayed_nodes_tree, | |
1926 | (void **)delayed_nodes, inode_id, | |
1927 | ARRAY_SIZE(delayed_nodes)); | |
1928 | if (!n) { | |
1929 | spin_unlock(&root->inode_lock); | |
1930 | break; | |
1931 | } | |
1932 | ||
1933 | inode_id = delayed_nodes[n - 1]->inode_id + 1; | |
1934 | ||
1935 | for (i = 0; i < n; i++) | |
6de5f18e | 1936 | refcount_inc(&delayed_nodes[i]->refs); |
16cdcec7 MX |
1937 | spin_unlock(&root->inode_lock); |
1938 | ||
1939 | for (i = 0; i < n; i++) { | |
1940 | __btrfs_kill_delayed_node(delayed_nodes[i]); | |
1941 | btrfs_release_delayed_node(delayed_nodes[i]); | |
1942 | } | |
1943 | } | |
1944 | } | |
67cde344 | 1945 | |
ccdf9b30 | 1946 | void btrfs_destroy_delayed_inodes(struct btrfs_fs_info *fs_info) |
67cde344 | 1947 | { |
67cde344 MX |
1948 | struct btrfs_delayed_node *curr_node, *prev_node; |
1949 | ||
ccdf9b30 | 1950 | curr_node = btrfs_first_delayed_node(fs_info->delayed_root); |
67cde344 MX |
1951 | while (curr_node) { |
1952 | __btrfs_kill_delayed_node(curr_node); | |
1953 | ||
1954 | prev_node = curr_node; | |
1955 | curr_node = btrfs_next_delayed_node(curr_node); | |
1956 | btrfs_release_delayed_node(prev_node); | |
1957 | } | |
1958 | } | |
1959 |