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"
39 * - subvol delete -> delete when ref goes to 0? delete limits also?
43 * - copy also limits on subvol creation
45 * - caches fuer ulists
46 * - performance benchmarks
47 * - check all ioctl parameters
51 * one struct for each qgroup, organized in fs_info->qgroup_tree.
59 u64 rfer; /* referenced */
60 u64 rfer_cmpr; /* referenced compressed */
61 u64 excl; /* exclusive */
62 u64 excl_cmpr; /* exclusive compressed */
67 u64 lim_flags; /* which limits are set */
74 * reservation tracking
81 struct list_head groups; /* groups this group is member of */
82 struct list_head members; /* groups that are members of this group */
83 struct list_head dirty; /* dirty groups */
84 struct rb_node node; /* tree of qgroups */
87 * temp variables for accounting operations
88 * Refer to qgroup_shared_accounting() for details.
94 static void btrfs_qgroup_update_old_refcnt(struct btrfs_qgroup *qg, u64 seq,
97 if (qg->old_refcnt < seq)
99 qg->old_refcnt += mod;
102 static void btrfs_qgroup_update_new_refcnt(struct btrfs_qgroup *qg, u64 seq,
105 if (qg->new_refcnt < seq)
106 qg->new_refcnt = seq;
107 qg->new_refcnt += mod;
110 static inline u64 btrfs_qgroup_get_old_refcnt(struct btrfs_qgroup *qg, u64 seq)
112 if (qg->old_refcnt < seq)
114 return qg->old_refcnt - seq;
117 static inline u64 btrfs_qgroup_get_new_refcnt(struct btrfs_qgroup *qg, u64 seq)
119 if (qg->new_refcnt < seq)
121 return qg->new_refcnt - seq;
125 * glue structure to represent the relations between qgroups.
127 struct btrfs_qgroup_list {
128 struct list_head next_group;
129 struct list_head next_member;
130 struct btrfs_qgroup *group;
131 struct btrfs_qgroup *member;
134 static inline u64 qgroup_to_aux(struct btrfs_qgroup *qg)
136 return (u64)(uintptr_t)qg;
139 static inline struct btrfs_qgroup* unode_aux_to_qgroup(struct ulist_node *n)
141 return (struct btrfs_qgroup *)(uintptr_t)n->aux;
145 qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
147 static void qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info);
149 /* must be called with qgroup_ioctl_lock held */
150 static struct btrfs_qgroup *find_qgroup_rb(struct btrfs_fs_info *fs_info,
153 struct rb_node *n = fs_info->qgroup_tree.rb_node;
154 struct btrfs_qgroup *qgroup;
157 qgroup = rb_entry(n, struct btrfs_qgroup, node);
158 if (qgroup->qgroupid < qgroupid)
160 else if (qgroup->qgroupid > qgroupid)
168 /* must be called with qgroup_lock held */
169 static struct btrfs_qgroup *add_qgroup_rb(struct btrfs_fs_info *fs_info,
172 struct rb_node **p = &fs_info->qgroup_tree.rb_node;
173 struct rb_node *parent = NULL;
174 struct btrfs_qgroup *qgroup;
178 qgroup = rb_entry(parent, struct btrfs_qgroup, node);
180 if (qgroup->qgroupid < qgroupid)
182 else if (qgroup->qgroupid > qgroupid)
188 qgroup = kzalloc(sizeof(*qgroup), GFP_ATOMIC);
190 return ERR_PTR(-ENOMEM);
192 qgroup->qgroupid = qgroupid;
193 INIT_LIST_HEAD(&qgroup->groups);
194 INIT_LIST_HEAD(&qgroup->members);
195 INIT_LIST_HEAD(&qgroup->dirty);
197 rb_link_node(&qgroup->node, parent, p);
198 rb_insert_color(&qgroup->node, &fs_info->qgroup_tree);
203 static void __del_qgroup_rb(struct btrfs_qgroup *qgroup)
205 struct btrfs_qgroup_list *list;
207 list_del(&qgroup->dirty);
208 while (!list_empty(&qgroup->groups)) {
209 list = list_first_entry(&qgroup->groups,
210 struct btrfs_qgroup_list, next_group);
211 list_del(&list->next_group);
212 list_del(&list->next_member);
216 while (!list_empty(&qgroup->members)) {
217 list = list_first_entry(&qgroup->members,
218 struct btrfs_qgroup_list, next_member);
219 list_del(&list->next_group);
220 list_del(&list->next_member);
226 /* must be called with qgroup_lock held */
227 static int del_qgroup_rb(struct btrfs_fs_info *fs_info, u64 qgroupid)
229 struct btrfs_qgroup *qgroup = find_qgroup_rb(fs_info, qgroupid);
234 rb_erase(&qgroup->node, &fs_info->qgroup_tree);
235 __del_qgroup_rb(qgroup);
239 /* must be called with qgroup_lock held */
240 static int add_relation_rb(struct btrfs_fs_info *fs_info,
241 u64 memberid, u64 parentid)
243 struct btrfs_qgroup *member;
244 struct btrfs_qgroup *parent;
245 struct btrfs_qgroup_list *list;
247 member = find_qgroup_rb(fs_info, memberid);
248 parent = find_qgroup_rb(fs_info, parentid);
249 if (!member || !parent)
252 list = kzalloc(sizeof(*list), GFP_ATOMIC);
256 list->group = parent;
257 list->member = member;
258 list_add_tail(&list->next_group, &member->groups);
259 list_add_tail(&list->next_member, &parent->members);
264 /* must be called with qgroup_lock held */
265 static int del_relation_rb(struct btrfs_fs_info *fs_info,
266 u64 memberid, u64 parentid)
268 struct btrfs_qgroup *member;
269 struct btrfs_qgroup *parent;
270 struct btrfs_qgroup_list *list;
272 member = find_qgroup_rb(fs_info, memberid);
273 parent = find_qgroup_rb(fs_info, parentid);
274 if (!member || !parent)
277 list_for_each_entry(list, &member->groups, next_group) {
278 if (list->group == parent) {
279 list_del(&list->next_group);
280 list_del(&list->next_member);
288 #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
289 int btrfs_verify_qgroup_counts(struct btrfs_fs_info *fs_info, u64 qgroupid,
292 struct btrfs_qgroup *qgroup;
294 qgroup = find_qgroup_rb(fs_info, qgroupid);
297 if (qgroup->rfer != rfer || qgroup->excl != excl)
304 * The full config is read in one go, only called from open_ctree()
305 * It doesn't use any locking, as at this point we're still single-threaded
307 int btrfs_read_qgroup_config(struct btrfs_fs_info *fs_info)
309 struct btrfs_key key;
310 struct btrfs_key found_key;
311 struct btrfs_root *quota_root = fs_info->quota_root;
312 struct btrfs_path *path = NULL;
313 struct extent_buffer *l;
317 u64 rescan_progress = 0;
319 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
322 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
323 if (!fs_info->qgroup_ulist) {
328 path = btrfs_alloc_path();
334 /* default this to quota off, in case no status key is found */
335 fs_info->qgroup_flags = 0;
338 * pass 1: read status, all qgroup infos and limits
343 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 1);
348 struct btrfs_qgroup *qgroup;
350 slot = path->slots[0];
352 btrfs_item_key_to_cpu(l, &found_key, slot);
354 if (found_key.type == BTRFS_QGROUP_STATUS_KEY) {
355 struct btrfs_qgroup_status_item *ptr;
357 ptr = btrfs_item_ptr(l, slot,
358 struct btrfs_qgroup_status_item);
360 if (btrfs_qgroup_status_version(l, ptr) !=
361 BTRFS_QGROUP_STATUS_VERSION) {
363 "old qgroup version, quota disabled");
366 if (btrfs_qgroup_status_generation(l, ptr) !=
367 fs_info->generation) {
368 flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
370 "qgroup generation mismatch, marked as inconsistent");
372 fs_info->qgroup_flags = btrfs_qgroup_status_flags(l,
374 rescan_progress = btrfs_qgroup_status_rescan(l, ptr);
378 if (found_key.type != BTRFS_QGROUP_INFO_KEY &&
379 found_key.type != BTRFS_QGROUP_LIMIT_KEY)
382 qgroup = find_qgroup_rb(fs_info, found_key.offset);
383 if ((qgroup && found_key.type == BTRFS_QGROUP_INFO_KEY) ||
384 (!qgroup && found_key.type == BTRFS_QGROUP_LIMIT_KEY)) {
385 btrfs_err(fs_info, "inconsistent qgroup config");
386 flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
389 qgroup = add_qgroup_rb(fs_info, found_key.offset);
390 if (IS_ERR(qgroup)) {
391 ret = PTR_ERR(qgroup);
395 switch (found_key.type) {
396 case BTRFS_QGROUP_INFO_KEY: {
397 struct btrfs_qgroup_info_item *ptr;
399 ptr = btrfs_item_ptr(l, slot,
400 struct btrfs_qgroup_info_item);
401 qgroup->rfer = btrfs_qgroup_info_rfer(l, ptr);
402 qgroup->rfer_cmpr = btrfs_qgroup_info_rfer_cmpr(l, ptr);
403 qgroup->excl = btrfs_qgroup_info_excl(l, ptr);
404 qgroup->excl_cmpr = btrfs_qgroup_info_excl_cmpr(l, ptr);
405 /* generation currently unused */
408 case BTRFS_QGROUP_LIMIT_KEY: {
409 struct btrfs_qgroup_limit_item *ptr;
411 ptr = btrfs_item_ptr(l, slot,
412 struct btrfs_qgroup_limit_item);
413 qgroup->lim_flags = btrfs_qgroup_limit_flags(l, ptr);
414 qgroup->max_rfer = btrfs_qgroup_limit_max_rfer(l, ptr);
415 qgroup->max_excl = btrfs_qgroup_limit_max_excl(l, ptr);
416 qgroup->rsv_rfer = btrfs_qgroup_limit_rsv_rfer(l, ptr);
417 qgroup->rsv_excl = btrfs_qgroup_limit_rsv_excl(l, ptr);
422 ret = btrfs_next_item(quota_root, path);
428 btrfs_release_path(path);
431 * pass 2: read all qgroup relations
434 key.type = BTRFS_QGROUP_RELATION_KEY;
436 ret = btrfs_search_slot_for_read(quota_root, &key, path, 1, 0);
440 slot = path->slots[0];
442 btrfs_item_key_to_cpu(l, &found_key, slot);
444 if (found_key.type != BTRFS_QGROUP_RELATION_KEY)
447 if (found_key.objectid > found_key.offset) {
448 /* parent <- member, not needed to build config */
449 /* FIXME should we omit the key completely? */
453 ret = add_relation_rb(fs_info, found_key.objectid,
455 if (ret == -ENOENT) {
457 "orphan qgroup relation 0x%llx->0x%llx",
458 found_key.objectid, found_key.offset);
459 ret = 0; /* ignore the error */
464 ret = btrfs_next_item(quota_root, path);
471 fs_info->qgroup_flags |= flags;
472 if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))
473 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
474 else if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN &&
476 ret = qgroup_rescan_init(fs_info, rescan_progress, 0);
477 btrfs_free_path(path);
480 ulist_free(fs_info->qgroup_ulist);
481 fs_info->qgroup_ulist = NULL;
482 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
485 return ret < 0 ? ret : 0;
489 * This is called from close_ctree() or open_ctree() or btrfs_quota_disable(),
490 * first two are in single-threaded paths.And for the third one, we have set
491 * quota_root to be null with qgroup_lock held before, so it is safe to clean
492 * up the in-memory structures without qgroup_lock held.
494 void btrfs_free_qgroup_config(struct btrfs_fs_info *fs_info)
497 struct btrfs_qgroup *qgroup;
499 while ((n = rb_first(&fs_info->qgroup_tree))) {
500 qgroup = rb_entry(n, struct btrfs_qgroup, node);
501 rb_erase(n, &fs_info->qgroup_tree);
502 __del_qgroup_rb(qgroup);
505 * we call btrfs_free_qgroup_config() when umounting
506 * filesystem and disabling quota, so we set qgroup_ulist
507 * to be null here to avoid double free.
509 ulist_free(fs_info->qgroup_ulist);
510 fs_info->qgroup_ulist = NULL;
513 static int add_qgroup_relation_item(struct btrfs_trans_handle *trans,
514 struct btrfs_root *quota_root,
518 struct btrfs_path *path;
519 struct btrfs_key key;
521 path = btrfs_alloc_path();
526 key.type = BTRFS_QGROUP_RELATION_KEY;
529 ret = btrfs_insert_empty_item(trans, quota_root, path, &key, 0);
531 btrfs_mark_buffer_dirty(path->nodes[0]);
533 btrfs_free_path(path);
537 static int del_qgroup_relation_item(struct btrfs_trans_handle *trans,
538 struct btrfs_root *quota_root,
542 struct btrfs_path *path;
543 struct btrfs_key key;
545 path = btrfs_alloc_path();
550 key.type = BTRFS_QGROUP_RELATION_KEY;
553 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
562 ret = btrfs_del_item(trans, quota_root, path);
564 btrfs_free_path(path);
568 static int add_qgroup_item(struct btrfs_trans_handle *trans,
569 struct btrfs_root *quota_root, u64 qgroupid)
572 struct btrfs_path *path;
573 struct btrfs_qgroup_info_item *qgroup_info;
574 struct btrfs_qgroup_limit_item *qgroup_limit;
575 struct extent_buffer *leaf;
576 struct btrfs_key key;
578 if (btrfs_is_testing(quota_root->fs_info))
581 path = btrfs_alloc_path();
586 key.type = BTRFS_QGROUP_INFO_KEY;
587 key.offset = qgroupid;
590 * Avoid a transaction abort by catching -EEXIST here. In that
591 * case, we proceed by re-initializing the existing structure
595 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
596 sizeof(*qgroup_info));
597 if (ret && ret != -EEXIST)
600 leaf = path->nodes[0];
601 qgroup_info = btrfs_item_ptr(leaf, path->slots[0],
602 struct btrfs_qgroup_info_item);
603 btrfs_set_qgroup_info_generation(leaf, qgroup_info, trans->transid);
604 btrfs_set_qgroup_info_rfer(leaf, qgroup_info, 0);
605 btrfs_set_qgroup_info_rfer_cmpr(leaf, qgroup_info, 0);
606 btrfs_set_qgroup_info_excl(leaf, qgroup_info, 0);
607 btrfs_set_qgroup_info_excl_cmpr(leaf, qgroup_info, 0);
609 btrfs_mark_buffer_dirty(leaf);
611 btrfs_release_path(path);
613 key.type = BTRFS_QGROUP_LIMIT_KEY;
614 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
615 sizeof(*qgroup_limit));
616 if (ret && ret != -EEXIST)
619 leaf = path->nodes[0];
620 qgroup_limit = btrfs_item_ptr(leaf, path->slots[0],
621 struct btrfs_qgroup_limit_item);
622 btrfs_set_qgroup_limit_flags(leaf, qgroup_limit, 0);
623 btrfs_set_qgroup_limit_max_rfer(leaf, qgroup_limit, 0);
624 btrfs_set_qgroup_limit_max_excl(leaf, qgroup_limit, 0);
625 btrfs_set_qgroup_limit_rsv_rfer(leaf, qgroup_limit, 0);
626 btrfs_set_qgroup_limit_rsv_excl(leaf, qgroup_limit, 0);
628 btrfs_mark_buffer_dirty(leaf);
632 btrfs_free_path(path);
636 static int del_qgroup_item(struct btrfs_trans_handle *trans,
637 struct btrfs_root *quota_root, u64 qgroupid)
640 struct btrfs_path *path;
641 struct btrfs_key key;
643 path = btrfs_alloc_path();
648 key.type = BTRFS_QGROUP_INFO_KEY;
649 key.offset = qgroupid;
650 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
659 ret = btrfs_del_item(trans, quota_root, path);
663 btrfs_release_path(path);
665 key.type = BTRFS_QGROUP_LIMIT_KEY;
666 ret = btrfs_search_slot(trans, quota_root, &key, path, -1, 1);
675 ret = btrfs_del_item(trans, quota_root, path);
678 btrfs_free_path(path);
682 static int update_qgroup_limit_item(struct btrfs_trans_handle *trans,
683 struct btrfs_root *root,
684 struct btrfs_qgroup *qgroup)
686 struct btrfs_path *path;
687 struct btrfs_key key;
688 struct extent_buffer *l;
689 struct btrfs_qgroup_limit_item *qgroup_limit;
694 key.type = BTRFS_QGROUP_LIMIT_KEY;
695 key.offset = qgroup->qgroupid;
697 path = btrfs_alloc_path();
701 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
709 slot = path->slots[0];
710 qgroup_limit = btrfs_item_ptr(l, slot, struct btrfs_qgroup_limit_item);
711 btrfs_set_qgroup_limit_flags(l, qgroup_limit, qgroup->lim_flags);
712 btrfs_set_qgroup_limit_max_rfer(l, qgroup_limit, qgroup->max_rfer);
713 btrfs_set_qgroup_limit_max_excl(l, qgroup_limit, qgroup->max_excl);
714 btrfs_set_qgroup_limit_rsv_rfer(l, qgroup_limit, qgroup->rsv_rfer);
715 btrfs_set_qgroup_limit_rsv_excl(l, qgroup_limit, qgroup->rsv_excl);
717 btrfs_mark_buffer_dirty(l);
720 btrfs_free_path(path);
724 static int update_qgroup_info_item(struct btrfs_trans_handle *trans,
725 struct btrfs_root *root,
726 struct btrfs_qgroup *qgroup)
728 struct btrfs_path *path;
729 struct btrfs_key key;
730 struct extent_buffer *l;
731 struct btrfs_qgroup_info_item *qgroup_info;
735 if (btrfs_is_testing(root->fs_info))
739 key.type = BTRFS_QGROUP_INFO_KEY;
740 key.offset = qgroup->qgroupid;
742 path = btrfs_alloc_path();
746 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
754 slot = path->slots[0];
755 qgroup_info = btrfs_item_ptr(l, slot, struct btrfs_qgroup_info_item);
756 btrfs_set_qgroup_info_generation(l, qgroup_info, trans->transid);
757 btrfs_set_qgroup_info_rfer(l, qgroup_info, qgroup->rfer);
758 btrfs_set_qgroup_info_rfer_cmpr(l, qgroup_info, qgroup->rfer_cmpr);
759 btrfs_set_qgroup_info_excl(l, qgroup_info, qgroup->excl);
760 btrfs_set_qgroup_info_excl_cmpr(l, qgroup_info, qgroup->excl_cmpr);
762 btrfs_mark_buffer_dirty(l);
765 btrfs_free_path(path);
769 static int update_qgroup_status_item(struct btrfs_trans_handle *trans,
770 struct btrfs_fs_info *fs_info,
771 struct btrfs_root *root)
773 struct btrfs_path *path;
774 struct btrfs_key key;
775 struct extent_buffer *l;
776 struct btrfs_qgroup_status_item *ptr;
781 key.type = BTRFS_QGROUP_STATUS_KEY;
784 path = btrfs_alloc_path();
788 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
796 slot = path->slots[0];
797 ptr = btrfs_item_ptr(l, slot, struct btrfs_qgroup_status_item);
798 btrfs_set_qgroup_status_flags(l, ptr, fs_info->qgroup_flags);
799 btrfs_set_qgroup_status_generation(l, ptr, trans->transid);
800 btrfs_set_qgroup_status_rescan(l, ptr,
801 fs_info->qgroup_rescan_progress.objectid);
803 btrfs_mark_buffer_dirty(l);
806 btrfs_free_path(path);
811 * called with qgroup_lock held
813 static int btrfs_clean_quota_tree(struct btrfs_trans_handle *trans,
814 struct btrfs_root *root)
816 struct btrfs_path *path;
817 struct btrfs_key key;
818 struct extent_buffer *leaf = NULL;
822 path = btrfs_alloc_path();
826 path->leave_spinning = 1;
833 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
836 leaf = path->nodes[0];
837 nr = btrfs_header_nritems(leaf);
841 * delete the leaf one by one
842 * since the whole tree is going
846 ret = btrfs_del_items(trans, root, path, 0, nr);
850 btrfs_release_path(path);
854 set_bit(BTRFS_FS_QUOTA_DISABLING, &root->fs_info->flags);
855 btrfs_free_path(path);
859 int btrfs_quota_enable(struct btrfs_trans_handle *trans,
860 struct btrfs_fs_info *fs_info)
862 struct btrfs_root *quota_root;
863 struct btrfs_root *tree_root = fs_info->tree_root;
864 struct btrfs_path *path = NULL;
865 struct btrfs_qgroup_status_item *ptr;
866 struct extent_buffer *leaf;
867 struct btrfs_key key;
868 struct btrfs_key found_key;
869 struct btrfs_qgroup *qgroup = NULL;
873 mutex_lock(&fs_info->qgroup_ioctl_lock);
874 if (fs_info->quota_root) {
875 set_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags);
879 fs_info->qgroup_ulist = ulist_alloc(GFP_KERNEL);
880 if (!fs_info->qgroup_ulist) {
886 * initially create the quota tree
888 quota_root = btrfs_create_tree(trans, fs_info,
889 BTRFS_QUOTA_TREE_OBJECTID);
890 if (IS_ERR(quota_root)) {
891 ret = PTR_ERR(quota_root);
895 path = btrfs_alloc_path();
902 key.type = BTRFS_QGROUP_STATUS_KEY;
905 ret = btrfs_insert_empty_item(trans, quota_root, path, &key,
910 leaf = path->nodes[0];
911 ptr = btrfs_item_ptr(leaf, path->slots[0],
912 struct btrfs_qgroup_status_item);
913 btrfs_set_qgroup_status_generation(leaf, ptr, trans->transid);
914 btrfs_set_qgroup_status_version(leaf, ptr, BTRFS_QGROUP_STATUS_VERSION);
915 fs_info->qgroup_flags = BTRFS_QGROUP_STATUS_FLAG_ON |
916 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
917 btrfs_set_qgroup_status_flags(leaf, ptr, fs_info->qgroup_flags);
918 btrfs_set_qgroup_status_rescan(leaf, ptr, 0);
920 btrfs_mark_buffer_dirty(leaf);
923 key.type = BTRFS_ROOT_REF_KEY;
926 btrfs_release_path(path);
927 ret = btrfs_search_slot_for_read(tree_root, &key, path, 1, 0);
935 slot = path->slots[0];
936 leaf = path->nodes[0];
937 btrfs_item_key_to_cpu(leaf, &found_key, slot);
939 if (found_key.type == BTRFS_ROOT_REF_KEY) {
940 ret = add_qgroup_item(trans, quota_root,
945 qgroup = add_qgroup_rb(fs_info, found_key.offset);
946 if (IS_ERR(qgroup)) {
947 ret = PTR_ERR(qgroup);
951 ret = btrfs_next_item(tree_root, path);
959 btrfs_release_path(path);
960 ret = add_qgroup_item(trans, quota_root, BTRFS_FS_TREE_OBJECTID);
964 qgroup = add_qgroup_rb(fs_info, BTRFS_FS_TREE_OBJECTID);
965 if (IS_ERR(qgroup)) {
966 ret = PTR_ERR(qgroup);
969 spin_lock(&fs_info->qgroup_lock);
970 fs_info->quota_root = quota_root;
971 set_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags);
972 spin_unlock(&fs_info->qgroup_lock);
974 btrfs_free_path(path);
977 free_extent_buffer(quota_root->node);
978 free_extent_buffer(quota_root->commit_root);
983 ulist_free(fs_info->qgroup_ulist);
984 fs_info->qgroup_ulist = NULL;
986 mutex_unlock(&fs_info->qgroup_ioctl_lock);
990 int btrfs_quota_disable(struct btrfs_trans_handle *trans,
991 struct btrfs_fs_info *fs_info)
993 struct btrfs_root *tree_root = fs_info->tree_root;
994 struct btrfs_root *quota_root;
997 mutex_lock(&fs_info->qgroup_ioctl_lock);
998 if (!fs_info->quota_root)
1000 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
1001 set_bit(BTRFS_FS_QUOTA_DISABLING, &fs_info->flags);
1002 btrfs_qgroup_wait_for_completion(fs_info, false);
1003 spin_lock(&fs_info->qgroup_lock);
1004 quota_root = fs_info->quota_root;
1005 fs_info->quota_root = NULL;
1006 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
1007 spin_unlock(&fs_info->qgroup_lock);
1009 btrfs_free_qgroup_config(fs_info);
1011 ret = btrfs_clean_quota_tree(trans, quota_root);
1015 ret = btrfs_del_root(trans, tree_root, "a_root->root_key);
1019 list_del("a_root->dirty_list);
1021 btrfs_tree_lock(quota_root->node);
1022 clean_tree_block(fs_info, quota_root->node);
1023 btrfs_tree_unlock(quota_root->node);
1024 btrfs_free_tree_block(trans, quota_root, quota_root->node, 0, 1);
1026 free_extent_buffer(quota_root->node);
1027 free_extent_buffer(quota_root->commit_root);
1030 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1034 static void qgroup_dirty(struct btrfs_fs_info *fs_info,
1035 struct btrfs_qgroup *qgroup)
1037 if (list_empty(&qgroup->dirty))
1038 list_add(&qgroup->dirty, &fs_info->dirty_qgroups);
1041 static void report_reserved_underflow(struct btrfs_fs_info *fs_info,
1042 struct btrfs_qgroup *qgroup,
1046 "qgroup %llu reserved space underflow, have: %llu, to free: %llu",
1047 qgroup->qgroupid, qgroup->reserved, num_bytes);
1048 qgroup->reserved = 0;
1051 * The easy accounting, if we are adding/removing the only ref for an extent
1052 * then this qgroup and all of the parent qgroups get their reference and
1053 * exclusive counts adjusted.
1055 * Caller should hold fs_info->qgroup_lock.
1057 static int __qgroup_excl_accounting(struct btrfs_fs_info *fs_info,
1058 struct ulist *tmp, u64 ref_root,
1059 u64 num_bytes, int sign)
1061 struct btrfs_qgroup *qgroup;
1062 struct btrfs_qgroup_list *glist;
1063 struct ulist_node *unode;
1064 struct ulist_iterator uiter;
1067 qgroup = find_qgroup_rb(fs_info, ref_root);
1071 qgroup->rfer += sign * num_bytes;
1072 qgroup->rfer_cmpr += sign * num_bytes;
1074 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1075 qgroup->excl += sign * num_bytes;
1076 qgroup->excl_cmpr += sign * num_bytes;
1078 if (WARN_ON(qgroup->reserved < num_bytes))
1079 report_reserved_underflow(fs_info, qgroup, num_bytes);
1081 qgroup->reserved -= num_bytes;
1084 qgroup_dirty(fs_info, qgroup);
1086 /* Get all of the parent groups that contain this qgroup */
1087 list_for_each_entry(glist, &qgroup->groups, next_group) {
1088 ret = ulist_add(tmp, glist->group->qgroupid,
1089 qgroup_to_aux(glist->group), GFP_ATOMIC);
1094 /* Iterate all of the parents and adjust their reference counts */
1095 ULIST_ITER_INIT(&uiter);
1096 while ((unode = ulist_next(tmp, &uiter))) {
1097 qgroup = unode_aux_to_qgroup(unode);
1098 qgroup->rfer += sign * num_bytes;
1099 qgroup->rfer_cmpr += sign * num_bytes;
1100 WARN_ON(sign < 0 && qgroup->excl < num_bytes);
1101 qgroup->excl += sign * num_bytes;
1103 if (WARN_ON(qgroup->reserved < num_bytes))
1104 report_reserved_underflow(fs_info, qgroup,
1107 qgroup->reserved -= num_bytes;
1109 qgroup->excl_cmpr += sign * num_bytes;
1110 qgroup_dirty(fs_info, qgroup);
1112 /* Add any parents of the parents */
1113 list_for_each_entry(glist, &qgroup->groups, next_group) {
1114 ret = ulist_add(tmp, glist->group->qgroupid,
1115 qgroup_to_aux(glist->group), GFP_ATOMIC);
1127 * Quick path for updating qgroup with only excl refs.
1129 * In that case, just update all parent will be enough.
1130 * Or we needs to do a full rescan.
1131 * Caller should also hold fs_info->qgroup_lock.
1133 * Return 0 for quick update, return >0 for need to full rescan
1134 * and mark INCONSISTENT flag.
1135 * Return < 0 for other error.
1137 static int quick_update_accounting(struct btrfs_fs_info *fs_info,
1138 struct ulist *tmp, u64 src, u64 dst,
1141 struct btrfs_qgroup *qgroup;
1145 qgroup = find_qgroup_rb(fs_info, src);
1148 if (qgroup->excl == qgroup->rfer) {
1150 err = __qgroup_excl_accounting(fs_info, tmp, dst,
1151 qgroup->excl, sign);
1159 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1163 int btrfs_add_qgroup_relation(struct btrfs_trans_handle *trans,
1164 struct btrfs_fs_info *fs_info, u64 src, u64 dst)
1166 struct btrfs_root *quota_root;
1167 struct btrfs_qgroup *parent;
1168 struct btrfs_qgroup *member;
1169 struct btrfs_qgroup_list *list;
1173 /* Check the level of src and dst first */
1174 if (btrfs_qgroup_level(src) >= btrfs_qgroup_level(dst))
1177 tmp = ulist_alloc(GFP_KERNEL);
1181 mutex_lock(&fs_info->qgroup_ioctl_lock);
1182 quota_root = fs_info->quota_root;
1187 member = find_qgroup_rb(fs_info, src);
1188 parent = find_qgroup_rb(fs_info, dst);
1189 if (!member || !parent) {
1194 /* check if such qgroup relation exist firstly */
1195 list_for_each_entry(list, &member->groups, next_group) {
1196 if (list->group == parent) {
1202 ret = add_qgroup_relation_item(trans, quota_root, src, dst);
1206 ret = add_qgroup_relation_item(trans, quota_root, dst, src);
1208 del_qgroup_relation_item(trans, quota_root, src, dst);
1212 spin_lock(&fs_info->qgroup_lock);
1213 ret = add_relation_rb(fs_info, src, dst);
1215 spin_unlock(&fs_info->qgroup_lock);
1218 ret = quick_update_accounting(fs_info, tmp, src, dst, 1);
1219 spin_unlock(&fs_info->qgroup_lock);
1221 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1226 static int __del_qgroup_relation(struct btrfs_trans_handle *trans,
1227 struct btrfs_fs_info *fs_info, u64 src, u64 dst)
1229 struct btrfs_root *quota_root;
1230 struct btrfs_qgroup *parent;
1231 struct btrfs_qgroup *member;
1232 struct btrfs_qgroup_list *list;
1237 tmp = ulist_alloc(GFP_KERNEL);
1241 quota_root = fs_info->quota_root;
1247 member = find_qgroup_rb(fs_info, src);
1248 parent = find_qgroup_rb(fs_info, dst);
1249 if (!member || !parent) {
1254 /* check if such qgroup relation exist firstly */
1255 list_for_each_entry(list, &member->groups, next_group) {
1256 if (list->group == parent)
1262 ret = del_qgroup_relation_item(trans, quota_root, src, dst);
1263 err = del_qgroup_relation_item(trans, quota_root, dst, src);
1267 spin_lock(&fs_info->qgroup_lock);
1268 del_relation_rb(fs_info, src, dst);
1269 ret = quick_update_accounting(fs_info, tmp, src, dst, -1);
1270 spin_unlock(&fs_info->qgroup_lock);
1276 int btrfs_del_qgroup_relation(struct btrfs_trans_handle *trans,
1277 struct btrfs_fs_info *fs_info, u64 src, u64 dst)
1281 mutex_lock(&fs_info->qgroup_ioctl_lock);
1282 ret = __del_qgroup_relation(trans, fs_info, src, dst);
1283 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1288 int btrfs_create_qgroup(struct btrfs_trans_handle *trans,
1289 struct btrfs_fs_info *fs_info, u64 qgroupid)
1291 struct btrfs_root *quota_root;
1292 struct btrfs_qgroup *qgroup;
1295 mutex_lock(&fs_info->qgroup_ioctl_lock);
1296 quota_root = fs_info->quota_root;
1301 qgroup = find_qgroup_rb(fs_info, qgroupid);
1307 ret = add_qgroup_item(trans, quota_root, qgroupid);
1311 spin_lock(&fs_info->qgroup_lock);
1312 qgroup = add_qgroup_rb(fs_info, qgroupid);
1313 spin_unlock(&fs_info->qgroup_lock);
1316 ret = PTR_ERR(qgroup);
1318 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1322 int btrfs_remove_qgroup(struct btrfs_trans_handle *trans,
1323 struct btrfs_fs_info *fs_info, u64 qgroupid)
1325 struct btrfs_root *quota_root;
1326 struct btrfs_qgroup *qgroup;
1327 struct btrfs_qgroup_list *list;
1330 mutex_lock(&fs_info->qgroup_ioctl_lock);
1331 quota_root = fs_info->quota_root;
1337 qgroup = find_qgroup_rb(fs_info, qgroupid);
1342 /* check if there are no children of this qgroup */
1343 if (!list_empty(&qgroup->members)) {
1348 ret = del_qgroup_item(trans, quota_root, qgroupid);
1350 while (!list_empty(&qgroup->groups)) {
1351 list = list_first_entry(&qgroup->groups,
1352 struct btrfs_qgroup_list, next_group);
1353 ret = __del_qgroup_relation(trans, fs_info,
1355 list->group->qgroupid);
1360 spin_lock(&fs_info->qgroup_lock);
1361 del_qgroup_rb(fs_info, qgroupid);
1362 spin_unlock(&fs_info->qgroup_lock);
1364 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1368 int btrfs_limit_qgroup(struct btrfs_trans_handle *trans,
1369 struct btrfs_fs_info *fs_info, u64 qgroupid,
1370 struct btrfs_qgroup_limit *limit)
1372 struct btrfs_root *quota_root;
1373 struct btrfs_qgroup *qgroup;
1375 /* Sometimes we would want to clear the limit on this qgroup.
1376 * To meet this requirement, we treat the -1 as a special value
1377 * which tell kernel to clear the limit on this qgroup.
1379 const u64 CLEAR_VALUE = -1;
1381 mutex_lock(&fs_info->qgroup_ioctl_lock);
1382 quota_root = fs_info->quota_root;
1388 qgroup = find_qgroup_rb(fs_info, qgroupid);
1394 spin_lock(&fs_info->qgroup_lock);
1395 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_RFER) {
1396 if (limit->max_rfer == CLEAR_VALUE) {
1397 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1398 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_RFER;
1399 qgroup->max_rfer = 0;
1401 qgroup->max_rfer = limit->max_rfer;
1404 if (limit->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) {
1405 if (limit->max_excl == CLEAR_VALUE) {
1406 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1407 limit->flags &= ~BTRFS_QGROUP_LIMIT_MAX_EXCL;
1408 qgroup->max_excl = 0;
1410 qgroup->max_excl = limit->max_excl;
1413 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_RFER) {
1414 if (limit->rsv_rfer == CLEAR_VALUE) {
1415 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1416 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_RFER;
1417 qgroup->rsv_rfer = 0;
1419 qgroup->rsv_rfer = limit->rsv_rfer;
1422 if (limit->flags & BTRFS_QGROUP_LIMIT_RSV_EXCL) {
1423 if (limit->rsv_excl == CLEAR_VALUE) {
1424 qgroup->lim_flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1425 limit->flags &= ~BTRFS_QGROUP_LIMIT_RSV_EXCL;
1426 qgroup->rsv_excl = 0;
1428 qgroup->rsv_excl = limit->rsv_excl;
1431 qgroup->lim_flags |= limit->flags;
1433 spin_unlock(&fs_info->qgroup_lock);
1435 ret = update_qgroup_limit_item(trans, quota_root, qgroup);
1437 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
1438 btrfs_info(fs_info, "unable to update quota limit for %llu",
1443 mutex_unlock(&fs_info->qgroup_ioctl_lock);
1447 int btrfs_qgroup_prepare_account_extents(struct btrfs_trans_handle *trans,
1448 struct btrfs_fs_info *fs_info)
1450 struct btrfs_qgroup_extent_record *record;
1451 struct btrfs_delayed_ref_root *delayed_refs;
1452 struct rb_node *node;
1456 delayed_refs = &trans->transaction->delayed_refs;
1457 qgroup_to_skip = delayed_refs->qgroup_to_skip;
1460 * No need to do lock, since this function will only be called in
1461 * btrfs_commit_transaction().
1463 node = rb_first(&delayed_refs->dirty_extent_root);
1465 record = rb_entry(node, struct btrfs_qgroup_extent_record,
1467 ret = btrfs_find_all_roots(NULL, fs_info, record->bytenr, 0,
1468 &record->old_roots);
1472 ulist_del(record->old_roots, qgroup_to_skip, 0);
1473 node = rb_next(node);
1478 int btrfs_qgroup_trace_extent_nolock(struct btrfs_fs_info *fs_info,
1479 struct btrfs_delayed_ref_root *delayed_refs,
1480 struct btrfs_qgroup_extent_record *record)
1482 struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node;
1483 struct rb_node *parent_node = NULL;
1484 struct btrfs_qgroup_extent_record *entry;
1485 u64 bytenr = record->bytenr;
1487 assert_spin_locked(&delayed_refs->lock);
1488 trace_btrfs_qgroup_trace_extent(fs_info, record);
1492 entry = rb_entry(parent_node, struct btrfs_qgroup_extent_record,
1494 if (bytenr < entry->bytenr)
1496 else if (bytenr > entry->bytenr)
1497 p = &(*p)->rb_right;
1502 rb_link_node(&record->node, parent_node, p);
1503 rb_insert_color(&record->node, &delayed_refs->dirty_extent_root);
1507 int btrfs_qgroup_trace_extent(struct btrfs_trans_handle *trans,
1508 struct btrfs_fs_info *fs_info, u64 bytenr, u64 num_bytes,
1511 struct btrfs_qgroup_extent_record *record;
1512 struct btrfs_delayed_ref_root *delayed_refs;
1515 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)
1516 || bytenr == 0 || num_bytes == 0)
1518 if (WARN_ON(trans == NULL))
1520 record = kmalloc(sizeof(*record), gfp_flag);
1524 delayed_refs = &trans->transaction->delayed_refs;
1525 record->bytenr = bytenr;
1526 record->num_bytes = num_bytes;
1527 record->old_roots = NULL;
1529 spin_lock(&delayed_refs->lock);
1530 ret = btrfs_qgroup_trace_extent_nolock(fs_info, delayed_refs, record);
1531 spin_unlock(&delayed_refs->lock);
1537 int btrfs_qgroup_trace_leaf_items(struct btrfs_trans_handle *trans,
1538 struct btrfs_fs_info *fs_info,
1539 struct extent_buffer *eb)
1541 int nr = btrfs_header_nritems(eb);
1542 int i, extent_type, ret;
1543 struct btrfs_key key;
1544 struct btrfs_file_extent_item *fi;
1545 u64 bytenr, num_bytes;
1547 /* We can be called directly from walk_up_proc() */
1548 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1551 for (i = 0; i < nr; i++) {
1552 btrfs_item_key_to_cpu(eb, &key, i);
1554 if (key.type != BTRFS_EXTENT_DATA_KEY)
1557 fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
1558 /* filter out non qgroup-accountable extents */
1559 extent_type = btrfs_file_extent_type(eb, fi);
1561 if (extent_type == BTRFS_FILE_EXTENT_INLINE)
1564 bytenr = btrfs_file_extent_disk_bytenr(eb, fi);
1568 num_bytes = btrfs_file_extent_disk_num_bytes(eb, fi);
1570 ret = btrfs_qgroup_trace_extent(trans, fs_info, bytenr,
1571 num_bytes, GFP_NOFS);
1579 * Walk up the tree from the bottom, freeing leaves and any interior
1580 * nodes which have had all slots visited. If a node (leaf or
1581 * interior) is freed, the node above it will have it's slot
1582 * incremented. The root node will never be freed.
1584 * At the end of this function, we should have a path which has all
1585 * slots incremented to the next position for a search. If we need to
1586 * read a new node it will be NULL and the node above it will have the
1587 * correct slot selected for a later read.
1589 * If we increment the root nodes slot counter past the number of
1590 * elements, 1 is returned to signal completion of the search.
1592 static int adjust_slots_upwards(struct btrfs_path *path, int root_level)
1596 struct extent_buffer *eb;
1598 if (root_level == 0)
1601 while (level <= root_level) {
1602 eb = path->nodes[level];
1603 nr = btrfs_header_nritems(eb);
1604 path->slots[level]++;
1605 slot = path->slots[level];
1606 if (slot >= nr || level == 0) {
1608 * Don't free the root - we will detect this
1609 * condition after our loop and return a
1610 * positive value for caller to stop walking the tree.
1612 if (level != root_level) {
1613 btrfs_tree_unlock_rw(eb, path->locks[level]);
1614 path->locks[level] = 0;
1616 free_extent_buffer(eb);
1617 path->nodes[level] = NULL;
1618 path->slots[level] = 0;
1622 * We have a valid slot to walk back down
1623 * from. Stop here so caller can process these
1632 eb = path->nodes[root_level];
1633 if (path->slots[root_level] >= btrfs_header_nritems(eb))
1639 int btrfs_qgroup_trace_subtree(struct btrfs_trans_handle *trans,
1640 struct btrfs_root *root,
1641 struct extent_buffer *root_eb,
1642 u64 root_gen, int root_level)
1644 struct btrfs_fs_info *fs_info = root->fs_info;
1647 struct extent_buffer *eb = root_eb;
1648 struct btrfs_path *path = NULL;
1650 BUG_ON(root_level < 0 || root_level > BTRFS_MAX_LEVEL);
1651 BUG_ON(root_eb == NULL);
1653 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1656 if (!extent_buffer_uptodate(root_eb)) {
1657 ret = btrfs_read_buffer(root_eb, root_gen);
1662 if (root_level == 0) {
1663 ret = btrfs_qgroup_trace_leaf_items(trans, fs_info, root_eb);
1667 path = btrfs_alloc_path();
1672 * Walk down the tree. Missing extent blocks are filled in as
1673 * we go. Metadata is accounted every time we read a new
1676 * When we reach a leaf, we account for file extent items in it,
1677 * walk back up the tree (adjusting slot pointers as we go)
1678 * and restart the search process.
1680 extent_buffer_get(root_eb); /* For path */
1681 path->nodes[root_level] = root_eb;
1682 path->slots[root_level] = 0;
1683 path->locks[root_level] = 0; /* so release_path doesn't try to unlock */
1686 while (level >= 0) {
1687 if (path->nodes[level] == NULL) {
1693 * We need to get child blockptr/gen from parent before
1696 eb = path->nodes[level + 1];
1697 parent_slot = path->slots[level + 1];
1698 child_bytenr = btrfs_node_blockptr(eb, parent_slot);
1699 child_gen = btrfs_node_ptr_generation(eb, parent_slot);
1701 eb = read_tree_block(fs_info, child_bytenr, child_gen);
1705 } else if (!extent_buffer_uptodate(eb)) {
1706 free_extent_buffer(eb);
1711 path->nodes[level] = eb;
1712 path->slots[level] = 0;
1714 btrfs_tree_read_lock(eb);
1715 btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK);
1716 path->locks[level] = BTRFS_READ_LOCK_BLOCKING;
1718 ret = btrfs_qgroup_trace_extent(trans, fs_info,
1727 ret = btrfs_qgroup_trace_leaf_items(trans,fs_info,
1728 path->nodes[level]);
1732 /* Nonzero return here means we completed our search */
1733 ret = adjust_slots_upwards(path, root_level);
1737 /* Restart search with new slots */
1746 btrfs_free_path(path);
1751 #define UPDATE_NEW 0
1752 #define UPDATE_OLD 1
1754 * Walk all of the roots that points to the bytenr and adjust their refcnts.
1756 static int qgroup_update_refcnt(struct btrfs_fs_info *fs_info,
1757 struct ulist *roots, struct ulist *tmp,
1758 struct ulist *qgroups, u64 seq, int update_old)
1760 struct ulist_node *unode;
1761 struct ulist_iterator uiter;
1762 struct ulist_node *tmp_unode;
1763 struct ulist_iterator tmp_uiter;
1764 struct btrfs_qgroup *qg;
1769 ULIST_ITER_INIT(&uiter);
1770 while ((unode = ulist_next(roots, &uiter))) {
1771 qg = find_qgroup_rb(fs_info, unode->val);
1776 ret = ulist_add(qgroups, qg->qgroupid, qgroup_to_aux(qg),
1780 ret = ulist_add(tmp, qg->qgroupid, qgroup_to_aux(qg), GFP_ATOMIC);
1783 ULIST_ITER_INIT(&tmp_uiter);
1784 while ((tmp_unode = ulist_next(tmp, &tmp_uiter))) {
1785 struct btrfs_qgroup_list *glist;
1787 qg = unode_aux_to_qgroup(tmp_unode);
1789 btrfs_qgroup_update_old_refcnt(qg, seq, 1);
1791 btrfs_qgroup_update_new_refcnt(qg, seq, 1);
1792 list_for_each_entry(glist, &qg->groups, next_group) {
1793 ret = ulist_add(qgroups, glist->group->qgroupid,
1794 qgroup_to_aux(glist->group),
1798 ret = ulist_add(tmp, glist->group->qgroupid,
1799 qgroup_to_aux(glist->group),
1810 * Update qgroup rfer/excl counters.
1811 * Rfer update is easy, codes can explain themselves.
1813 * Excl update is tricky, the update is split into 2 part.
1814 * Part 1: Possible exclusive <-> sharing detect:
1816 * -------------------------------------
1818 * -------------------------------------
1820 * -------------------------------------
1823 * A: cur_old_roots < nr_old_roots (not exclusive before)
1824 * !A: cur_old_roots == nr_old_roots (possible exclusive before)
1825 * B: cur_new_roots < nr_new_roots (not exclusive now)
1826 * !B: cur_new_roots == nr_new_roots (possible exclusive now)
1829 * +: Possible sharing -> exclusive -: Possible exclusive -> sharing
1830 * *: Definitely not changed. **: Possible unchanged.
1832 * For !A and !B condition, the exception is cur_old/new_roots == 0 case.
1834 * To make the logic clear, we first use condition A and B to split
1835 * combination into 4 results.
1837 * Then, for result "+" and "-", check old/new_roots == 0 case, as in them
1838 * only on variant maybe 0.
1840 * Lastly, check result **, since there are 2 variants maybe 0, split them
1842 * But this time we don't need to consider other things, the codes and logic
1843 * is easy to understand now.
1845 static int qgroup_update_counters(struct btrfs_fs_info *fs_info,
1846 struct ulist *qgroups,
1849 u64 num_bytes, u64 seq)
1851 struct ulist_node *unode;
1852 struct ulist_iterator uiter;
1853 struct btrfs_qgroup *qg;
1854 u64 cur_new_count, cur_old_count;
1856 ULIST_ITER_INIT(&uiter);
1857 while ((unode = ulist_next(qgroups, &uiter))) {
1860 qg = unode_aux_to_qgroup(unode);
1861 cur_old_count = btrfs_qgroup_get_old_refcnt(qg, seq);
1862 cur_new_count = btrfs_qgroup_get_new_refcnt(qg, seq);
1864 trace_qgroup_update_counters(fs_info, qg->qgroupid,
1865 cur_old_count, cur_new_count);
1867 /* Rfer update part */
1868 if (cur_old_count == 0 && cur_new_count > 0) {
1869 qg->rfer += num_bytes;
1870 qg->rfer_cmpr += num_bytes;
1873 if (cur_old_count > 0 && cur_new_count == 0) {
1874 qg->rfer -= num_bytes;
1875 qg->rfer_cmpr -= num_bytes;
1879 /* Excl update part */
1880 /* Exclusive/none -> shared case */
1881 if (cur_old_count == nr_old_roots &&
1882 cur_new_count < nr_new_roots) {
1883 /* Exclusive -> shared */
1884 if (cur_old_count != 0) {
1885 qg->excl -= num_bytes;
1886 qg->excl_cmpr -= num_bytes;
1891 /* Shared -> exclusive/none case */
1892 if (cur_old_count < nr_old_roots &&
1893 cur_new_count == nr_new_roots) {
1894 /* Shared->exclusive */
1895 if (cur_new_count != 0) {
1896 qg->excl += num_bytes;
1897 qg->excl_cmpr += num_bytes;
1902 /* Exclusive/none -> exclusive/none case */
1903 if (cur_old_count == nr_old_roots &&
1904 cur_new_count == nr_new_roots) {
1905 if (cur_old_count == 0) {
1906 /* None -> exclusive/none */
1908 if (cur_new_count != 0) {
1909 /* None -> exclusive */
1910 qg->excl += num_bytes;
1911 qg->excl_cmpr += num_bytes;
1914 /* None -> none, nothing changed */
1916 /* Exclusive -> exclusive/none */
1918 if (cur_new_count == 0) {
1919 /* Exclusive -> none */
1920 qg->excl -= num_bytes;
1921 qg->excl_cmpr -= num_bytes;
1924 /* Exclusive -> exclusive, nothing changed */
1929 qgroup_dirty(fs_info, qg);
1935 btrfs_qgroup_account_extent(struct btrfs_trans_handle *trans,
1936 struct btrfs_fs_info *fs_info,
1937 u64 bytenr, u64 num_bytes,
1938 struct ulist *old_roots, struct ulist *new_roots)
1940 struct ulist *qgroups = NULL;
1941 struct ulist *tmp = NULL;
1943 u64 nr_new_roots = 0;
1944 u64 nr_old_roots = 0;
1947 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
1951 nr_new_roots = new_roots->nnodes;
1953 nr_old_roots = old_roots->nnodes;
1955 BUG_ON(!fs_info->quota_root);
1957 trace_btrfs_qgroup_account_extent(fs_info, bytenr, num_bytes,
1958 nr_old_roots, nr_new_roots);
1960 qgroups = ulist_alloc(GFP_NOFS);
1965 tmp = ulist_alloc(GFP_NOFS);
1971 mutex_lock(&fs_info->qgroup_rescan_lock);
1972 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) {
1973 if (fs_info->qgroup_rescan_progress.objectid <= bytenr) {
1974 mutex_unlock(&fs_info->qgroup_rescan_lock);
1979 mutex_unlock(&fs_info->qgroup_rescan_lock);
1981 spin_lock(&fs_info->qgroup_lock);
1982 seq = fs_info->qgroup_seq;
1984 /* Update old refcnts using old_roots */
1985 ret = qgroup_update_refcnt(fs_info, old_roots, tmp, qgroups, seq,
1990 /* Update new refcnts using new_roots */
1991 ret = qgroup_update_refcnt(fs_info, new_roots, tmp, qgroups, seq,
1996 qgroup_update_counters(fs_info, qgroups, nr_old_roots, nr_new_roots,
2000 * Bump qgroup_seq to avoid seq overlap
2002 fs_info->qgroup_seq += max(nr_old_roots, nr_new_roots) + 1;
2004 spin_unlock(&fs_info->qgroup_lock);
2007 ulist_free(qgroups);
2008 ulist_free(old_roots);
2009 ulist_free(new_roots);
2013 int btrfs_qgroup_account_extents(struct btrfs_trans_handle *trans,
2014 struct btrfs_fs_info *fs_info)
2016 struct btrfs_qgroup_extent_record *record;
2017 struct btrfs_delayed_ref_root *delayed_refs;
2018 struct ulist *new_roots = NULL;
2019 struct rb_node *node;
2023 delayed_refs = &trans->transaction->delayed_refs;
2024 qgroup_to_skip = delayed_refs->qgroup_to_skip;
2025 while ((node = rb_first(&delayed_refs->dirty_extent_root))) {
2026 record = rb_entry(node, struct btrfs_qgroup_extent_record,
2029 trace_btrfs_qgroup_account_extents(fs_info, record);
2033 * Use (u64)-1 as time_seq to do special search, which
2034 * doesn't lock tree or delayed_refs and search current
2035 * root. It's safe inside commit_transaction().
2037 ret = btrfs_find_all_roots(trans, fs_info,
2038 record->bytenr, (u64)-1, &new_roots);
2042 ulist_del(new_roots, qgroup_to_skip, 0);
2043 ret = btrfs_qgroup_account_extent(trans, fs_info,
2044 record->bytenr, record->num_bytes,
2045 record->old_roots, new_roots);
2046 record->old_roots = NULL;
2050 ulist_free(record->old_roots);
2051 ulist_free(new_roots);
2053 rb_erase(node, &delayed_refs->dirty_extent_root);
2061 * called from commit_transaction. Writes all changed qgroups to disk.
2063 int btrfs_run_qgroups(struct btrfs_trans_handle *trans,
2064 struct btrfs_fs_info *fs_info)
2066 struct btrfs_root *quota_root = fs_info->quota_root;
2068 int start_rescan_worker = 0;
2073 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) &&
2074 test_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags))
2075 start_rescan_worker = 1;
2077 if (test_and_clear_bit(BTRFS_FS_QUOTA_ENABLING, &fs_info->flags))
2078 set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
2079 if (test_and_clear_bit(BTRFS_FS_QUOTA_DISABLING, &fs_info->flags))
2080 clear_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags);
2082 spin_lock(&fs_info->qgroup_lock);
2083 while (!list_empty(&fs_info->dirty_qgroups)) {
2084 struct btrfs_qgroup *qgroup;
2085 qgroup = list_first_entry(&fs_info->dirty_qgroups,
2086 struct btrfs_qgroup, dirty);
2087 list_del_init(&qgroup->dirty);
2088 spin_unlock(&fs_info->qgroup_lock);
2089 ret = update_qgroup_info_item(trans, quota_root, qgroup);
2091 fs_info->qgroup_flags |=
2092 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2093 ret = update_qgroup_limit_item(trans, quota_root, qgroup);
2095 fs_info->qgroup_flags |=
2096 BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2097 spin_lock(&fs_info->qgroup_lock);
2099 if (test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2100 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_ON;
2102 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_ON;
2103 spin_unlock(&fs_info->qgroup_lock);
2105 ret = update_qgroup_status_item(trans, fs_info, quota_root);
2107 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2109 if (!ret && start_rescan_worker) {
2110 ret = qgroup_rescan_init(fs_info, 0, 1);
2112 qgroup_rescan_zero_tracking(fs_info);
2113 btrfs_queue_work(fs_info->qgroup_rescan_workers,
2114 &fs_info->qgroup_rescan_work);
2125 * Copy the accounting information between qgroups. This is necessary
2126 * when a snapshot or a subvolume is created. Throwing an error will
2127 * cause a transaction abort so we take extra care here to only error
2128 * when a readonly fs is a reasonable outcome.
2130 int btrfs_qgroup_inherit(struct btrfs_trans_handle *trans,
2131 struct btrfs_fs_info *fs_info, u64 srcid, u64 objectid,
2132 struct btrfs_qgroup_inherit *inherit)
2137 struct btrfs_root *quota_root = fs_info->quota_root;
2138 struct btrfs_qgroup *srcgroup;
2139 struct btrfs_qgroup *dstgroup;
2143 mutex_lock(&fs_info->qgroup_ioctl_lock);
2144 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags))
2153 i_qgroups = (u64 *)(inherit + 1);
2154 nums = inherit->num_qgroups + 2 * inherit->num_ref_copies +
2155 2 * inherit->num_excl_copies;
2156 for (i = 0; i < nums; ++i) {
2157 srcgroup = find_qgroup_rb(fs_info, *i_qgroups);
2160 * Zero out invalid groups so we can ignore
2164 ((srcgroup->qgroupid >> 48) <= (objectid >> 48)))
2172 * create a tracking group for the subvol itself
2174 ret = add_qgroup_item(trans, quota_root, objectid);
2179 struct btrfs_root *srcroot;
2180 struct btrfs_key srckey;
2182 srckey.objectid = srcid;
2183 srckey.type = BTRFS_ROOT_ITEM_KEY;
2184 srckey.offset = (u64)-1;
2185 srcroot = btrfs_read_fs_root_no_name(fs_info, &srckey);
2186 if (IS_ERR(srcroot)) {
2187 ret = PTR_ERR(srcroot);
2191 level_size = fs_info->nodesize;
2195 * add qgroup to all inherited groups
2198 i_qgroups = (u64 *)(inherit + 1);
2199 for (i = 0; i < inherit->num_qgroups; ++i, ++i_qgroups) {
2200 if (*i_qgroups == 0)
2202 ret = add_qgroup_relation_item(trans, quota_root,
2203 objectid, *i_qgroups);
2204 if (ret && ret != -EEXIST)
2206 ret = add_qgroup_relation_item(trans, quota_root,
2207 *i_qgroups, objectid);
2208 if (ret && ret != -EEXIST)
2215 spin_lock(&fs_info->qgroup_lock);
2217 dstgroup = add_qgroup_rb(fs_info, objectid);
2218 if (IS_ERR(dstgroup)) {
2219 ret = PTR_ERR(dstgroup);
2223 if (inherit && inherit->flags & BTRFS_QGROUP_INHERIT_SET_LIMITS) {
2224 dstgroup->lim_flags = inherit->lim.flags;
2225 dstgroup->max_rfer = inherit->lim.max_rfer;
2226 dstgroup->max_excl = inherit->lim.max_excl;
2227 dstgroup->rsv_rfer = inherit->lim.rsv_rfer;
2228 dstgroup->rsv_excl = inherit->lim.rsv_excl;
2230 ret = update_qgroup_limit_item(trans, quota_root, dstgroup);
2232 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2234 "unable to update quota limit for %llu",
2235 dstgroup->qgroupid);
2241 srcgroup = find_qgroup_rb(fs_info, srcid);
2246 * We call inherit after we clone the root in order to make sure
2247 * our counts don't go crazy, so at this point the only
2248 * difference between the two roots should be the root node.
2250 dstgroup->rfer = srcgroup->rfer;
2251 dstgroup->rfer_cmpr = srcgroup->rfer_cmpr;
2252 dstgroup->excl = level_size;
2253 dstgroup->excl_cmpr = level_size;
2254 srcgroup->excl = level_size;
2255 srcgroup->excl_cmpr = level_size;
2257 /* inherit the limit info */
2258 dstgroup->lim_flags = srcgroup->lim_flags;
2259 dstgroup->max_rfer = srcgroup->max_rfer;
2260 dstgroup->max_excl = srcgroup->max_excl;
2261 dstgroup->rsv_rfer = srcgroup->rsv_rfer;
2262 dstgroup->rsv_excl = srcgroup->rsv_excl;
2264 qgroup_dirty(fs_info, dstgroup);
2265 qgroup_dirty(fs_info, srcgroup);
2271 i_qgroups = (u64 *)(inherit + 1);
2272 for (i = 0; i < inherit->num_qgroups; ++i) {
2274 ret = add_relation_rb(fs_info, objectid, *i_qgroups);
2281 for (i = 0; i < inherit->num_ref_copies; ++i, i_qgroups += 2) {
2282 struct btrfs_qgroup *src;
2283 struct btrfs_qgroup *dst;
2285 if (!i_qgroups[0] || !i_qgroups[1])
2288 src = find_qgroup_rb(fs_info, i_qgroups[0]);
2289 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
2296 dst->rfer = src->rfer - level_size;
2297 dst->rfer_cmpr = src->rfer_cmpr - level_size;
2299 for (i = 0; i < inherit->num_excl_copies; ++i, i_qgroups += 2) {
2300 struct btrfs_qgroup *src;
2301 struct btrfs_qgroup *dst;
2303 if (!i_qgroups[0] || !i_qgroups[1])
2306 src = find_qgroup_rb(fs_info, i_qgroups[0]);
2307 dst = find_qgroup_rb(fs_info, i_qgroups[1]);
2314 dst->excl = src->excl + level_size;
2315 dst->excl_cmpr = src->excl_cmpr + level_size;
2319 spin_unlock(&fs_info->qgroup_lock);
2321 mutex_unlock(&fs_info->qgroup_ioctl_lock);
2325 static bool qgroup_check_limits(const struct btrfs_qgroup *qg, u64 num_bytes)
2327 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_RFER) &&
2328 qg->reserved + (s64)qg->rfer + num_bytes > qg->max_rfer)
2331 if ((qg->lim_flags & BTRFS_QGROUP_LIMIT_MAX_EXCL) &&
2332 qg->reserved + (s64)qg->excl + num_bytes > qg->max_excl)
2338 static int qgroup_reserve(struct btrfs_root *root, u64 num_bytes, bool enforce)
2340 struct btrfs_root *quota_root;
2341 struct btrfs_qgroup *qgroup;
2342 struct btrfs_fs_info *fs_info = root->fs_info;
2343 u64 ref_root = root->root_key.objectid;
2345 struct ulist_node *unode;
2346 struct ulist_iterator uiter;
2348 if (!is_fstree(ref_root))
2354 spin_lock(&fs_info->qgroup_lock);
2355 quota_root = fs_info->quota_root;
2359 qgroup = find_qgroup_rb(fs_info, ref_root);
2364 * in a first step, we check all affected qgroups if any limits would
2367 ulist_reinit(fs_info->qgroup_ulist);
2368 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
2369 (uintptr_t)qgroup, GFP_ATOMIC);
2372 ULIST_ITER_INIT(&uiter);
2373 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2374 struct btrfs_qgroup *qg;
2375 struct btrfs_qgroup_list *glist;
2377 qg = unode_aux_to_qgroup(unode);
2379 if (enforce && !qgroup_check_limits(qg, num_bytes)) {
2384 list_for_each_entry(glist, &qg->groups, next_group) {
2385 ret = ulist_add(fs_info->qgroup_ulist,
2386 glist->group->qgroupid,
2387 (uintptr_t)glist->group, GFP_ATOMIC);
2394 * no limits exceeded, now record the reservation into all qgroups
2396 ULIST_ITER_INIT(&uiter);
2397 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2398 struct btrfs_qgroup *qg;
2400 qg = unode_aux_to_qgroup(unode);
2402 qg->reserved += num_bytes;
2406 spin_unlock(&fs_info->qgroup_lock);
2410 void btrfs_qgroup_free_refroot(struct btrfs_fs_info *fs_info,
2411 u64 ref_root, u64 num_bytes)
2413 struct btrfs_root *quota_root;
2414 struct btrfs_qgroup *qgroup;
2415 struct ulist_node *unode;
2416 struct ulist_iterator uiter;
2419 if (!is_fstree(ref_root))
2425 spin_lock(&fs_info->qgroup_lock);
2427 quota_root = fs_info->quota_root;
2431 qgroup = find_qgroup_rb(fs_info, ref_root);
2435 ulist_reinit(fs_info->qgroup_ulist);
2436 ret = ulist_add(fs_info->qgroup_ulist, qgroup->qgroupid,
2437 (uintptr_t)qgroup, GFP_ATOMIC);
2440 ULIST_ITER_INIT(&uiter);
2441 while ((unode = ulist_next(fs_info->qgroup_ulist, &uiter))) {
2442 struct btrfs_qgroup *qg;
2443 struct btrfs_qgroup_list *glist;
2445 qg = unode_aux_to_qgroup(unode);
2447 if (WARN_ON(qg->reserved < num_bytes))
2448 report_reserved_underflow(fs_info, qg, num_bytes);
2450 qg->reserved -= num_bytes;
2452 list_for_each_entry(glist, &qg->groups, next_group) {
2453 ret = ulist_add(fs_info->qgroup_ulist,
2454 glist->group->qgroupid,
2455 (uintptr_t)glist->group, GFP_ATOMIC);
2462 spin_unlock(&fs_info->qgroup_lock);
2465 void assert_qgroups_uptodate(struct btrfs_trans_handle *trans)
2467 if (list_empty(&trans->qgroup_ref_list) && !trans->delayed_ref_elem.seq)
2469 btrfs_err(trans->fs_info,
2470 "qgroups not uptodate in trans handle %p: list is%s empty, seq is %#x.%x",
2471 trans, list_empty(&trans->qgroup_ref_list) ? "" : " not",
2472 (u32)(trans->delayed_ref_elem.seq >> 32),
2473 (u32)trans->delayed_ref_elem.seq);
2478 * returns < 0 on error, 0 when more leafs are to be scanned.
2479 * returns 1 when done.
2482 qgroup_rescan_leaf(struct btrfs_fs_info *fs_info, struct btrfs_path *path,
2483 struct btrfs_trans_handle *trans)
2485 struct btrfs_key found;
2486 struct extent_buffer *scratch_leaf = NULL;
2487 struct ulist *roots = NULL;
2488 struct seq_list tree_mod_seq_elem = SEQ_LIST_INIT(tree_mod_seq_elem);
2493 mutex_lock(&fs_info->qgroup_rescan_lock);
2494 ret = btrfs_search_slot_for_read(fs_info->extent_root,
2495 &fs_info->qgroup_rescan_progress,
2498 btrfs_debug(fs_info,
2499 "current progress key (%llu %u %llu), search_slot ret %d",
2500 fs_info->qgroup_rescan_progress.objectid,
2501 fs_info->qgroup_rescan_progress.type,
2502 fs_info->qgroup_rescan_progress.offset, ret);
2506 * The rescan is about to end, we will not be scanning any
2507 * further blocks. We cannot unset the RESCAN flag here, because
2508 * we want to commit the transaction if everything went well.
2509 * To make the live accounting work in this phase, we set our
2510 * scan progress pointer such that every real extent objectid
2513 fs_info->qgroup_rescan_progress.objectid = (u64)-1;
2514 btrfs_release_path(path);
2515 mutex_unlock(&fs_info->qgroup_rescan_lock);
2519 btrfs_item_key_to_cpu(path->nodes[0], &found,
2520 btrfs_header_nritems(path->nodes[0]) - 1);
2521 fs_info->qgroup_rescan_progress.objectid = found.objectid + 1;
2523 btrfs_get_tree_mod_seq(fs_info, &tree_mod_seq_elem);
2524 scratch_leaf = btrfs_clone_extent_buffer(path->nodes[0]);
2525 if (!scratch_leaf) {
2527 mutex_unlock(&fs_info->qgroup_rescan_lock);
2530 extent_buffer_get(scratch_leaf);
2531 btrfs_tree_read_lock(scratch_leaf);
2532 btrfs_set_lock_blocking_rw(scratch_leaf, BTRFS_READ_LOCK);
2533 slot = path->slots[0];
2534 btrfs_release_path(path);
2535 mutex_unlock(&fs_info->qgroup_rescan_lock);
2537 for (; slot < btrfs_header_nritems(scratch_leaf); ++slot) {
2538 btrfs_item_key_to_cpu(scratch_leaf, &found, slot);
2539 if (found.type != BTRFS_EXTENT_ITEM_KEY &&
2540 found.type != BTRFS_METADATA_ITEM_KEY)
2542 if (found.type == BTRFS_METADATA_ITEM_KEY)
2543 num_bytes = fs_info->nodesize;
2545 num_bytes = found.offset;
2547 ret = btrfs_find_all_roots(NULL, fs_info, found.objectid, 0,
2551 /* For rescan, just pass old_roots as NULL */
2552 ret = btrfs_qgroup_account_extent(trans, fs_info,
2553 found.objectid, num_bytes, NULL, roots);
2559 btrfs_tree_read_unlock_blocking(scratch_leaf);
2560 free_extent_buffer(scratch_leaf);
2562 btrfs_put_tree_mod_seq(fs_info, &tree_mod_seq_elem);
2567 static void btrfs_qgroup_rescan_worker(struct btrfs_work *work)
2569 struct btrfs_fs_info *fs_info = container_of(work, struct btrfs_fs_info,
2570 qgroup_rescan_work);
2571 struct btrfs_path *path;
2572 struct btrfs_trans_handle *trans = NULL;
2576 path = btrfs_alloc_path();
2581 while (!err && !btrfs_fs_closing(fs_info)) {
2582 trans = btrfs_start_transaction(fs_info->fs_root, 0);
2583 if (IS_ERR(trans)) {
2584 err = PTR_ERR(trans);
2587 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags)) {
2590 err = qgroup_rescan_leaf(fs_info, path, trans);
2593 btrfs_commit_transaction(trans);
2595 btrfs_end_transaction(trans);
2599 btrfs_free_path(path);
2601 mutex_lock(&fs_info->qgroup_rescan_lock);
2602 if (!btrfs_fs_closing(fs_info))
2603 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2606 fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT) {
2607 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2608 } else if (err < 0) {
2609 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT;
2611 mutex_unlock(&fs_info->qgroup_rescan_lock);
2614 * only update status, since the previous part has already updated the
2617 trans = btrfs_start_transaction(fs_info->quota_root, 1);
2618 if (IS_ERR(trans)) {
2619 err = PTR_ERR(trans);
2621 "fail to start transaction for status update: %d\n",
2625 ret = update_qgroup_status_item(trans, fs_info, fs_info->quota_root);
2628 btrfs_err(fs_info, "fail to update qgroup status: %d", err);
2630 btrfs_end_transaction(trans);
2632 if (btrfs_fs_closing(fs_info)) {
2633 btrfs_info(fs_info, "qgroup scan paused");
2634 } else if (err >= 0) {
2635 btrfs_info(fs_info, "qgroup scan completed%s",
2636 err > 0 ? " (inconsistency flag cleared)" : "");
2638 btrfs_err(fs_info, "qgroup scan failed with %d", err);
2642 mutex_lock(&fs_info->qgroup_rescan_lock);
2643 fs_info->qgroup_rescan_running = false;
2644 mutex_unlock(&fs_info->qgroup_rescan_lock);
2645 complete_all(&fs_info->qgroup_rescan_completion);
2649 * Checks that (a) no rescan is running and (b) quota is enabled. Allocates all
2650 * memory required for the rescan context.
2653 qgroup_rescan_init(struct btrfs_fs_info *fs_info, u64 progress_objectid,
2659 (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN) ||
2660 !(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))) {
2665 mutex_lock(&fs_info->qgroup_rescan_lock);
2666 spin_lock(&fs_info->qgroup_lock);
2669 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
2671 else if (!(fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_ON))
2675 spin_unlock(&fs_info->qgroup_lock);
2676 mutex_unlock(&fs_info->qgroup_rescan_lock);
2679 fs_info->qgroup_flags |= BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2682 memset(&fs_info->qgroup_rescan_progress, 0,
2683 sizeof(fs_info->qgroup_rescan_progress));
2684 fs_info->qgroup_rescan_progress.objectid = progress_objectid;
2685 init_completion(&fs_info->qgroup_rescan_completion);
2686 fs_info->qgroup_rescan_running = true;
2688 spin_unlock(&fs_info->qgroup_lock);
2689 mutex_unlock(&fs_info->qgroup_rescan_lock);
2691 memset(&fs_info->qgroup_rescan_work, 0,
2692 sizeof(fs_info->qgroup_rescan_work));
2693 btrfs_init_work(&fs_info->qgroup_rescan_work,
2694 btrfs_qgroup_rescan_helper,
2695 btrfs_qgroup_rescan_worker, NULL, NULL);
2699 btrfs_info(fs_info, "qgroup_rescan_init failed with %d", ret);
2707 qgroup_rescan_zero_tracking(struct btrfs_fs_info *fs_info)
2710 struct btrfs_qgroup *qgroup;
2712 spin_lock(&fs_info->qgroup_lock);
2713 /* clear all current qgroup tracking information */
2714 for (n = rb_first(&fs_info->qgroup_tree); n; n = rb_next(n)) {
2715 qgroup = rb_entry(n, struct btrfs_qgroup, node);
2717 qgroup->rfer_cmpr = 0;
2719 qgroup->excl_cmpr = 0;
2721 spin_unlock(&fs_info->qgroup_lock);
2725 btrfs_qgroup_rescan(struct btrfs_fs_info *fs_info)
2728 struct btrfs_trans_handle *trans;
2730 ret = qgroup_rescan_init(fs_info, 0, 1);
2735 * We have set the rescan_progress to 0, which means no more
2736 * delayed refs will be accounted by btrfs_qgroup_account_ref.
2737 * However, btrfs_qgroup_account_ref may be right after its call
2738 * to btrfs_find_all_roots, in which case it would still do the
2740 * To solve this, we're committing the transaction, which will
2741 * ensure we run all delayed refs and only after that, we are
2742 * going to clear all tracking information for a clean start.
2745 trans = btrfs_join_transaction(fs_info->fs_root);
2746 if (IS_ERR(trans)) {
2747 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2748 return PTR_ERR(trans);
2750 ret = btrfs_commit_transaction(trans);
2752 fs_info->qgroup_flags &= ~BTRFS_QGROUP_STATUS_FLAG_RESCAN;
2756 qgroup_rescan_zero_tracking(fs_info);
2758 btrfs_queue_work(fs_info->qgroup_rescan_workers,
2759 &fs_info->qgroup_rescan_work);
2764 int btrfs_qgroup_wait_for_completion(struct btrfs_fs_info *fs_info,
2770 mutex_lock(&fs_info->qgroup_rescan_lock);
2771 spin_lock(&fs_info->qgroup_lock);
2772 running = fs_info->qgroup_rescan_running;
2773 spin_unlock(&fs_info->qgroup_lock);
2774 mutex_unlock(&fs_info->qgroup_rescan_lock);
2780 ret = wait_for_completion_interruptible(
2781 &fs_info->qgroup_rescan_completion);
2783 wait_for_completion(&fs_info->qgroup_rescan_completion);
2789 * this is only called from open_ctree where we're still single threaded, thus
2790 * locking is omitted here.
2793 btrfs_qgroup_rescan_resume(struct btrfs_fs_info *fs_info)
2795 if (fs_info->qgroup_flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
2796 btrfs_queue_work(fs_info->qgroup_rescan_workers,
2797 &fs_info->qgroup_rescan_work);
2801 * Reserve qgroup space for range [start, start + len).
2803 * This function will either reserve space from related qgroups or doing
2804 * nothing if the range is already reserved.
2806 * Return 0 for successful reserve
2807 * Return <0 for error (including -EQUOT)
2809 * NOTE: this function may sleep for memory allocation.
2811 int btrfs_qgroup_reserve_data(struct inode *inode, u64 start, u64 len)
2813 struct btrfs_root *root = BTRFS_I(inode)->root;
2814 struct extent_changeset changeset;
2815 struct ulist_node *unode;
2816 struct ulist_iterator uiter;
2819 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &root->fs_info->flags) ||
2820 !is_fstree(root->objectid) || len == 0)
2823 changeset.bytes_changed = 0;
2824 ulist_init(&changeset.range_changed);
2825 ret = set_record_extent_bits(&BTRFS_I(inode)->io_tree, start,
2826 start + len -1, EXTENT_QGROUP_RESERVED, &changeset);
2827 trace_btrfs_qgroup_reserve_data(inode, start, len,
2828 changeset.bytes_changed,
2832 ret = qgroup_reserve(root, changeset.bytes_changed, true);
2836 ulist_release(&changeset.range_changed);
2840 /* cleanup already reserved ranges */
2841 ULIST_ITER_INIT(&uiter);
2842 while ((unode = ulist_next(&changeset.range_changed, &uiter)))
2843 clear_extent_bit(&BTRFS_I(inode)->io_tree, unode->val,
2844 unode->aux, EXTENT_QGROUP_RESERVED, 0, 0, NULL,
2846 ulist_release(&changeset.range_changed);
2850 static int __btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len,
2853 struct extent_changeset changeset;
2854 int trace_op = QGROUP_RELEASE;
2857 changeset.bytes_changed = 0;
2858 ulist_init(&changeset.range_changed);
2859 ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree, start,
2860 start + len -1, EXTENT_QGROUP_RESERVED, &changeset);
2865 btrfs_qgroup_free_refroot(BTRFS_I(inode)->root->fs_info,
2866 BTRFS_I(inode)->root->objectid,
2867 changeset.bytes_changed);
2868 trace_op = QGROUP_FREE;
2870 trace_btrfs_qgroup_release_data(inode, start, len,
2871 changeset.bytes_changed, trace_op);
2873 ulist_release(&changeset.range_changed);
2878 * Free a reserved space range from io_tree and related qgroups
2880 * Should be called when a range of pages get invalidated before reaching disk.
2881 * Or for error cleanup case.
2883 * For data written to disk, use btrfs_qgroup_release_data().
2885 * NOTE: This function may sleep for memory allocation.
2887 int btrfs_qgroup_free_data(struct inode *inode, u64 start, u64 len)
2889 return __btrfs_qgroup_release_data(inode, start, len, 1);
2893 * Release a reserved space range from io_tree only.
2895 * Should be called when a range of pages get written to disk and corresponding
2896 * FILE_EXTENT is inserted into corresponding root.
2898 * Since new qgroup accounting framework will only update qgroup numbers at
2899 * commit_transaction() time, its reserved space shouldn't be freed from
2902 * But we should release the range from io_tree, to allow further write to be
2905 * NOTE: This function may sleep for memory allocation.
2907 int btrfs_qgroup_release_data(struct inode *inode, u64 start, u64 len)
2909 return __btrfs_qgroup_release_data(inode, start, len, 0);
2912 int btrfs_qgroup_reserve_meta(struct btrfs_root *root, int num_bytes,
2915 struct btrfs_fs_info *fs_info = root->fs_info;
2918 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
2919 !is_fstree(root->objectid) || num_bytes == 0)
2922 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
2923 ret = qgroup_reserve(root, num_bytes, enforce);
2926 atomic_add(num_bytes, &root->qgroup_meta_rsv);
2930 void btrfs_qgroup_free_meta_all(struct btrfs_root *root)
2932 struct btrfs_fs_info *fs_info = root->fs_info;
2935 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
2936 !is_fstree(root->objectid))
2939 reserved = atomic_xchg(&root->qgroup_meta_rsv, 0);
2942 btrfs_qgroup_free_refroot(fs_info, root->objectid, reserved);
2945 void btrfs_qgroup_free_meta(struct btrfs_root *root, int num_bytes)
2947 struct btrfs_fs_info *fs_info = root->fs_info;
2949 if (!test_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags) ||
2950 !is_fstree(root->objectid))
2953 BUG_ON(num_bytes != round_down(num_bytes, fs_info->nodesize));
2954 WARN_ON(atomic_read(&root->qgroup_meta_rsv) < num_bytes);
2955 atomic_sub(num_bytes, &root->qgroup_meta_rsv);
2956 btrfs_qgroup_free_refroot(fs_info, root->objectid, num_bytes);
2960 * Check qgroup reserved space leaking, normally at destroy inode
2963 void btrfs_qgroup_check_reserved_leak(struct inode *inode)
2965 struct extent_changeset changeset;
2966 struct ulist_node *unode;
2967 struct ulist_iterator iter;
2970 changeset.bytes_changed = 0;
2971 ulist_init(&changeset.range_changed);
2972 ret = clear_record_extent_bits(&BTRFS_I(inode)->io_tree, 0, (u64)-1,
2973 EXTENT_QGROUP_RESERVED, &changeset);
2976 if (WARN_ON(changeset.bytes_changed)) {
2977 ULIST_ITER_INIT(&iter);
2978 while ((unode = ulist_next(&changeset.range_changed, &iter))) {
2979 btrfs_warn(BTRFS_I(inode)->root->fs_info,
2980 "leaking qgroup reserved space, ino: %lu, start: %llu, end: %llu",
2981 inode->i_ino, unode->val, unode->aux);
2983 btrfs_qgroup_free_refroot(BTRFS_I(inode)->root->fs_info,
2984 BTRFS_I(inode)->root->objectid,
2985 changeset.bytes_changed);
2988 ulist_release(&changeset.range_changed);