1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2011 STRATO. All rights reserved.
6 #include <linux/sched.h>
7 #include <linux/pagemap.h>
8 #include <linux/writeback.h>
9 #include <linux/blkdev.h>
10 #include <linux/rbtree.h>
11 #include <linux/slab.h>
12 #include <linux/workqueue.h>
13 #include <linux/btrfs.h>
14 #include <linux/sched/mm.h>
17 #include "transaction.h"
22 #include "extent_io.h"
24 #include "block-group.h"
26 #include "tree-mod-log.h"
29 * Helpers to access qgroup reservation
31 * Callers should ensure the lock context and type are valid
34 static u64 qgroup_rsv_total(const struct btrfs_qgroup *qgroup)
39 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
40 ret += qgroup->rsv.values[i];
45 #ifdef CONFIG_BTRFS_DEBUG
46 static const char *qgroup_rsv_type_str(enum btrfs_qgroup_rsv_type type)
48 if (type == BTRFS_QGROUP_RSV_DATA)
50 if (type == BTRFS_QGROUP_RSV_META_PERTRANS)
51 return "meta_pertrans";
52 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
53 return "meta_prealloc";
58 static void qgroup_rsv_add(struct btrfs_fs_info *fs_info,
59 struct btrfs_qgroup *qgroup, u64 num_bytes,
60 enum btrfs_qgroup_rsv_type type)
62 trace_qgroup_update_reserve(fs_info, qgroup, num_bytes, type);
63 qgroup->rsv.values[type] += num_bytes;
66 static void qgroup_rsv_release(struct btrfs_fs_info *fs_info,
67 struct btrfs_qgroup *qgroup, u64 num_bytes,
68 enum btrfs_qgroup_rsv_type type)
70 trace_qgroup_update_reserve(fs_info, qgroup, -(s64)num_bytes, type);
71 if (qgroup->rsv.values[type] >= num_bytes) {
72 qgroup->rsv.values[type] -= num_bytes;
75 #ifdef CONFIG_BTRFS_DEBUG
77 "qgroup %llu %s reserved space underflow, have %llu to free %llu",
78 qgroup->qgroupid, qgroup_rsv_type_str(type),
79 qgroup->rsv.values[type], num_bytes);
81 qgroup->rsv.values[type] = 0;
84 static void qgroup_rsv_add_by_qgroup(struct btrfs_fs_info *fs_info,
85 struct btrfs_qgroup *dest,
86 struct btrfs_qgroup *src)
90 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
91 qgroup_rsv_add(fs_info, dest, src->rsv.values[i], i);
94 static void qgroup_rsv_release_by_qgroup(struct btrfs_fs_info *fs_info,
95 struct btrfs_qgroup *dest,
96 struct btrfs_qgroup *src)
100 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++)
101 qgroup_rsv_release(fs_info, dest, src->rsv.values[i], i);
104 static void btrfs_qgroup_update_old_refcnt(struct btrfs_qgroup *qg, u64 seq,
107 if (qg->old_refcnt < seq)
108 qg->old_refcnt = seq;
109 qg->old_refcnt += mod;
112 static void btrfs_qgroup_update_new_refcnt(struct btrfs_qgroup *qg, u64 seq,
115 if (qg->new_refcnt < seq)
116 qg->new_refcnt = seq;
117 qg->new_refcnt += mod;
120 static inline u64 btrfs_qgroup_get_old_refcnt(struct btrfs_qgroup *qg, u64 seq)
122 if (qg->old_refcnt < seq)
124 return qg->old_refcnt - seq;
127 static inline u64 btrfs_qgroup_get_new_refcnt(struct btrfs_qgroup *qg, u64 seq)
129 if (qg->new_refcnt < seq)
131 return qg->new_refcnt - seq;
135 * glue structure to represent the relations between qgroups.
137 struct btrfs_qgroup_list {
138 struct list_head next_group;
139 struct list_head next_member;
140 struct btrfs_qgroup *group;
141 struct btrfs_qgroup *member;
144 static inline u64 qgroup_to_aux(struct btrfs_qgroup *qg)
146 return (u64)(uintptr_t)qg;
149 static inline struct btrfs_qgroup* unode_aux_to_qgroup(struct ulist_node *n)
151 return (struct btrfs_qgroup *)(uintptr_t)n->aux;
155 qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
157 static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info);
159 /* must be called with qgroup_ioctl_lock held */
160 static struct btrfs_qgroup *find_qgroup_rb(struct btrfs_fs_info *fs_info,
163 struct rb_node *n = fs_info->qgroup_tree.rb_node;
164 struct btrfs_qgroup *qgroup;
167 qgroup = rb_entry(n, struct btrfs_qgroup, node);
168 if (qgroup->qgroupid < qgroupid)
170 else if (qgroup->qgroupid > qgroupid)
178 /* must be called with qgroup_lock held */
179 static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info,
182 struct rb_node **p = &fs_info->qgroup_tree.rb_node;
183 struct rb_node *parent = NULL;
184 struct btrfs_qgroup *qgroup;
188 qgroup = rb_entry(parent, struct btrfs_qgroup, node);
190 if (qgroup->qgroupid < qgroupid)
192 else if (qgroup->qgroupid > qgroupid)
198 qgroup = kzalloc(sizeof(*qgroup), GFP_ATOMIC);
200 return ERR_PTR(-ENOMEM);
202 qgroup->qgroupid = qgroupid;
203 INIT_LIST_HEAD(&qgroup->groups);
204 INIT_LIST_HEAD(&qgroup->members);
205 INIT_LIST_HEAD(&qgroup->dirty);
207 rb_link_node(&qgroup->node, parent, p);
208 rb_insert_color(&qgroup->node, &fs_info->qgroup_tree);
213 static void __del_qgroup_rb(struct btrfs_fs_info *fs_info,
214 struct btrfs_qgroup *qgroup)
216 struct btrfs_qgroup_list *list;
218 list_del(&qgroup->dirty);
219 while (!list_empty(&qgroup->groups)) {
220 list = list_first_entry(&qgroup->groups,
221 struct btrfs_qgroup_list, next_group);
222 list_del(&list->next_group);
223 list_del(&list->next_member);
227 while (!list_empty(&qgroup->members)) {
228 list = list_first_entry(&qgroup->members,
229 struct btrfs_qgroup_list, next_member);
230 list_del(&list->next_group);
231 list_del(&list->next_member);
236 /* must be called with qgroup_lock held */
237 static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid)
239 struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid);
244 rb_erase(&qgroup->node, &fs_info->qgroup_tree);
245 __del_qgroup_rb(fs_info, qgroup);
250 * Add relation specified by two qgroups.
252 * Must be called with qgroup_lock held.
254 * Return: 0 on success
255 * -ENOENT if one of the qgroups is NULL
258 static int __add_relation_rb(struct btrfs_qgroup *member, struct btrfs_qgroup *parent)
260 struct btrfs_qgroup_list *list;
262 if (!member || !parent)
265 list = kzalloc(sizeof(*list), GFP_ATOMIC);
269 list->group = parent;
270 list->member = member;
271 list_add_tail(&list->next_group, &member->groups);
272 list_add_tail(&list->next_member, &parent->members);
278 * Add relation specified by two qgroup ids.
280 * Must be called with qgroup_lock held.
282 * Return: 0 on success
283 * -ENOENT if one of the ids does not exist
286 static int add_relation_rb(struct btrfs_fs_info *fs_info, u64 memberid, u64 parentid)
288 struct btrfs_qgroup *member;
289 struct btrfs_qgroup *parent;
291 member = find_qgroup_rb(fs_info, memberid);
292 parent = find_qgroup_rb(fs_info, parentid);
294 return __add_relation_rb(member, parent);
297 /* Must be called with qgroup_lock held */
298 static int del_relation_rb(struct btrfs_fs_info *fs_info,
299 u64 memberid, u64 parentid)
301 struct btrfs_qgroup *member;
302 struct btrfs_qgroup *parent;
303 struct btrfs_qgroup_list *list;
305 member = find_qgroup_rb(fs_info, memberid);
306 parent = find_qgroup_rb(fs_info, parentid);
307 if (!member || !parent)
310 list_for_each_entry(list, &member->groups, next_group) {
311 if (list->group == parent) {
312 list_del(&list->next_group);
313 list_del(&list->next_member);
321 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
322 int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
325 struct btrfs_qgroup *qgroup;
327 qgroup = find_qgroup_rb(fs_info, qgroupid);
330 if (qgroup->rfer != rfer || qgroup->excl != excl)
336 static void qgroup_mark_inconsistent(struct btrfs_fs_info *fs_info)
338 fs_info->qgroup_flags |= (BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT |
339 BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN |
340 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING);
344 * The full config is read in one go, only called from open_ctree()
345 * It doesn't use any locking, as at this point we're still single-threaded
347 int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info)
349 struct btrfs_key key;
350 struct btrfs_key found_key;
351 struct btrfs_root *quota_root = fs_info->quota_root;
352 struct btrfs_path *path = NULL;
353 struct extent_buffer *l;
357 u64 rescan_progress = 0;
359 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
362 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
363 if (!fs_info->qgroup_ulist) {
368 path = btrfs_alloc_path();
374 ret = btrfs_sysfs_add_qgroups(fs_info);
377 /* default this to quota off, in case no status key is found */
378 fs_info->qgroup_flags = 0;
381 * pass 1: read status, all qgroup infos and limits
386 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1);
391 struct btrfs_qgroup *qgroup;
393 slot = path->slots[0];
395 btrfs_item_key_to_cpu(l, &found_key, slot);
397 if (found_key.type == BTRFS_QGROUP_STATUS_KEY) {
398 struct btrfs_qgroup_status_item *ptr;
400 ptr = btrfs_item_ptr(l, slot,
401 struct btrfs_qgroup_status_item);
403 if (btrfs_qgroup_status_version(l, ptr) !=
404 BTRFS_QGROUP_STATUS_VERSION) {
406 "old qgroup version, quota disabled");
409 if (btrfs_qgroup_status_generation(l, ptr) !=
410 fs_info->generation) {
411 qgroup_mark_inconsistent(fs_info);
413 "qgroup generation mismatch, marked as inconsistent");
415 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l,
417 rescan_progress = btrfs_qgroup_status_rescan(l, ptr);
421 if (found_key.type != BTRFS_QGROUP_INFO_KEY &&
422 found_key.type != BTRFS_QGROUP_LIMIT_KEY)
425 qgroup = find_qgroup_rb(fs_info, found_key.offset);
426 if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) ||
427 (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) {
428 btrfs_err(fs_info, "inconsistent qgroup config");
429 qgroup_mark_inconsistent(fs_info);
432 qgroup = add_qgroup_rb(fs_info, found_key.offset);
433 if (IS_ERR(qgroup)) {
434 ret = PTR_ERR(qgroup);
438 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
442 switch (found_key.type) {
443 case BTRFS_QGROUP_INFO_KEY: {
444 struct btrfs_qgroup_info_item *ptr;
446 ptr = btrfs_item_ptr(l, slot,
447 struct btrfs_qgroup_info_item);
448 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr);
449 qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr);
450 qgroup->excl = btrfs_qgroup_info_excl(l, ptr);
451 qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr);
452 /* generation currently unused */
455 case BTRFS_QGROUP_LIMIT_KEY: {
456 struct btrfs_qgroup_limit_item *ptr;
458 ptr = btrfs_item_ptr(l, slot,
459 struct btrfs_qgroup_limit_item);
460 qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr);
461 qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr);
462 qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr);
463 qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr);
464 qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr);
469 ret = btrfs_next_item(quota_root, path);
475 btrfs_release_path(path);
478 * pass 2: read all qgroup relations
481 key.type = BTRFS_QGROUP_RELATION_KEY;
483 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0);
487 slot = path->slots[0];
489 btrfs_item_key_to_cpu(l, &found_key, slot);
491 if (found_key.type != BTRFS_QGROUP_RELATION_KEY)
494 if (found_key.objectid > found_key.offset) {
495 /* parent <- member, not needed to build config */
496 /* FIXME should we omit the key completely? */
500 ret = add_relation_rb(fs_info, found_key.objectid,
502 if (ret == -ENOENT) {
504 "orphan qgroup relation 0x%llx->0x%llx",
505 found_key.objectid, found_key.offset);
506 ret = 0; /* ignore the error */
511 ret = btrfs_next_item(quota_root, path);
518 btrfs_free_path(path);
519 fs_info->qgroup_flags |= flags;
520 if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))
521 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
522 else if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN &&
524 ret = qgroup_rescan_init(fs_info, rescan_progress, 0);
527 ulist_free(fs_info->qgroup_ulist);
528 fs_info->qgroup_ulist = NULL;
529 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
530 btrfs_sysfs_del_qgroups(fs_info);
533 return ret < 0 ? ret : 0;
537 * Called in close_ctree() when quota is still enabled. This verifies we don't
538 * leak some reserved space.
540 * Return false if no reserved space is left.
541 * Return true if some reserved space is leaked.
543 bool btrfs_check_quota_leak(struct btrfs_fs_info *fs_info)
545 struct rb_node *node;
548 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
551 * Since we're unmounting, there is no race and no need to grab qgroup
552 * lock. And here we don't go post-order to provide a more user
553 * friendly sorted result.
555 for (node = rb_first(&fs_info->qgroup_tree); node; node = rb_next(node)) {
556 struct btrfs_qgroup *qgroup;
559 qgroup = rb_entry(node, struct btrfs_qgroup, node);
560 for (i = 0; i < BTRFS_QGROUP_RSV_LAST; i++) {
561 if (qgroup->rsv.values[i]) {
564 "qgroup %hu/%llu has unreleased space, type %d rsv %llu",
565 btrfs_qgroup_level(qgroup->qgroupid),
566 btrfs_qgroup_subvolid(qgroup->qgroupid),
567 i, qgroup->rsv.values[i]);
575 * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(),
576 * first two are in single-threaded paths.And for the third one, we have set
577 * quota_root to be null with qgroup_lock held before, so it is safe to clean
578 * up the in-memory structures without qgroup_lock held.
580 void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info)
583 struct btrfs_qgroup *qgroup;
585 while ((n = rb_first(&fs_info->qgroup_tree))) {
586 qgroup = rb_entry(n, struct btrfs_qgroup, node);
587 rb_erase(n, &fs_info->qgroup_tree);
588 __del_qgroup_rb(fs_info, qgroup);
589 btrfs_sysfs_del_one_qgroup(fs_info, qgroup);
593 * We call btrfs_free_qgroup_config() when unmounting
594 * filesystem and disabling quota, so we set qgroup_ulist
595 * to be null here to avoid double free.
597 ulist_free(fs_info->qgroup_ulist);
598 fs_info->qgroup_ulist = NULL;
599 btrfs_sysfs_del_qgroups(fs_info);
602 static int add_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
606 struct btrfs_root *quota_root = trans->fs_info->quota_root;
607 struct btrfs_path *path;
608 struct btrfs_key key;
610 path = btrfs_alloc_path();
615 key.type = BTRFS_QGROUP_RELATION_KEY;
618 ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0);
620 btrfs_mark_buffer_dirty(path->nodes[0]);
622 btrfs_free_path(path);
626 static int del_qgroup_relation_item(struct btrfs_trans_handle *trans, u64 src,
630 struct btrfs_root *quota_root = trans->fs_info->quota_root;
631 struct btrfs_path *path;
632 struct btrfs_key key;
634 path = btrfs_alloc_path();
639 key.type = BTRFS_QGROUP_RELATION_KEY;
642 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
651 ret = btrfs_del_item(trans, quota_root, path);
653 btrfs_free_path(path);
657 static int add_qgroup_item(struct btrfs_trans_handle *trans,
658 struct btrfs_root *quota_root, u64 qgroupid)
661 struct btrfs_path *path;
662 struct btrfs_qgroup_info_item *qgroup_info;
663 struct btrfs_qgroup_limit_item *qgroup_limit;
664 struct extent_buffer *leaf;
665 struct btrfs_key key;
667 if (btrfs_is_testing(quota_root->fs_info))
670 path = btrfs_alloc_path();
675 key.type = BTRFS_QGROUP_INFO_KEY;
676 key.offset = qgroupid;
679 * Avoid a transaction abort by catching -EEXIST here. In that
680 * case, we proceed by re-initializing the existing structure
684 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
685 sizeof(*qgroup_info));
686 if (ret && ret != -EEXIST)
689 leaf = path->nodes[0];
690 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
691 struct btrfs_qgroup_info_item);
692 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
693 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
694 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
695 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
696 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
698 btrfs_mark_buffer_dirty(leaf);
700 btrfs_release_path(path);
702 key.type = BTRFS_QGROUP_LIMIT_KEY;
703 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
704 sizeof(*qgroup_limit));
705 if (ret && ret != -EEXIST)
708 leaf = path->nodes[0];
709 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
710 struct btrfs_qgroup_limit_item);
711 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
712 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
713 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
714 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
715 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
717 btrfs_mark_buffer_dirty(leaf);
721 btrfs_free_path(path);
725 static int del_qgroup_item(struct btrfs_trans_handle *trans, u64 qgroupid)
728 struct btrfs_root *quota_root = trans->fs_info->quota_root;
729 struct btrfs_path *path;
730 struct btrfs_key key;
732 path = btrfs_alloc_path();
737 key.type = BTRFS_QGROUP_INFO_KEY;
738 key.offset = qgroupid;
739 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
748 ret = btrfs_del_item(trans, quota_root, path);
752 btrfs_release_path(path);
754 key.type = BTRFS_QGROUP_LIMIT_KEY;
755 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
764 ret = btrfs_del_item(trans, quota_root, path);
767 btrfs_free_path(path);
771 static int update_qgroup_limit_item(struct btrfs_trans_handle *trans,
772 struct btrfs_qgroup *qgroup)
774 struct btrfs_root *quota_root = trans->fs_info->quota_root;
775 struct btrfs_path *path;
776 struct btrfs_key key;
777 struct extent_buffer *l;
778 struct btrfs_qgroup_limit_item *qgroup_limit;
783 key.type = BTRFS_QGROUP_LIMIT_KEY;
784 key.offset = qgroup->qgroupid;
786 path = btrfs_alloc_path();
790 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
798 slot = path->slots[0];
799 qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
800 btrfs_set_qgroup_limit_flags(l, qgroup_limit, qgroup->lim_flags);
801 btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, qgroup->max_rfer);
802 btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, qgroup->max_excl);
803 btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, qgroup->rsv_rfer);
804 btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, qgroup->rsv_excl);
806 btrfs_mark_buffer_dirty(l);
809 btrfs_free_path(path);
813 static int update_qgroup_info_item(struct btrfs_trans_handle *trans,
814 struct btrfs_qgroup *qgroup)
816 struct btrfs_fs_info *fs_info = trans->fs_info;
817 struct btrfs_root *quota_root = fs_info->quota_root;
818 struct btrfs_path *path;
819 struct btrfs_key key;
820 struct extent_buffer *l;
821 struct btrfs_qgroup_info_item *qgroup_info;
825 if (btrfs_is_testing(fs_info))
829 key.type = BTRFS_QGROUP_INFO_KEY;
830 key.offset = qgroup->qgroupid;
832 path = btrfs_alloc_path();
836 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
844 slot = path->slots[0];
845 qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
846 btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid);
847 btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer);
848 btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr);
849 btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl);
850 btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr);
852 btrfs_mark_buffer_dirty(l);
855 btrfs_free_path(path);
859 static int update_qgroup_status_item(struct btrfs_trans_handle *trans)
861 struct btrfs_fs_info *fs_info = trans->fs_info;
862 struct btrfs_root *quota_root = fs_info->quota_root;
863 struct btrfs_path *path;
864 struct btrfs_key key;
865 struct extent_buffer *l;
866 struct btrfs_qgroup_status_item *ptr;
871 key.type = BTRFS_QGROUP_STATUS_KEY;
874 path = btrfs_alloc_path();
878 ret = btrfs_search_slot(trans, quota_root, &key, path, 0, 1);
886 slot = path->slots[0];
887 ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
888 btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags &
889 BTRFS_QGROUP_STATUS_FLAGS_MASK);
890 btrfs_set_qgroup_status_generation(l, ptr, trans->transid);
891 btrfs_set_qgroup_status_rescan(l, ptr,
892 fs_info->qgroup_rescan_progress.objectid);
894 btrfs_mark_buffer_dirty(l);
897 btrfs_free_path(path);
902 * called with qgroup_lock held
904 static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans,
905 struct btrfs_root *root)
907 struct btrfs_path *path;
908 struct btrfs_key key;
909 struct extent_buffer *leaf = NULL;
913 path = btrfs_alloc_path();
922 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
925 leaf = path->nodes[0];
926 nr = btrfs_header_nritems(leaf);
930 * delete the leaf one by one
931 * since the whole tree is going
935 ret = btrfs_del_items(trans, root, path, 0, nr);
939 btrfs_release_path(path);
943 btrfs_free_path(path);
947 int btrfs_quota_enable(struct btrfs_fs_info *fs_info)
949 struct btrfs_root *quota_root;
950 struct btrfs_root *tree_root = fs_info->tree_root;
951 struct btrfs_path *path = NULL;
952 struct btrfs_qgroup_status_item *ptr;
953 struct extent_buffer *leaf;
954 struct btrfs_key key;
955 struct btrfs_key found_key;
956 struct btrfs_qgroup *qgroup = NULL;
957 struct btrfs_trans_handle *trans = NULL;
958 struct ulist *ulist = NULL;
963 * We need to have subvol_sem write locked, to prevent races between
964 * concurrent tasks trying to enable quotas, because we will unlock
965 * and relock qgroup_ioctl_lock before setting fs_info->quota_root
966 * and before setting BTRFS_FS_QUOTA_ENABLED.
968 lockdep_assert_held_write(&fs_info->subvol_sem);
970 if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2)) {
972 "qgroups are currently unsupported in extent tree v2");
976 mutex_lock(&fs_info->qgroup_ioctl_lock);
977 if (fs_info->quota_root)
980 ulist = ulist_alloc(GFP_KERNEL);
986 ret = btrfs_sysfs_add_qgroups(fs_info);
991 * Unlock qgroup_ioctl_lock before starting the transaction. This is to
992 * avoid lock acquisition inversion problems (reported by lockdep) between
993 * qgroup_ioctl_lock and the vfs freeze semaphores, acquired when we
994 * start a transaction.
995 * After we started the transaction lock qgroup_ioctl_lock again and
996 * check if someone else created the quota root in the meanwhile. If so,
997 * just return success and release the transaction handle.
999 * Also we don't need to worry about someone else calling
1000 * btrfs_sysfs_add_qgroups() after we unlock and getting an error because
1001 * that function returns 0 (success) when the sysfs entries already exist.
1003 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1006 * 1 for quota root item
1007 * 1 for BTRFS_QGROUP_STATUS item
1009 * Yet we also need 2*n items for a QGROUP_INFO/QGROUP_LIMIT items
1010 * per subvolume. However those are not currently reserved since it
1011 * would be a lot of overkill.
1013 trans = btrfs_start_transaction(tree_root, 2);
1015 mutex_lock(&fs_info->qgroup_ioctl_lock);
1016 if (IS_ERR(trans)) {
1017 ret = PTR_ERR(trans);
1022 if (fs_info->quota_root)
1025 fs_info->qgroup_ulist = ulist;
1029 * initially create the quota tree
1031 quota_root = btrfs_create_tree(trans, BTRFS_QUOTA_TREE_OBJECTID);
1032 if (IS_ERR(quota_root)) {
1033 ret = PTR_ERR(quota_root);
1034 btrfs_abort_transaction(trans, ret);
1038 path = btrfs_alloc_path();
1041 btrfs_abort_transaction(trans, ret);
1046 key.type = BTRFS_QGROUP_STATUS_KEY;
1049 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
1052 btrfs_abort_transaction(trans, ret);
1056 leaf = path->nodes[0];
1057 ptr = btrfs_item_ptr(leaf, path->slots[0],
1058 struct btrfs_qgroup_status_item);
1059 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
1060 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
1061 fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON |
1062 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1063 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags &
1064 BTRFS_QGROUP_STATUS_FLAGS_MASK);
1065 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
1067 btrfs_mark_buffer_dirty(leaf);
1070 key.type = BTRFS_ROOT_REF_KEY;
1073 btrfs_release_path(path);
1074 ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0);
1078 btrfs_abort_transaction(trans, ret);
1083 slot = path->slots[0];
1084 leaf = path->nodes[0];
1085 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1087 if (found_key.type == BTRFS_ROOT_REF_KEY) {
1089 /* Release locks on tree_root before we access quota_root */
1090 btrfs_release_path(path);
1092 ret = add_qgroup_item(trans, quota_root,
1095 btrfs_abort_transaction(trans, ret);
1099 qgroup = add_qgroup_rb(fs_info, found_key.offset);
1100 if (IS_ERR(qgroup)) {
1101 ret = PTR_ERR(qgroup);
1102 btrfs_abort_transaction(trans, ret);
1105 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1107 btrfs_abort_transaction(trans, ret);
1110 ret = btrfs_search_slot_for_read(tree_root, &found_key,
1113 btrfs_abort_transaction(trans, ret);
1118 * Shouldn't happen, but in case it does we
1119 * don't need to do the btrfs_next_item, just
1125 ret = btrfs_next_item(tree_root, path);
1127 btrfs_abort_transaction(trans, ret);
1135 btrfs_release_path(path);
1136 ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID);
1138 btrfs_abort_transaction(trans, ret);
1142 qgroup = add_qgroup_rb(fs_info, BTRFS_FS_TREE_OBJECTID);
1143 if (IS_ERR(qgroup)) {
1144 ret = PTR_ERR(qgroup);
1145 btrfs_abort_transaction(trans, ret);
1148 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1150 btrfs_abort_transaction(trans, ret);
1154 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1156 * Commit the transaction while not holding qgroup_ioctl_lock, to avoid
1157 * a deadlock with tasks concurrently doing other qgroup operations, such
1158 * adding/removing qgroups or adding/deleting qgroup relations for example,
1159 * because all qgroup operations first start or join a transaction and then
1160 * lock the qgroup_ioctl_lock mutex.
1161 * We are safe from a concurrent task trying to enable quotas, by calling
1162 * this function, since we are serialized by fs_info->subvol_sem.
1164 ret = btrfs_commit_transaction(trans);
1166 mutex_lock(&fs_info->qgroup_ioctl_lock);
1171 * Set quota enabled flag after committing the transaction, to avoid
1172 * deadlocks on fs_info->qgroup_ioctl_lock with concurrent snapshot
1175 spin_lock(&fs_info->qgroup_lock);
1176 fs_info->quota_root = quota_root;
1177 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1178 spin_unlock(&fs_info->qgroup_lock);
1180 ret = qgroup_rescan_init(fs_info, 0, 1);
1182 qgroup_rescan_zero_tracking(fs_info);
1183 fs_info->qgroup_rescan_running = true;
1184 btrfs_queue_work(fs_info->qgroup_rescan_workers,
1185 &fs_info->qgroup_rescan_work);
1188 * We have set both BTRFS_FS_QUOTA_ENABLED and
1189 * BTRFS_QGROUP_STATUS_FLAG_ON, so we can only fail with
1190 * -EINPROGRESS. That can happen because someone started the
1191 * rescan worker by calling quota rescan ioctl before we
1192 * attempted to initialize the rescan worker. Failure due to
1193 * quotas disabled in the meanwhile is not possible, because
1194 * we are holding a write lock on fs_info->subvol_sem, which
1195 * is also acquired when disabling quotas.
1196 * Ignore such error, and any other error would need to undo
1197 * everything we did in the transaction we just committed.
1199 ASSERT(ret == -EINPROGRESS);
1204 btrfs_free_path(path);
1207 btrfs_put_root(quota_root);
1210 ulist_free(fs_info->qgroup_ulist);
1211 fs_info->qgroup_ulist = NULL;
1212 btrfs_sysfs_del_qgroups(fs_info);
1214 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1216 btrfs_end_transaction(trans);
1218 ret = btrfs_end_transaction(trans);
1223 int btrfs_quota_disable(struct btrfs_fs_info *fs_info)
1225 struct btrfs_root *quota_root;
1226 struct btrfs_trans_handle *trans = NULL;
1230 * We need to have subvol_sem write locked, to prevent races between
1231 * concurrent tasks trying to disable quotas, because we will unlock
1232 * and relock qgroup_ioctl_lock across BTRFS_FS_QUOTA_ENABLED changes.
1234 lockdep_assert_held_write(&fs_info->subvol_sem);
1236 mutex_lock(&fs_info->qgroup_ioctl_lock);
1237 if (!fs_info->quota_root)
1241 * Unlock the qgroup_ioctl_lock mutex before waiting for the rescan worker to
1242 * complete. Otherwise we can deadlock because btrfs_remove_qgroup() needs
1243 * to lock that mutex while holding a transaction handle and the rescan
1244 * worker needs to commit a transaction.
1246 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1249 * Request qgroup rescan worker to complete and wait for it. This wait
1250 * must be done before transaction start for quota disable since it may
1251 * deadlock with transaction by the qgroup rescan worker.
1253 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1254 btrfs_qgroup_wait_for_completion(fs_info, false);
1257 * 1 For the root item
1259 * We should also reserve enough items for the quota tree deletion in
1260 * btrfs_clean_quota_tree but this is not done.
1262 * Also, we must always start a transaction without holding the mutex
1263 * qgroup_ioctl_lock, see btrfs_quota_enable().
1265 trans = btrfs_start_transaction(fs_info->tree_root, 1);
1267 mutex_lock(&fs_info->qgroup_ioctl_lock);
1268 if (IS_ERR(trans)) {
1269 ret = PTR_ERR(trans);
1271 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1275 if (!fs_info->quota_root)
1278 spin_lock(&fs_info->qgroup_lock);
1279 quota_root = fs_info->quota_root;
1280 fs_info->quota_root = NULL;
1281 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
1282 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL;
1283 spin_unlock(&fs_info->qgroup_lock);
1285 btrfs_free_qgroup_config(fs_info);
1287 ret = btrfs_clean_quota_tree(trans, quota_root);
1289 btrfs_abort_transaction(trans, ret);
1293 ret = btrfs_del_root(trans, "a_root->root_key);
1295 btrfs_abort_transaction(trans, ret);
1299 list_del("a_root->dirty_list);
1301 btrfs_tree_lock(quota_root->node);
1302 btrfs_clean_tree_block(quota_root->node);
1303 btrfs_tree_unlock(quota_root->node);
1304 btrfs_free_tree_block(trans, btrfs_root_id(quota_root),
1305 quota_root->node, 0, 1);
1307 btrfs_put_root(quota_root);
1310 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1312 btrfs_end_transaction(trans);
1314 ret = btrfs_end_transaction(trans);
1319 static void qgroup_dirty(struct btrfs_fs_info *fs_info,
1320 struct btrfs_qgroup *qgroup)
1322 if (list_empty(&qgroup->dirty))
1323 list_add(&qgroup->dirty, &fs_info->dirty_qgroups);
1327 * The easy accounting, we're updating qgroup relationship whose child qgroup
1328 * only has exclusive extents.
1330 * In this case, all exclusive extents will also be exclusive for parent, so
1331 * excl/rfer just get added/removed.
1333 * So is qgroup reservation space, which should also be added/removed to
1335 * Or when child tries to release reservation space, parent will underflow its
1336 * reservation (for relationship adding case).
1338 * Caller should hold fs_info->qgroup_lock.
1340 static int __qgroup_excl_accounting(struct btrfs_fs_info *fs_info,
1341 struct ulist *tmp, u64 ref_root,
1342 struct btrfs_qgroup *src, int sign)
1344 struct btrfs_qgroup *qgroup;
1345 struct btrfs_qgroup_list *glist;
1346 struct ulist_node *unode;
1347 struct ulist_iterator uiter;
1348 u64 num_bytes = src->excl;
1351 qgroup = find_qgroup_rb(fs_info, ref_root);
1355 qgroup->rfer += sign * num_bytes;
1356 qgroup->rfer_cmpr += sign * num_bytes;
1358 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1359 qgroup->excl += sign * num_bytes;
1360 qgroup->excl_cmpr += sign * num_bytes;
1363 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1365 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1367 qgroup_dirty(fs_info, qgroup);
1369 /* Get all of the parent groups that contain this qgroup */
1370 list_for_each_entry(glist, &qgroup->groups, next_group) {
1371 ret = ulist_add(tmp, glist->group->qgroupid,
1372 qgroup_to_aux(glist->group), GFP_ATOMIC);
1377 /* Iterate all of the parents and adjust their reference counts */
1378 ULIST_ITER_INIT(&uiter);
1379 while ((unode = ulist_next(tmp, &uiter))) {
1380 qgroup = unode_aux_to_qgroup(unode);
1381 qgroup->rfer += sign * num_bytes;
1382 qgroup->rfer_cmpr += sign * num_bytes;
1383 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1384 qgroup->excl += sign * num_bytes;
1386 qgroup_rsv_add_by_qgroup(fs_info, qgroup, src);
1388 qgroup_rsv_release_by_qgroup(fs_info, qgroup, src);
1389 qgroup->excl_cmpr += sign * num_bytes;
1390 qgroup_dirty(fs_info, qgroup);
1392 /* Add any parents of the parents */
1393 list_for_each_entry(glist, &qgroup->groups, next_group) {
1394 ret = ulist_add(tmp, glist->group->qgroupid,
1395 qgroup_to_aux(glist->group), GFP_ATOMIC);
1407 * Quick path for updating qgroup with only excl refs.
1409 * In that case, just update all parent will be enough.
1410 * Or we needs to do a full rescan.
1411 * Caller should also hold fs_info->qgroup_lock.
1413 * Return 0 for quick update, return >0 for need to full rescan
1414 * and mark INCONSISTENT flag.
1415 * Return < 0 for other error.
1417 static int quick_update_accounting(struct btrfs_fs_info *fs_info,
1418 struct ulist *tmp, u64 src, u64 dst,
1421 struct btrfs_qgroup *qgroup;
1425 qgroup = find_qgroup_rb(fs_info, src);
1428 if (qgroup->excl == qgroup->rfer) {
1430 err = __qgroup_excl_accounting(fs_info, tmp, dst,
1439 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1443 int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1446 struct btrfs_fs_info *fs_info = trans->fs_info;
1447 struct btrfs_qgroup *parent;
1448 struct btrfs_qgroup *member;
1449 struct btrfs_qgroup_list *list;
1451 unsigned int nofs_flag;
1454 /* Check the level of src and dst first */
1455 if (btrfs_qgroup_level(src) >= btrfs_qgroup_level(dst))
1458 /* We hold a transaction handle open, must do a NOFS allocation. */
1459 nofs_flag = memalloc_nofs_save();
1460 tmp = ulist_alloc(GFP_KERNEL);
1461 memalloc_nofs_restore(nofs_flag);
1465 mutex_lock(&fs_info->qgroup_ioctl_lock);
1466 if (!fs_info->quota_root) {
1470 member = find_qgroup_rb(fs_info, src);
1471 parent = find_qgroup_rb(fs_info, dst);
1472 if (!member || !parent) {
1477 /* check if such qgroup relation exist firstly */
1478 list_for_each_entry(list, &member->groups, next_group) {
1479 if (list->group == parent) {
1485 ret = add_qgroup_relation_item(trans, src, dst);
1489 ret = add_qgroup_relation_item(trans, dst, src);
1491 del_qgroup_relation_item(trans, src, dst);
1495 spin_lock(&fs_info->qgroup_lock);
1496 ret = __add_relation_rb(member, parent);
1498 spin_unlock(&fs_info->qgroup_lock);
1501 ret = quick_update_accounting(fs_info, tmp, src, dst, 1);
1502 spin_unlock(&fs_info->qgroup_lock);
1504 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1509 static int __del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1512 struct btrfs_fs_info *fs_info = trans->fs_info;
1513 struct btrfs_qgroup *parent;
1514 struct btrfs_qgroup *member;
1515 struct btrfs_qgroup_list *list;
1518 unsigned int nofs_flag;
1522 /* We hold a transaction handle open, must do a NOFS allocation. */
1523 nofs_flag = memalloc_nofs_save();
1524 tmp = ulist_alloc(GFP_KERNEL);
1525 memalloc_nofs_restore(nofs_flag);
1529 if (!fs_info->quota_root) {
1534 member = find_qgroup_rb(fs_info, src);
1535 parent = find_qgroup_rb(fs_info, dst);
1537 * The parent/member pair doesn't exist, then try to delete the dead
1538 * relation items only.
1540 if (!member || !parent)
1543 /* check if such qgroup relation exist firstly */
1544 list_for_each_entry(list, &member->groups, next_group) {
1545 if (list->group == parent) {
1552 ret = del_qgroup_relation_item(trans, src, dst);
1553 if (ret < 0 && ret != -ENOENT)
1555 ret2 = del_qgroup_relation_item(trans, dst, src);
1556 if (ret2 < 0 && ret2 != -ENOENT)
1559 /* At least one deletion succeeded, return 0 */
1564 spin_lock(&fs_info->qgroup_lock);
1565 del_relation_rb(fs_info, src, dst);
1566 ret = quick_update_accounting(fs_info, tmp, src, dst, -1);
1567 spin_unlock(&fs_info->qgroup_lock);
1574 int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans, u64 src,
1577 struct btrfs_fs_info *fs_info = trans->fs_info;
1580 mutex_lock(&fs_info->qgroup_ioctl_lock);
1581 ret = __del_qgroup_relation(trans, src, dst);
1582 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1587 int btrfs_create_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1589 struct btrfs_fs_info *fs_info = trans->fs_info;
1590 struct btrfs_root *quota_root;
1591 struct btrfs_qgroup *qgroup;
1594 mutex_lock(&fs_info->qgroup_ioctl_lock);
1595 if (!fs_info->quota_root) {
1599 quota_root = fs_info->quota_root;
1600 qgroup = find_qgroup_rb(fs_info, qgroupid);
1606 ret = add_qgroup_item(trans, quota_root, qgroupid);
1610 spin_lock(&fs_info->qgroup_lock);
1611 qgroup = add_qgroup_rb(fs_info, qgroupid);
1612 spin_unlock(&fs_info->qgroup_lock);
1614 if (IS_ERR(qgroup)) {
1615 ret = PTR_ERR(qgroup);
1618 ret = btrfs_sysfs_add_one_qgroup(fs_info, qgroup);
1620 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1624 int btrfs_remove_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid)
1626 struct btrfs_fs_info *fs_info = trans->fs_info;
1627 struct btrfs_qgroup *qgroup;
1628 struct btrfs_qgroup_list *list;
1631 mutex_lock(&fs_info->qgroup_ioctl_lock);
1632 if (!fs_info->quota_root) {
1637 qgroup = find_qgroup_rb(fs_info, qgroupid);
1643 /* Check if there are no children of this qgroup */
1644 if (!list_empty(&qgroup->members)) {
1649 ret = del_qgroup_item(trans, qgroupid);
1650 if (ret && ret != -ENOENT)
1653 while (!list_empty(&qgroup->groups)) {
1654 list = list_first_entry(&qgroup->groups,
1655 struct btrfs_qgroup_list, next_group);
1656 ret = __del_qgroup_relation(trans, qgroupid,
1657 list->group->qgroupid);
1662 spin_lock(&fs_info->qgroup_lock);
1663 del_qgroup_rb(fs_info, qgroupid);
1664 spin_unlock(&fs_info->qgroup_lock);
1667 * Remove the qgroup from sysfs now without holding the qgroup_lock
1668 * spinlock, since the sysfs_remove_group() function needs to take
1669 * the mutex kernfs_mutex through kernfs_remove_by_name_ns().
1671 btrfs_sysfs_del_one_qgroup(fs_info, qgroup);
1674 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1678 int btrfs_limit_qgroup(struct btrfs_trans_handle *trans, u64 qgroupid,
1679 struct btrfs_qgroup_limit *limit)
1681 struct btrfs_fs_info *fs_info = trans->fs_info;
1682 struct btrfs_qgroup *qgroup;
1684 /* Sometimes we would want to clear the limit on this qgroup.
1685 * To meet this requirement, we treat the -1 as a special value
1686 * which tell kernel to clear the limit on this qgroup.
1688 const u64 CLEAR_VALUE = -1;
1690 mutex_lock(&fs_info->qgroup_ioctl_lock);
1691 if (!fs_info->quota_root) {
1696 qgroup = find_qgroup_rb(fs_info, qgroupid);
1702 spin_lock(&fs_info->qgroup_lock);
1703 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_RFER) {
1704 if (limit->max_rfer == CLEAR_VALUE) {
1705 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1706 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1707 qgroup->max_rfer = 0;
1709 qgroup->max_rfer = limit->max_rfer;
1712 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) {
1713 if (limit->max_excl == CLEAR_VALUE) {
1714 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1715 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1716 qgroup->max_excl = 0;
1718 qgroup->max_excl = limit->max_excl;
1721 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_RFER) {
1722 if (limit->rsv_rfer == CLEAR_VALUE) {
1723 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1724 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1725 qgroup->rsv_rfer = 0;
1727 qgroup->rsv_rfer = limit->rsv_rfer;
1730 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_EXCL) {
1731 if (limit->rsv_excl == CLEAR_VALUE) {
1732 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1733 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1734 qgroup->rsv_excl = 0;
1736 qgroup->rsv_excl = limit->rsv_excl;
1739 qgroup->lim_flags |= limit->flags;
1741 spin_unlock(&fs_info->qgroup_lock);
1743 ret = update_qgroup_limit_item(trans, qgroup);
1745 qgroup_mark_inconsistent(fs_info);
1746 btrfs_info(fs_info, "unable to update quota limit for %llu",
1751 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1755 int btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info *fs_info,
1756 struct btrfs_delayed_ref_root *delayed_refs,
1757 struct btrfs_qgroup_extent_record *record)
1759 struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node;
1760 struct rb_node *parent_node = NULL;
1761 struct btrfs_qgroup_extent_record *entry;
1762 u64 bytenr = record->bytenr;
1764 lockdep_assert_held(&delayed_refs->lock);
1765 trace_btrfs_qgroup_trace_extent(fs_info, record);
1769 entry = rb_entry(parent_node, struct btrfs_qgroup_extent_record,
1771 if (bytenr < entry->bytenr) {
1773 } else if (bytenr > entry->bytenr) {
1774 p = &(*p)->rb_right;
1776 if (record->data_rsv && !entry->data_rsv) {
1777 entry->data_rsv = record->data_rsv;
1778 entry->data_rsv_refroot =
1779 record->data_rsv_refroot;
1785 rb_link_node(&record->node, parent_node, p);
1786 rb_insert_color(&record->node, &delayed_refs->dirty_extent_root);
1790 int btrfs_qgroup_trace_extent_post(struct btrfs_trans_handle *trans,
1791 struct btrfs_qgroup_extent_record *qrecord)
1793 struct ulist *old_root;
1794 u64 bytenr = qrecord->bytenr;
1798 * We are always called in a context where we are already holding a
1799 * transaction handle. Often we are called when adding a data delayed
1800 * reference from btrfs_truncate_inode_items() (truncating or unlinking),
1801 * in which case we will be holding a write lock on extent buffer from a
1802 * subvolume tree. In this case we can't allow btrfs_find_all_roots() to
1803 * acquire fs_info->commit_root_sem, because that is a higher level lock
1804 * that must be acquired before locking any extent buffers.
1806 * So we want btrfs_find_all_roots() to not acquire the commit_root_sem
1807 * but we can't pass it a non-NULL transaction handle, because otherwise
1808 * it would not use commit roots and would lock extent buffers, causing
1809 * a deadlock if it ends up trying to read lock the same extent buffer
1810 * that was previously write locked at btrfs_truncate_inode_items().
1812 * So pass a NULL transaction handle to btrfs_find_all_roots() and
1813 * explicitly tell it to not acquire the commit_root_sem - if we are
1814 * holding a transaction handle we don't need its protection.
1816 ASSERT(trans != NULL);
1818 if (trans->fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)
1821 ret = btrfs_find_all_roots(NULL, trans->fs_info, bytenr, 0, &old_root,
1824 qgroup_mark_inconsistent(trans->fs_info);
1825 btrfs_warn(trans->fs_info,
1826 "error accounting new delayed refs extent (err code: %d), quota inconsistent",
1832 * Here we don't need to get the lock of
1833 * trans->transaction->delayed_refs, since inserted qrecord won't
1834 * be deleted, only qrecord->node may be modified (new qrecord insert)
1836 * So modifying qrecord->old_roots is safe here
1838 qrecord->old_roots = old_root;
1842 int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans, u64 bytenr,
1843 u64 num_bytes, gfp_t gfp_flag)
1845 struct btrfs_fs_info *fs_info = trans->fs_info;
1846 struct btrfs_qgroup_extent_record *record;
1847 struct btrfs_delayed_ref_root *delayed_refs;
1850 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)
1851 || bytenr == 0 || num_bytes == 0)
1853 record = kzalloc(sizeof(*record), gfp_flag);
1857 delayed_refs = &trans->transaction->delayed_refs;
1858 record->bytenr = bytenr;
1859 record->num_bytes = num_bytes;
1860 record->old_roots = NULL;
1862 spin_lock(&delayed_refs->lock);
1863 ret = btrfs_qgroup_trace_extent_nolock(fs_info, delayed_refs, record);
1864 spin_unlock(&delayed_refs->lock);
1869 return btrfs_qgroup_trace_extent_post(trans, record);
1872 int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
1873 struct extent_buffer *eb)
1875 struct btrfs_fs_info *fs_info = trans->fs_info;
1876 int nr = btrfs_header_nritems(eb);
1877 int i, extent_type, ret;
1878 struct btrfs_key key;
1879 struct btrfs_file_extent_item *fi;
1880 u64 bytenr, num_bytes;
1882 /* We can be called directly from walk_up_proc() */
1883 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1886 for (i = 0; i < nr; i++) {
1887 btrfs_item_key_to_cpu(eb, &key, i);
1889 if (key.type != BTRFS_EXTENT_DATA_KEY)
1892 fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
1893 /* filter out non qgroup-accountable extents */
1894 extent_type = btrfs_file_extent_type(eb, fi);
1896 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
1899 bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
1903 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
1905 ret = btrfs_qgroup_trace_extent(trans, bytenr, num_bytes,
1915 * Walk up the tree from the bottom, freeing leaves and any interior
1916 * nodes which have had all slots visited. If a node (leaf or
1917 * interior) is freed, the node above it will have it's slot
1918 * incremented. The root node will never be freed.
1920 * At the end of this function, we should have a path which has all
1921 * slots incremented to the next position for a search. If we need to
1922 * read a new node it will be NULL and the node above it will have the
1923 * correct slot selected for a later read.
1925 * If we increment the root nodes slot counter past the number of
1926 * elements, 1 is returned to signal completion of the search.
1928 static int adjust_slots_upwards(struct btrfs_path *path, int root_level)
1932 struct extent_buffer *eb;
1934 if (root_level == 0)
1937 while (level <= root_level) {
1938 eb = path->nodes[level];
1939 nr = btrfs_header_nritems(eb);
1940 path->slots[level]++;
1941 slot = path->slots[level];
1942 if (slot >= nr || level == 0) {
1944 * Don't free the root - we will detect this
1945 * condition after our loop and return a
1946 * positive value for caller to stop walking the tree.
1948 if (level != root_level) {
1949 btrfs_tree_unlock_rw(eb, path->locks[level]);
1950 path->locks[level] = 0;
1952 free_extent_buffer(eb);
1953 path->nodes[level] = NULL;
1954 path->slots[level] = 0;
1958 * We have a valid slot to walk back down
1959 * from. Stop here so caller can process these
1968 eb = path->nodes[root_level];
1969 if (path->slots[root_level] >= btrfs_header_nritems(eb))
1976 * Helper function to trace a subtree tree block swap.
1978 * The swap will happen in highest tree block, but there may be a lot of
1979 * tree blocks involved.
1982 * OO = Old tree blocks
1983 * NN = New tree blocks allocated during balance
1985 * File tree (257) Reloc tree for 257
1988 * L1 OO OO (a) OO NN (a)
1990 * L0 OO OO OO OO OO OO NN NN
1993 * When calling qgroup_trace_extent_swap(), we will pass:
1995 * @dst_path = [ nodes[1] = NN(a), nodes[0] = NN(c) ]
1999 * In that case, qgroup_trace_extent_swap() will search from OO(a) to
2000 * reach OO(c), then mark both OO(c) and NN(c) as qgroup dirty.
2002 * The main work of qgroup_trace_extent_swap() can be split into 3 parts:
2004 * 1) Tree search from @src_eb
2005 * It should acts as a simplified btrfs_search_slot().
2006 * The key for search can be extracted from @dst_path->nodes[dst_level]
2009 * 2) Mark the final tree blocks in @src_path and @dst_path qgroup dirty
2010 * NOTE: In above case, OO(a) and NN(a) won't be marked qgroup dirty.
2011 * They should be marked during previous (@dst_level = 1) iteration.
2013 * 3) Mark file extents in leaves dirty
2014 * We don't have good way to pick out new file extents only.
2015 * So we still follow the old method by scanning all file extents in
2018 * This function can free us from keeping two paths, thus later we only need
2019 * to care about how to iterate all new tree blocks in reloc tree.
2021 static int qgroup_trace_extent_swap(struct btrfs_trans_handle* trans,
2022 struct extent_buffer *src_eb,
2023 struct btrfs_path *dst_path,
2024 int dst_level, int root_level,
2027 struct btrfs_key key;
2028 struct btrfs_path *src_path;
2029 struct btrfs_fs_info *fs_info = trans->fs_info;
2030 u32 nodesize = fs_info->nodesize;
2031 int cur_level = root_level;
2034 BUG_ON(dst_level > root_level);
2035 /* Level mismatch */
2036 if (btrfs_header_level(src_eb) != root_level)
2039 src_path = btrfs_alloc_path();
2046 btrfs_node_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2048 btrfs_item_key_to_cpu(dst_path->nodes[dst_level], &key, 0);
2051 atomic_inc(&src_eb->refs);
2052 src_path->nodes[root_level] = src_eb;
2053 src_path->slots[root_level] = dst_path->slots[root_level];
2054 src_path->locks[root_level] = 0;
2056 /* A simplified version of btrfs_search_slot() */
2057 while (cur_level >= dst_level) {
2058 struct btrfs_key src_key;
2059 struct btrfs_key dst_key;
2061 if (src_path->nodes[cur_level] == NULL) {
2062 struct extent_buffer *eb;
2065 eb = src_path->nodes[cur_level + 1];
2066 parent_slot = src_path->slots[cur_level + 1];
2068 eb = btrfs_read_node_slot(eb, parent_slot);
2074 src_path->nodes[cur_level] = eb;
2076 btrfs_tree_read_lock(eb);
2077 src_path->locks[cur_level] = BTRFS_READ_LOCK;
2080 src_path->slots[cur_level] = dst_path->slots[cur_level];
2082 btrfs_node_key_to_cpu(dst_path->nodes[cur_level],
2083 &dst_key, dst_path->slots[cur_level]);
2084 btrfs_node_key_to_cpu(src_path->nodes[cur_level],
2085 &src_key, src_path->slots[cur_level]);
2087 btrfs_item_key_to_cpu(dst_path->nodes[cur_level],
2088 &dst_key, dst_path->slots[cur_level]);
2089 btrfs_item_key_to_cpu(src_path->nodes[cur_level],
2090 &src_key, src_path->slots[cur_level]);
2092 /* Content mismatch, something went wrong */
2093 if (btrfs_comp_cpu_keys(&dst_key, &src_key)) {
2101 * Now both @dst_path and @src_path have been populated, record the tree
2102 * blocks for qgroup accounting.
2104 ret = btrfs_qgroup_trace_extent(trans, src_path->nodes[dst_level]->start,
2105 nodesize, GFP_NOFS);
2108 ret = btrfs_qgroup_trace_extent(trans,
2109 dst_path->nodes[dst_level]->start,
2110 nodesize, GFP_NOFS);
2114 /* Record leaf file extents */
2115 if (dst_level == 0 && trace_leaf) {
2116 ret = btrfs_qgroup_trace_leaf_items(trans, src_path->nodes[0]);
2119 ret = btrfs_qgroup_trace_leaf_items(trans, dst_path->nodes[0]);
2122 btrfs_free_path(src_path);
2127 * Helper function to do recursive generation-aware depth-first search, to
2128 * locate all new tree blocks in a subtree of reloc tree.
2130 * E.g. (OO = Old tree blocks, NN = New tree blocks, whose gen == last_snapshot)
2139 * @dst_path = [ nodes[1] = NN(b), nodes[0] = NULL ],
2143 * We will iterate through tree blocks NN(b), NN(d) and info qgroup to trace
2144 * above tree blocks along with their counter parts in file tree.
2145 * While during search, old tree blocks OO(c) will be skipped as tree block swap
2146 * won't affect OO(c).
2148 static int qgroup_trace_new_subtree_blocks(struct btrfs_trans_handle* trans,
2149 struct extent_buffer *src_eb,
2150 struct btrfs_path *dst_path,
2151 int cur_level, int root_level,
2152 u64 last_snapshot, bool trace_leaf)
2154 struct btrfs_fs_info *fs_info = trans->fs_info;
2155 struct extent_buffer *eb;
2156 bool need_cleanup = false;
2160 /* Level sanity check */
2161 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 ||
2162 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 ||
2163 root_level < cur_level) {
2164 btrfs_err_rl(fs_info,
2165 "%s: bad levels, cur_level=%d root_level=%d",
2166 __func__, cur_level, root_level);
2170 /* Read the tree block if needed */
2171 if (dst_path->nodes[cur_level] == NULL) {
2176 * dst_path->nodes[root_level] must be initialized before
2177 * calling this function.
2179 if (cur_level == root_level) {
2180 btrfs_err_rl(fs_info,
2181 "%s: dst_path->nodes[%d] not initialized, root_level=%d cur_level=%d",
2182 __func__, root_level, root_level, cur_level);
2187 * We need to get child blockptr/gen from parent before we can
2190 eb = dst_path->nodes[cur_level + 1];
2191 parent_slot = dst_path->slots[cur_level + 1];
2192 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
2194 /* This node is old, no need to trace */
2195 if (child_gen < last_snapshot)
2198 eb = btrfs_read_node_slot(eb, parent_slot);
2204 dst_path->nodes[cur_level] = eb;
2205 dst_path->slots[cur_level] = 0;
2207 btrfs_tree_read_lock(eb);
2208 dst_path->locks[cur_level] = BTRFS_READ_LOCK;
2209 need_cleanup = true;
2212 /* Now record this tree block and its counter part for qgroups */
2213 ret = qgroup_trace_extent_swap(trans, src_eb, dst_path, cur_level,
2214 root_level, trace_leaf);
2218 eb = dst_path->nodes[cur_level];
2220 if (cur_level > 0) {
2221 /* Iterate all child tree blocks */
2222 for (i = 0; i < btrfs_header_nritems(eb); i++) {
2223 /* Skip old tree blocks as they won't be swapped */
2224 if (btrfs_node_ptr_generation(eb, i) < last_snapshot)
2226 dst_path->slots[cur_level] = i;
2228 /* Recursive call (at most 7 times) */
2229 ret = qgroup_trace_new_subtree_blocks(trans, src_eb,
2230 dst_path, cur_level - 1, root_level,
2231 last_snapshot, trace_leaf);
2240 btrfs_tree_unlock_rw(dst_path->nodes[cur_level],
2241 dst_path->locks[cur_level]);
2242 free_extent_buffer(dst_path->nodes[cur_level]);
2243 dst_path->nodes[cur_level] = NULL;
2244 dst_path->slots[cur_level] = 0;
2245 dst_path->locks[cur_level] = 0;
2251 static int qgroup_trace_subtree_swap(struct btrfs_trans_handle *trans,
2252 struct extent_buffer *src_eb,
2253 struct extent_buffer *dst_eb,
2254 u64 last_snapshot, bool trace_leaf)
2256 struct btrfs_fs_info *fs_info = trans->fs_info;
2257 struct btrfs_path *dst_path = NULL;
2261 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2264 /* Wrong parameter order */
2265 if (btrfs_header_generation(src_eb) > btrfs_header_generation(dst_eb)) {
2266 btrfs_err_rl(fs_info,
2267 "%s: bad parameter order, src_gen=%llu dst_gen=%llu", __func__,
2268 btrfs_header_generation(src_eb),
2269 btrfs_header_generation(dst_eb));
2273 if (!extent_buffer_uptodate(src_eb) || !extent_buffer_uptodate(dst_eb)) {
2278 level = btrfs_header_level(dst_eb);
2279 dst_path = btrfs_alloc_path();
2285 atomic_inc(&dst_eb->refs);
2286 dst_path->nodes[level] = dst_eb;
2287 dst_path->slots[level] = 0;
2288 dst_path->locks[level] = 0;
2290 /* Do the generation aware breadth-first search */
2291 ret = qgroup_trace_new_subtree_blocks(trans, src_eb, dst_path, level,
2292 level, last_snapshot, trace_leaf);
2298 btrfs_free_path(dst_path);
2300 qgroup_mark_inconsistent(fs_info);
2304 int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
2305 struct extent_buffer *root_eb,
2306 u64 root_gen, int root_level)
2308 struct btrfs_fs_info *fs_info = trans->fs_info;
2311 u8 drop_subptree_thres;
2312 struct extent_buffer *eb = root_eb;
2313 struct btrfs_path *path = NULL;
2315 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL);
2316 BUG_ON(root_eb == NULL);
2318 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2321 spin_lock(&fs_info->qgroup_lock);
2322 drop_subptree_thres = fs_info->qgroup_drop_subtree_thres;
2323 spin_unlock(&fs_info->qgroup_lock);
2326 * This function only gets called for snapshot drop, if we hit a high
2327 * node here, it means we are going to change ownership for quite a lot
2328 * of extents, which will greatly slow down btrfs_commit_transaction().
2330 * So here if we find a high tree here, we just skip the accounting and
2331 * mark qgroup inconsistent.
2333 if (root_level >= drop_subptree_thres) {
2334 qgroup_mark_inconsistent(fs_info);
2338 if (!extent_buffer_uptodate(root_eb)) {
2339 ret = btrfs_read_extent_buffer(root_eb, root_gen, root_level, NULL);
2344 if (root_level == 0) {
2345 ret = btrfs_qgroup_trace_leaf_items(trans, root_eb);
2349 path = btrfs_alloc_path();
2354 * Walk down the tree. Missing extent blocks are filled in as
2355 * we go. Metadata is accounted every time we read a new
2358 * When we reach a leaf, we account for file extent items in it,
2359 * walk back up the tree (adjusting slot pointers as we go)
2360 * and restart the search process.
2362 atomic_inc(&root_eb->refs); /* For path */
2363 path->nodes[root_level] = root_eb;
2364 path->slots[root_level] = 0;
2365 path->locks[root_level] = 0; /* so release_path doesn't try to unlock */
2368 while (level >= 0) {
2369 if (path->nodes[level] == NULL) {
2374 * We need to get child blockptr from parent before we
2377 eb = path->nodes[level + 1];
2378 parent_slot = path->slots[level + 1];
2379 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
2381 eb = btrfs_read_node_slot(eb, parent_slot);
2387 path->nodes[level] = eb;
2388 path->slots[level] = 0;
2390 btrfs_tree_read_lock(eb);
2391 path->locks[level] = BTRFS_READ_LOCK;
2393 ret = btrfs_qgroup_trace_extent(trans, child_bytenr,
2401 ret = btrfs_qgroup_trace_leaf_items(trans,
2402 path->nodes[level]);
2406 /* Nonzero return here means we completed our search */
2407 ret = adjust_slots_upwards(path, root_level);
2411 /* Restart search with new slots */
2420 btrfs_free_path(path);
2425 #define UPDATE_NEW 0
2426 #define UPDATE_OLD 1
2428 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2430 static int qgroup_update_refcnt(struct btrfs_fs_info *fs_info,
2431 struct ulist *roots, struct ulist *tmp,
2432 struct ulist *qgroups, u64 seq, int update_old)
2434 struct ulist_node *unode;
2435 struct ulist_iterator uiter;
2436 struct ulist_node *tmp_unode;
2437 struct ulist_iterator tmp_uiter;
2438 struct btrfs_qgroup *qg;
2443 ULIST_ITER_INIT(&uiter);
2444 while ((unode = ulist_next(roots, &uiter))) {
2445 qg = find_qgroup_rb(fs_info, unode->val);
2450 ret = ulist_add(qgroups, qg->qgroupid, qgroup_to_aux(qg),
2454 ret = ulist_add(tmp, qg->qgroupid, qgroup_to_aux(qg), GFP_ATOMIC);
2457 ULIST_ITER_INIT(&tmp_uiter);
2458 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) {
2459 struct btrfs_qgroup_list *glist;
2461 qg = unode_aux_to_qgroup(tmp_unode);
2463 btrfs_qgroup_update_old_refcnt(qg, seq, 1);
2465 btrfs_qgroup_update_new_refcnt(qg, seq, 1);
2466 list_for_each_entry(glist, &qg->groups, next_group) {
2467 ret = ulist_add(qgroups, glist->group->qgroupid,
2468 qgroup_to_aux(glist->group),
2472 ret = ulist_add(tmp, glist->group->qgroupid,
2473 qgroup_to_aux(glist->group),
2484 * Update qgroup rfer/excl counters.
2485 * Rfer update is easy, codes can explain themselves.
2487 * Excl update is tricky, the update is split into 2 parts.
2488 * Part 1: Possible exclusive <-> sharing detect:
2490 * -------------------------------------
2492 * -------------------------------------
2494 * -------------------------------------
2497 * A: cur_old_roots < nr_old_roots (not exclusive before)
2498 * !A: cur_old_roots == nr_old_roots (possible exclusive before)
2499 * B: cur_new_roots < nr_new_roots (not exclusive now)
2500 * !B: cur_new_roots == nr_new_roots (possible exclusive now)
2503 * +: Possible sharing -> exclusive -: Possible exclusive -> sharing
2504 * *: Definitely not changed. **: Possible unchanged.
2506 * For !A and !B condition, the exception is cur_old/new_roots == 0 case.
2508 * To make the logic clear, we first use condition A and B to split
2509 * combination into 4 results.
2511 * Then, for result "+" and "-", check old/new_roots == 0 case, as in them
2512 * only on variant maybe 0.
2514 * Lastly, check result **, since there are 2 variants maybe 0, split them
2516 * But this time we don't need to consider other things, the codes and logic
2517 * is easy to understand now.
2519 static int qgroup_update_counters(struct btrfs_fs_info *fs_info,
2520 struct ulist *qgroups,
2523 u64 num_bytes, u64 seq)
2525 struct ulist_node *unode;
2526 struct ulist_iterator uiter;
2527 struct btrfs_qgroup *qg;
2528 u64 cur_new_count, cur_old_count;
2530 ULIST_ITER_INIT(&uiter);
2531 while ((unode = ulist_next(qgroups, &uiter))) {
2534 qg = unode_aux_to_qgroup(unode);
2535 cur_old_count = btrfs_qgroup_get_old_refcnt(qg, seq);
2536 cur_new_count = btrfs_qgroup_get_new_refcnt(qg, seq);
2538 trace_qgroup_update_counters(fs_info, qg, cur_old_count,
2541 /* Rfer update part */
2542 if (cur_old_count == 0 && cur_new_count > 0) {
2543 qg->rfer += num_bytes;
2544 qg->rfer_cmpr += num_bytes;
2547 if (cur_old_count > 0 && cur_new_count == 0) {
2548 qg->rfer -= num_bytes;
2549 qg->rfer_cmpr -= num_bytes;
2553 /* Excl update part */
2554 /* Exclusive/none -> shared case */
2555 if (cur_old_count == nr_old_roots &&
2556 cur_new_count < nr_new_roots) {
2557 /* Exclusive -> shared */
2558 if (cur_old_count != 0) {
2559 qg->excl -= num_bytes;
2560 qg->excl_cmpr -= num_bytes;
2565 /* Shared -> exclusive/none case */
2566 if (cur_old_count < nr_old_roots &&
2567 cur_new_count == nr_new_roots) {
2568 /* Shared->exclusive */
2569 if (cur_new_count != 0) {
2570 qg->excl += num_bytes;
2571 qg->excl_cmpr += num_bytes;
2576 /* Exclusive/none -> exclusive/none case */
2577 if (cur_old_count == nr_old_roots &&
2578 cur_new_count == nr_new_roots) {
2579 if (cur_old_count == 0) {
2580 /* None -> exclusive/none */
2582 if (cur_new_count != 0) {
2583 /* None -> exclusive */
2584 qg->excl += num_bytes;
2585 qg->excl_cmpr += num_bytes;
2588 /* None -> none, nothing changed */
2590 /* Exclusive -> exclusive/none */
2592 if (cur_new_count == 0) {
2593 /* Exclusive -> none */
2594 qg->excl -= num_bytes;
2595 qg->excl_cmpr -= num_bytes;
2598 /* Exclusive -> exclusive, nothing changed */
2603 qgroup_dirty(fs_info, qg);
2609 * Check if the @roots potentially is a list of fs tree roots
2611 * Return 0 for definitely not a fs/subvol tree roots ulist
2612 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2615 static int maybe_fs_roots(struct ulist *roots)
2617 struct ulist_node *unode;
2618 struct ulist_iterator uiter;
2620 /* Empty one, still possible for fs roots */
2621 if (!roots || roots->nnodes == 0)
2624 ULIST_ITER_INIT(&uiter);
2625 unode = ulist_next(roots, &uiter);
2630 * If it contains fs tree roots, then it must belong to fs/subvol
2632 * If it contains a non-fs tree, it won't be shared with fs/subvol trees.
2634 return is_fstree(unode->val);
2637 int btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans, u64 bytenr,
2638 u64 num_bytes, struct ulist *old_roots,
2639 struct ulist *new_roots)
2641 struct btrfs_fs_info *fs_info = trans->fs_info;
2642 struct ulist *qgroups = NULL;
2643 struct ulist *tmp = NULL;
2645 u64 nr_new_roots = 0;
2646 u64 nr_old_roots = 0;
2650 * If quotas get disabled meanwhile, the resources need to be freed and
2651 * we can't just exit here.
2653 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
2654 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)
2658 if (!maybe_fs_roots(new_roots))
2660 nr_new_roots = new_roots->nnodes;
2663 if (!maybe_fs_roots(old_roots))
2665 nr_old_roots = old_roots->nnodes;
2668 /* Quick exit, either not fs tree roots, or won't affect any qgroup */
2669 if (nr_old_roots == 0 && nr_new_roots == 0)
2672 BUG_ON(!fs_info->quota_root);
2674 trace_btrfs_qgroup_account_extent(fs_info, trans->transid, bytenr,
2675 num_bytes, nr_old_roots, nr_new_roots);
2677 qgroups = ulist_alloc(GFP_NOFS);
2682 tmp = ulist_alloc(GFP_NOFS);
2688 mutex_lock(&fs_info->qgroup_rescan_lock);
2689 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
2690 if (fs_info->qgroup_rescan_progress.objectid <= bytenr) {
2691 mutex_unlock(&fs_info->qgroup_rescan_lock);
2696 mutex_unlock(&fs_info->qgroup_rescan_lock);
2698 spin_lock(&fs_info->qgroup_lock);
2699 seq = fs_info->qgroup_seq;
2701 /* Update old refcnts using old_roots */
2702 ret = qgroup_update_refcnt(fs_info, old_roots, tmp, qgroups, seq,
2707 /* Update new refcnts using new_roots */
2708 ret = qgroup_update_refcnt(fs_info, new_roots, tmp, qgroups, seq,
2713 qgroup_update_counters(fs_info, qgroups, nr_old_roots, nr_new_roots,
2717 * Bump qgroup_seq to avoid seq overlap
2719 fs_info->qgroup_seq += max(nr_old_roots, nr_new_roots) + 1;
2721 spin_unlock(&fs_info->qgroup_lock);
2724 ulist_free(qgroups);
2725 ulist_free(old_roots);
2726 ulist_free(new_roots);
2730 int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans)
2732 struct btrfs_fs_info *fs_info = trans->fs_info;
2733 struct btrfs_qgroup_extent_record *record;
2734 struct btrfs_delayed_ref_root *delayed_refs;
2735 struct ulist *new_roots = NULL;
2736 struct rb_node *node;
2737 u64 num_dirty_extents = 0;
2741 delayed_refs = &trans->transaction->delayed_refs;
2742 qgroup_to_skip = delayed_refs->qgroup_to_skip;
2743 while ((node = rb_first(&delayed_refs->dirty_extent_root))) {
2744 record = rb_entry(node, struct btrfs_qgroup_extent_record,
2747 num_dirty_extents++;
2748 trace_btrfs_qgroup_account_extents(fs_info, record);
2750 if (!ret && !(fs_info->qgroup_flags &
2751 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING)) {
2753 * Old roots should be searched when inserting qgroup
2756 if (WARN_ON(!record->old_roots)) {
2757 /* Search commit root to find old_roots */
2758 ret = btrfs_find_all_roots(NULL, fs_info,
2760 &record->old_roots, false);
2765 /* Free the reserved data space */
2766 btrfs_qgroup_free_refroot(fs_info,
2767 record->data_rsv_refroot,
2769 BTRFS_QGROUP_RSV_DATA);
2771 * Use BTRFS_SEQ_LAST as time_seq to do special search,
2772 * which doesn't lock tree or delayed_refs and search
2773 * current root. It's safe inside commit_transaction().
2775 ret = btrfs_find_all_roots(trans, fs_info,
2776 record->bytenr, BTRFS_SEQ_LAST, &new_roots, false);
2779 if (qgroup_to_skip) {
2780 ulist_del(new_roots, qgroup_to_skip, 0);
2781 ulist_del(record->old_roots, qgroup_to_skip,
2784 ret = btrfs_qgroup_account_extent(trans, record->bytenr,
2788 record->old_roots = NULL;
2792 ulist_free(record->old_roots);
2793 ulist_free(new_roots);
2795 rb_erase(node, &delayed_refs->dirty_extent_root);
2799 trace_qgroup_num_dirty_extents(fs_info, trans->transid,
2805 * called from commit_transaction. Writes all changed qgroups to disk.
2807 int btrfs_run_qgroups(struct btrfs_trans_handle *trans)
2809 struct btrfs_fs_info *fs_info = trans->fs_info;
2812 if (!fs_info->quota_root)
2815 spin_lock(&fs_info->qgroup_lock);
2816 while (!list_empty(&fs_info->dirty_qgroups)) {
2817 struct btrfs_qgroup *qgroup;
2818 qgroup = list_first_entry(&fs_info->dirty_qgroups,
2819 struct btrfs_qgroup, dirty);
2820 list_del_init(&qgroup->dirty);
2821 spin_unlock(&fs_info->qgroup_lock);
2822 ret = update_qgroup_info_item(trans, qgroup);
2824 qgroup_mark_inconsistent(fs_info);
2825 ret = update_qgroup_limit_item(trans, qgroup);
2827 qgroup_mark_inconsistent(fs_info);
2828 spin_lock(&fs_info->qgroup_lock);
2830 if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2831 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON;
2833 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
2834 spin_unlock(&fs_info->qgroup_lock);
2836 ret = update_qgroup_status_item(trans);
2838 qgroup_mark_inconsistent(fs_info);
2844 * Copy the accounting information between qgroups. This is necessary
2845 * when a snapshot or a subvolume is created. Throwing an error will
2846 * cause a transaction abort so we take extra care here to only error
2847 * when a readonly fs is a reasonable outcome.
2849 int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans, u64 srcid,
2850 u64 objectid, struct btrfs_qgroup_inherit *inherit)
2855 bool committing = false;
2856 struct btrfs_fs_info *fs_info = trans->fs_info;
2857 struct btrfs_root *quota_root;
2858 struct btrfs_qgroup *srcgroup;
2859 struct btrfs_qgroup *dstgroup;
2860 bool need_rescan = false;
2865 * There are only two callers of this function.
2867 * One in create_subvol() in the ioctl context, which needs to hold
2868 * the qgroup_ioctl_lock.
2870 * The other one in create_pending_snapshot() where no other qgroup
2871 * code can modify the fs as they all need to either start a new trans
2872 * or hold a trans handler, thus we don't need to hold
2873 * qgroup_ioctl_lock.
2874 * This would avoid long and complex lock chain and make lockdep happy.
2876 spin_lock(&fs_info->trans_lock);
2877 if (trans->transaction->state == TRANS_STATE_COMMIT_DOING)
2879 spin_unlock(&fs_info->trans_lock);
2882 mutex_lock(&fs_info->qgroup_ioctl_lock);
2883 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2886 quota_root = fs_info->quota_root;
2893 i_qgroups = (u64 *)(inherit + 1);
2894 nums = inherit->num_qgroups + 2 * inherit->num_ref_copies +
2895 2 * inherit->num_excl_copies;
2896 for (i = 0; i < nums; ++i) {
2897 srcgroup = find_qgroup_rb(fs_info, *i_qgroups);
2900 * Zero out invalid groups so we can ignore
2904 ((srcgroup->qgroupid >> 48) <= (objectid >> 48)))
2912 * create a tracking group for the subvol itself
2914 ret = add_qgroup_item(trans, quota_root, objectid);
2919 * add qgroup to all inherited groups
2922 i_qgroups = (u64 *)(inherit + 1);
2923 for (i = 0; i < inherit->num_qgroups; ++i, ++i_qgroups) {
2924 if (*i_qgroups == 0)
2926 ret = add_qgroup_relation_item(trans, objectid,
2928 if (ret && ret != -EEXIST)
2930 ret = add_qgroup_relation_item(trans, *i_qgroups,
2932 if (ret && ret != -EEXIST)
2939 spin_lock(&fs_info->qgroup_lock);
2941 dstgroup = add_qgroup_rb(fs_info, objectid);
2942 if (IS_ERR(dstgroup)) {
2943 ret = PTR_ERR(dstgroup);
2947 if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) {
2948 dstgroup->lim_flags = inherit->lim.flags;
2949 dstgroup->max_rfer = inherit->lim.max_rfer;
2950 dstgroup->max_excl = inherit->lim.max_excl;
2951 dstgroup->rsv_rfer = inherit->lim.rsv_rfer;
2952 dstgroup->rsv_excl = inherit->lim.rsv_excl;
2954 qgroup_dirty(fs_info, dstgroup);
2958 srcgroup = find_qgroup_rb(fs_info, srcid);
2963 * We call inherit after we clone the root in order to make sure
2964 * our counts don't go crazy, so at this point the only
2965 * difference between the two roots should be the root node.
2967 level_size = fs_info->nodesize;
2968 dstgroup->rfer = srcgroup->rfer;
2969 dstgroup->rfer_cmpr = srcgroup->rfer_cmpr;
2970 dstgroup->excl = level_size;
2971 dstgroup->excl_cmpr = level_size;
2972 srcgroup->excl = level_size;
2973 srcgroup->excl_cmpr = level_size;
2975 /* inherit the limit info */
2976 dstgroup->lim_flags = srcgroup->lim_flags;
2977 dstgroup->max_rfer = srcgroup->max_rfer;
2978 dstgroup->max_excl = srcgroup->max_excl;
2979 dstgroup->rsv_rfer = srcgroup->rsv_rfer;
2980 dstgroup->rsv_excl = srcgroup->rsv_excl;
2982 qgroup_dirty(fs_info, dstgroup);
2983 qgroup_dirty(fs_info, srcgroup);
2989 i_qgroups = (u64 *)(inherit + 1);
2990 for (i = 0; i < inherit->num_qgroups; ++i) {
2992 ret = add_relation_rb(fs_info, objectid, *i_qgroups);
2999 * If we're doing a snapshot, and adding the snapshot to a new
3000 * qgroup, the numbers are guaranteed to be incorrect.
3006 for (i = 0; i < inherit->num_ref_copies; ++i, i_qgroups += 2) {
3007 struct btrfs_qgroup *src;
3008 struct btrfs_qgroup *dst;
3010 if (!i_qgroups[0] || !i_qgroups[1])
3013 src = find_qgroup_rb(fs_info, i_qgroups[0]);
3014 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
3021 dst->rfer = src->rfer - level_size;
3022 dst->rfer_cmpr = src->rfer_cmpr - level_size;
3024 /* Manually tweaking numbers certainly needs a rescan */
3027 for (i = 0; i < inherit->num_excl_copies; ++i, i_qgroups += 2) {
3028 struct btrfs_qgroup *src;
3029 struct btrfs_qgroup *dst;
3031 if (!i_qgroups[0] || !i_qgroups[1])
3034 src = find_qgroup_rb(fs_info, i_qgroups[0]);
3035 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
3042 dst->excl = src->excl + level_size;
3043 dst->excl_cmpr = src->excl_cmpr + level_size;
3048 spin_unlock(&fs_info->qgroup_lock);
3050 ret = btrfs_sysfs_add_one_qgroup(fs_info, dstgroup);
3053 mutex_unlock(&fs_info->qgroup_ioctl_lock);
3055 qgroup_mark_inconsistent(fs_info);
3059 static bool qgroup_check_limits(const struct btrfs_qgroup *qg, u64 num_bytes)
3061 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) &&
3062 qgroup_rsv_total(qg) + (s64)qg->rfer + num_bytes > qg->max_rfer)
3065 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) &&
3066 qgroup_rsv_total(qg) + (s64)qg->excl + num_bytes > qg->max_excl)
3072 static int qgroup_reserve(struct btrfs_root *root, u64 num_bytes, bool enforce,
3073 enum btrfs_qgroup_rsv_type type)
3075 struct btrfs_qgroup *qgroup;
3076 struct btrfs_fs_info *fs_info = root->fs_info;
3077 u64 ref_root = root->root_key.objectid;
3079 struct ulist_node *unode;
3080 struct ulist_iterator uiter;
3082 if (!is_fstree(ref_root))
3088 if (test_bit(BTRFS_FS_QUOTA_OVERRIDE, &fs_info->flags) &&
3089 capable(CAP_SYS_RESOURCE))
3092 spin_lock(&fs_info->qgroup_lock);
3093 if (!fs_info->quota_root)
3096 qgroup = find_qgroup_rb(fs_info, ref_root);
3101 * in a first step, we check all affected qgroups if any limits would
3104 ulist_reinit(fs_info->qgroup_ulist);
3105 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
3106 qgroup_to_aux(qgroup), GFP_ATOMIC);
3109 ULIST_ITER_INIT(&uiter);
3110 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3111 struct btrfs_qgroup *qg;
3112 struct btrfs_qgroup_list *glist;
3114 qg = unode_aux_to_qgroup(unode);
3116 if (enforce && !qgroup_check_limits(qg, num_bytes)) {
3121 list_for_each_entry(glist, &qg->groups, next_group) {
3122 ret = ulist_add(fs_info->qgroup_ulist,
3123 glist->group->qgroupid,
3124 qgroup_to_aux(glist->group), GFP_ATOMIC);
3131 * no limits exceeded, now record the reservation into all qgroups
3133 ULIST_ITER_INIT(&uiter);
3134 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3135 struct btrfs_qgroup *qg;
3137 qg = unode_aux_to_qgroup(unode);
3139 qgroup_rsv_add(fs_info, qg, num_bytes, type);
3143 spin_unlock(&fs_info->qgroup_lock);
3148 * Free @num_bytes of reserved space with @type for qgroup. (Normally level 0
3151 * Will handle all higher level qgroup too.
3153 * NOTE: If @num_bytes is (u64)-1, this means to free all bytes of this qgroup.
3154 * This special case is only used for META_PERTRANS type.
3156 void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
3157 u64 ref_root, u64 num_bytes,
3158 enum btrfs_qgroup_rsv_type type)
3160 struct btrfs_qgroup *qgroup;
3161 struct ulist_node *unode;
3162 struct ulist_iterator uiter;
3165 if (!is_fstree(ref_root))
3171 if (num_bytes == (u64)-1 && type != BTRFS_QGROUP_RSV_META_PERTRANS) {
3172 WARN(1, "%s: Invalid type to free", __func__);
3175 spin_lock(&fs_info->qgroup_lock);
3177 if (!fs_info->quota_root)
3180 qgroup = find_qgroup_rb(fs_info, ref_root);
3184 if (num_bytes == (u64)-1)
3186 * We're freeing all pertrans rsv, get reserved value from
3187 * level 0 qgroup as real num_bytes to free.
3189 num_bytes = qgroup->rsv.values[type];
3191 ulist_reinit(fs_info->qgroup_ulist);
3192 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
3193 qgroup_to_aux(qgroup), GFP_ATOMIC);
3196 ULIST_ITER_INIT(&uiter);
3197 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
3198 struct btrfs_qgroup *qg;
3199 struct btrfs_qgroup_list *glist;
3201 qg = unode_aux_to_qgroup(unode);
3203 qgroup_rsv_release(fs_info, qg, num_bytes, type);
3205 list_for_each_entry(glist, &qg->groups, next_group) {
3206 ret = ulist_add(fs_info->qgroup_ulist,
3207 glist->group->qgroupid,
3208 qgroup_to_aux(glist->group), GFP_ATOMIC);
3215 spin_unlock(&fs_info->qgroup_lock);
3219 * Check if the leaf is the last leaf. Which means all node pointers
3220 * are at their last position.
3222 static bool is_last_leaf(struct btrfs_path *path)
3226 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
3227 if (path->slots[i] != btrfs_header_nritems(path->nodes[i]) - 1)
3234 * returns < 0 on error, 0 when more leafs are to be scanned.
3235 * returns 1 when done.
3237 static int qgroup_rescan_leaf(struct btrfs_trans_handle *trans,
3238 struct btrfs_path *path)
3240 struct btrfs_fs_info *fs_info = trans->fs_info;
3241 struct btrfs_root *extent_root;
3242 struct btrfs_key found;
3243 struct extent_buffer *scratch_leaf = NULL;
3244 struct ulist *roots = NULL;
3250 mutex_lock(&fs_info->qgroup_rescan_lock);
3251 extent_root = btrfs_extent_root(fs_info,
3252 fs_info->qgroup_rescan_progress.objectid);
3253 ret = btrfs_search_slot_for_read(extent_root,
3254 &fs_info->qgroup_rescan_progress,
3257 btrfs_debug(fs_info,
3258 "current progress key (%llu %u %llu), search_slot ret %d",
3259 fs_info->qgroup_rescan_progress.objectid,
3260 fs_info->qgroup_rescan_progress.type,
3261 fs_info->qgroup_rescan_progress.offset, ret);
3265 * The rescan is about to end, we will not be scanning any
3266 * further blocks. We cannot unset the RESCAN flag here, because
3267 * we want to commit the transaction if everything went well.
3268 * To make the live accounting work in this phase, we set our
3269 * scan progress pointer such that every real extent objectid
3272 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3273 btrfs_release_path(path);
3274 mutex_unlock(&fs_info->qgroup_rescan_lock);
3277 done = is_last_leaf(path);
3279 btrfs_item_key_to_cpu(path->nodes[0], &found,
3280 btrfs_header_nritems(path->nodes[0]) - 1);
3281 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1;
3283 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);
3284 if (!scratch_leaf) {
3286 mutex_unlock(&fs_info->qgroup_rescan_lock);
3289 slot = path->slots[0];
3290 btrfs_release_path(path);
3291 mutex_unlock(&fs_info->qgroup_rescan_lock);
3293 for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
3294 btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
3295 if (found.type != BTRFS_EXTENT_ITEM_KEY &&
3296 found.type != BTRFS_METADATA_ITEM_KEY)
3298 if (found.type == BTRFS_METADATA_ITEM_KEY)
3299 num_bytes = fs_info->nodesize;
3301 num_bytes = found.offset;
3303 ret = btrfs_find_all_roots(NULL, fs_info, found.objectid, 0,
3307 /* For rescan, just pass old_roots as NULL */
3308 ret = btrfs_qgroup_account_extent(trans, found.objectid,
3309 num_bytes, NULL, roots);
3315 free_extent_buffer(scratch_leaf);
3319 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
3324 static bool rescan_should_stop(struct btrfs_fs_info *fs_info)
3326 return btrfs_fs_closing(fs_info) ||
3327 test_bit(BTRFS_FS_STATE_REMOUNTING, &fs_info->fs_state) ||
3328 !test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3329 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN;
3332 static void btrfs_qgroup_rescan_worker(struct btrfs_work *work)
3334 struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info,
3335 qgroup_rescan_work);
3336 struct btrfs_path *path;
3337 struct btrfs_trans_handle *trans = NULL;
3340 bool stopped = false;
3342 path = btrfs_alloc_path();
3346 * Rescan should only search for commit root, and any later difference
3347 * should be recorded by qgroup
3349 path->search_commit_root = 1;
3350 path->skip_locking = 1;
3353 while (!err && !(stopped = rescan_should_stop(fs_info))) {
3354 trans = btrfs_start_transaction(fs_info->fs_root, 0);
3355 if (IS_ERR(trans)) {
3356 err = PTR_ERR(trans);
3360 err = qgroup_rescan_leaf(trans, path);
3363 btrfs_commit_transaction(trans);
3365 btrfs_end_transaction(trans);
3369 btrfs_free_path(path);
3371 mutex_lock(&fs_info->qgroup_rescan_lock);
3373 fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) {
3374 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3375 } else if (err < 0 || stopped) {
3376 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
3378 mutex_unlock(&fs_info->qgroup_rescan_lock);
3381 * only update status, since the previous part has already updated the
3384 trans = btrfs_start_transaction(fs_info->quota_root, 1);
3385 if (IS_ERR(trans)) {
3386 err = PTR_ERR(trans);
3389 "fail to start transaction for status update: %d",
3393 mutex_lock(&fs_info->qgroup_rescan_lock);
3395 fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN)
3396 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3398 ret = update_qgroup_status_item(trans);
3401 btrfs_err(fs_info, "fail to update qgroup status: %d",
3405 fs_info->qgroup_rescan_running = false;
3406 fs_info->qgroup_flags &= ~BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN;
3407 complete_all(&fs_info->qgroup_rescan_completion);
3408 mutex_unlock(&fs_info->qgroup_rescan_lock);
3413 btrfs_end_transaction(trans);
3416 btrfs_info(fs_info, "qgroup scan paused");
3417 } else if (fs_info->qgroup_flags & BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN) {
3418 btrfs_info(fs_info, "qgroup scan cancelled");
3419 } else if (err >= 0) {
3420 btrfs_info(fs_info, "qgroup scan completed%s",
3421 err > 0 ? " (inconsistency flag cleared)" : "");
3423 btrfs_err(fs_info, "qgroup scan failed with %d", err);
3428 * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all
3429 * memory required for the rescan context.
3432 qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
3438 /* we're resuming qgroup rescan at mount time */
3439 if (!(fs_info->qgroup_flags &
3440 BTRFS_QGROUP_STATUS_FLAG_RESCAN)) {
3442 "qgroup rescan init failed, qgroup rescan is not queued");
3444 } else if (!(fs_info->qgroup_flags &
3445 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3447 "qgroup rescan init failed, qgroup is not enabled");
3455 mutex_lock(&fs_info->qgroup_rescan_lock);
3458 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
3460 "qgroup rescan is already in progress");
3462 } else if (!(fs_info->qgroup_flags &
3463 BTRFS_QGROUP_STATUS_FLAG_ON)) {
3465 "qgroup rescan init failed, qgroup is not enabled");
3467 } else if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) {
3468 /* Quota disable is in progress */
3473 mutex_unlock(&fs_info->qgroup_rescan_lock);
3476 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3479 memset(&fs_info->qgroup_rescan_progress, 0,
3480 sizeof(fs_info->qgroup_rescan_progress));
3481 fs_info->qgroup_flags &= ~(BTRFS_QGROUP_RUNTIME_FLAG_CANCEL_RESCAN |
3482 BTRFS_QGROUP_RUNTIME_FLAG_NO_ACCOUNTING);
3483 fs_info->qgroup_rescan_progress.objectid = progress_objectid;
3484 init_completion(&fs_info->qgroup_rescan_completion);
3485 mutex_unlock(&fs_info->qgroup_rescan_lock);
3487 btrfs_init_work(&fs_info->qgroup_rescan_work,
3488 btrfs_qgroup_rescan_worker, NULL, NULL);
3493 qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info)
3496 struct btrfs_qgroup *qgroup;
3498 spin_lock(&fs_info->qgroup_lock);
3499 /* clear all current qgroup tracking information */
3500 for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) {
3501 qgroup = rb_entry(n, struct btrfs_qgroup, node);
3503 qgroup->rfer_cmpr = 0;
3505 qgroup->excl_cmpr = 0;
3506 qgroup_dirty(fs_info, qgroup);
3508 spin_unlock(&fs_info->qgroup_lock);
3512 btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info)
3515 struct btrfs_trans_handle *trans;
3517 ret = qgroup_rescan_init(fs_info, 0, 1);
3522 * We have set the rescan_progress to 0, which means no more
3523 * delayed refs will be accounted by btrfs_qgroup_account_ref.
3524 * However, btrfs_qgroup_account_ref may be right after its call
3525 * to btrfs_find_all_roots, in which case it would still do the
3527 * To solve this, we're committing the transaction, which will
3528 * ensure we run all delayed refs and only after that, we are
3529 * going to clear all tracking information for a clean start.
3532 trans = btrfs_join_transaction(fs_info->fs_root);
3533 if (IS_ERR(trans)) {
3534 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3535 return PTR_ERR(trans);
3537 ret = btrfs_commit_transaction(trans);
3539 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
3543 qgroup_rescan_zero_tracking(fs_info);
3545 mutex_lock(&fs_info->qgroup_rescan_lock);
3546 fs_info->qgroup_rescan_running = true;
3547 btrfs_queue_work(fs_info->qgroup_rescan_workers,
3548 &fs_info->qgroup_rescan_work);
3549 mutex_unlock(&fs_info->qgroup_rescan_lock);
3554 int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
3560 mutex_lock(&fs_info->qgroup_rescan_lock);
3561 running = fs_info->qgroup_rescan_running;
3562 mutex_unlock(&fs_info->qgroup_rescan_lock);
3568 ret = wait_for_completion_interruptible(
3569 &fs_info->qgroup_rescan_completion);
3571 wait_for_completion(&fs_info->qgroup_rescan_completion);
3577 * this is only called from open_ctree where we're still single threaded, thus
3578 * locking is omitted here.
3581 btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info)
3583 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
3584 mutex_lock(&fs_info->qgroup_rescan_lock);
3585 fs_info->qgroup_rescan_running = true;
3586 btrfs_queue_work(fs_info->qgroup_rescan_workers,
3587 &fs_info->qgroup_rescan_work);
3588 mutex_unlock(&fs_info->qgroup_rescan_lock);
3592 #define rbtree_iterate_from_safe(node, next, start) \
3593 for (node = start; node && ({ next = rb_next(node); 1;}); node = next)
3595 static int qgroup_unreserve_range(struct btrfs_inode *inode,
3596 struct extent_changeset *reserved, u64 start,
3599 struct rb_node *node;
3600 struct rb_node *next;
3601 struct ulist_node *entry;
3604 node = reserved->range_changed.root.rb_node;
3608 entry = rb_entry(node, struct ulist_node, rb_node);
3609 if (entry->val < start)
3610 node = node->rb_right;
3612 node = node->rb_left;
3615 if (entry->val > start && rb_prev(&entry->rb_node))
3616 entry = rb_entry(rb_prev(&entry->rb_node), struct ulist_node,
3619 rbtree_iterate_from_safe(node, next, &entry->rb_node) {
3625 entry = rb_entry(node, struct ulist_node, rb_node);
3626 entry_start = entry->val;
3627 entry_end = entry->aux;
3628 entry_len = entry_end - entry_start + 1;
3630 if (entry_start >= start + len)
3632 if (entry_start + entry_len <= start)
3635 * Now the entry is in [start, start + len), revert the
3636 * EXTENT_QGROUP_RESERVED bit.
3638 clear_ret = clear_extent_bits(&inode->io_tree, entry_start,
3639 entry_end, EXTENT_QGROUP_RESERVED);
3640 if (!ret && clear_ret < 0)
3643 ulist_del(&reserved->range_changed, entry->val, entry->aux);
3644 if (likely(reserved->bytes_changed >= entry_len)) {
3645 reserved->bytes_changed -= entry_len;
3648 reserved->bytes_changed = 0;
3656 * Try to free some space for qgroup.
3658 * For qgroup, there are only 3 ways to free qgroup space:
3659 * - Flush nodatacow write
3660 * Any nodatacow write will free its reserved data space at run_delalloc_range().
3661 * In theory, we should only flush nodatacow inodes, but it's not yet
3662 * possible, so we need to flush the whole root.
3664 * - Wait for ordered extents
3665 * When ordered extents are finished, their reserved metadata is finally
3666 * converted to per_trans status, which can be freed by later commit
3669 * - Commit transaction
3670 * This would free the meta_per_trans space.
3671 * In theory this shouldn't provide much space, but any more qgroup space
3674 static int try_flush_qgroup(struct btrfs_root *root)
3676 struct btrfs_trans_handle *trans;
3679 /* Can't hold an open transaction or we run the risk of deadlocking. */
3680 ASSERT(current->journal_info == NULL);
3681 if (WARN_ON(current->journal_info))
3685 * We don't want to run flush again and again, so if there is a running
3686 * one, we won't try to start a new flush, but exit directly.
3688 if (test_and_set_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state)) {
3689 wait_event(root->qgroup_flush_wait,
3690 !test_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state));
3694 ret = btrfs_start_delalloc_snapshot(root, true);
3697 btrfs_wait_ordered_extents(root, U64_MAX, 0, (u64)-1);
3699 trans = btrfs_join_transaction(root);
3700 if (IS_ERR(trans)) {
3701 ret = PTR_ERR(trans);
3705 ret = btrfs_commit_transaction(trans);
3707 clear_bit(BTRFS_ROOT_QGROUP_FLUSHING, &root->state);
3708 wake_up(&root->qgroup_flush_wait);
3712 static int qgroup_reserve_data(struct btrfs_inode *inode,
3713 struct extent_changeset **reserved_ret, u64 start,
3716 struct btrfs_root *root = inode->root;
3717 struct extent_changeset *reserved;
3718 bool new_reserved = false;
3723 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &root->fs_info->flags) ||
3724 !is_fstree(root->root_key.objectid) || len == 0)
3727 /* @reserved parameter is mandatory for qgroup */
3728 if (WARN_ON(!reserved_ret))
3730 if (!*reserved_ret) {
3731 new_reserved = true;
3732 *reserved_ret = extent_changeset_alloc();
3736 reserved = *reserved_ret;
3737 /* Record already reserved space */
3738 orig_reserved = reserved->bytes_changed;
3739 ret = set_record_extent_bits(&inode->io_tree, start,
3740 start + len -1, EXTENT_QGROUP_RESERVED, reserved);
3742 /* Newly reserved space */
3743 to_reserve = reserved->bytes_changed - orig_reserved;
3744 trace_btrfs_qgroup_reserve_data(&inode->vfs_inode, start, len,
3745 to_reserve, QGROUP_RESERVE);
3748 ret = qgroup_reserve(root, to_reserve, true, BTRFS_QGROUP_RSV_DATA);
3755 qgroup_unreserve_range(inode, reserved, start, len);
3758 extent_changeset_free(reserved);
3759 *reserved_ret = NULL;
3765 * Reserve qgroup space for range [start, start + len).
3767 * This function will either reserve space from related qgroups or do nothing
3768 * if the range is already reserved.
3770 * Return 0 for successful reservation
3771 * Return <0 for error (including -EQUOT)
3773 * NOTE: This function may sleep for memory allocation, dirty page flushing and
3774 * commit transaction. So caller should not hold any dirty page locked.
3776 int btrfs_qgroup_reserve_data(struct btrfs_inode *inode,
3777 struct extent_changeset **reserved_ret, u64 start,
3782 ret = qgroup_reserve_data(inode, reserved_ret, start, len);
3783 if (ret <= 0 && ret != -EDQUOT)
3786 ret = try_flush_qgroup(inode->root);
3789 return qgroup_reserve_data(inode, reserved_ret, start, len);
3792 /* Free ranges specified by @reserved, normally in error path */
3793 static int qgroup_free_reserved_data(struct btrfs_inode *inode,
3794 struct extent_changeset *reserved, u64 start, u64 len)
3796 struct btrfs_root *root = inode->root;
3797 struct ulist_node *unode;
3798 struct ulist_iterator uiter;
3799 struct extent_changeset changeset;
3803 extent_changeset_init(&changeset);
3804 len = round_up(start + len, root->fs_info->sectorsize);
3805 start = round_down(start, root->fs_info->sectorsize);
3807 ULIST_ITER_INIT(&uiter);
3808 while ((unode = ulist_next(&reserved->range_changed, &uiter))) {
3809 u64 range_start = unode->val;
3810 /* unode->aux is the inclusive end */
3811 u64 range_len = unode->aux - range_start + 1;
3815 extent_changeset_release(&changeset);
3817 /* Only free range in range [start, start + len) */
3818 if (range_start >= start + len ||
3819 range_start + range_len <= start)
3821 free_start = max(range_start, start);
3822 free_len = min(start + len, range_start + range_len) -
3825 * TODO: To also modify reserved->ranges_reserved to reflect
3828 * However as long as we free qgroup reserved according to
3829 * EXTENT_QGROUP_RESERVED, we won't double free.
3830 * So not need to rush.
3832 ret = clear_record_extent_bits(&inode->io_tree, free_start,
3833 free_start + free_len - 1,
3834 EXTENT_QGROUP_RESERVED, &changeset);
3837 freed += changeset.bytes_changed;
3839 btrfs_qgroup_free_refroot(root->fs_info, root->root_key.objectid, freed,
3840 BTRFS_QGROUP_RSV_DATA);
3843 extent_changeset_release(&changeset);
3847 static int __btrfs_qgroup_release_data(struct btrfs_inode *inode,
3848 struct extent_changeset *reserved, u64 start, u64 len,
3851 struct extent_changeset changeset;
3852 int trace_op = QGROUP_RELEASE;
3855 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &inode->root->fs_info->flags))
3858 /* In release case, we shouldn't have @reserved */
3859 WARN_ON(!free && reserved);
3860 if (free && reserved)
3861 return qgroup_free_reserved_data(inode, reserved, start, len);
3862 extent_changeset_init(&changeset);
3863 ret = clear_record_extent_bits(&inode->io_tree, start, start + len -1,
3864 EXTENT_QGROUP_RESERVED, &changeset);
3869 trace_op = QGROUP_FREE;
3870 trace_btrfs_qgroup_release_data(&inode->vfs_inode, start, len,
3871 changeset.bytes_changed, trace_op);
3873 btrfs_qgroup_free_refroot(inode->root->fs_info,
3874 inode->root->root_key.objectid,
3875 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
3876 ret = changeset.bytes_changed;
3878 extent_changeset_release(&changeset);
3883 * Free a reserved space range from io_tree and related qgroups
3885 * Should be called when a range of pages get invalidated before reaching disk.
3886 * Or for error cleanup case.
3887 * if @reserved is given, only reserved range in [@start, @start + @len) will
3890 * For data written to disk, use btrfs_qgroup_release_data().
3892 * NOTE: This function may sleep for memory allocation.
3894 int btrfs_qgroup_free_data(struct btrfs_inode *inode,
3895 struct extent_changeset *reserved, u64 start, u64 len)
3897 return __btrfs_qgroup_release_data(inode, reserved, start, len, 1);
3901 * Release a reserved space range from io_tree only.
3903 * Should be called when a range of pages get written to disk and corresponding
3904 * FILE_EXTENT is inserted into corresponding root.
3906 * Since new qgroup accounting framework will only update qgroup numbers at
3907 * commit_transaction() time, its reserved space shouldn't be freed from
3910 * But we should release the range from io_tree, to allow further write to be
3913 * NOTE: This function may sleep for memory allocation.
3915 int btrfs_qgroup_release_data(struct btrfs_inode *inode, u64 start, u64 len)
3917 return __btrfs_qgroup_release_data(inode, NULL, start, len, 0);
3920 static void add_root_meta_rsv(struct btrfs_root *root, int num_bytes,
3921 enum btrfs_qgroup_rsv_type type)
3923 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
3924 type != BTRFS_QGROUP_RSV_META_PERTRANS)
3929 spin_lock(&root->qgroup_meta_rsv_lock);
3930 if (type == BTRFS_QGROUP_RSV_META_PREALLOC)
3931 root->qgroup_meta_rsv_prealloc += num_bytes;
3933 root->qgroup_meta_rsv_pertrans += num_bytes;
3934 spin_unlock(&root->qgroup_meta_rsv_lock);
3937 static int sub_root_meta_rsv(struct btrfs_root *root, int num_bytes,
3938 enum btrfs_qgroup_rsv_type type)
3940 if (type != BTRFS_QGROUP_RSV_META_PREALLOC &&
3941 type != BTRFS_QGROUP_RSV_META_PERTRANS)
3946 spin_lock(&root->qgroup_meta_rsv_lock);
3947 if (type == BTRFS_QGROUP_RSV_META_PREALLOC) {
3948 num_bytes = min_t(u64, root->qgroup_meta_rsv_prealloc,
3950 root->qgroup_meta_rsv_prealloc -= num_bytes;
3952 num_bytes = min_t(u64, root->qgroup_meta_rsv_pertrans,
3954 root->qgroup_meta_rsv_pertrans -= num_bytes;
3956 spin_unlock(&root->qgroup_meta_rsv_lock);
3960 int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
3961 enum btrfs_qgroup_rsv_type type, bool enforce)
3963 struct btrfs_fs_info *fs_info = root->fs_info;
3966 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
3967 !is_fstree(root->root_key.objectid) || num_bytes == 0)
3970 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
3971 trace_qgroup_meta_reserve(root, (s64)num_bytes, type);
3972 ret = qgroup_reserve(root, num_bytes, enforce, type);
3976 * Record what we have reserved into root.
3978 * To avoid quota disabled->enabled underflow.
3979 * In that case, we may try to free space we haven't reserved
3980 * (since quota was disabled), so record what we reserved into root.
3981 * And ensure later release won't underflow this number.
3983 add_root_meta_rsv(root, num_bytes, type);
3987 int __btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
3988 enum btrfs_qgroup_rsv_type type, bool enforce,
3993 ret = btrfs_qgroup_reserve_meta(root, num_bytes, type, enforce);
3994 if ((ret <= 0 && ret != -EDQUOT) || noflush)
3997 ret = try_flush_qgroup(root);
4000 return btrfs_qgroup_reserve_meta(root, num_bytes, type, enforce);
4003 void btrfs_qgroup_free_meta_all_pertrans(struct btrfs_root *root)
4005 struct btrfs_fs_info *fs_info = root->fs_info;
4007 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4008 !is_fstree(root->root_key.objectid))
4011 /* TODO: Update trace point to handle such free */
4012 trace_qgroup_meta_free_all_pertrans(root);
4013 /* Special value -1 means to free all reserved space */
4014 btrfs_qgroup_free_refroot(fs_info, root->root_key.objectid, (u64)-1,
4015 BTRFS_QGROUP_RSV_META_PERTRANS);
4018 void __btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes,
4019 enum btrfs_qgroup_rsv_type type)
4021 struct btrfs_fs_info *fs_info = root->fs_info;
4023 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4024 !is_fstree(root->root_key.objectid))
4028 * reservation for META_PREALLOC can happen before quota is enabled,
4029 * which can lead to underflow.
4030 * Here ensure we will only free what we really have reserved.
4032 num_bytes = sub_root_meta_rsv(root, num_bytes, type);
4033 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
4034 trace_qgroup_meta_reserve(root, -(s64)num_bytes, type);
4035 btrfs_qgroup_free_refroot(fs_info, root->root_key.objectid,
4039 static void qgroup_convert_meta(struct btrfs_fs_info *fs_info, u64 ref_root,
4042 struct btrfs_qgroup *qgroup;
4043 struct ulist_node *unode;
4044 struct ulist_iterator uiter;
4049 if (!fs_info->quota_root)
4052 spin_lock(&fs_info->qgroup_lock);
4053 qgroup = find_qgroup_rb(fs_info, ref_root);
4056 ulist_reinit(fs_info->qgroup_ulist);
4057 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
4058 qgroup_to_aux(qgroup), GFP_ATOMIC);
4061 ULIST_ITER_INIT(&uiter);
4062 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
4063 struct btrfs_qgroup *qg;
4064 struct btrfs_qgroup_list *glist;
4066 qg = unode_aux_to_qgroup(unode);
4068 qgroup_rsv_release(fs_info, qg, num_bytes,
4069 BTRFS_QGROUP_RSV_META_PREALLOC);
4070 qgroup_rsv_add(fs_info, qg, num_bytes,
4071 BTRFS_QGROUP_RSV_META_PERTRANS);
4072 list_for_each_entry(glist, &qg->groups, next_group) {
4073 ret = ulist_add(fs_info->qgroup_ulist,
4074 glist->group->qgroupid,
4075 qgroup_to_aux(glist->group), GFP_ATOMIC);
4081 spin_unlock(&fs_info->qgroup_lock);
4084 void btrfs_qgroup_convert_reserved_meta(struct btrfs_root *root, int num_bytes)
4086 struct btrfs_fs_info *fs_info = root->fs_info;
4088 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
4089 !is_fstree(root->root_key.objectid))
4091 /* Same as btrfs_qgroup_free_meta_prealloc() */
4092 num_bytes = sub_root_meta_rsv(root, num_bytes,
4093 BTRFS_QGROUP_RSV_META_PREALLOC);
4094 trace_qgroup_meta_convert(root, num_bytes);
4095 qgroup_convert_meta(fs_info, root->root_key.objectid, num_bytes);
4099 * Check qgroup reserved space leaking, normally at destroy inode
4102 void btrfs_qgroup_check_reserved_leak(struct btrfs_inode *inode)
4104 struct extent_changeset changeset;
4105 struct ulist_node *unode;
4106 struct ulist_iterator iter;
4109 extent_changeset_init(&changeset);
4110 ret = clear_record_extent_bits(&inode->io_tree, 0, (u64)-1,
4111 EXTENT_QGROUP_RESERVED, &changeset);
4114 if (WARN_ON(changeset.bytes_changed)) {
4115 ULIST_ITER_INIT(&iter);
4116 while ((unode = ulist_next(&changeset.range_changed, &iter))) {
4117 btrfs_warn(inode->root->fs_info,
4118 "leaking qgroup reserved space, ino: %llu, start: %llu, end: %llu",
4119 btrfs_ino(inode), unode->val, unode->aux);
4121 btrfs_qgroup_free_refroot(inode->root->fs_info,
4122 inode->root->root_key.objectid,
4123 changeset.bytes_changed, BTRFS_QGROUP_RSV_DATA);
4126 extent_changeset_release(&changeset);
4129 void btrfs_qgroup_init_swapped_blocks(
4130 struct btrfs_qgroup_swapped_blocks *swapped_blocks)
4134 spin_lock_init(&swapped_blocks->lock);
4135 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
4136 swapped_blocks->blocks[i] = RB_ROOT;
4137 swapped_blocks->swapped = false;
4141 * Delete all swapped blocks record of @root.
4142 * Every record here means we skipped a full subtree scan for qgroup.
4144 * Gets called when committing one transaction.
4146 void btrfs_qgroup_clean_swapped_blocks(struct btrfs_root *root)
4148 struct btrfs_qgroup_swapped_blocks *swapped_blocks;
4151 swapped_blocks = &root->swapped_blocks;
4153 spin_lock(&swapped_blocks->lock);
4154 if (!swapped_blocks->swapped)
4156 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4157 struct rb_root *cur_root = &swapped_blocks->blocks[i];
4158 struct btrfs_qgroup_swapped_block *entry;
4159 struct btrfs_qgroup_swapped_block *next;
4161 rbtree_postorder_for_each_entry_safe(entry, next, cur_root,
4164 swapped_blocks->blocks[i] = RB_ROOT;
4166 swapped_blocks->swapped = false;
4168 spin_unlock(&swapped_blocks->lock);
4172 * Add subtree roots record into @subvol_root.
4174 * @subvol_root: tree root of the subvolume tree get swapped
4175 * @bg: block group under balance
4176 * @subvol_parent/slot: pointer to the subtree root in subvolume tree
4177 * @reloc_parent/slot: pointer to the subtree root in reloc tree
4178 * BOTH POINTERS ARE BEFORE TREE SWAP
4179 * @last_snapshot: last snapshot generation of the subvolume tree
4181 int btrfs_qgroup_add_swapped_blocks(struct btrfs_trans_handle *trans,
4182 struct btrfs_root *subvol_root,
4183 struct btrfs_block_group *bg,
4184 struct extent_buffer *subvol_parent, int subvol_slot,
4185 struct extent_buffer *reloc_parent, int reloc_slot,
4188 struct btrfs_fs_info *fs_info = subvol_root->fs_info;
4189 struct btrfs_qgroup_swapped_blocks *blocks = &subvol_root->swapped_blocks;
4190 struct btrfs_qgroup_swapped_block *block;
4191 struct rb_node **cur;
4192 struct rb_node *parent = NULL;
4193 int level = btrfs_header_level(subvol_parent) - 1;
4196 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
4199 if (btrfs_node_ptr_generation(subvol_parent, subvol_slot) >
4200 btrfs_node_ptr_generation(reloc_parent, reloc_slot)) {
4201 btrfs_err_rl(fs_info,
4202 "%s: bad parameter order, subvol_gen=%llu reloc_gen=%llu",
4204 btrfs_node_ptr_generation(subvol_parent, subvol_slot),
4205 btrfs_node_ptr_generation(reloc_parent, reloc_slot));
4209 block = kmalloc(sizeof(*block), GFP_NOFS);
4216 * @reloc_parent/slot is still before swap, while @block is going to
4217 * record the bytenr after swap, so we do the swap here.
4219 block->subvol_bytenr = btrfs_node_blockptr(reloc_parent, reloc_slot);
4220 block->subvol_generation = btrfs_node_ptr_generation(reloc_parent,
4222 block->reloc_bytenr = btrfs_node_blockptr(subvol_parent, subvol_slot);
4223 block->reloc_generation = btrfs_node_ptr_generation(subvol_parent,
4225 block->last_snapshot = last_snapshot;
4226 block->level = level;
4229 * If we have bg == NULL, we're called from btrfs_recover_relocation(),
4230 * no one else can modify tree blocks thus we qgroup will not change
4231 * no matter the value of trace_leaf.
4233 if (bg && bg->flags & BTRFS_BLOCK_GROUP_DATA)
4234 block->trace_leaf = true;
4236 block->trace_leaf = false;
4237 btrfs_node_key_to_cpu(reloc_parent, &block->first_key, reloc_slot);
4239 /* Insert @block into @blocks */
4240 spin_lock(&blocks->lock);
4241 cur = &blocks->blocks[level].rb_node;
4243 struct btrfs_qgroup_swapped_block *entry;
4246 entry = rb_entry(parent, struct btrfs_qgroup_swapped_block,
4249 if (entry->subvol_bytenr < block->subvol_bytenr) {
4250 cur = &(*cur)->rb_left;
4251 } else if (entry->subvol_bytenr > block->subvol_bytenr) {
4252 cur = &(*cur)->rb_right;
4254 if (entry->subvol_generation !=
4255 block->subvol_generation ||
4256 entry->reloc_bytenr != block->reloc_bytenr ||
4257 entry->reloc_generation !=
4258 block->reloc_generation) {
4260 * Duplicated but mismatch entry found.
4263 * Marking qgroup inconsistent should be enough
4266 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
4273 rb_link_node(&block->node, parent, cur);
4274 rb_insert_color(&block->node, &blocks->blocks[level]);
4275 blocks->swapped = true;
4277 spin_unlock(&blocks->lock);
4280 qgroup_mark_inconsistent(fs_info);
4285 * Check if the tree block is a subtree root, and if so do the needed
4286 * delayed subtree trace for qgroup.
4288 * This is called during btrfs_cow_block().
4290 int btrfs_qgroup_trace_subtree_after_cow(struct btrfs_trans_handle *trans,
4291 struct btrfs_root *root,
4292 struct extent_buffer *subvol_eb)
4294 struct btrfs_fs_info *fs_info = root->fs_info;
4295 struct btrfs_qgroup_swapped_blocks *blocks = &root->swapped_blocks;
4296 struct btrfs_qgroup_swapped_block *block;
4297 struct extent_buffer *reloc_eb = NULL;
4298 struct rb_node *node;
4300 bool swapped = false;
4301 int level = btrfs_header_level(subvol_eb);
4305 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
4307 if (!is_fstree(root->root_key.objectid) || !root->reloc_root)
4310 spin_lock(&blocks->lock);
4311 if (!blocks->swapped) {
4312 spin_unlock(&blocks->lock);
4315 node = blocks->blocks[level].rb_node;
4318 block = rb_entry(node, struct btrfs_qgroup_swapped_block, node);
4319 if (block->subvol_bytenr < subvol_eb->start) {
4320 node = node->rb_left;
4321 } else if (block->subvol_bytenr > subvol_eb->start) {
4322 node = node->rb_right;
4329 spin_unlock(&blocks->lock);
4332 /* Found one, remove it from @blocks first and update blocks->swapped */
4333 rb_erase(&block->node, &blocks->blocks[level]);
4334 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4335 if (RB_EMPTY_ROOT(&blocks->blocks[i])) {
4340 blocks->swapped = swapped;
4341 spin_unlock(&blocks->lock);
4343 /* Read out reloc subtree root */
4344 reloc_eb = read_tree_block(fs_info, block->reloc_bytenr, 0,
4345 block->reloc_generation, block->level,
4347 if (IS_ERR(reloc_eb)) {
4348 ret = PTR_ERR(reloc_eb);
4352 if (!extent_buffer_uptodate(reloc_eb)) {
4357 ret = qgroup_trace_subtree_swap(trans, reloc_eb, subvol_eb,
4358 block->last_snapshot, block->trace_leaf);
4361 free_extent_buffer(reloc_eb);
4364 btrfs_err_rl(fs_info,
4365 "failed to account subtree at bytenr %llu: %d",
4366 subvol_eb->start, ret);
4367 qgroup_mark_inconsistent(fs_info);
4372 void btrfs_qgroup_destroy_extent_records(struct btrfs_transaction *trans)
4374 struct btrfs_qgroup_extent_record *entry;
4375 struct btrfs_qgroup_extent_record *next;
4376 struct rb_root *root;
4378 root = &trans->delayed_refs.dirty_extent_root;
4379 rbtree_postorder_for_each_entry_safe(entry, next, root, node) {
4380 ulist_free(entry->old_roots);