btrfs: Factor out common delayed refs init code
[sfrench/cifs-2.6.git] / fs / btrfs / delayed-ref.c
1 // SPDX-License-Identifier: GPL-2.0
2 /*
3  * Copyright (C) 2009 Oracle.  All rights reserved.
4  */
5
6 #include <linux/sched.h>
7 #include <linux/slab.h>
8 #include <linux/sort.h>
9 #include "ctree.h"
10 #include "delayed-ref.h"
11 #include "transaction.h"
12 #include "qgroup.h"
13
14 struct kmem_cache *btrfs_delayed_ref_head_cachep;
15 struct kmem_cache *btrfs_delayed_tree_ref_cachep;
16 struct kmem_cache *btrfs_delayed_data_ref_cachep;
17 struct kmem_cache *btrfs_delayed_extent_op_cachep;
18 /*
19  * delayed back reference update tracking.  For subvolume trees
20  * we queue up extent allocations and backref maintenance for
21  * delayed processing.   This avoids deep call chains where we
22  * add extents in the middle of btrfs_search_slot, and it allows
23  * us to buffer up frequently modified backrefs in an rb tree instead
24  * of hammering updates on the extent allocation tree.
25  */
26
27 /*
28  * compare two delayed tree backrefs with same bytenr and type
29  */
30 static int comp_tree_refs(struct btrfs_delayed_tree_ref *ref1,
31                           struct btrfs_delayed_tree_ref *ref2)
32 {
33         if (ref1->node.type == BTRFS_TREE_BLOCK_REF_KEY) {
34                 if (ref1->root < ref2->root)
35                         return -1;
36                 if (ref1->root > ref2->root)
37                         return 1;
38         } else {
39                 if (ref1->parent < ref2->parent)
40                         return -1;
41                 if (ref1->parent > ref2->parent)
42                         return 1;
43         }
44         return 0;
45 }
46
47 /*
48  * compare two delayed data backrefs with same bytenr and type
49  */
50 static int comp_data_refs(struct btrfs_delayed_data_ref *ref1,
51                           struct btrfs_delayed_data_ref *ref2)
52 {
53         if (ref1->node.type == BTRFS_EXTENT_DATA_REF_KEY) {
54                 if (ref1->root < ref2->root)
55                         return -1;
56                 if (ref1->root > ref2->root)
57                         return 1;
58                 if (ref1->objectid < ref2->objectid)
59                         return -1;
60                 if (ref1->objectid > ref2->objectid)
61                         return 1;
62                 if (ref1->offset < ref2->offset)
63                         return -1;
64                 if (ref1->offset > ref2->offset)
65                         return 1;
66         } else {
67                 if (ref1->parent < ref2->parent)
68                         return -1;
69                 if (ref1->parent > ref2->parent)
70                         return 1;
71         }
72         return 0;
73 }
74
75 static int comp_refs(struct btrfs_delayed_ref_node *ref1,
76                      struct btrfs_delayed_ref_node *ref2,
77                      bool check_seq)
78 {
79         int ret = 0;
80
81         if (ref1->type < ref2->type)
82                 return -1;
83         if (ref1->type > ref2->type)
84                 return 1;
85         if (ref1->type == BTRFS_TREE_BLOCK_REF_KEY ||
86             ref1->type == BTRFS_SHARED_BLOCK_REF_KEY)
87                 ret = comp_tree_refs(btrfs_delayed_node_to_tree_ref(ref1),
88                                      btrfs_delayed_node_to_tree_ref(ref2));
89         else
90                 ret = comp_data_refs(btrfs_delayed_node_to_data_ref(ref1),
91                                      btrfs_delayed_node_to_data_ref(ref2));
92         if (ret)
93                 return ret;
94         if (check_seq) {
95                 if (ref1->seq < ref2->seq)
96                         return -1;
97                 if (ref1->seq > ref2->seq)
98                         return 1;
99         }
100         return 0;
101 }
102
103 /* insert a new ref to head ref rbtree */
104 static struct btrfs_delayed_ref_head *htree_insert(struct rb_root *root,
105                                                    struct rb_node *node)
106 {
107         struct rb_node **p = &root->rb_node;
108         struct rb_node *parent_node = NULL;
109         struct btrfs_delayed_ref_head *entry;
110         struct btrfs_delayed_ref_head *ins;
111         u64 bytenr;
112
113         ins = rb_entry(node, struct btrfs_delayed_ref_head, href_node);
114         bytenr = ins->bytenr;
115         while (*p) {
116                 parent_node = *p;
117                 entry = rb_entry(parent_node, struct btrfs_delayed_ref_head,
118                                  href_node);
119
120                 if (bytenr < entry->bytenr)
121                         p = &(*p)->rb_left;
122                 else if (bytenr > entry->bytenr)
123                         p = &(*p)->rb_right;
124                 else
125                         return entry;
126         }
127
128         rb_link_node(node, parent_node, p);
129         rb_insert_color(node, root);
130         return NULL;
131 }
132
133 static struct btrfs_delayed_ref_node* tree_insert(struct rb_root *root,
134                 struct btrfs_delayed_ref_node *ins)
135 {
136         struct rb_node **p = &root->rb_node;
137         struct rb_node *node = &ins->ref_node;
138         struct rb_node *parent_node = NULL;
139         struct btrfs_delayed_ref_node *entry;
140
141         while (*p) {
142                 int comp;
143
144                 parent_node = *p;
145                 entry = rb_entry(parent_node, struct btrfs_delayed_ref_node,
146                                  ref_node);
147                 comp = comp_refs(ins, entry, true);
148                 if (comp < 0)
149                         p = &(*p)->rb_left;
150                 else if (comp > 0)
151                         p = &(*p)->rb_right;
152                 else
153                         return entry;
154         }
155
156         rb_link_node(node, parent_node, p);
157         rb_insert_color(node, root);
158         return NULL;
159 }
160
161 /*
162  * find an head entry based on bytenr. This returns the delayed ref
163  * head if it was able to find one, or NULL if nothing was in that spot.
164  * If return_bigger is given, the next bigger entry is returned if no exact
165  * match is found.
166  */
167 static struct btrfs_delayed_ref_head *
168 find_ref_head(struct rb_root *root, u64 bytenr,
169               int return_bigger)
170 {
171         struct rb_node *n;
172         struct btrfs_delayed_ref_head *entry;
173
174         n = root->rb_node;
175         entry = NULL;
176         while (n) {
177                 entry = rb_entry(n, struct btrfs_delayed_ref_head, href_node);
178
179                 if (bytenr < entry->bytenr)
180                         n = n->rb_left;
181                 else if (bytenr > entry->bytenr)
182                         n = n->rb_right;
183                 else
184                         return entry;
185         }
186         if (entry && return_bigger) {
187                 if (bytenr > entry->bytenr) {
188                         n = rb_next(&entry->href_node);
189                         if (!n)
190                                 n = rb_first(root);
191                         entry = rb_entry(n, struct btrfs_delayed_ref_head,
192                                          href_node);
193                         return entry;
194                 }
195                 return entry;
196         }
197         return NULL;
198 }
199
200 int btrfs_delayed_ref_lock(struct btrfs_trans_handle *trans,
201                            struct btrfs_delayed_ref_head *head)
202 {
203         struct btrfs_delayed_ref_root *delayed_refs;
204
205         delayed_refs = &trans->transaction->delayed_refs;
206         lockdep_assert_held(&delayed_refs->lock);
207         if (mutex_trylock(&head->mutex))
208                 return 0;
209
210         refcount_inc(&head->refs);
211         spin_unlock(&delayed_refs->lock);
212
213         mutex_lock(&head->mutex);
214         spin_lock(&delayed_refs->lock);
215         if (RB_EMPTY_NODE(&head->href_node)) {
216                 mutex_unlock(&head->mutex);
217                 btrfs_put_delayed_ref_head(head);
218                 return -EAGAIN;
219         }
220         btrfs_put_delayed_ref_head(head);
221         return 0;
222 }
223
224 static inline void drop_delayed_ref(struct btrfs_trans_handle *trans,
225                                     struct btrfs_delayed_ref_root *delayed_refs,
226                                     struct btrfs_delayed_ref_head *head,
227                                     struct btrfs_delayed_ref_node *ref)
228 {
229         lockdep_assert_held(&head->lock);
230         rb_erase(&ref->ref_node, &head->ref_tree);
231         RB_CLEAR_NODE(&ref->ref_node);
232         if (!list_empty(&ref->add_list))
233                 list_del(&ref->add_list);
234         ref->in_tree = 0;
235         btrfs_put_delayed_ref(ref);
236         atomic_dec(&delayed_refs->num_entries);
237         if (trans->delayed_ref_updates)
238                 trans->delayed_ref_updates--;
239 }
240
241 static bool merge_ref(struct btrfs_trans_handle *trans,
242                       struct btrfs_delayed_ref_root *delayed_refs,
243                       struct btrfs_delayed_ref_head *head,
244                       struct btrfs_delayed_ref_node *ref,
245                       u64 seq)
246 {
247         struct btrfs_delayed_ref_node *next;
248         struct rb_node *node = rb_next(&ref->ref_node);
249         bool done = false;
250
251         while (!done && node) {
252                 int mod;
253
254                 next = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);
255                 node = rb_next(node);
256                 if (seq && next->seq >= seq)
257                         break;
258                 if (comp_refs(ref, next, false))
259                         break;
260
261                 if (ref->action == next->action) {
262                         mod = next->ref_mod;
263                 } else {
264                         if (ref->ref_mod < next->ref_mod) {
265                                 swap(ref, next);
266                                 done = true;
267                         }
268                         mod = -next->ref_mod;
269                 }
270
271                 drop_delayed_ref(trans, delayed_refs, head, next);
272                 ref->ref_mod += mod;
273                 if (ref->ref_mod == 0) {
274                         drop_delayed_ref(trans, delayed_refs, head, ref);
275                         done = true;
276                 } else {
277                         /*
278                          * Can't have multiples of the same ref on a tree block.
279                          */
280                         WARN_ON(ref->type == BTRFS_TREE_BLOCK_REF_KEY ||
281                                 ref->type == BTRFS_SHARED_BLOCK_REF_KEY);
282                 }
283         }
284
285         return done;
286 }
287
288 void btrfs_merge_delayed_refs(struct btrfs_trans_handle *trans,
289                               struct btrfs_delayed_ref_root *delayed_refs,
290                               struct btrfs_delayed_ref_head *head)
291 {
292         struct btrfs_fs_info *fs_info = trans->fs_info;
293         struct btrfs_delayed_ref_node *ref;
294         struct rb_node *node;
295         u64 seq = 0;
296
297         lockdep_assert_held(&head->lock);
298
299         if (RB_EMPTY_ROOT(&head->ref_tree))
300                 return;
301
302         /* We don't have too many refs to merge for data. */
303         if (head->is_data)
304                 return;
305
306         spin_lock(&fs_info->tree_mod_seq_lock);
307         if (!list_empty(&fs_info->tree_mod_seq_list)) {
308                 struct seq_list *elem;
309
310                 elem = list_first_entry(&fs_info->tree_mod_seq_list,
311                                         struct seq_list, list);
312                 seq = elem->seq;
313         }
314         spin_unlock(&fs_info->tree_mod_seq_lock);
315
316 again:
317         for (node = rb_first(&head->ref_tree); node; node = rb_next(node)) {
318                 ref = rb_entry(node, struct btrfs_delayed_ref_node, ref_node);
319                 if (seq && ref->seq >= seq)
320                         continue;
321                 if (merge_ref(trans, delayed_refs, head, ref, seq))
322                         goto again;
323         }
324 }
325
326 int btrfs_check_delayed_seq(struct btrfs_fs_info *fs_info, u64 seq)
327 {
328         struct seq_list *elem;
329         int ret = 0;
330
331         spin_lock(&fs_info->tree_mod_seq_lock);
332         if (!list_empty(&fs_info->tree_mod_seq_list)) {
333                 elem = list_first_entry(&fs_info->tree_mod_seq_list,
334                                         struct seq_list, list);
335                 if (seq >= elem->seq) {
336                         btrfs_debug(fs_info,
337                                 "holding back delayed_ref %#x.%x, lowest is %#x.%x",
338                                 (u32)(seq >> 32), (u32)seq,
339                                 (u32)(elem->seq >> 32), (u32)elem->seq);
340                         ret = 1;
341                 }
342         }
343
344         spin_unlock(&fs_info->tree_mod_seq_lock);
345         return ret;
346 }
347
348 struct btrfs_delayed_ref_head *
349 btrfs_select_ref_head(struct btrfs_trans_handle *trans)
350 {
351         struct btrfs_delayed_ref_root *delayed_refs;
352         struct btrfs_delayed_ref_head *head;
353         u64 start;
354         bool loop = false;
355
356         delayed_refs = &trans->transaction->delayed_refs;
357
358 again:
359         start = delayed_refs->run_delayed_start;
360         head = find_ref_head(&delayed_refs->href_root, start, 1);
361         if (!head && !loop) {
362                 delayed_refs->run_delayed_start = 0;
363                 start = 0;
364                 loop = true;
365                 head = find_ref_head(&delayed_refs->href_root, start, 1);
366                 if (!head)
367                         return NULL;
368         } else if (!head && loop) {
369                 return NULL;
370         }
371
372         while (head->processing) {
373                 struct rb_node *node;
374
375                 node = rb_next(&head->href_node);
376                 if (!node) {
377                         if (loop)
378                                 return NULL;
379                         delayed_refs->run_delayed_start = 0;
380                         start = 0;
381                         loop = true;
382                         goto again;
383                 }
384                 head = rb_entry(node, struct btrfs_delayed_ref_head,
385                                 href_node);
386         }
387
388         head->processing = 1;
389         WARN_ON(delayed_refs->num_heads_ready == 0);
390         delayed_refs->num_heads_ready--;
391         delayed_refs->run_delayed_start = head->bytenr +
392                 head->num_bytes;
393         return head;
394 }
395
396 /*
397  * Helper to insert the ref_node to the tail or merge with tail.
398  *
399  * Return 0 for insert.
400  * Return >0 for merge.
401  */
402 static int insert_delayed_ref(struct btrfs_trans_handle *trans,
403                               struct btrfs_delayed_ref_root *root,
404                               struct btrfs_delayed_ref_head *href,
405                               struct btrfs_delayed_ref_node *ref)
406 {
407         struct btrfs_delayed_ref_node *exist;
408         int mod;
409         int ret = 0;
410
411         spin_lock(&href->lock);
412         exist = tree_insert(&href->ref_tree, ref);
413         if (!exist)
414                 goto inserted;
415
416         /* Now we are sure we can merge */
417         ret = 1;
418         if (exist->action == ref->action) {
419                 mod = ref->ref_mod;
420         } else {
421                 /* Need to change action */
422                 if (exist->ref_mod < ref->ref_mod) {
423                         exist->action = ref->action;
424                         mod = -exist->ref_mod;
425                         exist->ref_mod = ref->ref_mod;
426                         if (ref->action == BTRFS_ADD_DELAYED_REF)
427                                 list_add_tail(&exist->add_list,
428                                               &href->ref_add_list);
429                         else if (ref->action == BTRFS_DROP_DELAYED_REF) {
430                                 ASSERT(!list_empty(&exist->add_list));
431                                 list_del(&exist->add_list);
432                         } else {
433                                 ASSERT(0);
434                         }
435                 } else
436                         mod = -ref->ref_mod;
437         }
438         exist->ref_mod += mod;
439
440         /* remove existing tail if its ref_mod is zero */
441         if (exist->ref_mod == 0)
442                 drop_delayed_ref(trans, root, href, exist);
443         spin_unlock(&href->lock);
444         return ret;
445 inserted:
446         if (ref->action == BTRFS_ADD_DELAYED_REF)
447                 list_add_tail(&ref->add_list, &href->ref_add_list);
448         atomic_inc(&root->num_entries);
449         trans->delayed_ref_updates++;
450         spin_unlock(&href->lock);
451         return ret;
452 }
453
454 /*
455  * helper function to update the accounting in the head ref
456  * existing and update must have the same bytenr
457  */
458 static noinline void
459 update_existing_head_ref(struct btrfs_delayed_ref_root *delayed_refs,
460                          struct btrfs_delayed_ref_head *existing,
461                          struct btrfs_delayed_ref_head *update,
462                          int *old_ref_mod_ret)
463 {
464         int old_ref_mod;
465
466         BUG_ON(existing->is_data != update->is_data);
467
468         spin_lock(&existing->lock);
469         if (update->must_insert_reserved) {
470                 /* if the extent was freed and then
471                  * reallocated before the delayed ref
472                  * entries were processed, we can end up
473                  * with an existing head ref without
474                  * the must_insert_reserved flag set.
475                  * Set it again here
476                  */
477                 existing->must_insert_reserved = update->must_insert_reserved;
478
479                 /*
480                  * update the num_bytes so we make sure the accounting
481                  * is done correctly
482                  */
483                 existing->num_bytes = update->num_bytes;
484
485         }
486
487         if (update->extent_op) {
488                 if (!existing->extent_op) {
489                         existing->extent_op = update->extent_op;
490                 } else {
491                         if (update->extent_op->update_key) {
492                                 memcpy(&existing->extent_op->key,
493                                        &update->extent_op->key,
494                                        sizeof(update->extent_op->key));
495                                 existing->extent_op->update_key = true;
496                         }
497                         if (update->extent_op->update_flags) {
498                                 existing->extent_op->flags_to_set |=
499                                         update->extent_op->flags_to_set;
500                                 existing->extent_op->update_flags = true;
501                         }
502                         btrfs_free_delayed_extent_op(update->extent_op);
503                 }
504         }
505         /*
506          * update the reference mod on the head to reflect this new operation,
507          * only need the lock for this case cause we could be processing it
508          * currently, for refs we just added we know we're a-ok.
509          */
510         old_ref_mod = existing->total_ref_mod;
511         if (old_ref_mod_ret)
512                 *old_ref_mod_ret = old_ref_mod;
513         existing->ref_mod += update->ref_mod;
514         existing->total_ref_mod += update->ref_mod;
515
516         /*
517          * If we are going to from a positive ref mod to a negative or vice
518          * versa we need to make sure to adjust pending_csums accordingly.
519          */
520         if (existing->is_data) {
521                 if (existing->total_ref_mod >= 0 && old_ref_mod < 0)
522                         delayed_refs->pending_csums -= existing->num_bytes;
523                 if (existing->total_ref_mod < 0 && old_ref_mod >= 0)
524                         delayed_refs->pending_csums += existing->num_bytes;
525         }
526         spin_unlock(&existing->lock);
527 }
528
529 /*
530  * helper function to actually insert a head node into the rbtree.
531  * this does all the dirty work in terms of maintaining the correct
532  * overall modification count.
533  */
534 static noinline struct btrfs_delayed_ref_head *
535 add_delayed_ref_head(struct btrfs_trans_handle *trans,
536                      struct btrfs_delayed_ref_head *head_ref,
537                      struct btrfs_qgroup_extent_record *qrecord,
538                      u64 bytenr, u64 num_bytes, u64 ref_root, u64 reserved,
539                      int action, int is_data, int is_system,
540                      int *qrecord_inserted_ret,
541                      int *old_ref_mod, int *new_ref_mod)
542
543 {
544         struct btrfs_delayed_ref_head *existing;
545         struct btrfs_delayed_ref_root *delayed_refs;
546         int count_mod = 1;
547         int must_insert_reserved = 0;
548         int qrecord_inserted = 0;
549
550         /* If reserved is provided, it must be a data extent. */
551         BUG_ON(!is_data && reserved);
552
553         /*
554          * the head node stores the sum of all the mods, so dropping a ref
555          * should drop the sum in the head node by one.
556          */
557         if (action == BTRFS_UPDATE_DELAYED_HEAD)
558                 count_mod = 0;
559         else if (action == BTRFS_DROP_DELAYED_REF)
560                 count_mod = -1;
561
562         /*
563          * BTRFS_ADD_DELAYED_EXTENT means that we need to update
564          * the reserved accounting when the extent is finally added, or
565          * if a later modification deletes the delayed ref without ever
566          * inserting the extent into the extent allocation tree.
567          * ref->must_insert_reserved is the flag used to record
568          * that accounting mods are required.
569          *
570          * Once we record must_insert_reserved, switch the action to
571          * BTRFS_ADD_DELAYED_REF because other special casing is not required.
572          */
573         if (action == BTRFS_ADD_DELAYED_EXTENT)
574                 must_insert_reserved = 1;
575         else
576                 must_insert_reserved = 0;
577
578         delayed_refs = &trans->transaction->delayed_refs;
579
580         refcount_set(&head_ref->refs, 1);
581         head_ref->bytenr = bytenr;
582         head_ref->num_bytes = num_bytes;
583         head_ref->ref_mod = count_mod;
584         head_ref->must_insert_reserved = must_insert_reserved;
585         head_ref->is_data = is_data;
586         head_ref->is_system = is_system;
587         head_ref->ref_tree = RB_ROOT;
588         INIT_LIST_HEAD(&head_ref->ref_add_list);
589         RB_CLEAR_NODE(&head_ref->href_node);
590         head_ref->processing = 0;
591         head_ref->total_ref_mod = count_mod;
592         head_ref->qgroup_reserved = 0;
593         head_ref->qgroup_ref_root = 0;
594         spin_lock_init(&head_ref->lock);
595         mutex_init(&head_ref->mutex);
596
597         /* Record qgroup extent info if provided */
598         if (qrecord) {
599                 if (ref_root && reserved) {
600                         head_ref->qgroup_ref_root = ref_root;
601                         head_ref->qgroup_reserved = reserved;
602                 }
603
604                 qrecord->bytenr = bytenr;
605                 qrecord->num_bytes = num_bytes;
606                 qrecord->old_roots = NULL;
607
608                 if(btrfs_qgroup_trace_extent_nolock(trans->fs_info,
609                                         delayed_refs, qrecord))
610                         kfree(qrecord);
611                 else
612                         qrecord_inserted = 1;
613         }
614
615         trace_add_delayed_ref_head(trans->fs_info, head_ref, action);
616
617         existing = htree_insert(&delayed_refs->href_root,
618                                 &head_ref->href_node);
619         if (existing) {
620                 WARN_ON(ref_root && reserved && existing->qgroup_ref_root
621                         && existing->qgroup_reserved);
622                 update_existing_head_ref(delayed_refs, existing, head_ref,
623                                          old_ref_mod);
624                 /*
625                  * we've updated the existing ref, free the newly
626                  * allocated ref
627                  */
628                 kmem_cache_free(btrfs_delayed_ref_head_cachep, head_ref);
629                 head_ref = existing;
630         } else {
631                 if (old_ref_mod)
632                         *old_ref_mod = 0;
633                 if (is_data && count_mod < 0)
634                         delayed_refs->pending_csums += num_bytes;
635                 delayed_refs->num_heads++;
636                 delayed_refs->num_heads_ready++;
637                 atomic_inc(&delayed_refs->num_entries);
638                 trans->delayed_ref_updates++;
639         }
640         if (qrecord_inserted_ret)
641                 *qrecord_inserted_ret = qrecord_inserted;
642         if (new_ref_mod)
643                 *new_ref_mod = head_ref->total_ref_mod;
644         return head_ref;
645 }
646
647 /*
648  * init_delayed_ref_common - Initialize the structure which represents a
649  *                           modification to a an extent.
650  *
651  * @fs_info:    Internal to the mounted filesystem mount structure.
652  *
653  * @ref:        The structure which is going to be initialized.
654  *
655  * @bytenr:     The logical address of the extent for which a modification is
656  *              going to be recorded.
657  *
658  * @num_bytes:  Size of the extent whose modification is being recorded.
659  *
660  * @ref_root:   The id of the root where this modification has originated, this
661  *              can be either one of the well-known metadata trees or the
662  *              subvolume id which references this extent.
663  *
664  * @action:     Can be one of BTRFS_ADD_DELAYED_REF/BTRFS_DROP_DELAYED_REF or
665  *              BTRFS_ADD_DELAYED_EXTENT
666  *
667  * @ref_type:   Holds the type of the extent which is being recorded, can be
668  *              one of BTRFS_SHARED_BLOCK_REF_KEY/BTRFS_TREE_BLOCK_REF_KEY
669  *              when recording a metadata extent or BTRFS_SHARED_DATA_REF_KEY/
670  *              BTRFS_EXTENT_DATA_REF_KEY when recording data extent
671  */
672 static void init_delayed_ref_common(struct btrfs_fs_info *fs_info,
673                                     struct btrfs_delayed_ref_node *ref,
674                                     u64 bytenr, u64 num_bytes, u64 ref_root,
675                                     int action, u8 ref_type)
676 {
677         u64 seq = 0;
678
679         if (action == BTRFS_ADD_DELAYED_EXTENT)
680                 action = BTRFS_ADD_DELAYED_REF;
681
682         if (is_fstree(ref_root))
683                 seq = atomic64_read(&fs_info->tree_mod_seq);
684
685         refcount_set(&ref->refs, 1);
686         ref->bytenr = bytenr;
687         ref->num_bytes = num_bytes;
688         ref->ref_mod = 1;
689         ref->action = action;
690         ref->is_head = 0;
691         ref->in_tree = 1;
692         ref->seq = seq;
693         ref->type = ref_type;
694         RB_CLEAR_NODE(&ref->ref_node);
695         INIT_LIST_HEAD(&ref->add_list);
696 }
697
698 /*
699  * helper to insert a delayed tree ref into the rbtree.
700  */
701 static noinline void
702 add_delayed_tree_ref(struct btrfs_fs_info *fs_info,
703                      struct btrfs_trans_handle *trans,
704                      struct btrfs_delayed_ref_head *head_ref,
705                      struct btrfs_delayed_ref_node *ref, u64 bytenr,
706                      u64 num_bytes, u64 parent, u64 ref_root, int level,
707                      int action)
708 {
709         struct btrfs_delayed_tree_ref *full_ref;
710         struct btrfs_delayed_ref_root *delayed_refs;
711         u64 seq = 0;
712         int ret;
713
714         if (action == BTRFS_ADD_DELAYED_EXTENT)
715                 action = BTRFS_ADD_DELAYED_REF;
716
717         if (is_fstree(ref_root))
718                 seq = atomic64_read(&fs_info->tree_mod_seq);
719         delayed_refs = &trans->transaction->delayed_refs;
720
721         /* first set the basic ref node struct up */
722         refcount_set(&ref->refs, 1);
723         ref->bytenr = bytenr;
724         ref->num_bytes = num_bytes;
725         ref->ref_mod = 1;
726         ref->action = action;
727         ref->is_head = 0;
728         ref->in_tree = 1;
729         ref->seq = seq;
730         RB_CLEAR_NODE(&ref->ref_node);
731         INIT_LIST_HEAD(&ref->add_list);
732
733         full_ref = btrfs_delayed_node_to_tree_ref(ref);
734         full_ref->parent = parent;
735         full_ref->root = ref_root;
736         if (parent)
737                 ref->type = BTRFS_SHARED_BLOCK_REF_KEY;
738         else
739                 ref->type = BTRFS_TREE_BLOCK_REF_KEY;
740         full_ref->level = level;
741
742         trace_add_delayed_tree_ref(fs_info, ref, full_ref, action);
743
744         ret = insert_delayed_ref(trans, delayed_refs, head_ref, ref);
745
746         /*
747          * XXX: memory should be freed at the same level allocated.
748          * But bad practice is anywhere... Follow it now. Need cleanup.
749          */
750         if (ret > 0)
751                 kmem_cache_free(btrfs_delayed_tree_ref_cachep, full_ref);
752 }
753
754 /*
755  * helper to insert a delayed data ref into the rbtree.
756  */
757 static noinline void
758 add_delayed_data_ref(struct btrfs_trans_handle *trans,
759                      struct btrfs_delayed_ref_head *head_ref,
760                      struct btrfs_delayed_ref_node *ref, u64 bytenr,
761                      u64 num_bytes, u64 parent, u64 ref_root, u64 owner,
762                      u64 offset, int action)
763 {
764         struct btrfs_delayed_data_ref *full_ref;
765         struct btrfs_delayed_ref_root *delayed_refs;
766         u64 seq = 0;
767         int ret;
768
769         if (action == BTRFS_ADD_DELAYED_EXTENT)
770                 action = BTRFS_ADD_DELAYED_REF;
771
772         delayed_refs = &trans->transaction->delayed_refs;
773
774         if (is_fstree(ref_root))
775                 seq = atomic64_read(&trans->fs_info->tree_mod_seq);
776
777         /* first set the basic ref node struct up */
778         refcount_set(&ref->refs, 1);
779         ref->bytenr = bytenr;
780         ref->num_bytes = num_bytes;
781         ref->ref_mod = 1;
782         ref->action = action;
783         ref->is_head = 0;
784         ref->in_tree = 1;
785         ref->seq = seq;
786         RB_CLEAR_NODE(&ref->ref_node);
787         INIT_LIST_HEAD(&ref->add_list);
788
789         full_ref = btrfs_delayed_node_to_data_ref(ref);
790         full_ref->parent = parent;
791         full_ref->root = ref_root;
792         if (parent)
793                 ref->type = BTRFS_SHARED_DATA_REF_KEY;
794         else
795                 ref->type = BTRFS_EXTENT_DATA_REF_KEY;
796
797         full_ref->objectid = owner;
798         full_ref->offset = offset;
799
800         trace_add_delayed_data_ref(trans->fs_info, ref, full_ref, action);
801
802         ret = insert_delayed_ref(trans, delayed_refs, head_ref, ref);
803         if (ret > 0)
804                 kmem_cache_free(btrfs_delayed_data_ref_cachep, full_ref);
805 }
806
807 /*
808  * add a delayed tree ref.  This does all of the accounting required
809  * to make sure the delayed ref is eventually processed before this
810  * transaction commits.
811  */
812 int btrfs_add_delayed_tree_ref(struct btrfs_fs_info *fs_info,
813                                struct btrfs_trans_handle *trans,
814                                u64 bytenr, u64 num_bytes, u64 parent,
815                                u64 ref_root,  int level, int action,
816                                struct btrfs_delayed_extent_op *extent_op,
817                                int *old_ref_mod, int *new_ref_mod)
818 {
819         struct btrfs_delayed_tree_ref *ref;
820         struct btrfs_delayed_ref_head *head_ref;
821         struct btrfs_delayed_ref_root *delayed_refs;
822         struct btrfs_qgroup_extent_record *record = NULL;
823         int qrecord_inserted;
824         int is_system = (ref_root == BTRFS_CHUNK_TREE_OBJECTID);
825
826         BUG_ON(extent_op && extent_op->is_data);
827         ref = kmem_cache_alloc(btrfs_delayed_tree_ref_cachep, GFP_NOFS);
828         if (!ref)
829                 return -ENOMEM;
830
831         head_ref = kmem_cache_alloc(btrfs_delayed_ref_head_cachep, GFP_NOFS);
832         if (!head_ref)
833                 goto free_ref;
834
835         if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) &&
836             is_fstree(ref_root)) {
837                 record = kmalloc(sizeof(*record), GFP_NOFS);
838                 if (!record)
839                         goto free_head_ref;
840         }
841
842         head_ref->extent_op = extent_op;
843
844         delayed_refs = &trans->transaction->delayed_refs;
845         spin_lock(&delayed_refs->lock);
846
847         /*
848          * insert both the head node and the new ref without dropping
849          * the spin lock
850          */
851         head_ref = add_delayed_ref_head(trans, head_ref, record, bytenr,
852                                         num_bytes, 0, 0, action, 0,
853                                         is_system, &qrecord_inserted,
854                                         old_ref_mod, new_ref_mod);
855
856         add_delayed_tree_ref(fs_info, trans, head_ref, &ref->node, bytenr,
857                              num_bytes, parent, ref_root, level, action);
858         spin_unlock(&delayed_refs->lock);
859
860         if (qrecord_inserted)
861                 btrfs_qgroup_trace_extent_post(fs_info, record);
862
863         return 0;
864
865 free_head_ref:
866         kmem_cache_free(btrfs_delayed_ref_head_cachep, head_ref);
867 free_ref:
868         kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);
869
870         return -ENOMEM;
871 }
872
873 /*
874  * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.
875  */
876 int btrfs_add_delayed_data_ref(struct btrfs_fs_info *fs_info,
877                                struct btrfs_trans_handle *trans,
878                                u64 bytenr, u64 num_bytes,
879                                u64 parent, u64 ref_root,
880                                u64 owner, u64 offset, u64 reserved, int action,
881                                int *old_ref_mod, int *new_ref_mod)
882 {
883         struct btrfs_delayed_data_ref *ref;
884         struct btrfs_delayed_ref_head *head_ref;
885         struct btrfs_delayed_ref_root *delayed_refs;
886         struct btrfs_qgroup_extent_record *record = NULL;
887         int qrecord_inserted;
888
889         ref = kmem_cache_alloc(btrfs_delayed_data_ref_cachep, GFP_NOFS);
890         if (!ref)
891                 return -ENOMEM;
892
893         head_ref = kmem_cache_alloc(btrfs_delayed_ref_head_cachep, GFP_NOFS);
894         if (!head_ref) {
895                 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);
896                 return -ENOMEM;
897         }
898
899         if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) &&
900             is_fstree(ref_root)) {
901                 record = kmalloc(sizeof(*record), GFP_NOFS);
902                 if (!record) {
903                         kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);
904                         kmem_cache_free(btrfs_delayed_ref_head_cachep,
905                                         head_ref);
906                         return -ENOMEM;
907                 }
908         }
909
910         head_ref->extent_op = NULL;
911
912         delayed_refs = &trans->transaction->delayed_refs;
913         spin_lock(&delayed_refs->lock);
914
915         /*
916          * insert both the head node and the new ref without dropping
917          * the spin lock
918          */
919         head_ref = add_delayed_ref_head(trans, head_ref, record, bytenr,
920                                         num_bytes, ref_root, reserved,
921                                         action, 1, 0, &qrecord_inserted,
922                                         old_ref_mod, new_ref_mod);
923
924         add_delayed_data_ref(trans, head_ref, &ref->node, bytenr, num_bytes,
925                              parent, ref_root, owner, offset, action);
926         spin_unlock(&delayed_refs->lock);
927
928         if (qrecord_inserted)
929                 return btrfs_qgroup_trace_extent_post(fs_info, record);
930         return 0;
931 }
932
933 int btrfs_add_delayed_extent_op(struct btrfs_fs_info *fs_info,
934                                 struct btrfs_trans_handle *trans,
935                                 u64 bytenr, u64 num_bytes,
936                                 struct btrfs_delayed_extent_op *extent_op)
937 {
938         struct btrfs_delayed_ref_head *head_ref;
939         struct btrfs_delayed_ref_root *delayed_refs;
940
941         head_ref = kmem_cache_alloc(btrfs_delayed_ref_head_cachep, GFP_NOFS);
942         if (!head_ref)
943                 return -ENOMEM;
944
945         head_ref->extent_op = extent_op;
946
947         delayed_refs = &trans->transaction->delayed_refs;
948         spin_lock(&delayed_refs->lock);
949
950         /*
951          * extent_ops just modify the flags of an extent and they don't result
952          * in ref count changes, hence it's safe to pass false/0 for is_system
953          * argument
954          */
955         add_delayed_ref_head(trans, head_ref, NULL, bytenr, num_bytes, 0, 0,
956                              BTRFS_UPDATE_DELAYED_HEAD, extent_op->is_data,
957                              0, NULL, NULL, NULL);
958
959         spin_unlock(&delayed_refs->lock);
960         return 0;
961 }
962
963 /*
964  * this does a simple search for the head node for a given extent.
965  * It must be called with the delayed ref spinlock held, and it returns
966  * the head node if any where found, or NULL if not.
967  */
968 struct btrfs_delayed_ref_head *
969 btrfs_find_delayed_ref_head(struct btrfs_delayed_ref_root *delayed_refs, u64 bytenr)
970 {
971         return find_ref_head(&delayed_refs->href_root, bytenr, 0);
972 }
973
974 void __cold btrfs_delayed_ref_exit(void)
975 {
976         kmem_cache_destroy(btrfs_delayed_ref_head_cachep);
977         kmem_cache_destroy(btrfs_delayed_tree_ref_cachep);
978         kmem_cache_destroy(btrfs_delayed_data_ref_cachep);
979         kmem_cache_destroy(btrfs_delayed_extent_op_cachep);
980 }
981
982 int __init btrfs_delayed_ref_init(void)
983 {
984         btrfs_delayed_ref_head_cachep = kmem_cache_create(
985                                 "btrfs_delayed_ref_head",
986                                 sizeof(struct btrfs_delayed_ref_head), 0,
987                                 SLAB_MEM_SPREAD, NULL);
988         if (!btrfs_delayed_ref_head_cachep)
989                 goto fail;
990
991         btrfs_delayed_tree_ref_cachep = kmem_cache_create(
992                                 "btrfs_delayed_tree_ref",
993                                 sizeof(struct btrfs_delayed_tree_ref), 0,
994                                 SLAB_MEM_SPREAD, NULL);
995         if (!btrfs_delayed_tree_ref_cachep)
996                 goto fail;
997
998         btrfs_delayed_data_ref_cachep = kmem_cache_create(
999                                 "btrfs_delayed_data_ref",
1000                                 sizeof(struct btrfs_delayed_data_ref), 0,
1001                                 SLAB_MEM_SPREAD, NULL);
1002         if (!btrfs_delayed_data_ref_cachep)
1003                 goto fail;
1004
1005         btrfs_delayed_extent_op_cachep = kmem_cache_create(
1006                                 "btrfs_delayed_extent_op",
1007                                 sizeof(struct btrfs_delayed_extent_op), 0,
1008                                 SLAB_MEM_SPREAD, NULL);
1009         if (!btrfs_delayed_extent_op_cachep)
1010                 goto fail;
1011
1012         return 0;
1013 fail:
1014         btrfs_delayed_ref_exit();
1015         return -ENOMEM;
1016 }