2 * Copyright (C) 2012 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.
20 #include <sys/ioctl.h>
26 #define BTRFS_QGROUP_NFILTERS_INCREASE (2 * BTRFS_QGROUP_FILTER_MAX)
27 #define BTRFS_QGROUP_NCOMPS_INCREASE (2 * BTRFS_QGROUP_COMP_MAX)
29 struct qgroup_lookup {
34 struct rb_node rb_node;
35 struct rb_node sort_node;
37 *all_parent_node is used to
38 *filter a qgroup's all parent
40 struct rb_node all_parent_node;
47 u64 rfer; /*referenced*/
48 u64 rfer_cmpr; /*referenced compressed*/
49 u64 excl; /*exclusive*/
50 u64 excl_cmpr; /*exclusive compressed*/
55 u64 flags; /*which limits are set*/
61 /*qgroups this group is member of*/
62 struct list_head qgroups;
63 /*qgroups that are members of this group*/
64 struct list_head members;
68 * glue structure to represent the relations
71 struct btrfs_qgroup_list {
72 struct list_head next_qgroup;
73 struct list_head next_member;
74 struct btrfs_qgroup *qgroup;
75 struct btrfs_qgroup *member;
79 * qgroupid,rfer,excl default to set
87 } btrfs_qgroup_columns[] = {
90 .column_name = "Qgroupid",
97 .column_name = "Rfer",
99 .unit_mode = UNITS_DEFAULT,
104 .column_name = "Excl",
106 .unit_mode = UNITS_DEFAULT,
109 { .name = "max_rfer",
110 .column_name = "Max_rfer",
112 .unit_mode = UNITS_DEFAULT,
117 .column_name = "Max_excl",
119 .unit_mode = UNITS_DEFAULT,
124 .column_name = "Parent",
131 .column_name = "Child",
144 static btrfs_qgroup_filter_func all_filter_funcs[];
145 static btrfs_qgroup_comp_func all_comp_funcs[];
147 void btrfs_qgroup_setup_print_column(enum btrfs_qgroup_column_enum column)
151 BUG_ON(column < 0 || column > BTRFS_QGROUP_ALL);
153 if (column < BTRFS_QGROUP_ALL) {
154 btrfs_qgroup_columns[column].need_print = 1;
157 for (i = 0; i < BTRFS_QGROUP_ALL; i++)
158 btrfs_qgroup_columns[i].need_print = 1;
161 void btrfs_qgroup_setup_units(unsigned unit_mode)
163 btrfs_qgroup_columns[BTRFS_QGROUP_RFER].unit_mode = unit_mode;
164 btrfs_qgroup_columns[BTRFS_QGROUP_EXCL].unit_mode = unit_mode;
165 btrfs_qgroup_columns[BTRFS_QGROUP_MAX_RFER].unit_mode = unit_mode;
166 btrfs_qgroup_columns[BTRFS_QGROUP_MAX_EXCL].unit_mode = unit_mode;
169 static int print_parent_column(struct btrfs_qgroup *qgroup)
171 struct btrfs_qgroup_list *list = NULL;
174 list_for_each_entry(list, &qgroup->qgroups, next_qgroup) {
175 len += printf("%llu/%llu", (list->qgroup)->qgroupid >> 48,
176 ((1ll << 48) - 1) & (list->qgroup)->qgroupid);
177 if (!list_is_last(&list->next_qgroup, &qgroup->qgroups))
180 if (list_empty(&qgroup->qgroups))
181 len += printf("---");
186 static int print_child_column(struct btrfs_qgroup *qgroup)
188 struct btrfs_qgroup_list *list = NULL;
191 list_for_each_entry(list, &qgroup->members, next_member) {
192 len += printf("%llu/%llu", (list->member)->qgroupid >> 48,
193 ((1ll << 48) - 1) & (list->member)->qgroupid);
194 if (!list_is_last(&list->next_member, &qgroup->members))
197 if (list_empty(&qgroup->members))
198 len += printf("---");
203 static void print_qgroup_column_add_blank(enum btrfs_qgroup_column_enum column,
206 len = btrfs_qgroup_columns[column].max_len - len;
211 static void print_qgroup_column(struct btrfs_qgroup *qgroup,
212 enum btrfs_qgroup_column_enum column)
214 BUG_ON(column >= BTRFS_QGROUP_ALL || column < 0);
216 int unit_mode = btrfs_qgroup_columns[column].unit_mode;
217 int max_len = btrfs_qgroup_columns[column].max_len;
221 case BTRFS_QGROUP_QGROUPID:
222 len = printf("%llu/%llu", qgroup->qgroupid >> 48,
223 ((1ll << 48) - 1) & qgroup->qgroupid);
224 print_qgroup_column_add_blank(BTRFS_QGROUP_QGROUPID, len);
226 case BTRFS_QGROUP_RFER:
227 len = printf("%*s", max_len, pretty_size_mode(qgroup->rfer, unit_mode));
229 case BTRFS_QGROUP_EXCL:
230 len = printf("%*s", max_len, pretty_size_mode(qgroup->excl, unit_mode));
232 case BTRFS_QGROUP_PARENT:
233 len = print_parent_column(qgroup);
234 print_qgroup_column_add_blank(BTRFS_QGROUP_PARENT, len);
236 case BTRFS_QGROUP_MAX_RFER:
237 len = printf("%*s", max_len, pretty_size_mode(qgroup->max_rfer, unit_mode));
239 case BTRFS_QGROUP_MAX_EXCL:
240 len = printf("%*s", max_len, pretty_size_mode(qgroup->max_excl, unit_mode));
242 case BTRFS_QGROUP_CHILD:
243 len = print_child_column(qgroup);
244 print_qgroup_column_add_blank(BTRFS_QGROUP_CHILD, len);
251 static void print_single_qgroup_table(struct btrfs_qgroup *qgroup)
255 for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
256 if (!btrfs_qgroup_columns[i].need_print)
258 print_qgroup_column(qgroup, i);
260 if (i != BTRFS_QGROUP_CHILD)
266 static void print_table_head()
272 for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
273 max_len = btrfs_qgroup_columns[i].max_len;
274 if (!btrfs_qgroup_columns[i].need_print)
276 if ((i == BTRFS_QGROUP_QGROUPID) | (i == BTRFS_QGROUP_PARENT) |
277 (i == BTRFS_QGROUP_CHILD))
278 printf("%-*s", max_len, btrfs_qgroup_columns[i].name);
280 printf("%*s", max_len, btrfs_qgroup_columns[i].name);
284 for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
285 max_len = btrfs_qgroup_columns[i].max_len;
286 if (!btrfs_qgroup_columns[i].need_print)
288 if ((i == BTRFS_QGROUP_QGROUPID) | (i == BTRFS_QGROUP_PARENT) |
289 (i == BTRFS_QGROUP_CHILD)) {
290 len = strlen(btrfs_qgroup_columns[i].name);
293 len = max_len - strlen(btrfs_qgroup_columns[i].name);
297 len = max_len - strlen(btrfs_qgroup_columns[i].name);
300 len = strlen(btrfs_qgroup_columns[i].name);
309 static void qgroup_lookup_init(struct qgroup_lookup *tree)
311 tree->root.rb_node = NULL;
314 static int comp_entry_with_qgroupid(struct btrfs_qgroup *entry1,
315 struct btrfs_qgroup *entry2,
321 if (entry1->qgroupid > entry2->qgroupid)
323 else if (entry1->qgroupid < entry2->qgroupid)
328 return is_descending ? -ret : ret;
331 static int comp_entry_with_rfer(struct btrfs_qgroup *entry1,
332 struct btrfs_qgroup *entry2,
337 if (entry1->rfer > entry2->rfer)
339 else if (entry1->rfer < entry2->rfer)
344 return is_descending ? -ret : ret;
347 static int comp_entry_with_excl(struct btrfs_qgroup *entry1,
348 struct btrfs_qgroup *entry2,
353 if (entry1->excl > entry2->excl)
355 else if (entry1->excl < entry2->excl)
360 return is_descending ? -ret : ret;
363 static int comp_entry_with_max_rfer(struct btrfs_qgroup *entry1,
364 struct btrfs_qgroup *entry2,
369 if (entry1->max_rfer > entry2->max_rfer)
371 else if (entry1->max_rfer < entry2->max_rfer)
376 return is_descending ? -ret : ret;
379 static int comp_entry_with_max_excl(struct btrfs_qgroup *entry1,
380 struct btrfs_qgroup *entry2,
385 if (entry1->max_excl > entry2->max_excl)
387 else if (entry1->max_excl < entry2->max_excl)
392 return is_descending ? -ret : ret;
395 static btrfs_qgroup_comp_func all_comp_funcs[] = {
396 [BTRFS_QGROUP_COMP_QGROUPID] = comp_entry_with_qgroupid,
397 [BTRFS_QGROUP_COMP_RFER] = comp_entry_with_rfer,
398 [BTRFS_QGROUP_COMP_EXCL] = comp_entry_with_excl,
399 [BTRFS_QGROUP_COMP_MAX_RFER] = comp_entry_with_max_rfer,
400 [BTRFS_QGROUP_COMP_MAX_EXCL] = comp_entry_with_max_excl
403 static char *all_sort_items[] = {
404 [BTRFS_QGROUP_COMP_QGROUPID] = "qgroupid",
405 [BTRFS_QGROUP_COMP_RFER] = "rfer",
406 [BTRFS_QGROUP_COMP_EXCL] = "excl",
407 [BTRFS_QGROUP_COMP_MAX_RFER] = "max_rfer",
408 [BTRFS_QGROUP_COMP_MAX_EXCL] = "max_excl",
409 [BTRFS_QGROUP_COMP_MAX] = NULL,
412 static int btrfs_qgroup_get_sort_item(char *sort_name)
416 for (i = 0; i < BTRFS_QGROUP_COMP_MAX; i++) {
417 if (strcmp(sort_name, all_sort_items[i]) == 0)
423 struct btrfs_qgroup_comparer_set *btrfs_qgroup_alloc_comparer_set(void)
425 struct btrfs_qgroup_comparer_set *set;
427 size = sizeof(struct btrfs_qgroup_comparer_set) +
428 BTRFS_QGROUP_NCOMPS_INCREASE *
429 sizeof(struct btrfs_qgroup_comparer);
432 fprintf(stderr, "memory allocation failed\n");
436 memset(set, 0, size);
437 set->total = BTRFS_QGROUP_NCOMPS_INCREASE;
442 void btrfs_qgroup_free_comparer_set(struct btrfs_qgroup_comparer_set *comp_set)
447 int btrfs_qgroup_setup_comparer(struct btrfs_qgroup_comparer_set **comp_set,
448 enum btrfs_qgroup_comp_enum comparer,
451 struct btrfs_qgroup_comparer_set *set = *comp_set;
455 BUG_ON(comparer >= BTRFS_QGROUP_COMP_MAX);
456 BUG_ON(set->ncomps > set->total);
458 if (set->ncomps == set->total) {
459 size = set->total + BTRFS_QGROUP_NCOMPS_INCREASE;
460 size = sizeof(*set) +
461 size * sizeof(struct btrfs_qgroup_comparer);
462 set = realloc(set, size);
464 fprintf(stderr, "memory allocation failed\n");
468 memset(&set->comps[set->total], 0,
469 BTRFS_QGROUP_NCOMPS_INCREASE *
470 sizeof(struct btrfs_qgroup_comparer));
471 set->total += BTRFS_QGROUP_NCOMPS_INCREASE;
475 BUG_ON(set->comps[set->ncomps].comp_func);
477 set->comps[set->ncomps].comp_func = all_comp_funcs[comparer];
478 set->comps[set->ncomps].is_descending = is_descending;
483 static int sort_comp(struct btrfs_qgroup *entry1, struct btrfs_qgroup *entry2,
484 struct btrfs_qgroup_comparer_set *set)
486 int qgroupid_compared = 0;
489 if (!set || !set->ncomps)
492 for (i = 0; i < set->ncomps; i++) {
493 if (!set->comps[i].comp_func)
496 ret = set->comps[i].comp_func(entry1, entry2,
497 set->comps[i].is_descending);
501 if (set->comps[i].comp_func == comp_entry_with_qgroupid)
502 qgroupid_compared = 1;
505 if (!qgroupid_compared) {
507 ret = comp_entry_with_qgroupid(entry1, entry2, 0);
514 * insert a new root into the tree. returns the existing root entry
515 * if one is already there. qgroupid is used
518 static int qgroup_tree_insert(struct qgroup_lookup *root_tree,
519 struct btrfs_qgroup *ins)
522 struct rb_node **p = &root_tree->root.rb_node;
523 struct rb_node *parent = NULL;
524 struct btrfs_qgroup *curr;
529 curr = rb_entry(parent, struct btrfs_qgroup, rb_node);
531 ret = comp_entry_with_qgroupid(ins, curr, 0);
539 rb_link_node(&ins->rb_node, parent, p);
540 rb_insert_color(&ins->rb_node, &root_tree->root);
545 *find a given qgroupid in the tree. We return the smallest one,
546 *rb_next can be used to move forward looking for more if required
548 static struct btrfs_qgroup *qgroup_tree_search(struct qgroup_lookup *root_tree,
551 struct rb_node *n = root_tree->root.rb_node;
552 struct btrfs_qgroup *entry;
553 struct btrfs_qgroup tmp;
556 tmp.qgroupid = qgroupid;
559 entry = rb_entry(n, struct btrfs_qgroup, rb_node);
561 ret = comp_entry_with_qgroupid(&tmp, entry, 0);
573 static int update_qgroup(struct qgroup_lookup *qgroup_lookup, u64 qgroupid,
574 u64 generation, u64 rfer, u64 rfer_cmpr, u64 excl,
575 u64 excl_cmpr, u64 flags, u64 max_rfer, u64 max_excl,
576 u64 rsv_rfer, u64 rsv_excl, struct btrfs_qgroup *pa,
577 struct btrfs_qgroup *child)
579 struct btrfs_qgroup *bq;
580 struct btrfs_qgroup_list *list;
582 bq = qgroup_tree_search(qgroup_lookup, qgroupid);
583 if (!bq || bq->qgroupid != qgroupid)
587 bq->generation = generation;
591 bq->rfer_cmpr = rfer_cmpr;
595 bq->excl_cmpr = excl_cmpr;
599 bq->max_rfer = max_rfer;
601 bq->max_excl = max_excl;
603 bq->rsv_rfer = rsv_rfer;
605 list = malloc(sizeof(*list));
607 fprintf(stderr, "memory allocation failed\n");
611 list->member = child;
612 list_add_tail(&list->next_qgroup, &child->qgroups);
613 list_add_tail(&list->next_member, &pa->members);
618 static int add_qgroup(struct qgroup_lookup *qgroup_lookup, u64 qgroupid,
619 u64 generation, u64 rfer, u64 rfer_cmpr, u64 excl,
620 u64 excl_cmpr, u64 flags, u64 max_rfer, u64 max_excl,
621 u64 rsv_rfer, u64 rsv_excl, struct btrfs_qgroup *parent,
622 struct btrfs_qgroup *child)
624 struct btrfs_qgroup *bq;
625 struct btrfs_qgroup_list *list;
628 ret = update_qgroup(qgroup_lookup, qgroupid, generation, rfer,
629 rfer_cmpr, excl, excl_cmpr, flags, max_rfer,
630 max_excl, rsv_rfer, rsv_excl, parent, child);
634 bq = malloc(sizeof(*bq));
636 printf("memory allocation failed\n");
639 memset(bq, 0, sizeof(*bq));
641 bq->qgroupid = qgroupid;
642 INIT_LIST_HEAD(&bq->qgroups);
643 INIT_LIST_HEAD(&bq->members);
646 bq->generation = generation;
650 bq->rfer_cmpr = rfer_cmpr;
654 bq->excl_cmpr = excl_cmpr;
658 bq->max_rfer = max_rfer;
660 bq->max_excl = max_excl;
662 bq->rsv_rfer = rsv_rfer;
663 if (parent && child) {
664 list = malloc(sizeof(*list));
666 fprintf(stderr, "memory allocation failed\n");
669 list->qgroup = parent;
670 list->member = child;
671 list_add_tail(&list->next_qgroup, &child->qgroups);
672 list_add_tail(&list->next_member, &parent->members);
674 ret = qgroup_tree_insert(qgroup_lookup, bq);
676 printf("failed to insert tree %llu\n",
683 static void __free_btrfs_qgroup(struct btrfs_qgroup *bq)
685 struct btrfs_qgroup_list *list;
686 while (!list_empty(&bq->qgroups)) {
687 list = list_entry((&bq->qgroups)->next,
688 struct btrfs_qgroup_list,
690 list_del(&list->next_qgroup);
691 list_del(&list->next_member);
694 while (!list_empty(&bq->members)) {
695 list = list_entry((&bq->members)->next,
696 struct btrfs_qgroup_list,
698 list_del(&list->next_qgroup);
699 list_del(&list->next_member);
705 static void __free_all_qgroups(struct qgroup_lookup *root_tree)
707 struct btrfs_qgroup *entry;
710 n = rb_first(&root_tree->root);
712 entry = rb_entry(n, struct btrfs_qgroup, rb_node);
713 rb_erase(n, &root_tree->root);
714 __free_btrfs_qgroup(entry);
716 n = rb_first(&root_tree->root);
720 static int filter_all_parent_insert(struct qgroup_lookup *sort_tree,
721 struct btrfs_qgroup *bq)
723 struct rb_node **p = &sort_tree->root.rb_node;
724 struct rb_node *parent = NULL;
725 struct btrfs_qgroup *curr;
730 curr = rb_entry(parent, struct btrfs_qgroup, all_parent_node);
732 ret = comp_entry_with_qgroupid(bq, curr, 0);
740 rb_link_node(&bq->all_parent_node, parent, p);
741 rb_insert_color(&bq->all_parent_node, &sort_tree->root);
745 static int filter_by_parent(struct btrfs_qgroup *bq, u64 data)
747 struct btrfs_qgroup *qgroup =
748 (struct btrfs_qgroup *)(unsigned long)data;
752 if (qgroup->qgroupid == bq->qgroupid)
757 static int filter_by_all_parent(struct btrfs_qgroup *bq, u64 data)
759 struct qgroup_lookup lookup;
760 struct qgroup_lookup *ql = &lookup;
761 struct btrfs_qgroup_list *list;
763 struct btrfs_qgroup *qgroup =
764 (struct btrfs_qgroup *)(unsigned long)data;
768 if (bq->qgroupid == qgroup->qgroupid)
771 qgroup_lookup_init(ql);
772 filter_all_parent_insert(ql, qgroup);
773 n = rb_first(&ql->root);
775 qgroup = rb_entry(n, struct btrfs_qgroup, all_parent_node);
776 if (!list_empty(&qgroup->qgroups)) {
777 list_for_each_entry(list, &qgroup->qgroups,
779 if ((list->qgroup)->qgroupid == bq->qgroupid)
781 filter_all_parent_insert(ql, list->qgroup);
784 rb_erase(n, &ql->root);
785 n = rb_first(&ql->root);
790 static btrfs_qgroup_filter_func all_filter_funcs[] = {
791 [BTRFS_QGROUP_FILTER_PARENT] = filter_by_parent,
792 [BTRFS_QGROUP_FILTER_ALL_PARENT] = filter_by_all_parent,
795 struct btrfs_qgroup_filter_set *btrfs_qgroup_alloc_filter_set(void)
797 struct btrfs_qgroup_filter_set *set;
800 size = sizeof(struct btrfs_qgroup_filter_set) +
801 BTRFS_QGROUP_NFILTERS_INCREASE *
802 sizeof(struct btrfs_qgroup_filter);
805 fprintf(stderr, "memory allocation failed\n");
808 memset(set, 0, size);
809 set->total = BTRFS_QGROUP_NFILTERS_INCREASE;
814 void btrfs_qgroup_free_filter_set(struct btrfs_qgroup_filter_set *filter_set)
819 int btrfs_qgroup_setup_filter(struct btrfs_qgroup_filter_set **filter_set,
820 enum btrfs_qgroup_filter_enum filter, u64 data)
822 struct btrfs_qgroup_filter_set *set = *filter_set;
826 BUG_ON(filter >= BTRFS_QGROUP_FILTER_MAX);
827 BUG_ON(set->nfilters > set->total);
829 if (set->nfilters == set->total) {
830 size = set->total + BTRFS_QGROUP_NFILTERS_INCREASE;
831 size = sizeof(*set) + size * sizeof(struct btrfs_qgroup_filter);
833 set = realloc(set, size);
835 fprintf(stderr, "memory allocation failed\n");
838 memset(&set->filters[set->total], 0,
839 BTRFS_QGROUP_NFILTERS_INCREASE *
840 sizeof(struct btrfs_qgroup_filter));
841 set->total += BTRFS_QGROUP_NFILTERS_INCREASE;
844 BUG_ON(set->filters[set->nfilters].filter_func);
845 set->filters[set->nfilters].filter_func = all_filter_funcs[filter];
846 set->filters[set->nfilters].data = data;
851 static int filter_qgroup(struct btrfs_qgroup *bq,
852 struct btrfs_qgroup_filter_set *set)
856 if (!set || !set->nfilters)
858 for (i = 0; i < set->nfilters; i++) {
859 if (!set->filters[i].filter_func)
861 ret = set->filters[i].filter_func(bq, set->filters[i].data);
868 static void pre_process_filter_set(struct qgroup_lookup *lookup,
869 struct btrfs_qgroup_filter_set *set)
872 struct btrfs_qgroup *qgroup_for_filter = NULL;
874 for (i = 0; i < set->nfilters; i++) {
876 if (set->filters[i].filter_func == filter_by_all_parent
877 || set->filters[i].filter_func == filter_by_parent) {
878 qgroup_for_filter = qgroup_tree_search(lookup,
879 set->filters[i].data);
880 set->filters[i].data =
881 (u64)(unsigned long)qgroup_for_filter;
886 static int sort_tree_insert(struct qgroup_lookup *sort_tree,
887 struct btrfs_qgroup *bq,
888 struct btrfs_qgroup_comparer_set *comp_set)
890 struct rb_node **p = &sort_tree->root.rb_node;
891 struct rb_node *parent = NULL;
892 struct btrfs_qgroup *curr;
897 curr = rb_entry(parent, struct btrfs_qgroup, sort_node);
899 ret = sort_comp(bq, curr, comp_set);
907 rb_link_node(&bq->sort_node, parent, p);
908 rb_insert_color(&bq->sort_node, &sort_tree->root);
912 static void __update_columns_max_len(struct btrfs_qgroup *bq,
913 enum btrfs_qgroup_column_enum column)
915 BUG_ON(column >= BTRFS_QGROUP_ALL || column < 0);
916 struct btrfs_qgroup_list *list = NULL;
919 unsigned unit_mode = btrfs_qgroup_columns[column].unit_mode;
923 case BTRFS_QGROUP_QGROUPID:
924 sprintf(tmp, "%llu/%llu", (bq->qgroupid >> 48),
925 bq->qgroupid & ((1ll << 48) - 1));
927 if (btrfs_qgroup_columns[column].max_len < len)
928 btrfs_qgroup_columns[column].max_len = len;
930 case BTRFS_QGROUP_RFER:
931 len = strlen(pretty_size_mode(bq->rfer, unit_mode));
932 if (btrfs_qgroup_columns[column].max_len < len)
933 btrfs_qgroup_columns[column].max_len = len;
935 case BTRFS_QGROUP_EXCL:
936 len = strlen(pretty_size_mode(bq->excl, unit_mode));
937 if (btrfs_qgroup_columns[column].max_len < len)
938 btrfs_qgroup_columns[column].max_len = len;
940 case BTRFS_QGROUP_MAX_RFER:
941 len = strlen(pretty_size_mode(bq->max_rfer, unit_mode));
942 if (btrfs_qgroup_columns[column].max_len < len)
943 btrfs_qgroup_columns[column].max_len = len;
945 case BTRFS_QGROUP_MAX_EXCL:
946 len = strlen(pretty_size_mode(bq->max_excl, unit_mode));
947 if (btrfs_qgroup_columns[column].max_len < len)
948 btrfs_qgroup_columns[column].max_len = len;
950 case BTRFS_QGROUP_PARENT:
952 list_for_each_entry(list, &bq->qgroups, next_qgroup) {
953 len += sprintf(tmp, "%llu/%llu",
954 (list->qgroup)->qgroupid >> 48,
955 ((1ll << 48) - 1) & (list->qgroup)->qgroupid);
956 if (!list_is_last(&list->next_qgroup, &bq->qgroups))
959 if (btrfs_qgroup_columns[column].max_len < len)
960 btrfs_qgroup_columns[column].max_len = len;
962 case BTRFS_QGROUP_CHILD:
964 list_for_each_entry(list, &bq->members, next_member) {
965 len += sprintf(tmp, "%llu/%llu",
966 (list->member)->qgroupid >> 48,
967 ((1ll << 48) - 1) & (list->member)->qgroupid);
968 if (!list_is_last(&list->next_member, &bq->members))
971 if (btrfs_qgroup_columns[column].max_len < len)
972 btrfs_qgroup_columns[column].max_len = len;
980 static void update_columns_max_len(struct btrfs_qgroup *bq)
984 for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
985 if (!btrfs_qgroup_columns[i].need_print)
987 __update_columns_max_len(bq, i);
991 static void __filter_and_sort_qgroups(struct qgroup_lookup *all_qgroups,
992 struct qgroup_lookup *sort_tree,
993 struct btrfs_qgroup_filter_set *filter_set,
994 struct btrfs_qgroup_comparer_set *comp_set)
997 struct btrfs_qgroup *entry;
1000 qgroup_lookup_init(sort_tree);
1001 pre_process_filter_set(all_qgroups, filter_set);
1003 n = rb_last(&all_qgroups->root);
1005 entry = rb_entry(n, struct btrfs_qgroup, rb_node);
1007 ret = filter_qgroup(entry, filter_set);
1009 sort_tree_insert(sort_tree, entry, comp_set);
1011 update_columns_max_len(entry);
1016 static int __qgroups_search(int fd, struct qgroup_lookup *qgroup_lookup)
1019 struct btrfs_ioctl_search_args args;
1020 struct btrfs_ioctl_search_key *sk = &args.key;
1021 struct btrfs_ioctl_search_header *sh;
1022 unsigned long off = 0;
1025 struct btrfs_qgroup_info_item *info;
1026 struct btrfs_qgroup_limit_item *limit;
1027 struct btrfs_qgroup *bq;
1028 struct btrfs_qgroup *bq1;
1035 memset(&args, 0, sizeof(args));
1037 sk->tree_id = BTRFS_QUOTA_TREE_OBJECTID;
1038 sk->max_type = BTRFS_QGROUP_RELATION_KEY;
1039 sk->min_type = BTRFS_QGROUP_INFO_KEY;
1040 sk->max_objectid = (u64)-1;
1041 sk->max_offset = (u64)-1;
1042 sk->max_transid = (u64)-1;
1043 sk->nr_items = 4096;
1045 qgroup_lookup_init(qgroup_lookup);
1048 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1052 "ERROR: can't perform the search - %s\n",
1056 /* the ioctl returns the number of item it found in nr_items */
1057 if (sk->nr_items == 0)
1062 * for each item, pull the key out of the header and then
1063 * read the root_ref item it contains
1065 for (i = 0; i < sk->nr_items; i++) {
1066 sh = (struct btrfs_ioctl_search_header *)(args.buf +
1070 if (sh->type == BTRFS_QGROUP_INFO_KEY) {
1071 info = (struct btrfs_qgroup_info_item *)
1073 a1 = btrfs_stack_qgroup_info_generation(info);
1074 a2 = btrfs_stack_qgroup_info_referenced(info);
1076 btrfs_stack_qgroup_info_referenced_compressed
1078 a4 = btrfs_stack_qgroup_info_exclusive(info);
1080 btrfs_stack_qgroup_info_exclusive_compressed
1082 add_qgroup(qgroup_lookup, sh->offset, a1, a2,
1083 a3, a4, a5, 0, 0, 0, 0, 0, 0, 0);
1084 } else if (sh->type == BTRFS_QGROUP_LIMIT_KEY) {
1085 limit = (struct btrfs_qgroup_limit_item *)
1088 a1 = btrfs_stack_qgroup_limit_flags(limit);
1089 a2 = btrfs_stack_qgroup_limit_max_referenced
1091 a3 = btrfs_stack_qgroup_limit_max_exclusive
1093 a4 = btrfs_stack_qgroup_limit_rsv_referenced
1095 a5 = btrfs_stack_qgroup_limit_rsv_exclusive
1097 add_qgroup(qgroup_lookup, sh->offset, 0, 0,
1098 0, 0, 0, a1, a2, a3, a4, a5, 0, 0);
1099 } else if (sh->type == BTRFS_QGROUP_RELATION_KEY) {
1100 if (sh->offset < sh->objectid)
1102 bq = qgroup_tree_search(qgroup_lookup,
1106 bq1 = qgroup_tree_search(qgroup_lookup,
1110 add_qgroup(qgroup_lookup, sh->offset, 0, 0,
1111 0, 0, 0, 0, 0, 0, 0, 0, bq, bq1);
1118 * record the mins in sk so we can make sure the
1119 * next search doesn't repeat this root
1121 sk->min_type = sh->type;
1122 sk->min_offset = sh->offset;
1123 sk->min_objectid = sh->objectid;
1125 sk->nr_items = 4096;
1127 * this iteration is done, step forward one qgroup for the next
1130 if (sk->min_offset < (u64)-1)
1140 static void print_all_qgroups(struct qgroup_lookup *qgroup_lookup)
1144 struct btrfs_qgroup *entry;
1148 n = rb_first(&qgroup_lookup->root);
1150 entry = rb_entry(n, struct btrfs_qgroup, sort_node);
1151 print_single_qgroup_table(entry);
1156 int btrfs_show_qgroups(int fd,
1157 struct btrfs_qgroup_filter_set *filter_set,
1158 struct btrfs_qgroup_comparer_set *comp_set)
1161 struct qgroup_lookup qgroup_lookup;
1162 struct qgroup_lookup sort_tree;
1165 ret = __qgroups_search(fd, &qgroup_lookup);
1168 __filter_and_sort_qgroups(&qgroup_lookup, &sort_tree,
1169 filter_set, comp_set);
1170 print_all_qgroups(&sort_tree);
1172 __free_all_qgroups(&qgroup_lookup);
1173 btrfs_qgroup_free_filter_set(filter_set);
1177 u64 btrfs_get_path_rootid(int fd)
1180 struct btrfs_ioctl_ino_lookup_args args;
1182 memset(&args, 0, sizeof(args));
1183 args.objectid = BTRFS_FIRST_FREE_OBJECTID;
1185 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
1188 "ERROR: can't perform the search - %s\n",
1195 int btrfs_qgroup_parse_sort_string(char *opt_arg,
1196 struct btrfs_qgroup_comparer_set **comps)
1204 while ((p = strtok(opt_arg, ",")) != NULL) {
1206 ptr_argv = all_sort_items;
1209 if (strcmp(*ptr_argv, p) == 0) {
1214 if (strcmp(*ptr_argv, p) == 0) {
1231 } else if (*p == '-') {
1237 what_to_sort = btrfs_qgroup_get_sort_item(p);
1238 if (what_to_sort < 0)
1240 btrfs_qgroup_setup_comparer(comps, what_to_sort, order);
1248 u64 parse_qgroupid(char *p)
1250 char *s = strchr(p, '/');
1251 char *ptr_src_end = p + strlen(p);
1252 char *ptr_parse_end = NULL;
1257 id = strtoull(p, &ptr_parse_end, 10);
1258 if (ptr_parse_end != ptr_src_end)
1262 level = strtoull(p, &ptr_parse_end, 10);
1263 if (ptr_parse_end != s)
1266 id = strtoull(s+1, &ptr_parse_end, 10);
1267 if (ptr_parse_end != ptr_src_end)
1270 return (level << 48) | id;
1272 fprintf(stderr, "ERROR:invalid qgroupid\n");
1276 int qgroup_inherit_size(struct btrfs_qgroup_inherit *p)
1278 return sizeof(*p) + sizeof(p->qgroups[0]) *
1279 (p->num_qgroups + 2 * p->num_ref_copies +
1280 2 * p->num_excl_copies);
1284 qgroup_inherit_realloc(struct btrfs_qgroup_inherit **inherit, int n, int pos)
1286 struct btrfs_qgroup_inherit *out;
1290 nitems = (*inherit)->num_qgroups +
1291 (*inherit)->num_ref_copies +
1292 (*inherit)->num_excl_copies;
1295 out = calloc(sizeof(*out) + sizeof(out->qgroups[0]) * (nitems + n), 1);
1297 fprintf(stderr, "ERROR: Not enough memory\n");
1302 struct btrfs_qgroup_inherit *i = *inherit;
1303 int s = sizeof(out->qgroups[0]);
1305 out->num_qgroups = i->num_qgroups;
1306 out->num_ref_copies = i->num_ref_copies;
1307 out->num_excl_copies = i->num_excl_copies;
1308 memcpy(out->qgroups, i->qgroups, pos * s);
1309 memcpy(out->qgroups + pos + n, i->qgroups + pos,
1310 (nitems - pos) * s);
1318 int qgroup_inherit_add_group(struct btrfs_qgroup_inherit **inherit, char *arg)
1321 u64 qgroupid = parse_qgroupid(arg);
1324 if (qgroupid == 0) {
1325 fprintf(stderr, "ERROR: bad qgroup specification\n");
1330 pos = (*inherit)->num_qgroups;
1331 ret = qgroup_inherit_realloc(inherit, 1, pos);
1335 (*inherit)->qgroups[(*inherit)->num_qgroups++] = qgroupid;
1340 int qgroup_inherit_add_copy(struct btrfs_qgroup_inherit **inherit, char *arg,
1349 p = strchr(arg, ':');
1352 fprintf(stderr, "ERROR: bad copy specification\n");
1356 qgroup_src = parse_qgroupid(arg);
1357 qgroup_dst = parse_qgroupid(p + 1);
1360 if (!qgroup_src || !qgroup_dst)
1364 pos = (*inherit)->num_qgroups +
1365 (*inherit)->num_ref_copies * 2 * type;
1367 ret = qgroup_inherit_realloc(inherit, 2, pos);
1371 (*inherit)->qgroups[pos++] = qgroup_src;
1372 (*inherit)->qgroups[pos++] = qgroup_dst;
1375 ++(*inherit)->num_ref_copies;
1377 ++(*inherit)->num_excl_copies;