blob: ac3e81da6d4edc8e33856840349cc88750771546 [file] [log] [blame]
Chris Mason56bec292009-03-13 10:10:06 -04001/*
2 * Copyright (C) 2009 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
18
19#include <linux/sched.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090020#include <linux/slab.h>
Chris Mason56bec292009-03-13 10:10:06 -040021#include <linux/sort.h>
Chris Mason56bec292009-03-13 10:10:06 -040022#include "ctree.h"
23#include "delayed-ref.h"
24#include "transaction.h"
Qu Wenruo3368d002015-04-16 14:34:17 +080025#include "qgroup.h"
Chris Mason56bec292009-03-13 10:10:06 -040026
Miao Xie78a61842012-11-21 02:21:28 +000027struct kmem_cache *btrfs_delayed_ref_head_cachep;
28struct kmem_cache *btrfs_delayed_tree_ref_cachep;
29struct kmem_cache *btrfs_delayed_data_ref_cachep;
30struct kmem_cache *btrfs_delayed_extent_op_cachep;
Chris Mason56bec292009-03-13 10:10:06 -040031/*
32 * delayed back reference update tracking. For subvolume trees
33 * we queue up extent allocations and backref maintenance for
34 * delayed processing. This avoids deep call chains where we
35 * add extents in the middle of btrfs_search_slot, and it allows
36 * us to buffer up frequently modified backrefs in an rb tree instead
37 * of hammering updates on the extent allocation tree.
Chris Mason56bec292009-03-13 10:10:06 -040038 */
39
40/*
Yan Zheng5d4f98a2009-06-10 10:45:14 -040041 * compare two delayed tree backrefs with same bytenr and type
Chris Mason56bec292009-03-13 10:10:06 -040042 */
Yan Zheng5d4f98a2009-06-10 10:45:14 -040043static int comp_tree_refs(struct btrfs_delayed_tree_ref *ref2,
Josef Bacik41b0fc42013-04-01 20:36:28 -040044 struct btrfs_delayed_tree_ref *ref1, int type)
Chris Mason56bec292009-03-13 10:10:06 -040045{
Josef Bacik41b0fc42013-04-01 20:36:28 -040046 if (type == BTRFS_TREE_BLOCK_REF_KEY) {
47 if (ref1->root < ref2->root)
48 return -1;
49 if (ref1->root > ref2->root)
50 return 1;
51 } else {
52 if (ref1->parent < ref2->parent)
53 return -1;
54 if (ref1->parent > ref2->parent)
55 return 1;
56 }
Yan Zheng5d4f98a2009-06-10 10:45:14 -040057 return 0;
58}
59
60/*
61 * compare two delayed data backrefs with same bytenr and type
62 */
63static int comp_data_refs(struct btrfs_delayed_data_ref *ref2,
64 struct btrfs_delayed_data_ref *ref1)
65{
66 if (ref1->node.type == BTRFS_EXTENT_DATA_REF_KEY) {
67 if (ref1->root < ref2->root)
68 return -1;
69 if (ref1->root > ref2->root)
70 return 1;
71 if (ref1->objectid < ref2->objectid)
72 return -1;
73 if (ref1->objectid > ref2->objectid)
74 return 1;
75 if (ref1->offset < ref2->offset)
76 return -1;
77 if (ref1->offset > ref2->offset)
78 return 1;
79 } else {
80 if (ref1->parent < ref2->parent)
81 return -1;
82 if (ref1->parent > ref2->parent)
83 return 1;
84 }
85 return 0;
86}
87
Liu Boc46effa2013-10-14 12:59:45 +080088/* insert a new ref to head ref rbtree */
89static struct btrfs_delayed_ref_head *htree_insert(struct rb_root *root,
90 struct rb_node *node)
91{
92 struct rb_node **p = &root->rb_node;
93 struct rb_node *parent_node = NULL;
94 struct btrfs_delayed_ref_head *entry;
95 struct btrfs_delayed_ref_head *ins;
96 u64 bytenr;
97
98 ins = rb_entry(node, struct btrfs_delayed_ref_head, href_node);
99 bytenr = ins->node.bytenr;
100 while (*p) {
101 parent_node = *p;
102 entry = rb_entry(parent_node, struct btrfs_delayed_ref_head,
103 href_node);
104
105 if (bytenr < entry->node.bytenr)
106 p = &(*p)->rb_left;
107 else if (bytenr > entry->node.bytenr)
108 p = &(*p)->rb_right;
109 else
110 return entry;
111 }
112
113 rb_link_node(node, parent_node, p);
114 rb_insert_color(node, root);
115 return NULL;
116}
117
Chris Mason56bec292009-03-13 10:10:06 -0400118/*
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400119 * find an head entry based on bytenr. This returns the delayed ref
Arne Jansend1270cd2011-09-13 15:16:43 +0200120 * head if it was able to find one, or NULL if nothing was in that spot.
121 * If return_bigger is given, the next bigger entry is returned if no exact
122 * match is found.
Chris Mason56bec292009-03-13 10:10:06 -0400123 */
Liu Boc46effa2013-10-14 12:59:45 +0800124static struct btrfs_delayed_ref_head *
125find_ref_head(struct rb_root *root, u64 bytenr,
Filipe Manana85fdfdf2014-02-12 15:07:53 +0000126 int return_bigger)
Chris Mason56bec292009-03-13 10:10:06 -0400127{
Arne Jansend1270cd2011-09-13 15:16:43 +0200128 struct rb_node *n;
Liu Boc46effa2013-10-14 12:59:45 +0800129 struct btrfs_delayed_ref_head *entry;
Chris Mason56bec292009-03-13 10:10:06 -0400130
Arne Jansend1270cd2011-09-13 15:16:43 +0200131 n = root->rb_node;
132 entry = NULL;
Chris Mason56bec292009-03-13 10:10:06 -0400133 while (n) {
Liu Boc46effa2013-10-14 12:59:45 +0800134 entry = rb_entry(n, struct btrfs_delayed_ref_head, href_node);
Chris Mason56bec292009-03-13 10:10:06 -0400135
Liu Boc46effa2013-10-14 12:59:45 +0800136 if (bytenr < entry->node.bytenr)
Chris Mason56bec292009-03-13 10:10:06 -0400137 n = n->rb_left;
Filipe Manana85fdfdf2014-02-12 15:07:53 +0000138 else if (bytenr > entry->node.bytenr)
Chris Mason56bec292009-03-13 10:10:06 -0400139 n = n->rb_right;
140 else
141 return entry;
142 }
Arne Jansend1270cd2011-09-13 15:16:43 +0200143 if (entry && return_bigger) {
Filipe Manana85fdfdf2014-02-12 15:07:53 +0000144 if (bytenr > entry->node.bytenr) {
Liu Boc46effa2013-10-14 12:59:45 +0800145 n = rb_next(&entry->href_node);
Arne Jansend1270cd2011-09-13 15:16:43 +0200146 if (!n)
147 n = rb_first(root);
Liu Boc46effa2013-10-14 12:59:45 +0800148 entry = rb_entry(n, struct btrfs_delayed_ref_head,
149 href_node);
Filipe Manana6103fb42014-02-12 15:07:52 +0000150 return entry;
Arne Jansend1270cd2011-09-13 15:16:43 +0200151 }
152 return entry;
153 }
Chris Mason56bec292009-03-13 10:10:06 -0400154 return NULL;
155}
156
Chris Masonc3e69d52009-03-13 10:17:05 -0400157int btrfs_delayed_ref_lock(struct btrfs_trans_handle *trans,
158 struct btrfs_delayed_ref_head *head)
Chris Mason56bec292009-03-13 10:10:06 -0400159{
Chris Masonc3e69d52009-03-13 10:17:05 -0400160 struct btrfs_delayed_ref_root *delayed_refs;
Chris Mason56bec292009-03-13 10:10:06 -0400161
Chris Masonc3e69d52009-03-13 10:17:05 -0400162 delayed_refs = &trans->transaction->delayed_refs;
163 assert_spin_locked(&delayed_refs->lock);
164 if (mutex_trylock(&head->mutex))
165 return 0;
166
167 atomic_inc(&head->node.refs);
168 spin_unlock(&delayed_refs->lock);
169
170 mutex_lock(&head->mutex);
171 spin_lock(&delayed_refs->lock);
172 if (!head->node.in_tree) {
173 mutex_unlock(&head->mutex);
174 btrfs_put_delayed_ref(&head->node);
175 return -EAGAIN;
176 }
177 btrfs_put_delayed_ref(&head->node);
178 return 0;
179}
180
Stefan Behrens35a36212013-08-14 18:12:25 +0200181static inline void drop_delayed_ref(struct btrfs_trans_handle *trans,
Josef Bacikae1e2062012-08-07 16:00:32 -0400182 struct btrfs_delayed_ref_root *delayed_refs,
Josef Bacikd7df2c72014-01-23 09:21:38 -0500183 struct btrfs_delayed_ref_head *head,
Josef Bacikae1e2062012-08-07 16:00:32 -0400184 struct btrfs_delayed_ref_node *ref)
185{
Liu Boc46effa2013-10-14 12:59:45 +0800186 if (btrfs_delayed_ref_is_head(ref)) {
Liu Boc46effa2013-10-14 12:59:45 +0800187 head = btrfs_delayed_node_to_head(ref);
188 rb_erase(&head->href_node, &delayed_refs->href_root);
Josef Bacikd7df2c72014-01-23 09:21:38 -0500189 } else {
190 assert_spin_locked(&head->lock);
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800191 list_del(&ref->list);
Liu Boc46effa2013-10-14 12:59:45 +0800192 }
Josef Bacikae1e2062012-08-07 16:00:32 -0400193 ref->in_tree = 0;
194 btrfs_put_delayed_ref(ref);
Josef Bacikd7df2c72014-01-23 09:21:38 -0500195 atomic_dec(&delayed_refs->num_entries);
Josef Bacikae1e2062012-08-07 16:00:32 -0400196 if (trans->delayed_ref_updates)
197 trans->delayed_ref_updates--;
198}
199
Jan Schmidt097b8a72012-06-21 11:08:04 +0200200int btrfs_check_delayed_seq(struct btrfs_fs_info *fs_info,
201 struct btrfs_delayed_ref_root *delayed_refs,
Arne Jansen00f04b82011-09-14 12:37:00 +0200202 u64 seq)
203{
204 struct seq_list *elem;
Jan Schmidt097b8a72012-06-21 11:08:04 +0200205 int ret = 0;
Arne Jansen00f04b82011-09-14 12:37:00 +0200206
Jan Schmidt097b8a72012-06-21 11:08:04 +0200207 spin_lock(&fs_info->tree_mod_seq_lock);
208 if (!list_empty(&fs_info->tree_mod_seq_list)) {
209 elem = list_first_entry(&fs_info->tree_mod_seq_list,
210 struct seq_list, list);
211 if (seq >= elem->seq) {
Jan Schmidtfc36ed7e2013-04-24 16:57:33 +0000212 pr_debug("holding back delayed_ref %#x.%x, lowest is %#x.%x (%p)\n",
213 (u32)(seq >> 32), (u32)seq,
214 (u32)(elem->seq >> 32), (u32)elem->seq,
215 delayed_refs);
Jan Schmidt097b8a72012-06-21 11:08:04 +0200216 ret = 1;
217 }
Arne Jansen00f04b82011-09-14 12:37:00 +0200218 }
Jan Schmidt097b8a72012-06-21 11:08:04 +0200219
220 spin_unlock(&fs_info->tree_mod_seq_lock);
221 return ret;
Arne Jansen00f04b82011-09-14 12:37:00 +0200222}
223
Josef Bacikd7df2c72014-01-23 09:21:38 -0500224struct btrfs_delayed_ref_head *
225btrfs_select_ref_head(struct btrfs_trans_handle *trans)
Chris Masonc3e69d52009-03-13 10:17:05 -0400226{
Chris Masonc3e69d52009-03-13 10:17:05 -0400227 struct btrfs_delayed_ref_root *delayed_refs;
Josef Bacikd7df2c72014-01-23 09:21:38 -0500228 struct btrfs_delayed_ref_head *head;
229 u64 start;
230 bool loop = false;
Chris Masonc3e69d52009-03-13 10:17:05 -0400231
232 delayed_refs = &trans->transaction->delayed_refs;
Liu Boc46effa2013-10-14 12:59:45 +0800233
Chris Masonc3e69d52009-03-13 10:17:05 -0400234again:
Josef Bacikd7df2c72014-01-23 09:21:38 -0500235 start = delayed_refs->run_delayed_start;
Filipe Manana85fdfdf2014-02-12 15:07:53 +0000236 head = find_ref_head(&delayed_refs->href_root, start, 1);
Josef Bacikd7df2c72014-01-23 09:21:38 -0500237 if (!head && !loop) {
238 delayed_refs->run_delayed_start = 0;
Chris Masonc3e69d52009-03-13 10:17:05 -0400239 start = 0;
Josef Bacikd7df2c72014-01-23 09:21:38 -0500240 loop = true;
Filipe Manana85fdfdf2014-02-12 15:07:53 +0000241 head = find_ref_head(&delayed_refs->href_root, start, 1);
Josef Bacikd7df2c72014-01-23 09:21:38 -0500242 if (!head)
243 return NULL;
244 } else if (!head && loop) {
245 return NULL;
Chris Masonc3e69d52009-03-13 10:17:05 -0400246 }
Chris Mason56bec292009-03-13 10:10:06 -0400247
Josef Bacikd7df2c72014-01-23 09:21:38 -0500248 while (head->processing) {
249 struct rb_node *node;
Miao Xie093486c2012-12-19 08:10:10 +0000250
Josef Bacikd7df2c72014-01-23 09:21:38 -0500251 node = rb_next(&head->href_node);
252 if (!node) {
253 if (loop)
254 return NULL;
255 delayed_refs->run_delayed_start = 0;
256 start = 0;
257 loop = true;
258 goto again;
259 }
260 head = rb_entry(node, struct btrfs_delayed_ref_head,
261 href_node);
262 }
263
264 head->processing = 1;
265 WARN_ON(delayed_refs->num_heads_ready == 0);
266 delayed_refs->num_heads_ready--;
267 delayed_refs->run_delayed_start = head->node.bytenr +
268 head->node.num_bytes;
269 return head;
Miao Xie093486c2012-12-19 08:10:10 +0000270}
271
Chris Mason56bec292009-03-13 10:10:06 -0400272/*
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800273 * Helper to insert the ref_node to the tail or merge with tail.
274 *
275 * Return 0 for insert.
276 * Return >0 for merge.
277 */
278static int
279add_delayed_ref_tail_merge(struct btrfs_trans_handle *trans,
280 struct btrfs_delayed_ref_root *root,
281 struct btrfs_delayed_ref_head *href,
282 struct btrfs_delayed_ref_node *ref)
283{
284 struct btrfs_delayed_ref_node *exist;
285 int mod;
286 int ret = 0;
287
288 spin_lock(&href->lock);
289 /* Check whether we can merge the tail node with ref */
290 if (list_empty(&href->ref_list))
291 goto add_tail;
292 exist = list_entry(href->ref_list.prev, struct btrfs_delayed_ref_node,
293 list);
294 /* No need to compare bytenr nor is_head */
295 if (exist->type != ref->type || exist->no_quota != ref->no_quota ||
296 exist->seq != ref->seq)
297 goto add_tail;
298
299 if ((exist->type == BTRFS_TREE_BLOCK_REF_KEY ||
300 exist->type == BTRFS_SHARED_BLOCK_REF_KEY) &&
301 comp_tree_refs(btrfs_delayed_node_to_tree_ref(exist),
302 btrfs_delayed_node_to_tree_ref(ref),
303 ref->type))
304 goto add_tail;
305 if ((exist->type == BTRFS_EXTENT_DATA_REF_KEY ||
306 exist->type == BTRFS_SHARED_DATA_REF_KEY) &&
307 comp_data_refs(btrfs_delayed_node_to_data_ref(exist),
308 btrfs_delayed_node_to_data_ref(ref)))
309 goto add_tail;
310
311 /* Now we are sure we can merge */
312 ret = 1;
313 if (exist->action == ref->action) {
314 mod = ref->ref_mod;
315 } else {
316 /* Need to change action */
317 if (exist->ref_mod < ref->ref_mod) {
318 exist->action = ref->action;
319 mod = -exist->ref_mod;
320 exist->ref_mod = ref->ref_mod;
321 } else
322 mod = -ref->ref_mod;
323 }
324 exist->ref_mod += mod;
325
326 /* remove existing tail if its ref_mod is zero */
327 if (exist->ref_mod == 0)
328 drop_delayed_ref(trans, root, href, exist);
329 spin_unlock(&href->lock);
330 return ret;
331
332add_tail:
333 list_add_tail(&ref->list, &href->ref_list);
334 atomic_inc(&root->num_entries);
335 trans->delayed_ref_updates++;
336 spin_unlock(&href->lock);
337 return ret;
338}
339
340/*
Chris Mason56bec292009-03-13 10:10:06 -0400341 * helper function to update the accounting in the head ref
342 * existing and update must have the same bytenr
343 */
344static noinline void
Josef Bacik12621332015-02-03 07:50:16 -0800345update_existing_head_ref(struct btrfs_delayed_ref_root *delayed_refs,
346 struct btrfs_delayed_ref_node *existing,
Chris Mason56bec292009-03-13 10:10:06 -0400347 struct btrfs_delayed_ref_node *update)
348{
349 struct btrfs_delayed_ref_head *existing_ref;
350 struct btrfs_delayed_ref_head *ref;
Josef Bacik12621332015-02-03 07:50:16 -0800351 int old_ref_mod;
Chris Mason56bec292009-03-13 10:10:06 -0400352
353 existing_ref = btrfs_delayed_node_to_head(existing);
354 ref = btrfs_delayed_node_to_head(update);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400355 BUG_ON(existing_ref->is_data != ref->is_data);
Chris Mason56bec292009-03-13 10:10:06 -0400356
Filipe Manana21543ba2014-03-14 20:55:01 +0000357 spin_lock(&existing_ref->lock);
Chris Mason56bec292009-03-13 10:10:06 -0400358 if (ref->must_insert_reserved) {
359 /* if the extent was freed and then
360 * reallocated before the delayed ref
361 * entries were processed, we can end up
362 * with an existing head ref without
363 * the must_insert_reserved flag set.
364 * Set it again here
365 */
366 existing_ref->must_insert_reserved = ref->must_insert_reserved;
367
368 /*
369 * update the num_bytes so we make sure the accounting
370 * is done correctly
371 */
372 existing->num_bytes = update->num_bytes;
373
374 }
375
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400376 if (ref->extent_op) {
377 if (!existing_ref->extent_op) {
378 existing_ref->extent_op = ref->extent_op;
379 } else {
380 if (ref->extent_op->update_key) {
381 memcpy(&existing_ref->extent_op->key,
382 &ref->extent_op->key,
383 sizeof(ref->extent_op->key));
384 existing_ref->extent_op->update_key = 1;
385 }
386 if (ref->extent_op->update_flags) {
387 existing_ref->extent_op->flags_to_set |=
388 ref->extent_op->flags_to_set;
389 existing_ref->extent_op->update_flags = 1;
390 }
Miao Xie78a61842012-11-21 02:21:28 +0000391 btrfs_free_delayed_extent_op(ref->extent_op);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400392 }
393 }
Chris Mason56bec292009-03-13 10:10:06 -0400394 /*
Josef Bacikd7df2c72014-01-23 09:21:38 -0500395 * update the reference mod on the head to reflect this new operation,
396 * only need the lock for this case cause we could be processing it
397 * currently, for refs we just added we know we're a-ok.
Chris Mason56bec292009-03-13 10:10:06 -0400398 */
Josef Bacik12621332015-02-03 07:50:16 -0800399 old_ref_mod = existing_ref->total_ref_mod;
Chris Mason56bec292009-03-13 10:10:06 -0400400 existing->ref_mod += update->ref_mod;
Josef Bacik12621332015-02-03 07:50:16 -0800401 existing_ref->total_ref_mod += update->ref_mod;
402
403 /*
404 * If we are going to from a positive ref mod to a negative or vice
405 * versa we need to make sure to adjust pending_csums accordingly.
406 */
407 if (existing_ref->is_data) {
408 if (existing_ref->total_ref_mod >= 0 && old_ref_mod < 0)
409 delayed_refs->pending_csums -= existing->num_bytes;
410 if (existing_ref->total_ref_mod < 0 && old_ref_mod >= 0)
411 delayed_refs->pending_csums += existing->num_bytes;
412 }
Josef Bacikd7df2c72014-01-23 09:21:38 -0500413 spin_unlock(&existing_ref->lock);
Chris Mason56bec292009-03-13 10:10:06 -0400414}
415
416/*
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400417 * helper function to actually insert a head node into the rbtree.
Chris Mason56bec292009-03-13 10:10:06 -0400418 * this does all the dirty work in terms of maintaining the correct
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400419 * overall modification count.
Chris Mason56bec292009-03-13 10:10:06 -0400420 */
Josef Bacikd7df2c72014-01-23 09:21:38 -0500421static noinline struct btrfs_delayed_ref_head *
422add_delayed_ref_head(struct btrfs_fs_info *fs_info,
423 struct btrfs_trans_handle *trans,
Qu Wenruo3368d002015-04-16 14:34:17 +0800424 struct btrfs_delayed_ref_node *ref,
425 struct btrfs_qgroup_extent_record *qrecord,
426 u64 bytenr, u64 num_bytes, int action, int is_data)
Chris Mason56bec292009-03-13 10:10:06 -0400427{
Josef Bacikd7df2c72014-01-23 09:21:38 -0500428 struct btrfs_delayed_ref_head *existing;
Chris Masonc3e69d52009-03-13 10:17:05 -0400429 struct btrfs_delayed_ref_head *head_ref = NULL;
Chris Mason56bec292009-03-13 10:10:06 -0400430 struct btrfs_delayed_ref_root *delayed_refs;
Qu Wenruo3368d002015-04-16 14:34:17 +0800431 struct btrfs_qgroup_extent_record *qexisting;
Chris Mason56bec292009-03-13 10:10:06 -0400432 int count_mod = 1;
433 int must_insert_reserved = 0;
434
435 /*
436 * the head node stores the sum of all the mods, so dropping a ref
437 * should drop the sum in the head node by one.
438 */
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400439 if (action == BTRFS_UPDATE_DELAYED_HEAD)
440 count_mod = 0;
441 else if (action == BTRFS_DROP_DELAYED_REF)
442 count_mod = -1;
Chris Mason56bec292009-03-13 10:10:06 -0400443
444 /*
445 * BTRFS_ADD_DELAYED_EXTENT means that we need to update
446 * the reserved accounting when the extent is finally added, or
447 * if a later modification deletes the delayed ref without ever
448 * inserting the extent into the extent allocation tree.
449 * ref->must_insert_reserved is the flag used to record
450 * that accounting mods are required.
451 *
452 * Once we record must_insert_reserved, switch the action to
453 * BTRFS_ADD_DELAYED_REF because other special casing is not required.
454 */
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400455 if (action == BTRFS_ADD_DELAYED_EXTENT)
Chris Mason56bec292009-03-13 10:10:06 -0400456 must_insert_reserved = 1;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400457 else
Chris Mason56bec292009-03-13 10:10:06 -0400458 must_insert_reserved = 0;
Chris Mason56bec292009-03-13 10:10:06 -0400459
460 delayed_refs = &trans->transaction->delayed_refs;
461
462 /* first set the basic ref node struct up */
463 atomic_set(&ref->refs, 1);
464 ref->bytenr = bytenr;
Chris Mason56bec292009-03-13 10:10:06 -0400465 ref->num_bytes = num_bytes;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400466 ref->ref_mod = count_mod;
467 ref->type = 0;
468 ref->action = 0;
469 ref->is_head = 1;
470 ref->in_tree = 1;
Arne Jansen00f04b82011-09-14 12:37:00 +0200471 ref->seq = 0;
Chris Mason56bec292009-03-13 10:10:06 -0400472
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400473 head_ref = btrfs_delayed_node_to_head(ref);
474 head_ref->must_insert_reserved = must_insert_reserved;
475 head_ref->is_data = is_data;
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800476 INIT_LIST_HEAD(&head_ref->ref_list);
Josef Bacikd7df2c72014-01-23 09:21:38 -0500477 head_ref->processing = 0;
Josef Bacik12621332015-02-03 07:50:16 -0800478 head_ref->total_ref_mod = count_mod;
Chris Mason56bec292009-03-13 10:10:06 -0400479
Qu Wenruo3368d002015-04-16 14:34:17 +0800480 /* Record qgroup extent info if provided */
481 if (qrecord) {
482 qrecord->bytenr = bytenr;
483 qrecord->num_bytes = num_bytes;
484 qrecord->old_roots = NULL;
485
486 qexisting = btrfs_qgroup_insert_dirty_extent(delayed_refs,
487 qrecord);
488 if (qexisting)
489 kfree(qrecord);
490 }
491
Josef Bacikd7df2c72014-01-23 09:21:38 -0500492 spin_lock_init(&head_ref->lock);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400493 mutex_init(&head_ref->mutex);
494
Liu Bo599c75e2013-07-16 19:03:36 +0800495 trace_add_delayed_ref_head(ref, head_ref, action);
liubo1abe9b82011-03-24 11:18:59 +0000496
Josef Bacikd7df2c72014-01-23 09:21:38 -0500497 existing = htree_insert(&delayed_refs->href_root,
498 &head_ref->href_node);
Chris Mason56bec292009-03-13 10:10:06 -0400499 if (existing) {
Josef Bacik12621332015-02-03 07:50:16 -0800500 update_existing_head_ref(delayed_refs, &existing->node, ref);
Chris Mason56bec292009-03-13 10:10:06 -0400501 /*
502 * we've updated the existing ref, free the newly
503 * allocated ref
504 */
Miao Xie78a61842012-11-21 02:21:28 +0000505 kmem_cache_free(btrfs_delayed_ref_head_cachep, head_ref);
Josef Bacikd7df2c72014-01-23 09:21:38 -0500506 head_ref = existing;
Chris Mason56bec292009-03-13 10:10:06 -0400507 } else {
Josef Bacik12621332015-02-03 07:50:16 -0800508 if (is_data && count_mod < 0)
509 delayed_refs->pending_csums += num_bytes;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400510 delayed_refs->num_heads++;
511 delayed_refs->num_heads_ready++;
Josef Bacikd7df2c72014-01-23 09:21:38 -0500512 atomic_inc(&delayed_refs->num_entries);
Chris Mason56bec292009-03-13 10:10:06 -0400513 trans->delayed_ref_updates++;
514 }
Josef Bacikd7df2c72014-01-23 09:21:38 -0500515 return head_ref;
Chris Mason56bec292009-03-13 10:10:06 -0400516}
517
518/*
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400519 * helper to insert a delayed tree ref into the rbtree.
520 */
Josef Bacikd7df2c72014-01-23 09:21:38 -0500521static noinline void
522add_delayed_tree_ref(struct btrfs_fs_info *fs_info,
523 struct btrfs_trans_handle *trans,
524 struct btrfs_delayed_ref_head *head_ref,
525 struct btrfs_delayed_ref_node *ref, u64 bytenr,
526 u64 num_bytes, u64 parent, u64 ref_root, int level,
Josef Bacikfcebe452014-05-13 17:30:47 -0700527 int action, int no_quota)
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400528{
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400529 struct btrfs_delayed_tree_ref *full_ref;
530 struct btrfs_delayed_ref_root *delayed_refs;
Arne Jansen00f04b82011-09-14 12:37:00 +0200531 u64 seq = 0;
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800532 int ret;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400533
534 if (action == BTRFS_ADD_DELAYED_EXTENT)
535 action = BTRFS_ADD_DELAYED_REF;
536
Josef Bacikfcebe452014-05-13 17:30:47 -0700537 if (is_fstree(ref_root))
538 seq = atomic64_read(&fs_info->tree_mod_seq);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400539 delayed_refs = &trans->transaction->delayed_refs;
540
541 /* first set the basic ref node struct up */
542 atomic_set(&ref->refs, 1);
543 ref->bytenr = bytenr;
544 ref->num_bytes = num_bytes;
545 ref->ref_mod = 1;
546 ref->action = action;
547 ref->is_head = 0;
548 ref->in_tree = 1;
Josef Bacikfcebe452014-05-13 17:30:47 -0700549 ref->no_quota = no_quota;
Arne Jansen00f04b82011-09-14 12:37:00 +0200550 ref->seq = seq;
551
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400552 full_ref = btrfs_delayed_node_to_tree_ref(ref);
Arne Janseneebe0632011-09-14 14:01:24 +0200553 full_ref->parent = parent;
554 full_ref->root = ref_root;
555 if (parent)
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400556 ref->type = BTRFS_SHARED_BLOCK_REF_KEY;
Arne Janseneebe0632011-09-14 14:01:24 +0200557 else
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400558 ref->type = BTRFS_TREE_BLOCK_REF_KEY;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400559 full_ref->level = level;
560
Liu Bo599c75e2013-07-16 19:03:36 +0800561 trace_add_delayed_tree_ref(ref, full_ref, action);
liubo1abe9b82011-03-24 11:18:59 +0000562
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800563 ret = add_delayed_ref_tail_merge(trans, delayed_refs, head_ref, ref);
564
565 /*
566 * XXX: memory should be freed at the same level allocated.
567 * But bad practice is anywhere... Follow it now. Need cleanup.
568 */
569 if (ret > 0)
Miao Xie78a61842012-11-21 02:21:28 +0000570 kmem_cache_free(btrfs_delayed_tree_ref_cachep, full_ref);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400571}
572
573/*
574 * helper to insert a delayed data ref into the rbtree.
575 */
Josef Bacikd7df2c72014-01-23 09:21:38 -0500576static noinline void
577add_delayed_data_ref(struct btrfs_fs_info *fs_info,
578 struct btrfs_trans_handle *trans,
579 struct btrfs_delayed_ref_head *head_ref,
580 struct btrfs_delayed_ref_node *ref, u64 bytenr,
581 u64 num_bytes, u64 parent, u64 ref_root, u64 owner,
Josef Bacikfcebe452014-05-13 17:30:47 -0700582 u64 offset, int action, int no_quota)
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400583{
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400584 struct btrfs_delayed_data_ref *full_ref;
585 struct btrfs_delayed_ref_root *delayed_refs;
Arne Jansen00f04b82011-09-14 12:37:00 +0200586 u64 seq = 0;
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800587 int ret;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400588
589 if (action == BTRFS_ADD_DELAYED_EXTENT)
590 action = BTRFS_ADD_DELAYED_REF;
591
592 delayed_refs = &trans->transaction->delayed_refs;
593
Josef Bacikfcebe452014-05-13 17:30:47 -0700594 if (is_fstree(ref_root))
595 seq = atomic64_read(&fs_info->tree_mod_seq);
596
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400597 /* first set the basic ref node struct up */
598 atomic_set(&ref->refs, 1);
599 ref->bytenr = bytenr;
600 ref->num_bytes = num_bytes;
601 ref->ref_mod = 1;
602 ref->action = action;
603 ref->is_head = 0;
604 ref->in_tree = 1;
Josef Bacikfcebe452014-05-13 17:30:47 -0700605 ref->no_quota = no_quota;
Arne Jansen00f04b82011-09-14 12:37:00 +0200606 ref->seq = seq;
607
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400608 full_ref = btrfs_delayed_node_to_data_ref(ref);
Arne Janseneebe0632011-09-14 14:01:24 +0200609 full_ref->parent = parent;
610 full_ref->root = ref_root;
611 if (parent)
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400612 ref->type = BTRFS_SHARED_DATA_REF_KEY;
Arne Janseneebe0632011-09-14 14:01:24 +0200613 else
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400614 ref->type = BTRFS_EXTENT_DATA_REF_KEY;
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200615
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400616 full_ref->objectid = owner;
617 full_ref->offset = offset;
618
Liu Bo599c75e2013-07-16 19:03:36 +0800619 trace_add_delayed_data_ref(ref, full_ref, action);
liubo1abe9b82011-03-24 11:18:59 +0000620
Qu Wenruoc6fc2452015-03-30 17:03:00 +0800621 ret = add_delayed_ref_tail_merge(trans, delayed_refs, head_ref, ref);
622
623 if (ret > 0)
Miao Xie78a61842012-11-21 02:21:28 +0000624 kmem_cache_free(btrfs_delayed_data_ref_cachep, full_ref);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400625}
626
627/*
628 * add a delayed tree ref. This does all of the accounting required
Chris Mason56bec292009-03-13 10:10:06 -0400629 * to make sure the delayed ref is eventually processed before this
630 * transaction commits.
631 */
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200632int btrfs_add_delayed_tree_ref(struct btrfs_fs_info *fs_info,
633 struct btrfs_trans_handle *trans,
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400634 u64 bytenr, u64 num_bytes, u64 parent,
635 u64 ref_root, int level, int action,
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200636 struct btrfs_delayed_extent_op *extent_op,
Josef Bacikfcebe452014-05-13 17:30:47 -0700637 int no_quota)
Chris Mason56bec292009-03-13 10:10:06 -0400638{
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400639 struct btrfs_delayed_tree_ref *ref;
Chris Mason56bec292009-03-13 10:10:06 -0400640 struct btrfs_delayed_ref_head *head_ref;
641 struct btrfs_delayed_ref_root *delayed_refs;
Qu Wenruo3368d002015-04-16 14:34:17 +0800642 struct btrfs_qgroup_extent_record *record = NULL;
Chris Mason56bec292009-03-13 10:10:06 -0400643
Josef Bacikfcebe452014-05-13 17:30:47 -0700644 if (!is_fstree(ref_root) || !fs_info->quota_enabled)
645 no_quota = 0;
646
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400647 BUG_ON(extent_op && extent_op->is_data);
Miao Xie78a61842012-11-21 02:21:28 +0000648 ref = kmem_cache_alloc(btrfs_delayed_tree_ref_cachep, GFP_NOFS);
Chris Mason56bec292009-03-13 10:10:06 -0400649 if (!ref)
650 return -ENOMEM;
651
Miao Xie78a61842012-11-21 02:21:28 +0000652 head_ref = kmem_cache_alloc(btrfs_delayed_ref_head_cachep, GFP_NOFS);
Dan Carpenter5a5003df2015-06-24 17:32:33 +0300653 if (!head_ref)
654 goto free_ref;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400655
Qu Wenruo3368d002015-04-16 14:34:17 +0800656 if (fs_info->quota_enabled && is_fstree(ref_root)) {
657 record = kmalloc(sizeof(*record), GFP_NOFS);
Dan Carpenter5a5003df2015-06-24 17:32:33 +0300658 if (!record)
659 goto free_head_ref;
Qu Wenruo3368d002015-04-16 14:34:17 +0800660 }
661
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400662 head_ref->extent_op = extent_op;
663
Chris Mason56bec292009-03-13 10:10:06 -0400664 delayed_refs = &trans->transaction->delayed_refs;
665 spin_lock(&delayed_refs->lock);
666
667 /*
668 * insert both the head node and the new ref without dropping
669 * the spin lock
670 */
Qu Wenruo3368d002015-04-16 14:34:17 +0800671 head_ref = add_delayed_ref_head(fs_info, trans, &head_ref->node, record,
Josef Bacikd7df2c72014-01-23 09:21:38 -0500672 bytenr, num_bytes, action, 0);
Chris Mason56bec292009-03-13 10:10:06 -0400673
Josef Bacikd7df2c72014-01-23 09:21:38 -0500674 add_delayed_tree_ref(fs_info, trans, head_ref, &ref->node, bytenr,
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200675 num_bytes, parent, ref_root, level, action,
Josef Bacikfcebe452014-05-13 17:30:47 -0700676 no_quota);
Chris Mason56bec292009-03-13 10:10:06 -0400677 spin_unlock(&delayed_refs->lock);
Jan Schmidt95a06072012-05-29 17:06:54 +0200678
Chris Mason56bec292009-03-13 10:10:06 -0400679 return 0;
Dan Carpenter5a5003df2015-06-24 17:32:33 +0300680
681free_head_ref:
682 kmem_cache_free(btrfs_delayed_ref_head_cachep, head_ref);
683free_ref:
684 kmem_cache_free(btrfs_delayed_tree_ref_cachep, ref);
685
686 return -ENOMEM;
Chris Mason56bec292009-03-13 10:10:06 -0400687}
688
689/*
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400690 * add a delayed data ref. it's similar to btrfs_add_delayed_tree_ref.
691 */
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200692int btrfs_add_delayed_data_ref(struct btrfs_fs_info *fs_info,
693 struct btrfs_trans_handle *trans,
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400694 u64 bytenr, u64 num_bytes,
695 u64 parent, u64 ref_root,
696 u64 owner, u64 offset, int action,
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200697 struct btrfs_delayed_extent_op *extent_op,
Josef Bacikfcebe452014-05-13 17:30:47 -0700698 int no_quota)
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400699{
700 struct btrfs_delayed_data_ref *ref;
701 struct btrfs_delayed_ref_head *head_ref;
702 struct btrfs_delayed_ref_root *delayed_refs;
Qu Wenruo3368d002015-04-16 14:34:17 +0800703 struct btrfs_qgroup_extent_record *record = NULL;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400704
Josef Bacikfcebe452014-05-13 17:30:47 -0700705 if (!is_fstree(ref_root) || !fs_info->quota_enabled)
706 no_quota = 0;
707
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400708 BUG_ON(extent_op && !extent_op->is_data);
Miao Xie78a61842012-11-21 02:21:28 +0000709 ref = kmem_cache_alloc(btrfs_delayed_data_ref_cachep, GFP_NOFS);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400710 if (!ref)
711 return -ENOMEM;
712
Miao Xie78a61842012-11-21 02:21:28 +0000713 head_ref = kmem_cache_alloc(btrfs_delayed_ref_head_cachep, GFP_NOFS);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400714 if (!head_ref) {
Miao Xie78a61842012-11-21 02:21:28 +0000715 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400716 return -ENOMEM;
717 }
718
Qu Wenruo3368d002015-04-16 14:34:17 +0800719 if (fs_info->quota_enabled && is_fstree(ref_root)) {
720 record = kmalloc(sizeof(*record), GFP_NOFS);
721 if (!record) {
722 kmem_cache_free(btrfs_delayed_data_ref_cachep, ref);
723 kmem_cache_free(btrfs_delayed_ref_head_cachep,
724 head_ref);
725 return -ENOMEM;
726 }
727 }
728
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400729 head_ref->extent_op = extent_op;
730
731 delayed_refs = &trans->transaction->delayed_refs;
732 spin_lock(&delayed_refs->lock);
733
734 /*
735 * insert both the head node and the new ref without dropping
736 * the spin lock
737 */
Qu Wenruo3368d002015-04-16 14:34:17 +0800738 head_ref = add_delayed_ref_head(fs_info, trans, &head_ref->node, record,
Josef Bacikd7df2c72014-01-23 09:21:38 -0500739 bytenr, num_bytes, action, 1);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400740
Josef Bacikd7df2c72014-01-23 09:21:38 -0500741 add_delayed_data_ref(fs_info, trans, head_ref, &ref->node, bytenr,
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200742 num_bytes, parent, ref_root, owner, offset,
Josef Bacikfcebe452014-05-13 17:30:47 -0700743 action, no_quota);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400744 spin_unlock(&delayed_refs->lock);
Jan Schmidt95a06072012-05-29 17:06:54 +0200745
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400746 return 0;
747}
748
Arne Jansen66d7e7f2011-09-12 15:26:38 +0200749int btrfs_add_delayed_extent_op(struct btrfs_fs_info *fs_info,
750 struct btrfs_trans_handle *trans,
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400751 u64 bytenr, u64 num_bytes,
752 struct btrfs_delayed_extent_op *extent_op)
753{
754 struct btrfs_delayed_ref_head *head_ref;
755 struct btrfs_delayed_ref_root *delayed_refs;
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400756
Miao Xie78a61842012-11-21 02:21:28 +0000757 head_ref = kmem_cache_alloc(btrfs_delayed_ref_head_cachep, GFP_NOFS);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400758 if (!head_ref)
759 return -ENOMEM;
760
761 head_ref->extent_op = extent_op;
762
763 delayed_refs = &trans->transaction->delayed_refs;
764 spin_lock(&delayed_refs->lock);
765
Qu Wenruo3368d002015-04-16 14:34:17 +0800766 add_delayed_ref_head(fs_info, trans, &head_ref->node, NULL, bytenr,
767 num_bytes, BTRFS_UPDATE_DELAYED_HEAD,
768 extent_op->is_data);
Yan Zheng5d4f98a2009-06-10 10:45:14 -0400769
770 spin_unlock(&delayed_refs->lock);
771 return 0;
772}
773
774/*
Chris Mason1887be62009-03-13 10:11:24 -0400775 * this does a simple search for the head node for a given extent.
776 * It must be called with the delayed ref spinlock held, and it returns
777 * the head node if any where found, or NULL if not.
778 */
779struct btrfs_delayed_ref_head *
780btrfs_find_delayed_ref_head(struct btrfs_trans_handle *trans, u64 bytenr)
781{
Chris Mason1887be62009-03-13 10:11:24 -0400782 struct btrfs_delayed_ref_root *delayed_refs;
783
784 delayed_refs = &trans->transaction->delayed_refs;
Filipe Manana85fdfdf2014-02-12 15:07:53 +0000785 return find_ref_head(&delayed_refs->href_root, bytenr, 0);
Chris Mason1887be62009-03-13 10:11:24 -0400786}
Miao Xie78a61842012-11-21 02:21:28 +0000787
788void btrfs_delayed_ref_exit(void)
789{
790 if (btrfs_delayed_ref_head_cachep)
791 kmem_cache_destroy(btrfs_delayed_ref_head_cachep);
792 if (btrfs_delayed_tree_ref_cachep)
793 kmem_cache_destroy(btrfs_delayed_tree_ref_cachep);
794 if (btrfs_delayed_data_ref_cachep)
795 kmem_cache_destroy(btrfs_delayed_data_ref_cachep);
796 if (btrfs_delayed_extent_op_cachep)
797 kmem_cache_destroy(btrfs_delayed_extent_op_cachep);
798}
799
800int btrfs_delayed_ref_init(void)
801{
802 btrfs_delayed_ref_head_cachep = kmem_cache_create(
803 "btrfs_delayed_ref_head",
804 sizeof(struct btrfs_delayed_ref_head), 0,
805 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
806 if (!btrfs_delayed_ref_head_cachep)
807 goto fail;
808
809 btrfs_delayed_tree_ref_cachep = kmem_cache_create(
810 "btrfs_delayed_tree_ref",
811 sizeof(struct btrfs_delayed_tree_ref), 0,
812 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
813 if (!btrfs_delayed_tree_ref_cachep)
814 goto fail;
815
816 btrfs_delayed_data_ref_cachep = kmem_cache_create(
817 "btrfs_delayed_data_ref",
818 sizeof(struct btrfs_delayed_data_ref), 0,
819 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
820 if (!btrfs_delayed_data_ref_cachep)
821 goto fail;
822
823 btrfs_delayed_extent_op_cachep = kmem_cache_create(
824 "btrfs_delayed_extent_op",
825 sizeof(struct btrfs_delayed_extent_op), 0,
826 SLAB_RECLAIM_ACCOUNT | SLAB_MEM_SPREAD, NULL);
827 if (!btrfs_delayed_extent_op_cachep)
828 goto fail;
829
830 return 0;
831fail:
832 btrfs_delayed_ref_exit();
833 return -ENOMEM;
834}