2 * Copyright (C) 2011 STRATO. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #include <linux/sched.h>
20 #include <linux/pagemap.h>
21 #include <linux/writeback.h>
22 #include <linux/blkdev.h>
23 #include <linux/rbtree.h>
24 #include <linux/slab.h>
25 #include <linux/workqueue.h>
26 #include <linux/btrfs.h>
29 #include "transaction.h"
34 #include "extent_io.h"
38 * - subvol delete -> delete when ref goes to 0? delete limits also?
42 * - copy also limits on subvol creation
44 * - caches fuer ulists
45 * - performance benchmarks
46 * - check all ioctl parameters
50 * one struct for each qgroup, organized in fs_info->qgroup_tree.
58 u64 rfer; /* referenced */
59 u64 rfer_cmpr; /* referenced compressed */
60 u64 excl; /* exclusive */
61 u64 excl_cmpr; /* exclusive compressed */
66 u64 lim_flags; /* which limits are set */
73 * reservation tracking
80 struct list_head groups; /* groups this group is member of */
81 struct list_head members; /* groups that are members of this group */
82 struct list_head dirty; /* dirty groups */
83 struct rb_node node; /* tree of qgroups */
86 * temp variables for accounting operations
93 * glue structure to represent the relations between qgroups.
95 struct btrfs_qgroup_list {
96 struct list_head next_group;
97 struct list_head next_member;
98 struct btrfs_qgroup *group;
99 struct btrfs_qgroup *member;
102 #define ptr_to_u64(x) ((u64)(uintptr_t)x)
103 #define u64_to_ptr(x) ((struct btrfs_qgroup *)(uintptr_t)x)
106 qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
108 static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info);
110 /* must be called with qgroup_ioctl_lock held */
111 static struct btrfs_qgroup *find_qgroup_rb(struct btrfs_fs_info *fs_info,
114 struct rb_node *n = fs_info->qgroup_tree.rb_node;
115 struct btrfs_qgroup *qgroup;
118 qgroup = rb_entry(n, struct btrfs_qgroup, node);
119 if (qgroup->qgroupid < qgroupid)
121 else if (qgroup->qgroupid > qgroupid)
129 /* must be called with qgroup_lock held */
130 static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info,
133 struct rb_node **p = &fs_info->qgroup_tree.rb_node;
134 struct rb_node *parent = NULL;
135 struct btrfs_qgroup *qgroup;
139 qgroup = rb_entry(parent, struct btrfs_qgroup, node);
141 if (qgroup->qgroupid < qgroupid)
143 else if (qgroup->qgroupid > qgroupid)
149 qgroup = kzalloc(sizeof(*qgroup), GFP_ATOMIC);
151 return ERR_PTR(-ENOMEM);
153 qgroup->qgroupid = qgroupid;
154 INIT_LIST_HEAD(&qgroup->groups);
155 INIT_LIST_HEAD(&qgroup->members);
156 INIT_LIST_HEAD(&qgroup->dirty);
158 rb_link_node(&qgroup->node, parent, p);
159 rb_insert_color(&qgroup->node, &fs_info->qgroup_tree);
164 static void __del_qgroup_rb(struct btrfs_qgroup *qgroup)
166 struct btrfs_qgroup_list *list;
168 list_del(&qgroup->dirty);
169 while (!list_empty(&qgroup->groups)) {
170 list = list_first_entry(&qgroup->groups,
171 struct btrfs_qgroup_list, next_group);
172 list_del(&list->next_group);
173 list_del(&list->next_member);
177 while (!list_empty(&qgroup->members)) {
178 list = list_first_entry(&qgroup->members,
179 struct btrfs_qgroup_list, next_member);
180 list_del(&list->next_group);
181 list_del(&list->next_member);
187 /* must be called with qgroup_lock held */
188 static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid)
190 struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid);
195 rb_erase(&qgroup->node, &fs_info->qgroup_tree);
196 __del_qgroup_rb(qgroup);
200 /* must be called with qgroup_lock held */
201 static int add_relation_rb(struct btrfs_fs_info *fs_info,
202 u64 memberid, u64 parentid)
204 struct btrfs_qgroup *member;
205 struct btrfs_qgroup *parent;
206 struct btrfs_qgroup_list *list;
208 member = find_qgroup_rb(fs_info, memberid);
209 parent = find_qgroup_rb(fs_info, parentid);
210 if (!member || !parent)
213 list = kzalloc(sizeof(*list), GFP_ATOMIC);
217 list->group = parent;
218 list->member = member;
219 list_add_tail(&list->next_group, &member->groups);
220 list_add_tail(&list->next_member, &parent->members);
225 /* must be called with qgroup_lock held */
226 static int del_relation_rb(struct btrfs_fs_info *fs_info,
227 u64 memberid, u64 parentid)
229 struct btrfs_qgroup *member;
230 struct btrfs_qgroup *parent;
231 struct btrfs_qgroup_list *list;
233 member = find_qgroup_rb(fs_info, memberid);
234 parent = find_qgroup_rb(fs_info, parentid);
235 if (!member || !parent)
238 list_for_each_entry(list, &member->groups, next_group) {
239 if (list->group == parent) {
240 list_del(&list->next_group);
241 list_del(&list->next_member);
249 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
250 int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
253 struct btrfs_qgroup *qgroup;
255 qgroup = find_qgroup_rb(fs_info, qgroupid);
258 if (qgroup->rfer != rfer || qgroup->excl != excl)
265 * The full config is read in one go, only called from open_ctree()
266 * It doesn't use any locking, as at this point we're still single-threaded
268 int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info)
270 struct btrfs_key key;
271 struct btrfs_key found_key;
272 struct btrfs_root *quota_root = fs_info->quota_root;
273 struct btrfs_path *path = NULL;
274 struct extent_buffer *l;
278 u64 rescan_progress = 0;
280 if (!fs_info->quota_enabled)
283 fs_info->qgroup_ulist = ulist_alloc(GFP_NOFS);
284 if (!fs_info->qgroup_ulist) {
289 path = btrfs_alloc_path();
295 /* default this to quota off, in case no status key is found */
296 fs_info->qgroup_flags = 0;
299 * pass 1: read status, all qgroup infos and limits
304 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1);
309 struct btrfs_qgroup *qgroup;
311 slot = path->slots[0];
313 btrfs_item_key_to_cpu(l, &found_key, slot);
315 if (found_key.type == BTRFS_QGROUP_STATUS_KEY) {
316 struct btrfs_qgroup_status_item *ptr;
318 ptr = btrfs_item_ptr(l, slot,
319 struct btrfs_qgroup_status_item);
321 if (btrfs_qgroup_status_version(l, ptr) !=
322 BTRFS_QGROUP_STATUS_VERSION) {
324 "old qgroup version, quota disabled");
327 if (btrfs_qgroup_status_generation(l, ptr) !=
328 fs_info->generation) {
329 flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
331 "qgroup generation mismatch, "
332 "marked as inconsistent");
334 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l,
336 rescan_progress = btrfs_qgroup_status_rescan(l, ptr);
340 if (found_key.type != BTRFS_QGROUP_INFO_KEY &&
341 found_key.type != BTRFS_QGROUP_LIMIT_KEY)
344 qgroup = find_qgroup_rb(fs_info, found_key.offset);
345 if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) ||
346 (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) {
347 btrfs_err(fs_info, "inconsitent qgroup config");
348 flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
351 qgroup = add_qgroup_rb(fs_info, found_key.offset);
352 if (IS_ERR(qgroup)) {
353 ret = PTR_ERR(qgroup);
357 switch (found_key.type) {
358 case BTRFS_QGROUP_INFO_KEY: {
359 struct btrfs_qgroup_info_item *ptr;
361 ptr = btrfs_item_ptr(l, slot,
362 struct btrfs_qgroup_info_item);
363 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr);
364 qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr);
365 qgroup->excl = btrfs_qgroup_info_excl(l, ptr);
366 qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr);
367 /* generation currently unused */
370 case BTRFS_QGROUP_LIMIT_KEY: {
371 struct btrfs_qgroup_limit_item *ptr;
373 ptr = btrfs_item_ptr(l, slot,
374 struct btrfs_qgroup_limit_item);
375 qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr);
376 qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr);
377 qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr);
378 qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr);
379 qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr);
384 ret = btrfs_next_item(quota_root, path);
390 btrfs_release_path(path);
393 * pass 2: read all qgroup relations
396 key.type = BTRFS_QGROUP_RELATION_KEY;
398 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0);
402 slot = path->slots[0];
404 btrfs_item_key_to_cpu(l, &found_key, slot);
406 if (found_key.type != BTRFS_QGROUP_RELATION_KEY)
409 if (found_key.objectid > found_key.offset) {
410 /* parent <- member, not needed to build config */
411 /* FIXME should we omit the key completely? */
415 ret = add_relation_rb(fs_info, found_key.objectid,
417 if (ret == -ENOENT) {
419 "orphan qgroup relation 0x%llx->0x%llx",
420 found_key.objectid, found_key.offset);
421 ret = 0; /* ignore the error */
426 ret = btrfs_next_item(quota_root, path);
433 fs_info->qgroup_flags |= flags;
434 if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON)) {
435 fs_info->quota_enabled = 0;
436 fs_info->pending_quota_state = 0;
437 } else if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN &&
439 ret = qgroup_rescan_init(fs_info, rescan_progress, 0);
441 btrfs_free_path(path);
444 ulist_free(fs_info->qgroup_ulist);
445 fs_info->qgroup_ulist = NULL;
446 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
449 return ret < 0 ? ret : 0;
453 * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(),
454 * first two are in single-threaded paths.And for the third one, we have set
455 * quota_root to be null with qgroup_lock held before, so it is safe to clean
456 * up the in-memory structures without qgroup_lock held.
458 void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info)
461 struct btrfs_qgroup *qgroup;
463 while ((n = rb_first(&fs_info->qgroup_tree))) {
464 qgroup = rb_entry(n, struct btrfs_qgroup, node);
465 rb_erase(n, &fs_info->qgroup_tree);
466 __del_qgroup_rb(qgroup);
469 * we call btrfs_free_qgroup_config() when umounting
470 * filesystem and disabling quota, so we set qgroup_ulit
471 * to be null here to avoid double free.
473 ulist_free(fs_info->qgroup_ulist);
474 fs_info->qgroup_ulist = NULL;
477 static int add_qgroup_relation_item(struct btrfs_trans_handle *trans,
478 struct btrfs_root *quota_root,
482 struct btrfs_path *path;
483 struct btrfs_key key;
485 path = btrfs_alloc_path();
490 key.type = BTRFS_QGROUP_RELATION_KEY;
493 ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0);
495 btrfs_mark_buffer_dirty(path->nodes[0]);
497 btrfs_free_path(path);
501 static int del_qgroup_relation_item(struct btrfs_trans_handle *trans,
502 struct btrfs_root *quota_root,
506 struct btrfs_path *path;
507 struct btrfs_key key;
509 path = btrfs_alloc_path();
514 key.type = BTRFS_QGROUP_RELATION_KEY;
517 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
526 ret = btrfs_del_item(trans, quota_root, path);
528 btrfs_free_path(path);
532 static int add_qgroup_item(struct btrfs_trans_handle *trans,
533 struct btrfs_root *quota_root, u64 qgroupid)
536 struct btrfs_path *path;
537 struct btrfs_qgroup_info_item *qgroup_info;
538 struct btrfs_qgroup_limit_item *qgroup_limit;
539 struct extent_buffer *leaf;
540 struct btrfs_key key;
542 if (btrfs_test_is_dummy_root(quota_root))
545 path = btrfs_alloc_path();
550 key.type = BTRFS_QGROUP_INFO_KEY;
551 key.offset = qgroupid;
554 * Avoid a transaction abort by catching -EEXIST here. In that
555 * case, we proceed by re-initializing the existing structure
559 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
560 sizeof(*qgroup_info));
561 if (ret && ret != -EEXIST)
564 leaf = path->nodes[0];
565 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
566 struct btrfs_qgroup_info_item);
567 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
568 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
569 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
570 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
571 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
573 btrfs_mark_buffer_dirty(leaf);
575 btrfs_release_path(path);
577 key.type = BTRFS_QGROUP_LIMIT_KEY;
578 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
579 sizeof(*qgroup_limit));
580 if (ret && ret != -EEXIST)
583 leaf = path->nodes[0];
584 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
585 struct btrfs_qgroup_limit_item);
586 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
587 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
588 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
589 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
590 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
592 btrfs_mark_buffer_dirty(leaf);
596 btrfs_free_path(path);
600 static int del_qgroup_item(struct btrfs_trans_handle *trans,
601 struct btrfs_root *quota_root, u64 qgroupid)
604 struct btrfs_path *path;
605 struct btrfs_key key;
607 path = btrfs_alloc_path();
612 key.type = BTRFS_QGROUP_INFO_KEY;
613 key.offset = qgroupid;
614 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
623 ret = btrfs_del_item(trans, quota_root, path);
627 btrfs_release_path(path);
629 key.type = BTRFS_QGROUP_LIMIT_KEY;
630 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
639 ret = btrfs_del_item(trans, quota_root, path);
642 btrfs_free_path(path);
646 static int update_qgroup_limit_item(struct btrfs_trans_handle *trans,
647 struct btrfs_root *root, u64 qgroupid,
648 u64 flags, u64 max_rfer, u64 max_excl,
649 u64 rsv_rfer, u64 rsv_excl)
651 struct btrfs_path *path;
652 struct btrfs_key key;
653 struct extent_buffer *l;
654 struct btrfs_qgroup_limit_item *qgroup_limit;
659 key.type = BTRFS_QGROUP_LIMIT_KEY;
660 key.offset = qgroupid;
662 path = btrfs_alloc_path();
666 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
674 slot = path->slots[0];
675 qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
676 btrfs_set_qgroup_limit_flags(l, qgroup_limit, flags);
677 btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, max_rfer);
678 btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, max_excl);
679 btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, rsv_rfer);
680 btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, rsv_excl);
682 btrfs_mark_buffer_dirty(l);
685 btrfs_free_path(path);
689 static int update_qgroup_info_item(struct btrfs_trans_handle *trans,
690 struct btrfs_root *root,
691 struct btrfs_qgroup *qgroup)
693 struct btrfs_path *path;
694 struct btrfs_key key;
695 struct extent_buffer *l;
696 struct btrfs_qgroup_info_item *qgroup_info;
700 if (btrfs_test_is_dummy_root(root))
704 key.type = BTRFS_QGROUP_INFO_KEY;
705 key.offset = qgroup->qgroupid;
707 path = btrfs_alloc_path();
711 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
719 slot = path->slots[0];
720 qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
721 btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid);
722 btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer);
723 btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr);
724 btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl);
725 btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr);
727 btrfs_mark_buffer_dirty(l);
730 btrfs_free_path(path);
734 static int update_qgroup_status_item(struct btrfs_trans_handle *trans,
735 struct btrfs_fs_info *fs_info,
736 struct btrfs_root *root)
738 struct btrfs_path *path;
739 struct btrfs_key key;
740 struct extent_buffer *l;
741 struct btrfs_qgroup_status_item *ptr;
746 key.type = BTRFS_QGROUP_STATUS_KEY;
749 path = btrfs_alloc_path();
753 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
761 slot = path->slots[0];
762 ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
763 btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags);
764 btrfs_set_qgroup_status_generation(l, ptr, trans->transid);
765 btrfs_set_qgroup_status_rescan(l, ptr,
766 fs_info->qgroup_rescan_progress.objectid);
768 btrfs_mark_buffer_dirty(l);
771 btrfs_free_path(path);
776 * called with qgroup_lock held
778 static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans,
779 struct btrfs_root *root)
781 struct btrfs_path *path;
782 struct btrfs_key key;
783 struct extent_buffer *leaf = NULL;
787 path = btrfs_alloc_path();
791 path->leave_spinning = 1;
798 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
801 leaf = path->nodes[0];
802 nr = btrfs_header_nritems(leaf);
806 * delete the leaf one by one
807 * since the whole tree is going
811 ret = btrfs_del_items(trans, root, path, 0, nr);
815 btrfs_release_path(path);
819 root->fs_info->pending_quota_state = 0;
820 btrfs_free_path(path);
824 int btrfs_quota_enable(struct btrfs_trans_handle *trans,
825 struct btrfs_fs_info *fs_info)
827 struct btrfs_root *quota_root;
828 struct btrfs_root *tree_root = fs_info->tree_root;
829 struct btrfs_path *path = NULL;
830 struct btrfs_qgroup_status_item *ptr;
831 struct extent_buffer *leaf;
832 struct btrfs_key key;
833 struct btrfs_key found_key;
834 struct btrfs_qgroup *qgroup = NULL;
838 mutex_lock(&fs_info->qgroup_ioctl_lock);
839 if (fs_info->quota_root) {
840 fs_info->pending_quota_state = 1;
844 fs_info->qgroup_ulist = ulist_alloc(GFP_NOFS);
845 if (!fs_info->qgroup_ulist) {
851 * initially create the quota tree
853 quota_root = btrfs_create_tree(trans, fs_info,
854 BTRFS_QUOTA_TREE_OBJECTID);
855 if (IS_ERR(quota_root)) {
856 ret = PTR_ERR(quota_root);
860 path = btrfs_alloc_path();
867 key.type = BTRFS_QGROUP_STATUS_KEY;
870 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
875 leaf = path->nodes[0];
876 ptr = btrfs_item_ptr(leaf, path->slots[0],
877 struct btrfs_qgroup_status_item);
878 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
879 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
880 fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON |
881 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
882 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags);
883 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
885 btrfs_mark_buffer_dirty(leaf);
888 key.type = BTRFS_ROOT_REF_KEY;
891 btrfs_release_path(path);
892 ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0);
900 slot = path->slots[0];
901 leaf = path->nodes[0];
902 btrfs_item_key_to_cpu(leaf, &found_key, slot);
904 if (found_key.type == BTRFS_ROOT_REF_KEY) {
905 ret = add_qgroup_item(trans, quota_root,
910 qgroup = add_qgroup_rb(fs_info, found_key.offset);
911 if (IS_ERR(qgroup)) {
912 ret = PTR_ERR(qgroup);
916 ret = btrfs_next_item(tree_root, path);
924 btrfs_release_path(path);
925 ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID);
929 qgroup = add_qgroup_rb(fs_info, BTRFS_FS_TREE_OBJECTID);
930 if (IS_ERR(qgroup)) {
931 ret = PTR_ERR(qgroup);
934 spin_lock(&fs_info->qgroup_lock);
935 fs_info->quota_root = quota_root;
936 fs_info->pending_quota_state = 1;
937 spin_unlock(&fs_info->qgroup_lock);
939 btrfs_free_path(path);
942 free_extent_buffer(quota_root->node);
943 free_extent_buffer(quota_root->commit_root);
948 ulist_free(fs_info->qgroup_ulist);
949 fs_info->qgroup_ulist = NULL;
951 mutex_unlock(&fs_info->qgroup_ioctl_lock);
955 int btrfs_quota_disable(struct btrfs_trans_handle *trans,
956 struct btrfs_fs_info *fs_info)
958 struct btrfs_root *tree_root = fs_info->tree_root;
959 struct btrfs_root *quota_root;
962 mutex_lock(&fs_info->qgroup_ioctl_lock);
963 if (!fs_info->quota_root)
965 spin_lock(&fs_info->qgroup_lock);
966 fs_info->quota_enabled = 0;
967 fs_info->pending_quota_state = 0;
968 quota_root = fs_info->quota_root;
969 fs_info->quota_root = NULL;
970 spin_unlock(&fs_info->qgroup_lock);
972 btrfs_free_qgroup_config(fs_info);
974 ret = btrfs_clean_quota_tree(trans, quota_root);
978 ret = btrfs_del_root(trans, tree_root, "a_root->root_key);
982 list_del("a_root->dirty_list);
984 btrfs_tree_lock(quota_root->node);
985 clean_tree_block(trans, tree_root, quota_root->node);
986 btrfs_tree_unlock(quota_root->node);
987 btrfs_free_tree_block(trans, quota_root, quota_root->node, 0, 1);
989 free_extent_buffer(quota_root->node);
990 free_extent_buffer(quota_root->commit_root);
993 mutex_unlock(&fs_info->qgroup_ioctl_lock);
997 static void qgroup_dirty(struct btrfs_fs_info *fs_info,
998 struct btrfs_qgroup *qgroup)
1000 if (list_empty(&qgroup->dirty))
1001 list_add(&qgroup->dirty, &fs_info->dirty_qgroups);
1004 int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans,
1005 struct btrfs_fs_info *fs_info, u64 src, u64 dst)
1007 struct btrfs_root *quota_root;
1008 struct btrfs_qgroup *parent;
1009 struct btrfs_qgroup *member;
1010 struct btrfs_qgroup_list *list;
1013 mutex_lock(&fs_info->qgroup_ioctl_lock);
1014 quota_root = fs_info->quota_root;
1019 member = find_qgroup_rb(fs_info, src);
1020 parent = find_qgroup_rb(fs_info, dst);
1021 if (!member || !parent) {
1026 /* check if such qgroup relation exist firstly */
1027 list_for_each_entry(list, &member->groups, next_group) {
1028 if (list->group == parent) {
1034 ret = add_qgroup_relation_item(trans, quota_root, src, dst);
1038 ret = add_qgroup_relation_item(trans, quota_root, dst, src);
1040 del_qgroup_relation_item(trans, quota_root, src, dst);
1044 spin_lock(&fs_info->qgroup_lock);
1045 ret = add_relation_rb(quota_root->fs_info, src, dst);
1046 spin_unlock(&fs_info->qgroup_lock);
1048 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1052 int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans,
1053 struct btrfs_fs_info *fs_info, u64 src, u64 dst)
1055 struct btrfs_root *quota_root;
1056 struct btrfs_qgroup *parent;
1057 struct btrfs_qgroup *member;
1058 struct btrfs_qgroup_list *list;
1062 mutex_lock(&fs_info->qgroup_ioctl_lock);
1063 quota_root = fs_info->quota_root;
1069 member = find_qgroup_rb(fs_info, src);
1070 parent = find_qgroup_rb(fs_info, dst);
1071 if (!member || !parent) {
1076 /* check if such qgroup relation exist firstly */
1077 list_for_each_entry(list, &member->groups, next_group) {
1078 if (list->group == parent)
1084 ret = del_qgroup_relation_item(trans, quota_root, src, dst);
1085 err = del_qgroup_relation_item(trans, quota_root, dst, src);
1089 spin_lock(&fs_info->qgroup_lock);
1090 del_relation_rb(fs_info, src, dst);
1091 spin_unlock(&fs_info->qgroup_lock);
1093 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1097 int btrfs_create_qgroup(struct btrfs_trans_handle *trans,
1098 struct btrfs_fs_info *fs_info, u64 qgroupid, char *name)
1100 struct btrfs_root *quota_root;
1101 struct btrfs_qgroup *qgroup;
1104 mutex_lock(&fs_info->qgroup_ioctl_lock);
1105 quota_root = fs_info->quota_root;
1110 qgroup = find_qgroup_rb(fs_info, qgroupid);
1116 ret = add_qgroup_item(trans, quota_root, qgroupid);
1120 spin_lock(&fs_info->qgroup_lock);
1121 qgroup = add_qgroup_rb(fs_info, qgroupid);
1122 spin_unlock(&fs_info->qgroup_lock);
1125 ret = PTR_ERR(qgroup);
1127 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1131 int btrfs_remove_qgroup(struct btrfs_trans_handle *trans,
1132 struct btrfs_fs_info *fs_info, u64 qgroupid)
1134 struct btrfs_root *quota_root;
1135 struct btrfs_qgroup *qgroup;
1138 mutex_lock(&fs_info->qgroup_ioctl_lock);
1139 quota_root = fs_info->quota_root;
1145 qgroup = find_qgroup_rb(fs_info, qgroupid);
1150 /* check if there are no relations to this qgroup */
1151 if (!list_empty(&qgroup->groups) ||
1152 !list_empty(&qgroup->members)) {
1157 ret = del_qgroup_item(trans, quota_root, qgroupid);
1159 spin_lock(&fs_info->qgroup_lock);
1160 del_qgroup_rb(quota_root->fs_info, qgroupid);
1161 spin_unlock(&fs_info->qgroup_lock);
1163 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1167 int btrfs_limit_qgroup(struct btrfs_trans_handle *trans,
1168 struct btrfs_fs_info *fs_info, u64 qgroupid,
1169 struct btrfs_qgroup_limit *limit)
1171 struct btrfs_root *quota_root;
1172 struct btrfs_qgroup *qgroup;
1175 mutex_lock(&fs_info->qgroup_ioctl_lock);
1176 quota_root = fs_info->quota_root;
1182 qgroup = find_qgroup_rb(fs_info, qgroupid);
1187 ret = update_qgroup_limit_item(trans, quota_root, qgroupid,
1188 limit->flags, limit->max_rfer,
1189 limit->max_excl, limit->rsv_rfer,
1192 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1193 btrfs_info(fs_info, "unable to update quota limit for %llu",
1197 spin_lock(&fs_info->qgroup_lock);
1198 qgroup->lim_flags = limit->flags;
1199 qgroup->max_rfer = limit->max_rfer;
1200 qgroup->max_excl = limit->max_excl;
1201 qgroup->rsv_rfer = limit->rsv_rfer;
1202 qgroup->rsv_excl = limit->rsv_excl;
1203 spin_unlock(&fs_info->qgroup_lock);
1205 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1209 static int comp_oper_exist(struct btrfs_qgroup_operation *oper1,
1210 struct btrfs_qgroup_operation *oper2)
1213 * Ignore seq and type here, we're looking for any operation
1214 * at all related to this extent on that root.
1216 if (oper1->bytenr < oper2->bytenr)
1218 if (oper1->bytenr > oper2->bytenr)
1220 if (oper1->ref_root < oper2->ref_root)
1222 if (oper1->ref_root > oper2->ref_root)
1227 static int qgroup_oper_exists(struct btrfs_fs_info *fs_info,
1228 struct btrfs_qgroup_operation *oper)
1231 struct btrfs_qgroup_operation *cur;
1234 spin_lock(&fs_info->qgroup_op_lock);
1235 n = fs_info->qgroup_op_tree.rb_node;
1237 cur = rb_entry(n, struct btrfs_qgroup_operation, n);
1238 cmp = comp_oper_exist(cur, oper);
1244 spin_unlock(&fs_info->qgroup_op_lock);
1248 spin_unlock(&fs_info->qgroup_op_lock);
1252 static int comp_oper(struct btrfs_qgroup_operation *oper1,
1253 struct btrfs_qgroup_operation *oper2)
1255 if (oper1->bytenr < oper2->bytenr)
1257 if (oper1->bytenr > oper2->bytenr)
1259 if (oper1->seq < oper2->seq)
1261 if (oper1->seq > oper2->seq)
1263 if (oper1->ref_root < oper2->ref_root)
1265 if (oper1->ref_root > oper2->ref_root)
1267 if (oper1->type < oper2->type)
1269 if (oper1->type > oper2->type)
1274 static int insert_qgroup_oper(struct btrfs_fs_info *fs_info,
1275 struct btrfs_qgroup_operation *oper)
1278 struct rb_node *parent = NULL;
1279 struct btrfs_qgroup_operation *cur;
1282 spin_lock(&fs_info->qgroup_op_lock);
1283 p = &fs_info->qgroup_op_tree.rb_node;
1286 cur = rb_entry(parent, struct btrfs_qgroup_operation, n);
1287 cmp = comp_oper(cur, oper);
1289 p = &(*p)->rb_right;
1293 spin_unlock(&fs_info->qgroup_op_lock);
1297 rb_link_node(&oper->n, parent, p);
1298 rb_insert_color(&oper->n, &fs_info->qgroup_op_tree);
1299 spin_unlock(&fs_info->qgroup_op_lock);
1304 * Record a quota operation for processing later on.
1305 * @trans: the transaction we are adding the delayed op to.
1306 * @fs_info: the fs_info for this fs.
1307 * @ref_root: the root of the reference we are acting on,
1308 * @bytenr: the bytenr we are acting on.
1309 * @num_bytes: the number of bytes in the reference.
1310 * @type: the type of operation this is.
1311 * @mod_seq: do we need to get a sequence number for looking up roots.
1313 * We just add it to our trans qgroup_ref_list and carry on and process these
1314 * operations in order at some later point. If the reference root isn't a fs
1315 * root then we don't bother with doing anything.
1317 * MUST BE HOLDING THE REF LOCK.
1319 int btrfs_qgroup_record_ref(struct btrfs_trans_handle *trans,
1320 struct btrfs_fs_info *fs_info, u64 ref_root,
1321 u64 bytenr, u64 num_bytes,
1322 enum btrfs_qgroup_operation_type type, int mod_seq)
1324 struct btrfs_qgroup_operation *oper;
1327 if (!is_fstree(ref_root) || !fs_info->quota_enabled)
1330 oper = kmalloc(sizeof(*oper), GFP_NOFS);
1334 oper->ref_root = ref_root;
1335 oper->bytenr = bytenr;
1336 oper->num_bytes = num_bytes;
1338 oper->seq = atomic_inc_return(&fs_info->qgroup_op_seq);
1339 INIT_LIST_HEAD(&oper->elem.list);
1342 trace_btrfs_qgroup_record_ref(oper);
1344 if (type == BTRFS_QGROUP_OPER_SUB_SUBTREE) {
1346 * If any operation for this bytenr/ref_root combo
1347 * exists, then we know it's not exclusively owned and
1348 * shouldn't be queued up.
1350 * This also catches the case where we have a cloned
1351 * extent that gets queued up multiple times during
1354 if (qgroup_oper_exists(fs_info, oper)) {
1360 ret = insert_qgroup_oper(fs_info, oper);
1362 /* Shouldn't happen so have an assert for developers */
1367 list_add_tail(&oper->list, &trans->qgroup_ref_list);
1370 btrfs_get_tree_mod_seq(fs_info, &oper->elem);
1376 * The easy accounting, if we are adding/removing the only ref for an extent
1377 * then this qgroup and all of the parent qgroups get their refrence and
1378 * exclusive counts adjusted.
1380 static int qgroup_excl_accounting(struct btrfs_fs_info *fs_info,
1381 struct btrfs_qgroup_operation *oper)
1383 struct btrfs_qgroup *qgroup;
1385 struct btrfs_qgroup_list *glist;
1386 struct ulist_node *unode;
1387 struct ulist_iterator uiter;
1391 tmp = ulist_alloc(GFP_NOFS);
1395 spin_lock(&fs_info->qgroup_lock);
1396 if (!fs_info->quota_root)
1398 qgroup = find_qgroup_rb(fs_info, oper->ref_root);
1401 switch (oper->type) {
1402 case BTRFS_QGROUP_OPER_ADD_EXCL:
1405 case BTRFS_QGROUP_OPER_SUB_EXCL:
1411 qgroup->rfer += sign * oper->num_bytes;
1412 qgroup->rfer_cmpr += sign * oper->num_bytes;
1414 WARN_ON(sign < 0 && qgroup->excl < oper->num_bytes);
1415 qgroup->excl += sign * oper->num_bytes;
1416 qgroup->excl_cmpr += sign * oper->num_bytes;
1418 qgroup_dirty(fs_info, qgroup);
1420 /* Get all of the parent groups that contain this qgroup */
1421 list_for_each_entry(glist, &qgroup->groups, next_group) {
1422 ret = ulist_add(tmp, glist->group->qgroupid,
1423 ptr_to_u64(glist->group), GFP_ATOMIC);
1428 /* Iterate all of the parents and adjust their reference counts */
1429 ULIST_ITER_INIT(&uiter);
1430 while ((unode = ulist_next(tmp, &uiter))) {
1431 qgroup = u64_to_ptr(unode->aux);
1432 qgroup->rfer += sign * oper->num_bytes;
1433 qgroup->rfer_cmpr += sign * oper->num_bytes;
1434 qgroup->excl += sign * oper->num_bytes;
1436 WARN_ON(qgroup->excl < oper->num_bytes);
1437 qgroup->excl_cmpr += sign * oper->num_bytes;
1438 qgroup_dirty(fs_info, qgroup);
1440 /* Add any parents of the parents */
1441 list_for_each_entry(glist, &qgroup->groups, next_group) {
1442 ret = ulist_add(tmp, glist->group->qgroupid,
1443 ptr_to_u64(glist->group), GFP_ATOMIC);
1450 spin_unlock(&fs_info->qgroup_lock);
1456 * Walk all of the roots that pointed to our bytenr and adjust their refcnts as
1459 static int qgroup_calc_old_refcnt(struct btrfs_fs_info *fs_info,
1460 u64 root_to_skip, struct ulist *tmp,
1461 struct ulist *roots, struct ulist *qgroups,
1462 u64 seq, int *old_roots, int rescan)
1464 struct ulist_node *unode;
1465 struct ulist_iterator uiter;
1466 struct ulist_node *tmp_unode;
1467 struct ulist_iterator tmp_uiter;
1468 struct btrfs_qgroup *qg;
1471 ULIST_ITER_INIT(&uiter);
1472 while ((unode = ulist_next(roots, &uiter))) {
1473 /* We don't count our current root here */
1474 if (unode->val == root_to_skip)
1476 qg = find_qgroup_rb(fs_info, unode->val);
1480 * We could have a pending removal of this same ref so we may
1481 * not have actually found our ref root when doing
1482 * btrfs_find_all_roots, so we need to keep track of how many
1483 * old roots we find in case we removed ours and added a
1484 * different one at the same time. I don't think this could
1485 * happen in practice but that sort of thinking leads to pain
1486 * and suffering and to the dark side.
1491 ret = ulist_add(qgroups, qg->qgroupid, ptr_to_u64(qg),
1495 ret = ulist_add(tmp, qg->qgroupid, ptr_to_u64(qg), GFP_ATOMIC);
1498 ULIST_ITER_INIT(&tmp_uiter);
1499 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) {
1500 struct btrfs_qgroup_list *glist;
1502 qg = u64_to_ptr(tmp_unode->aux);
1504 * We use this sequence number to keep from having to
1505 * run the whole list and 0 out the refcnt every time.
1506 * We basically use sequnce as the known 0 count and
1507 * then add 1 everytime we see a qgroup. This is how we
1508 * get how many of the roots actually point up to the
1509 * upper level qgroups in order to determine exclusive
1512 * For rescan we want to set old_refcnt to seq so our
1513 * exclusive calculations end up correct.
1516 qg->old_refcnt = seq;
1517 else if (qg->old_refcnt < seq)
1518 qg->old_refcnt = seq + 1;
1522 if (qg->new_refcnt < seq)
1523 qg->new_refcnt = seq + 1;
1526 list_for_each_entry(glist, &qg->groups, next_group) {
1527 ret = ulist_add(qgroups, glist->group->qgroupid,
1528 ptr_to_u64(glist->group),
1532 ret = ulist_add(tmp, glist->group->qgroupid,
1533 ptr_to_u64(glist->group),
1544 * We need to walk forward in our operation tree and account for any roots that
1545 * were deleted after we made this operation.
1547 static int qgroup_account_deleted_refs(struct btrfs_fs_info *fs_info,
1548 struct btrfs_qgroup_operation *oper,
1550 struct ulist *qgroups, u64 seq,
1553 struct ulist_node *unode;
1554 struct ulist_iterator uiter;
1555 struct btrfs_qgroup *qg;
1556 struct btrfs_qgroup_operation *tmp_oper;
1563 * We only walk forward in the tree since we're only interested in
1564 * removals that happened _after_ our operation.
1566 spin_lock(&fs_info->qgroup_op_lock);
1567 n = rb_next(&oper->n);
1568 spin_unlock(&fs_info->qgroup_op_lock);
1571 tmp_oper = rb_entry(n, struct btrfs_qgroup_operation, n);
1572 while (tmp_oper->bytenr == oper->bytenr) {
1574 * If it's not a removal we don't care, additions work out
1575 * properly with our refcnt tracking.
1577 if (tmp_oper->type != BTRFS_QGROUP_OPER_SUB_SHARED &&
1578 tmp_oper->type != BTRFS_QGROUP_OPER_SUB_EXCL)
1580 qg = find_qgroup_rb(fs_info, tmp_oper->ref_root);
1583 ret = ulist_add(qgroups, qg->qgroupid, ptr_to_u64(qg),
1589 * We only want to increase old_roots if this qgroup is
1590 * not already in the list of qgroups. If it is already
1591 * there then that means it must have been re-added or
1592 * the delete will be discarded because we had an
1593 * existing ref that we haven't looked up yet. In this
1594 * case we don't want to increase old_roots. So if ret
1595 * == 1 then we know that this is the first time we've
1596 * seen this qgroup and we can bump the old_roots.
1599 ret = ulist_add(tmp, qg->qgroupid, ptr_to_u64(qg),
1605 spin_lock(&fs_info->qgroup_op_lock);
1606 n = rb_next(&tmp_oper->n);
1607 spin_unlock(&fs_info->qgroup_op_lock);
1610 tmp_oper = rb_entry(n, struct btrfs_qgroup_operation, n);
1613 /* Ok now process the qgroups we found */
1614 ULIST_ITER_INIT(&uiter);
1615 while ((unode = ulist_next(tmp, &uiter))) {
1616 struct btrfs_qgroup_list *glist;
1618 qg = u64_to_ptr(unode->aux);
1619 if (qg->old_refcnt < seq)
1620 qg->old_refcnt = seq + 1;
1623 if (qg->new_refcnt < seq)
1624 qg->new_refcnt = seq + 1;
1627 list_for_each_entry(glist, &qg->groups, next_group) {
1628 ret = ulist_add(qgroups, glist->group->qgroupid,
1629 ptr_to_u64(glist->group), GFP_ATOMIC);
1632 ret = ulist_add(tmp, glist->group->qgroupid,
1633 ptr_to_u64(glist->group), GFP_ATOMIC);
1641 /* Add refcnt for the newly added reference. */
1642 static int qgroup_calc_new_refcnt(struct btrfs_fs_info *fs_info,
1643 struct btrfs_qgroup_operation *oper,
1644 struct btrfs_qgroup *qgroup,
1645 struct ulist *tmp, struct ulist *qgroups,
1648 struct ulist_node *unode;
1649 struct ulist_iterator uiter;
1650 struct btrfs_qgroup *qg;
1654 ret = ulist_add(qgroups, qgroup->qgroupid, ptr_to_u64(qgroup),
1658 ret = ulist_add(tmp, qgroup->qgroupid, ptr_to_u64(qgroup),
1662 ULIST_ITER_INIT(&uiter);
1663 while ((unode = ulist_next(tmp, &uiter))) {
1664 struct btrfs_qgroup_list *glist;
1666 qg = u64_to_ptr(unode->aux);
1667 if (oper->type == BTRFS_QGROUP_OPER_ADD_SHARED) {
1668 if (qg->new_refcnt < seq)
1669 qg->new_refcnt = seq + 1;
1673 if (qg->old_refcnt < seq)
1674 qg->old_refcnt = seq + 1;
1678 list_for_each_entry(glist, &qg->groups, next_group) {
1679 ret = ulist_add(tmp, glist->group->qgroupid,
1680 ptr_to_u64(glist->group), GFP_ATOMIC);
1683 ret = ulist_add(qgroups, glist->group->qgroupid,
1684 ptr_to_u64(glist->group), GFP_ATOMIC);
1693 * This adjusts the counters for all referenced qgroups if need be.
1695 static int qgroup_adjust_counters(struct btrfs_fs_info *fs_info,
1696 u64 root_to_skip, u64 num_bytes,
1697 struct ulist *qgroups, u64 seq,
1698 int old_roots, int new_roots, int rescan)
1700 struct ulist_node *unode;
1701 struct ulist_iterator uiter;
1702 struct btrfs_qgroup *qg;
1703 u64 cur_new_count, cur_old_count;
1705 ULIST_ITER_INIT(&uiter);
1706 while ((unode = ulist_next(qgroups, &uiter))) {
1709 qg = u64_to_ptr(unode->aux);
1711 * Wasn't referenced before but is now, add to the reference
1714 if (qg->old_refcnt <= seq && qg->new_refcnt > seq) {
1715 qg->rfer += num_bytes;
1716 qg->rfer_cmpr += num_bytes;
1721 * Was referenced before but isn't now, subtract from the
1722 * reference counters.
1724 if (qg->old_refcnt > seq && qg->new_refcnt <= seq) {
1725 qg->rfer -= num_bytes;
1726 qg->rfer_cmpr -= num_bytes;
1730 if (qg->old_refcnt < seq)
1733 cur_old_count = qg->old_refcnt - seq;
1734 if (qg->new_refcnt < seq)
1737 cur_new_count = qg->new_refcnt - seq;
1740 * If our refcount was the same as the roots previously but our
1741 * new count isn't the same as the number of roots now then we
1742 * went from having a exclusive reference on this range to not.
1744 if (old_roots && cur_old_count == old_roots &&
1745 (cur_new_count != new_roots || new_roots == 0)) {
1746 WARN_ON(cur_new_count != new_roots && new_roots == 0);
1747 qg->excl -= num_bytes;
1748 qg->excl_cmpr -= num_bytes;
1753 * If we didn't reference all the roots before but now we do we
1754 * have an exclusive reference to this range.
1756 if ((!old_roots || (old_roots && cur_old_count != old_roots))
1757 && cur_new_count == new_roots) {
1758 qg->excl += num_bytes;
1759 qg->excl_cmpr += num_bytes;
1764 qgroup_dirty(fs_info, qg);
1770 * If we removed a data extent and there were other references for that bytenr
1771 * then we need to lookup all referenced roots to make sure we still don't
1772 * reference this bytenr. If we do then we can just discard this operation.
1774 static int check_existing_refs(struct btrfs_trans_handle *trans,
1775 struct btrfs_fs_info *fs_info,
1776 struct btrfs_qgroup_operation *oper)
1778 struct ulist *roots = NULL;
1779 struct ulist_node *unode;
1780 struct ulist_iterator uiter;
1783 ret = btrfs_find_all_roots(trans, fs_info, oper->bytenr,
1784 oper->elem.seq, &roots);
1789 ULIST_ITER_INIT(&uiter);
1790 while ((unode = ulist_next(roots, &uiter))) {
1791 if (unode->val == oper->ref_root) {
1797 btrfs_put_tree_mod_seq(fs_info, &oper->elem);
1803 * If we share a reference across multiple roots then we may need to adjust
1804 * various qgroups referenced and exclusive counters. The basic premise is this
1806 * 1) We have seq to represent a 0 count. Instead of looping through all of the
1807 * qgroups and resetting their refcount to 0 we just constantly bump this
1808 * sequence number to act as the base reference count. This means that if
1809 * anybody is equal to or below this sequence they were never referenced. We
1810 * jack this sequence up by the number of roots we found each time in order to
1811 * make sure we don't have any overlap.
1813 * 2) We first search all the roots that reference the area _except_ the root
1814 * we're acting on currently. This makes up the old_refcnt of all the qgroups
1817 * 3) We walk all of the qgroups referenced by the root we are currently acting
1818 * on, and will either adjust old_refcnt in the case of a removal or the
1819 * new_refcnt in the case of an addition.
1821 * 4) Finally we walk all the qgroups that are referenced by this range
1822 * including the root we are acting on currently. We will adjust the counters
1823 * based on the number of roots we had and will have after this operation.
1825 * Take this example as an illustration
1829 * [qg 0/0] [qg 0/1] [qg 0/2]
1833 * Say we are adding a reference that is covered by qg 0/0. The first step
1834 * would give a refcnt of 1 to qg 0/1 and 0/2 and a refcnt of 2 to qg 1/0 with
1835 * old_roots being 2. Because it is adding new_roots will be 1. We then go
1836 * through qg 0/0 which will get the new_refcnt set to 1 and add 1 to qg 1/0's
1837 * new_refcnt, bringing it to 3. We then walk through all of the qgroups, we
1838 * notice that the old refcnt for qg 0/0 < the new refcnt, so we added a
1839 * reference and thus must add the size to the referenced bytes. Everything
1840 * else is the same so nothing else changes.
1842 static int qgroup_shared_accounting(struct btrfs_trans_handle *trans,
1843 struct btrfs_fs_info *fs_info,
1844 struct btrfs_qgroup_operation *oper)
1846 struct ulist *roots = NULL;
1847 struct ulist *qgroups, *tmp;
1848 struct btrfs_qgroup *qgroup;
1849 struct seq_list elem = {};
1855 if (oper->elem.seq) {
1856 ret = check_existing_refs(trans, fs_info, oper);
1863 qgroups = ulist_alloc(GFP_NOFS);
1867 tmp = ulist_alloc(GFP_NOFS);
1869 ulist_free(qgroups);
1873 btrfs_get_tree_mod_seq(fs_info, &elem);
1874 ret = btrfs_find_all_roots(trans, fs_info, oper->bytenr, elem.seq,
1876 btrfs_put_tree_mod_seq(fs_info, &elem);
1878 ulist_free(qgroups);
1882 spin_lock(&fs_info->qgroup_lock);
1883 qgroup = find_qgroup_rb(fs_info, oper->ref_root);
1886 seq = fs_info->qgroup_seq;
1889 * So roots is the list of all the roots currently pointing at the
1890 * bytenr, including the ref we are adding if we are adding, or not if
1891 * we are removing a ref. So we pass in the ref_root to skip that root
1892 * in our calculations. We set old_refnct and new_refcnt cause who the
1893 * hell knows what everything looked like before, and it doesn't matter
1896 ret = qgroup_calc_old_refcnt(fs_info, oper->ref_root, tmp, roots, qgroups,
1897 seq, &old_roots, 0);
1902 * Now adjust the refcounts of the qgroups that care about this
1903 * reference, either the old_count in the case of removal or new_count
1904 * in the case of an addition.
1906 ret = qgroup_calc_new_refcnt(fs_info, oper, qgroup, tmp, qgroups,
1912 * ...in the case of removals. If we had a removal before we got around
1913 * to processing this operation then we need to find that guy and count
1914 * his references as if they really existed so we don't end up screwing
1915 * up the exclusive counts. Then whenever we go to process the delete
1916 * everything will be grand and we can account for whatever exclusive
1917 * changes need to be made there. We also have to pass in old_roots so
1918 * we have an accurate count of the roots as it pertains to this
1919 * operations view of the world.
1921 ret = qgroup_account_deleted_refs(fs_info, oper, tmp, qgroups, seq,
1927 * We are adding our root, need to adjust up the number of roots,
1928 * otherwise old_roots is the number of roots we want.
1930 if (oper->type == BTRFS_QGROUP_OPER_ADD_SHARED) {
1931 new_roots = old_roots + 1;
1933 new_roots = old_roots;
1936 fs_info->qgroup_seq += old_roots + 1;
1940 * And now the magic happens, bless Arne for having a pretty elegant
1941 * solution for this.
1943 qgroup_adjust_counters(fs_info, oper->ref_root, oper->num_bytes,
1944 qgroups, seq, old_roots, new_roots, 0);
1946 spin_unlock(&fs_info->qgroup_lock);
1947 ulist_free(qgroups);
1954 * Process a reference to a shared subtree. This type of operation is
1955 * queued during snapshot removal when we encounter extents which are
1956 * shared between more than one root.
1958 static int qgroup_subtree_accounting(struct btrfs_trans_handle *trans,
1959 struct btrfs_fs_info *fs_info,
1960 struct btrfs_qgroup_operation *oper)
1962 struct ulist *roots = NULL;
1963 struct ulist_node *unode;
1964 struct ulist_iterator uiter;
1965 struct btrfs_qgroup_list *glist;
1966 struct ulist *parents;
1969 struct btrfs_qgroup *qg;
1971 struct seq_list elem = {};
1973 parents = ulist_alloc(GFP_NOFS);
1977 btrfs_get_tree_mod_seq(fs_info, &elem);
1978 ret = btrfs_find_all_roots(trans, fs_info, oper->bytenr,
1980 btrfs_put_tree_mod_seq(fs_info, &elem);
1984 if (roots->nnodes != 1)
1987 ULIST_ITER_INIT(&uiter);
1988 unode = ulist_next(roots, &uiter); /* Only want 1 so no need to loop */
1990 * If we find our ref root then that means all refs
1991 * this extent has to the root have not yet been
1992 * deleted. In that case, we do nothing and let the
1993 * last ref for this bytenr drive our update.
1995 * This can happen for example if an extent is
1996 * referenced multiple times in a snapshot (clone,
1997 * etc). If we are in the middle of snapshot removal,
1998 * queued updates for such an extent will find the
1999 * root if we have not yet finished removing the
2002 if (unode->val == oper->ref_root)
2005 root_obj = unode->val;
2008 spin_lock(&fs_info->qgroup_lock);
2009 qg = find_qgroup_rb(fs_info, root_obj);
2013 qg->excl += oper->num_bytes;
2014 qg->excl_cmpr += oper->num_bytes;
2015 qgroup_dirty(fs_info, qg);
2018 * Adjust counts for parent groups. First we find all
2019 * parents, then in the 2nd loop we do the adjustment
2020 * while adding parents of the parents to our ulist.
2022 list_for_each_entry(glist, &qg->groups, next_group) {
2023 err = ulist_add(parents, glist->group->qgroupid,
2024 ptr_to_u64(glist->group), GFP_ATOMIC);
2031 ULIST_ITER_INIT(&uiter);
2032 while ((unode = ulist_next(parents, &uiter))) {
2033 qg = u64_to_ptr(unode->aux);
2034 qg->excl += oper->num_bytes;
2035 qg->excl_cmpr += oper->num_bytes;
2036 qgroup_dirty(fs_info, qg);
2038 /* Add any parents of the parents */
2039 list_for_each_entry(glist, &qg->groups, next_group) {
2040 err = ulist_add(parents, glist->group->qgroupid,
2041 ptr_to_u64(glist->group), GFP_ATOMIC);
2050 spin_unlock(&fs_info->qgroup_lock);
2054 ulist_free(parents);
2059 * btrfs_qgroup_account_ref is called for every ref that is added to or deleted
2060 * from the fs. First, all roots referencing the extent are searched, and
2061 * then the space is accounted accordingly to the different roots. The
2062 * accounting algorithm works in 3 steps documented inline.
2064 static int btrfs_qgroup_account(struct btrfs_trans_handle *trans,
2065 struct btrfs_fs_info *fs_info,
2066 struct btrfs_qgroup_operation *oper)
2070 if (!fs_info->quota_enabled)
2073 BUG_ON(!fs_info->quota_root);
2075 mutex_lock(&fs_info->qgroup_rescan_lock);
2076 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
2077 if (fs_info->qgroup_rescan_progress.objectid <= oper->bytenr) {
2078 mutex_unlock(&fs_info->qgroup_rescan_lock);
2082 mutex_unlock(&fs_info->qgroup_rescan_lock);
2084 ASSERT(is_fstree(oper->ref_root));
2086 trace_btrfs_qgroup_account(oper);
2088 switch (oper->type) {
2089 case BTRFS_QGROUP_OPER_ADD_EXCL:
2090 case BTRFS_QGROUP_OPER_SUB_EXCL:
2091 ret = qgroup_excl_accounting(fs_info, oper);
2093 case BTRFS_QGROUP_OPER_ADD_SHARED:
2094 case BTRFS_QGROUP_OPER_SUB_SHARED:
2095 ret = qgroup_shared_accounting(trans, fs_info, oper);
2097 case BTRFS_QGROUP_OPER_SUB_SUBTREE:
2098 ret = qgroup_subtree_accounting(trans, fs_info, oper);
2107 * Needs to be called everytime we run delayed refs, even if there is an error
2108 * in order to cleanup outstanding operations.
2110 int btrfs_delayed_qgroup_accounting(struct btrfs_trans_handle *trans,
2111 struct btrfs_fs_info *fs_info)
2113 struct btrfs_qgroup_operation *oper;
2116 while (!list_empty(&trans->qgroup_ref_list)) {
2117 oper = list_first_entry(&trans->qgroup_ref_list,
2118 struct btrfs_qgroup_operation, list);
2119 list_del_init(&oper->list);
2120 if (!ret || !trans->aborted)
2121 ret = btrfs_qgroup_account(trans, fs_info, oper);
2122 spin_lock(&fs_info->qgroup_op_lock);
2123 rb_erase(&oper->n, &fs_info->qgroup_op_tree);
2124 spin_unlock(&fs_info->qgroup_op_lock);
2125 btrfs_put_tree_mod_seq(fs_info, &oper->elem);
2132 * called from commit_transaction. Writes all changed qgroups to disk.
2134 int btrfs_run_qgroups(struct btrfs_trans_handle *trans,
2135 struct btrfs_fs_info *fs_info)
2137 struct btrfs_root *quota_root = fs_info->quota_root;
2139 int start_rescan_worker = 0;
2144 if (!fs_info->quota_enabled && fs_info->pending_quota_state)
2145 start_rescan_worker = 1;
2147 fs_info->quota_enabled = fs_info->pending_quota_state;
2149 spin_lock(&fs_info->qgroup_lock);
2150 while (!list_empty(&fs_info->dirty_qgroups)) {
2151 struct btrfs_qgroup *qgroup;
2152 qgroup = list_first_entry(&fs_info->dirty_qgroups,
2153 struct btrfs_qgroup, dirty);
2154 list_del_init(&qgroup->dirty);
2155 spin_unlock(&fs_info->qgroup_lock);
2156 ret = update_qgroup_info_item(trans, quota_root, qgroup);
2158 fs_info->qgroup_flags |=
2159 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2160 spin_lock(&fs_info->qgroup_lock);
2162 if (fs_info->quota_enabled)
2163 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON;
2165 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
2166 spin_unlock(&fs_info->qgroup_lock);
2168 ret = update_qgroup_status_item(trans, fs_info, quota_root);
2170 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2172 if (!ret && start_rescan_worker) {
2173 ret = qgroup_rescan_init(fs_info, 0, 1);
2175 qgroup_rescan_zero_tracking(fs_info);
2176 btrfs_queue_work(fs_info->qgroup_rescan_workers,
2177 &fs_info->qgroup_rescan_work);
2188 * copy the acounting information between qgroups. This is necessary when a
2189 * snapshot or a subvolume is created
2191 int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans,
2192 struct btrfs_fs_info *fs_info, u64 srcid, u64 objectid,
2193 struct btrfs_qgroup_inherit *inherit)
2198 struct btrfs_root *quota_root = fs_info->quota_root;
2199 struct btrfs_qgroup *srcgroup;
2200 struct btrfs_qgroup *dstgroup;
2204 mutex_lock(&fs_info->qgroup_ioctl_lock);
2205 if (!fs_info->quota_enabled)
2214 i_qgroups = (u64 *)(inherit + 1);
2215 nums = inherit->num_qgroups + 2 * inherit->num_ref_copies +
2216 2 * inherit->num_excl_copies;
2217 for (i = 0; i < nums; ++i) {
2218 srcgroup = find_qgroup_rb(fs_info, *i_qgroups);
2228 * create a tracking group for the subvol itself
2230 ret = add_qgroup_item(trans, quota_root, objectid);
2234 if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) {
2235 ret = update_qgroup_limit_item(trans, quota_root, objectid,
2237 inherit->lim.max_rfer,
2238 inherit->lim.max_excl,
2239 inherit->lim.rsv_rfer,
2240 inherit->lim.rsv_excl);
2246 struct btrfs_root *srcroot;
2247 struct btrfs_key srckey;
2249 srckey.objectid = srcid;
2250 srckey.type = BTRFS_ROOT_ITEM_KEY;
2251 srckey.offset = (u64)-1;
2252 srcroot = btrfs_read_fs_root_no_name(fs_info, &srckey);
2253 if (IS_ERR(srcroot)) {
2254 ret = PTR_ERR(srcroot);
2259 level_size = srcroot->nodesize;
2264 * add qgroup to all inherited groups
2267 i_qgroups = (u64 *)(inherit + 1);
2268 for (i = 0; i < inherit->num_qgroups; ++i) {
2269 ret = add_qgroup_relation_item(trans, quota_root,
2270 objectid, *i_qgroups);
2273 ret = add_qgroup_relation_item(trans, quota_root,
2274 *i_qgroups, objectid);
2282 spin_lock(&fs_info->qgroup_lock);
2284 dstgroup = add_qgroup_rb(fs_info, objectid);
2285 if (IS_ERR(dstgroup)) {
2286 ret = PTR_ERR(dstgroup);
2291 srcgroup = find_qgroup_rb(fs_info, srcid);
2296 * We call inherit after we clone the root in order to make sure
2297 * our counts don't go crazy, so at this point the only
2298 * difference between the two roots should be the root node.
2300 dstgroup->rfer = srcgroup->rfer;
2301 dstgroup->rfer_cmpr = srcgroup->rfer_cmpr;
2302 dstgroup->excl = level_size;
2303 dstgroup->excl_cmpr = level_size;
2304 srcgroup->excl = level_size;
2305 srcgroup->excl_cmpr = level_size;
2306 qgroup_dirty(fs_info, dstgroup);
2307 qgroup_dirty(fs_info, srcgroup);
2313 i_qgroups = (u64 *)(inherit + 1);
2314 for (i = 0; i < inherit->num_qgroups; ++i) {
2315 ret = add_relation_rb(quota_root->fs_info, objectid,
2322 for (i = 0; i < inherit->num_ref_copies; ++i) {
2323 struct btrfs_qgroup *src;
2324 struct btrfs_qgroup *dst;
2326 src = find_qgroup_rb(fs_info, i_qgroups[0]);
2327 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
2334 dst->rfer = src->rfer - level_size;
2335 dst->rfer_cmpr = src->rfer_cmpr - level_size;
2338 for (i = 0; i < inherit->num_excl_copies; ++i) {
2339 struct btrfs_qgroup *src;
2340 struct btrfs_qgroup *dst;
2342 src = find_qgroup_rb(fs_info, i_qgroups[0]);
2343 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
2350 dst->excl = src->excl + level_size;
2351 dst->excl_cmpr = src->excl_cmpr + level_size;
2356 spin_unlock(&fs_info->qgroup_lock);
2358 mutex_unlock(&fs_info->qgroup_ioctl_lock);
2363 * reserve some space for a qgroup and all its parents. The reservation takes
2364 * place with start_transaction or dealloc_reserve, similar to ENOSPC
2365 * accounting. If not enough space is available, EDQUOT is returned.
2366 * We assume that the requested space is new for all qgroups.
2368 int btrfs_qgroup_reserve(struct btrfs_root *root, u64 num_bytes)
2370 struct btrfs_root *quota_root;
2371 struct btrfs_qgroup *qgroup;
2372 struct btrfs_fs_info *fs_info = root->fs_info;
2373 u64 ref_root = root->root_key.objectid;
2375 struct ulist_node *unode;
2376 struct ulist_iterator uiter;
2378 if (!is_fstree(ref_root))
2384 spin_lock(&fs_info->qgroup_lock);
2385 quota_root = fs_info->quota_root;
2389 qgroup = find_qgroup_rb(fs_info, ref_root);
2394 * in a first step, we check all affected qgroups if any limits would
2397 ulist_reinit(fs_info->qgroup_ulist);
2398 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
2399 (uintptr_t)qgroup, GFP_ATOMIC);
2402 ULIST_ITER_INIT(&uiter);
2403 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2404 struct btrfs_qgroup *qg;
2405 struct btrfs_qgroup_list *glist;
2407 qg = u64_to_ptr(unode->aux);
2409 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) &&
2410 qg->reserved + (s64)qg->rfer + num_bytes >
2416 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) &&
2417 qg->reserved + (s64)qg->excl + num_bytes >
2423 list_for_each_entry(glist, &qg->groups, next_group) {
2424 ret = ulist_add(fs_info->qgroup_ulist,
2425 glist->group->qgroupid,
2426 (uintptr_t)glist->group, GFP_ATOMIC);
2433 * no limits exceeded, now record the reservation into all qgroups
2435 ULIST_ITER_INIT(&uiter);
2436 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2437 struct btrfs_qgroup *qg;
2439 qg = u64_to_ptr(unode->aux);
2441 qg->reserved += num_bytes;
2445 spin_unlock(&fs_info->qgroup_lock);
2449 void btrfs_qgroup_free(struct btrfs_root *root, u64 num_bytes)
2451 struct btrfs_root *quota_root;
2452 struct btrfs_qgroup *qgroup;
2453 struct btrfs_fs_info *fs_info = root->fs_info;
2454 struct ulist_node *unode;
2455 struct ulist_iterator uiter;
2456 u64 ref_root = root->root_key.objectid;
2459 if (!is_fstree(ref_root))
2465 spin_lock(&fs_info->qgroup_lock);
2467 quota_root = fs_info->quota_root;
2471 qgroup = find_qgroup_rb(fs_info, ref_root);
2475 ulist_reinit(fs_info->qgroup_ulist);
2476 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
2477 (uintptr_t)qgroup, GFP_ATOMIC);
2480 ULIST_ITER_INIT(&uiter);
2481 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2482 struct btrfs_qgroup *qg;
2483 struct btrfs_qgroup_list *glist;
2485 qg = u64_to_ptr(unode->aux);
2487 qg->reserved -= num_bytes;
2489 list_for_each_entry(glist, &qg->groups, next_group) {
2490 ret = ulist_add(fs_info->qgroup_ulist,
2491 glist->group->qgroupid,
2492 (uintptr_t)glist->group, GFP_ATOMIC);
2499 spin_unlock(&fs_info->qgroup_lock);
2502 void assert_qgroups_uptodate(struct btrfs_trans_handle *trans)
2504 if (list_empty(&trans->qgroup_ref_list) && !trans->delayed_ref_elem.seq)
2506 btrfs_err(trans->root->fs_info,
2507 "qgroups not uptodate in trans handle %p: list is%s empty, "
2509 trans, list_empty(&trans->qgroup_ref_list) ? "" : " not",
2510 (u32)(trans->delayed_ref_elem.seq >> 32),
2511 (u32)trans->delayed_ref_elem.seq);
2516 * returns < 0 on error, 0 when more leafs are to be scanned.
2517 * returns 1 when done, 2 when done and FLAG_INCONSISTENT was cleared.
2520 qgroup_rescan_leaf(struct btrfs_fs_info *fs_info, struct btrfs_path *path,
2521 struct btrfs_trans_handle *trans, struct ulist *qgroups,
2522 struct ulist *tmp, struct extent_buffer *scratch_leaf)
2524 struct btrfs_key found;
2525 struct ulist *roots = NULL;
2526 struct seq_list tree_mod_seq_elem = {};
2533 path->leave_spinning = 1;
2534 mutex_lock(&fs_info->qgroup_rescan_lock);
2535 ret = btrfs_search_slot_for_read(fs_info->extent_root,
2536 &fs_info->qgroup_rescan_progress,
2539 pr_debug("current progress key (%llu %u %llu), search_slot ret %d\n",
2540 fs_info->qgroup_rescan_progress.objectid,
2541 fs_info->qgroup_rescan_progress.type,
2542 fs_info->qgroup_rescan_progress.offset, ret);
2546 * The rescan is about to end, we will not be scanning any
2547 * further blocks. We cannot unset the RESCAN flag here, because
2548 * we want to commit the transaction if everything went well.
2549 * To make the live accounting work in this phase, we set our
2550 * scan progress pointer such that every real extent objectid
2553 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
2554 btrfs_release_path(path);
2555 mutex_unlock(&fs_info->qgroup_rescan_lock);
2559 btrfs_item_key_to_cpu(path->nodes[0], &found,
2560 btrfs_header_nritems(path->nodes[0]) - 1);
2561 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1;
2563 btrfs_get_tree_mod_seq(fs_info, &tree_mod_seq_elem);
2564 memcpy(scratch_leaf, path->nodes[0], sizeof(*scratch_leaf));
2565 slot = path->slots[0];
2566 btrfs_release_path(path);
2567 mutex_unlock(&fs_info->qgroup_rescan_lock);
2569 for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
2570 btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
2571 if (found.type != BTRFS_EXTENT_ITEM_KEY &&
2572 found.type != BTRFS_METADATA_ITEM_KEY)
2574 if (found.type == BTRFS_METADATA_ITEM_KEY)
2575 num_bytes = fs_info->extent_root->nodesize;
2577 num_bytes = found.offset;
2579 ulist_reinit(qgroups);
2580 ret = btrfs_find_all_roots(NULL, fs_info, found.objectid, 0,
2584 spin_lock(&fs_info->qgroup_lock);
2585 seq = fs_info->qgroup_seq;
2586 fs_info->qgroup_seq += roots->nnodes + 1; /* max refcnt */
2589 ret = qgroup_calc_old_refcnt(fs_info, 0, tmp, roots, qgroups,
2590 seq, &new_roots, 1);
2592 spin_unlock(&fs_info->qgroup_lock);
2597 ret = qgroup_adjust_counters(fs_info, 0, num_bytes, qgroups,
2598 seq, 0, new_roots, 1);
2600 spin_unlock(&fs_info->qgroup_lock);
2604 spin_unlock(&fs_info->qgroup_lock);
2608 btrfs_put_tree_mod_seq(fs_info, &tree_mod_seq_elem);
2613 static void btrfs_qgroup_rescan_worker(struct btrfs_work *work)
2615 struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info,
2616 qgroup_rescan_work);
2617 struct btrfs_path *path;
2618 struct btrfs_trans_handle *trans = NULL;
2619 struct ulist *tmp = NULL, *qgroups = NULL;
2620 struct extent_buffer *scratch_leaf = NULL;
2623 path = btrfs_alloc_path();
2626 qgroups = ulist_alloc(GFP_NOFS);
2629 tmp = ulist_alloc(GFP_NOFS);
2632 scratch_leaf = kmalloc(sizeof(*scratch_leaf), GFP_NOFS);
2638 trans = btrfs_start_transaction(fs_info->fs_root, 0);
2639 if (IS_ERR(trans)) {
2640 err = PTR_ERR(trans);
2643 if (!fs_info->quota_enabled) {
2646 err = qgroup_rescan_leaf(fs_info, path, trans,
2647 qgroups, tmp, scratch_leaf);
2650 btrfs_commit_transaction(trans, fs_info->fs_root);
2652 btrfs_end_transaction(trans, fs_info->fs_root);
2656 kfree(scratch_leaf);
2657 ulist_free(qgroups);
2659 btrfs_free_path(path);
2661 mutex_lock(&fs_info->qgroup_rescan_lock);
2662 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2665 fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) {
2666 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2667 } else if (err < 0) {
2668 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2670 mutex_unlock(&fs_info->qgroup_rescan_lock);
2673 btrfs_info(fs_info, "qgroup scan completed%s",
2674 err == 2 ? " (inconsistency flag cleared)" : "");
2676 btrfs_err(fs_info, "qgroup scan failed with %d", err);
2679 complete_all(&fs_info->qgroup_rescan_completion);
2683 * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all
2684 * memory required for the rescan context.
2687 qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
2693 (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) ||
2694 !(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))) {
2699 mutex_lock(&fs_info->qgroup_rescan_lock);
2700 spin_lock(&fs_info->qgroup_lock);
2703 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
2705 else if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))
2709 spin_unlock(&fs_info->qgroup_lock);
2710 mutex_unlock(&fs_info->qgroup_rescan_lock);
2714 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2717 memset(&fs_info->qgroup_rescan_progress, 0,
2718 sizeof(fs_info->qgroup_rescan_progress));
2719 fs_info->qgroup_rescan_progress.objectid = progress_objectid;
2721 spin_unlock(&fs_info->qgroup_lock);
2722 mutex_unlock(&fs_info->qgroup_rescan_lock);
2724 init_completion(&fs_info->qgroup_rescan_completion);
2726 memset(&fs_info->qgroup_rescan_work, 0,
2727 sizeof(fs_info->qgroup_rescan_work));
2728 btrfs_init_work(&fs_info->qgroup_rescan_work,
2729 btrfs_qgroup_rescan_helper,
2730 btrfs_qgroup_rescan_worker, NULL, NULL);
2734 btrfs_info(fs_info, "qgroup_rescan_init failed with %d", ret);
2742 qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info)
2745 struct btrfs_qgroup *qgroup;
2747 spin_lock(&fs_info->qgroup_lock);
2748 /* clear all current qgroup tracking information */
2749 for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) {
2750 qgroup = rb_entry(n, struct btrfs_qgroup, node);
2752 qgroup->rfer_cmpr = 0;
2754 qgroup->excl_cmpr = 0;
2756 spin_unlock(&fs_info->qgroup_lock);
2760 btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info)
2763 struct btrfs_trans_handle *trans;
2765 ret = qgroup_rescan_init(fs_info, 0, 1);
2770 * We have set the rescan_progress to 0, which means no more
2771 * delayed refs will be accounted by btrfs_qgroup_account_ref.
2772 * However, btrfs_qgroup_account_ref may be right after its call
2773 * to btrfs_find_all_roots, in which case it would still do the
2775 * To solve this, we're committing the transaction, which will
2776 * ensure we run all delayed refs and only after that, we are
2777 * going to clear all tracking information for a clean start.
2780 trans = btrfs_join_transaction(fs_info->fs_root);
2781 if (IS_ERR(trans)) {
2782 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2783 return PTR_ERR(trans);
2785 ret = btrfs_commit_transaction(trans, fs_info->fs_root);
2787 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2791 qgroup_rescan_zero_tracking(fs_info);
2793 btrfs_queue_work(fs_info->qgroup_rescan_workers,
2794 &fs_info->qgroup_rescan_work);
2799 int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info)
2804 mutex_lock(&fs_info->qgroup_rescan_lock);
2805 spin_lock(&fs_info->qgroup_lock);
2806 running = fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2807 spin_unlock(&fs_info->qgroup_lock);
2808 mutex_unlock(&fs_info->qgroup_rescan_lock);
2811 ret = wait_for_completion_interruptible(
2812 &fs_info->qgroup_rescan_completion);
2818 * this is only called from open_ctree where we're still single threaded, thus
2819 * locking is omitted here.
2822 btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info)
2824 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
2825 btrfs_queue_work(fs_info->qgroup_rescan_workers,
2826 &fs_info->qgroup_rescan_work);