qgroup.c

   1 /*
   2  * Copyright (C) 2012 STRATO.  All rights reserved.
   3  *
   4  * This program is free software; you can redistribute it and/or
   5  * modify it under the terms of the GNU General Public
   6  * License v2 as published by the Free Software Foundation.
   7  *
   8  * This program is distributed in the hope that it will be useful,
   9  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  11  * General Public License for more details.
  12  *
  13  * You should have received a copy of the GNU General Public
  14  * License along with this program; if not, write to the
  15  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16  * Boston, MA 021110-1307, USA.
  17  */
  18
  19 #include "qgroup.h"
  20 #include <sys/ioctl.h>
  21 #include "ctree.h"
  22 #include "ioctl.h"
  23 #include "utils.h"
  24 #include <errno.h>
  25
  26 #define BTRFS_QGROUP_NFILTERS_INCREASE (2 * BTRFS_QGROUP_FILTER_MAX)
  27 #define BTRFS_QGROUP_NCOMPS_INCREASE (2 * BTRFS_QGROUP_COMP_MAX)
  28
  29 struct qgroup_lookup {
  30         struct rb_root root;
  31 };
  32
  33 struct btrfs_qgroup {
  34         struct rb_node rb_node;
  35         struct rb_node sort_node;
  36         /*
  37          *all_parent_node is used to
  38          *filter a qgroup's all parent
  39          */
  40         struct rb_node all_parent_node;
  41         u64 qgroupid;
  42
  43         /*
  44          * info_item
  45          */
  46         u64 generation;
  47         u64 rfer;       /*referenced*/
  48         u64 rfer_cmpr;  /*referenced compressed*/
  49         u64 excl;       /*exclusive*/
  50         u64 excl_cmpr;  /*exclusive compressed*/
  51
  52         /*
  53          *limit_item
  54          */
  55         u64 flags;      /*which limits are set*/
  56         u64 max_rfer;
  57         u64 max_excl;
  58         u64 rsv_rfer;
  59         u64 rsv_excl;
  60
  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;
  65 };
  66
  67 /*
  68  * glue structure to represent the relations
  69  * between qgroups
  70  */
  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;
  76 };
  77
  78 /*
  79  * qgroupid,rfer,excl default to set
  80  */
  81 static struct {
  82         char *name;
  83         char *column_name;
  84         int need_print;
  85         unsigned unit_mode;
  86         int max_len;
  87 } btrfs_qgroup_columns[] = {
  88         {
  89                 .name           = "qgroupid",
  90                 .column_name    = "Qgroupid",
  91                 .need_print     = 1,
  92                 .unit_mode      = 0,
  93                 .max_len        = 8,
  94         },
  95         {
  96                 .name           = "rfer",
  97                 .column_name    = "Rfer",
  98                 .need_print     = 1,
  99                 .unit_mode      = UNITS_DEFAULT,
 100                 .max_len        = 12,
 101         },
 102         {
 103                 .name           = "excl",
 104                 .column_name    = "Excl",
 105                 .need_print     = 1,
 106                 .unit_mode      = UNITS_DEFAULT,
 107                 .max_len        = 12,
 108         },
 109         {       .name           = "max_rfer",
 110                 .column_name    = "Max_rfer",
 111                 .need_print     = 0,
 112                 .unit_mode      = UNITS_DEFAULT,
 113                 .max_len        = 12,
 114         },
 115         {
 116                 .name           = "max_excl",
 117                 .column_name    = "Max_excl",
 118                 .need_print     = 0,
 119                 .unit_mode      = UNITS_DEFAULT,
 120                 .max_len        = 12,
 121         },
 122         {
 123                 .name           = "parent",
 124                 .column_name    = "Parent",
 125                 .need_print     = 0,
 126                 .unit_mode      = 0,
 127                 .max_len        = 7,
 128         },
 129         {
 130                 .name           = "child",
 131                 .column_name    = "Child",
 132                 .need_print     = 0,
 133                 .unit_mode      = 0,
 134                 .max_len        = 5,
 135         },
 136         {
 137                 .name           = NULL,
 138                 .column_name    = NULL,
 139                 .need_print     = 0,
 140                 .unit_mode      = 0,
 141         },
 142 };
 143
 144 static btrfs_qgroup_filter_func all_filter_funcs[];
 145 static btrfs_qgroup_comp_func all_comp_funcs[];
 146
 147 void btrfs_qgroup_setup_print_column(enum btrfs_qgroup_column_enum column)
 148 {
 149         int i;
 150
 151         BUG_ON(column < 0 || column > BTRFS_QGROUP_ALL);
 152
 153         if (column < BTRFS_QGROUP_ALL) {
 154                 btrfs_qgroup_columns[column].need_print = 1;
 155                 return;
 156         }
 157         for (i = 0; i < BTRFS_QGROUP_ALL; i++)
 158                 btrfs_qgroup_columns[i].need_print = 1;
 159 }
 160
 161 void btrfs_qgroup_setup_units(unsigned unit_mode)
 162 {
 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;
 167 }
 168
 169 static int print_parent_column(struct btrfs_qgroup *qgroup)
 170 {
 171         struct btrfs_qgroup_list *list = NULL;
 172         int len = 0;
 173
 174         list_for_each_entry(list, &qgroup->qgroups, next_qgroup) {
 175                 len += printf("%llu/%llu",
 176                               btrfs_qgroup_level(list->qgroup->qgroupid),
 177                               btrfs_qgroup_subvid(list->qgroup->qgroupid));
 178                 if (!list_is_last(&list->next_qgroup, &qgroup->qgroups))
 179                         len += printf(",");
 180         }
 181         if (list_empty(&qgroup->qgroups))
 182                 len += printf("---");
 183
 184         return len;
 185 }
 186
 187 static int print_child_column(struct btrfs_qgroup *qgroup)
 188 {
 189         struct btrfs_qgroup_list *list = NULL;
 190         int len = 0;
 191
 192         list_for_each_entry(list, &qgroup->members, next_member) {
 193                 len += printf("%llu/%llu",
 194                               btrfs_qgroup_level(list->member->qgroupid),
 195                               btrfs_qgroup_subvid(list->member->qgroupid));
 196                 if (!list_is_last(&list->next_member, &qgroup->members))
 197                         len += printf(",");
 198         }
 199         if (list_empty(&qgroup->members))
 200                 len += printf("---");
 201
 202         return len;
 203 }
 204
 205 static void print_qgroup_column_add_blank(enum btrfs_qgroup_column_enum column,
 206                                           int len)
 207 {
 208         len = btrfs_qgroup_columns[column].max_len - len;
 209         while (len--)
 210                 printf(" ");
 211 }
 212
 213 static void print_qgroup_column(struct btrfs_qgroup *qgroup,
 214                                 enum btrfs_qgroup_column_enum column)
 215 {
 216         BUG_ON(column >= BTRFS_QGROUP_ALL || column < 0);
 217         int len;
 218         int unit_mode = btrfs_qgroup_columns[column].unit_mode;
 219         int max_len = btrfs_qgroup_columns[column].max_len;
 220
 221         switch (column) {
 222
 223         case BTRFS_QGROUP_QGROUPID:
 224                 len = printf("%llu/%llu",
 225                              btrfs_qgroup_level(qgroup->qgroupid),
 226                              btrfs_qgroup_subvid(qgroup->qgroupid));
 227                 print_qgroup_column_add_blank(BTRFS_QGROUP_QGROUPID, len);
 228                 break;
 229         case BTRFS_QGROUP_RFER:
 230                 len = printf("%*s", max_len, pretty_size_mode(qgroup->rfer, unit_mode));
 231                 break;
 232         case BTRFS_QGROUP_EXCL:
 233                 len = printf("%*s", max_len, pretty_size_mode(qgroup->excl, unit_mode));
 234                 break;
 235         case BTRFS_QGROUP_PARENT:
 236                 len = print_parent_column(qgroup);
 237                 print_qgroup_column_add_blank(BTRFS_QGROUP_PARENT, len);
 238                 break;
 239         case BTRFS_QGROUP_MAX_RFER:
 240                 if (qgroup->flags & BTRFS_QGROUP_LIMIT_MAX_RFER)
 241                         len = printf("%*s", max_len, pretty_size_mode(qgroup->max_rfer, unit_mode));
 242                 else
 243                         len = printf("%*s", max_len, "none");
 244                 break;
 245         case BTRFS_QGROUP_MAX_EXCL:
 246                 if (qgroup->flags & BTRFS_QGROUP_LIMIT_MAX_EXCL)
 247                         len = printf("%*s", max_len, pretty_size_mode(qgroup->max_excl, unit_mode));
 248                 else
 249                         len = printf("%*s", max_len, "none");
 250                 break;
 251         case BTRFS_QGROUP_CHILD:
 252                 len = print_child_column(qgroup);
 253                 print_qgroup_column_add_blank(BTRFS_QGROUP_CHILD, len);
 254                 break;
 255         default:
 256                 break;
 257         }
 258 }
 259
 260 static void print_single_qgroup_table(struct btrfs_qgroup *qgroup)
 261 {
 262         int i;
 263
 264         for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
 265                 if (!btrfs_qgroup_columns[i].need_print)
 266                         continue;
 267                 print_qgroup_column(qgroup, i);
 268
 269                 if (i != BTRFS_QGROUP_CHILD)
 270                         printf(" ");
 271         }
 272         printf("\n");
 273 }
 274
 275 static void print_table_head()
 276 {
 277         int i;
 278         int len;
 279         int max_len;
 280
 281         for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
 282                 max_len = btrfs_qgroup_columns[i].max_len;
 283                 if (!btrfs_qgroup_columns[i].need_print)
 284                         continue;
 285                 if ((i == BTRFS_QGROUP_QGROUPID) | (i == BTRFS_QGROUP_PARENT) |
 286                         (i == BTRFS_QGROUP_CHILD))
 287                         printf("%-*s", max_len, btrfs_qgroup_columns[i].name);
 288                 else
 289                         printf("%*s", max_len, btrfs_qgroup_columns[i].name);
 290                 printf(" ");
 291         }
 292         printf("\n");
 293         for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
 294                 max_len = btrfs_qgroup_columns[i].max_len;
 295                 if (!btrfs_qgroup_columns[i].need_print)
 296                         continue;
 297                 if ((i == BTRFS_QGROUP_QGROUPID) | (i == BTRFS_QGROUP_PARENT) |
 298                         (i == BTRFS_QGROUP_CHILD)) {
 299                         len = strlen(btrfs_qgroup_columns[i].name);
 300                         while (len--)
 301                                 printf("-");
 302                         len = max_len - strlen(btrfs_qgroup_columns[i].name);
 303                         while (len--)
 304                                 printf(" ");
 305                 } else {
 306                         len = max_len - strlen(btrfs_qgroup_columns[i].name);
 307                         while (len--)
 308                                 printf(" ");
 309                         len = strlen(btrfs_qgroup_columns[i].name);
 310                         while (len--)
 311                                 printf("-");
 312                 }
 313                 printf(" ");
 314         }
 315         printf("\n");
 316 }
 317
 318 static void qgroup_lookup_init(struct qgroup_lookup *tree)
 319 {
 320         tree->root.rb_node = NULL;
 321 }
 322
 323 static int comp_entry_with_qgroupid(struct btrfs_qgroup *entry1,
 324                                     struct btrfs_qgroup *entry2,
 325                                     int is_descending)
 326 {
 327
 328         int ret;
 329
 330         if (entry1->qgroupid > entry2->qgroupid)
 331                 ret = 1;
 332         else if (entry1->qgroupid < entry2->qgroupid)
 333                 ret = -1;
 334         else
 335                 ret = 0;
 336
 337         return is_descending ? -ret : ret;
 338 }
 339
 340 static int comp_entry_with_rfer(struct btrfs_qgroup *entry1,
 341                                 struct btrfs_qgroup *entry2,
 342                                 int is_descending)
 343 {
 344         int ret;
 345
 346         if (entry1->rfer > entry2->rfer)
 347                 ret = 1;
 348         else if (entry1->rfer < entry2->rfer)
 349                 ret = -1;
 350         else
 351                 ret = 0;
 352
 353         return is_descending ? -ret : ret;
 354 }
 355
 356 static int comp_entry_with_excl(struct btrfs_qgroup *entry1,
 357                                 struct btrfs_qgroup *entry2,
 358                                 int is_descending)
 359 {
 360         int ret;
 361
 362         if (entry1->excl > entry2->excl)
 363                 ret = 1;
 364         else if (entry1->excl < entry2->excl)
 365                 ret = -1;
 366         else
 367                 ret = 0;
 368
 369         return is_descending ? -ret : ret;
 370 }
 371
 372 static int comp_entry_with_max_rfer(struct btrfs_qgroup *entry1,
 373                                     struct btrfs_qgroup *entry2,
 374                                     int is_descending)
 375 {
 376         int ret;
 377
 378         if (entry1->max_rfer > entry2->max_rfer)
 379                 ret = 1;
 380         else if (entry1->max_rfer < entry2->max_rfer)
 381                 ret = -1;
 382         else
 383                 ret = 0;
 384
 385         return is_descending ? -ret : ret;
 386 }
 387
 388 static int comp_entry_with_max_excl(struct btrfs_qgroup *entry1,
 389                                     struct btrfs_qgroup *entry2,
 390                                     int is_descending)
 391 {
 392         int ret;
 393
 394         if (entry1->max_excl > entry2->max_excl)
 395                 ret = 1;
 396         else if (entry1->max_excl < entry2->max_excl)
 397                 ret = -1;
 398         else
 399                 ret = 0;
 400
 401         return is_descending ? -ret : ret;
 402 }
 403
 404 static btrfs_qgroup_comp_func all_comp_funcs[] = {
 405         [BTRFS_QGROUP_COMP_QGROUPID]    = comp_entry_with_qgroupid,
 406         [BTRFS_QGROUP_COMP_RFER]        = comp_entry_with_rfer,
 407         [BTRFS_QGROUP_COMP_EXCL]        = comp_entry_with_excl,
 408         [BTRFS_QGROUP_COMP_MAX_RFER]    = comp_entry_with_max_rfer,
 409         [BTRFS_QGROUP_COMP_MAX_EXCL]    = comp_entry_with_max_excl
 410 };
 411
 412 static char *all_sort_items[] = {
 413         [BTRFS_QGROUP_COMP_QGROUPID]    = "qgroupid",
 414         [BTRFS_QGROUP_COMP_RFER]        = "rfer",
 415         [BTRFS_QGROUP_COMP_EXCL]        = "excl",
 416         [BTRFS_QGROUP_COMP_MAX_RFER]    = "max_rfer",
 417         [BTRFS_QGROUP_COMP_MAX_EXCL]    = "max_excl",
 418         [BTRFS_QGROUP_COMP_MAX]         = NULL,
 419 };
 420
 421 static int  btrfs_qgroup_get_sort_item(char *sort_name)
 422 {
 423         int i;
 424
 425         for (i = 0; i < BTRFS_QGROUP_COMP_MAX; i++) {
 426                 if (strcmp(sort_name, all_sort_items[i]) == 0)
 427                         return i;
 428         }
 429         return -1;
 430 }
 431
 432 struct btrfs_qgroup_comparer_set *btrfs_qgroup_alloc_comparer_set(void)
 433 {
 434         struct btrfs_qgroup_comparer_set *set;
 435         int size;
 436         size = sizeof(struct btrfs_qgroup_comparer_set) +
 437                BTRFS_QGROUP_NCOMPS_INCREASE *
 438                sizeof(struct btrfs_qgroup_comparer);
 439         set = malloc(size);
 440         if (!set) {
 441                 fprintf(stderr, "memory allocation failed\n");
 442                 exit(1);
 443         }
 444
 445         memset(set, 0, size);
 446         set->total = BTRFS_QGROUP_NCOMPS_INCREASE;
 447
 448         return set;
 449 }
 450
 451 void btrfs_qgroup_free_comparer_set(struct btrfs_qgroup_comparer_set *comp_set)
 452 {
 453         free(comp_set);
 454 }
 455
 456 int btrfs_qgroup_setup_comparer(struct btrfs_qgroup_comparer_set  **comp_set,
 457                                 enum btrfs_qgroup_comp_enum comparer,
 458                                 int is_descending)
 459 {
 460         struct btrfs_qgroup_comparer_set *set = *comp_set;
 461         int size;
 462
 463         BUG_ON(!set);
 464         BUG_ON(comparer >= BTRFS_QGROUP_COMP_MAX);
 465         BUG_ON(set->ncomps > set->total);
 466
 467         if (set->ncomps == set->total) {
 468                 void *tmp;
 469
 470                 size = set->total + BTRFS_QGROUP_NCOMPS_INCREASE;
 471                 size = sizeof(*set) +
 472                        size * sizeof(struct btrfs_qgroup_comparer);
 473                 tmp = set;
 474                 set = realloc(set, size);
 475                 if (!set) {
 476                         fprintf(stderr, "memory allocation failed\n");
 477                         free(tmp);
 478                         exit(1);
 479                 }
 480
 481                 memset(&set->comps[set->total], 0,
 482                        BTRFS_QGROUP_NCOMPS_INCREASE *
 483                        sizeof(struct btrfs_qgroup_comparer));
 484                 set->total += BTRFS_QGROUP_NCOMPS_INCREASE;
 485                 *comp_set = set;
 486         }
 487
 488         BUG_ON(set->comps[set->ncomps].comp_func);
 489
 490         set->comps[set->ncomps].comp_func = all_comp_funcs[comparer];
 491         set->comps[set->ncomps].is_descending = is_descending;
 492         set->ncomps++;
 493         return 0;
 494 }
 495
 496 static int sort_comp(struct btrfs_qgroup *entry1, struct btrfs_qgroup *entry2,
 497                      struct btrfs_qgroup_comparer_set *set)
 498 {
 499         int qgroupid_compared = 0;
 500         int i, ret = 0;
 501
 502         if (!set || !set->ncomps)
 503                 goto comp_qgroupid;
 504
 505         for (i = 0; i < set->ncomps; i++) {
 506                 if (!set->comps[i].comp_func)
 507                         break;
 508
 509                 ret = set->comps[i].comp_func(entry1, entry2,
 510                                               set->comps[i].is_descending);
 511                 if (ret)
 512                         return ret;
 513
 514                 if (set->comps[i].comp_func == comp_entry_with_qgroupid)
 515                         qgroupid_compared = 1;
 516         }
 517
 518         if (!qgroupid_compared) {
 519 comp_qgroupid:
 520                 ret = comp_entry_with_qgroupid(entry1, entry2, 0);
 521         }
 522
 523         return ret;
 524 }
 525
 526 /*
 527  * insert a new root into the tree.  returns the existing root entry
 528  * if one is already there.  qgroupid is used
 529  * as the key
 530  */
 531 static int qgroup_tree_insert(struct qgroup_lookup *root_tree,
 532                               struct btrfs_qgroup *ins)
 533 {
 534
 535         struct rb_node **p = &root_tree->root.rb_node;
 536         struct rb_node *parent = NULL;
 537         struct btrfs_qgroup *curr;
 538         int ret;
 539
 540         while (*p) {
 541                 parent = *p;
 542                 curr = rb_entry(parent, struct btrfs_qgroup, rb_node);
 543
 544                 ret = comp_entry_with_qgroupid(ins, curr, 0);
 545                 if (ret < 0)
 546                         p = &(*p)->rb_left;
 547                 else if (ret > 0)
 548                         p = &(*p)->rb_right;
 549                 else
 550                         return -EEXIST;
 551         }
 552         rb_link_node(&ins->rb_node, parent, p);
 553         rb_insert_color(&ins->rb_node, &root_tree->root);
 554         return 0;
 555 }
 556
 557 /*
 558  *find a given qgroupid in the tree. We return the smallest one,
 559  *rb_next can be used to move forward looking for more if required
 560  */
 561 static struct btrfs_qgroup *qgroup_tree_search(struct qgroup_lookup *root_tree,
 562                                                u64 qgroupid)
 563 {
 564         struct rb_node *n = root_tree->root.rb_node;
 565         struct btrfs_qgroup *entry;
 566         struct btrfs_qgroup tmp;
 567         int ret;
 568
 569         tmp.qgroupid = qgroupid;
 570
 571         while (n) {
 572                 entry = rb_entry(n, struct btrfs_qgroup, rb_node);
 573
 574                 ret = comp_entry_with_qgroupid(&tmp, entry, 0);
 575                 if (ret < 0)
 576                         n = n->rb_left;
 577                 else if (ret > 0)
 578                         n = n->rb_right;
 579                 else
 580                         return entry;
 581
 582         }
 583         return NULL;
 584 }
 585
 586 static int update_qgroup(struct qgroup_lookup *qgroup_lookup, u64 qgroupid,
 587                          u64 generation, u64 rfer, u64 rfer_cmpr, u64 excl,
 588                          u64 excl_cmpr, u64 flags, u64 max_rfer, u64 max_excl,
 589                          u64 rsv_rfer, u64 rsv_excl, struct btrfs_qgroup *pa,
 590                          struct btrfs_qgroup *child)
 591 {
 592         struct btrfs_qgroup *bq;
 593         struct btrfs_qgroup_list *list;
 594
 595         bq = qgroup_tree_search(qgroup_lookup, qgroupid);
 596         if (!bq || bq->qgroupid != qgroupid)
 597                 return -ENOENT;
 598
 599         if (generation)
 600                 bq->generation = generation;
 601         if (rfer)
 602                 bq->rfer = rfer;
 603         if (rfer_cmpr)
 604                 bq->rfer_cmpr = rfer_cmpr;
 605         if (excl)
 606                 bq->excl = excl;
 607         if (excl_cmpr)
 608                 bq->excl_cmpr = excl_cmpr;
 609         if (flags)
 610                 bq->flags = flags;
 611         if (max_rfer)
 612                 bq->max_rfer = max_rfer;
 613         if (max_excl)
 614                 bq->max_excl = max_excl;
 615         if (rsv_rfer)
 616                 bq->rsv_rfer = rsv_rfer;
 617         if (pa && child) {
 618                 list = malloc(sizeof(*list));
 619                 if (!list) {
 620                         fprintf(stderr, "memory allocation failed\n");
 621                         exit(1);
 622                 }
 623                 list->qgroup = pa;
 624                 list->member = child;
 625                 list_add_tail(&list->next_qgroup, &child->qgroups);
 626                 list_add_tail(&list->next_member, &pa->members);
 627         }
 628         return 0;
 629 }
 630
 631 static int add_qgroup(struct qgroup_lookup *qgroup_lookup, u64 qgroupid,
 632                       u64 generation, u64 rfer, u64 rfer_cmpr, u64 excl,
 633                       u64 excl_cmpr, u64 flags, u64 max_rfer, u64 max_excl,
 634                       u64 rsv_rfer, u64 rsv_excl, struct btrfs_qgroup *parent,
 635                       struct btrfs_qgroup *child)
 636 {
 637         struct btrfs_qgroup *bq;
 638         struct btrfs_qgroup_list *list;
 639         int ret;
 640
 641         ret = update_qgroup(qgroup_lookup, qgroupid, generation, rfer,
 642                             rfer_cmpr, excl, excl_cmpr, flags, max_rfer,
 643                             max_excl, rsv_rfer, rsv_excl, parent, child);
 644         if (!ret)
 645                 return 0;
 646
 647         bq = malloc(sizeof(*bq));
 648         if (!bq) {
 649                 printf("memory allocation failed\n");
 650                 exit(1);
 651         }
 652         memset(bq, 0, sizeof(*bq));
 653         if (qgroupid) {
 654                 bq->qgroupid = qgroupid;
 655                 INIT_LIST_HEAD(&bq->qgroups);
 656                 INIT_LIST_HEAD(&bq->members);
 657         }
 658         if (generation)
 659                 bq->generation = generation;
 660         if (rfer)
 661                 bq->rfer = rfer;
 662         if (rfer_cmpr)
 663                 bq->rfer_cmpr = rfer_cmpr;
 664         if (excl)
 665                 bq->excl = excl;
 666         if (excl_cmpr)
 667                 bq->excl_cmpr = excl_cmpr;
 668         if (flags)
 669                 bq->flags = flags;
 670         if (max_rfer)
 671                 bq->max_rfer = max_rfer;
 672         if (max_excl)
 673                 bq->max_excl = max_excl;
 674         if (rsv_rfer)
 675                 bq->rsv_rfer = rsv_rfer;
 676         if (parent && child) {
 677                 list = malloc(sizeof(*list));
 678                 if (!list) {
 679                         fprintf(stderr, "memory allocation failed\n");
 680                         exit(1);
 681                 }
 682                 list->qgroup = parent;
 683                 list->member = child;
 684                 list_add_tail(&list->next_qgroup, &child->qgroups);
 685                 list_add_tail(&list->next_member, &parent->members);
 686         }
 687         ret = qgroup_tree_insert(qgroup_lookup, bq);
 688         if (ret) {
 689                 printf("failed to insert tree %llu\n",
 690                        bq->qgroupid);
 691                 exit(1);
 692         }
 693         return ret;
 694 }
 695
 696 static void __free_btrfs_qgroup(struct btrfs_qgroup *bq)
 697 {
 698         struct btrfs_qgroup_list *list;
 699         while (!list_empty(&bq->qgroups)) {
 700                 list = list_entry((&bq->qgroups)->next,
 701                                   struct btrfs_qgroup_list,
 702                                   next_qgroup);
 703                 list_del(&list->next_qgroup);
 704                 list_del(&list->next_member);
 705                 free(list);
 706         }
 707         while (!list_empty(&bq->members)) {
 708                 list = list_entry((&bq->members)->next,
 709                                   struct btrfs_qgroup_list,
 710                                   next_member);
 711                 list_del(&list->next_qgroup);
 712                 list_del(&list->next_member);
 713                 free(list);
 714         }
 715         free(bq);
 716 }
 717
 718 static void __free_all_qgroups(struct qgroup_lookup *root_tree)
 719 {
 720         struct btrfs_qgroup *entry;
 721         struct rb_node *n;
 722
 723         n = rb_first(&root_tree->root);
 724         while (n) {
 725                 entry = rb_entry(n, struct btrfs_qgroup, rb_node);
 726                 rb_erase(n, &root_tree->root);
 727                 __free_btrfs_qgroup(entry);
 728
 729                 n = rb_first(&root_tree->root);
 730         }
 731 }
 732
 733 static int filter_all_parent_insert(struct qgroup_lookup *sort_tree,
 734                                     struct btrfs_qgroup *bq)
 735 {
 736         struct rb_node **p = &sort_tree->root.rb_node;
 737         struct rb_node *parent = NULL;
 738         struct btrfs_qgroup *curr;
 739         int ret;
 740
 741         while (*p) {
 742                 parent = *p;
 743                 curr = rb_entry(parent, struct btrfs_qgroup, all_parent_node);
 744
 745                 ret = comp_entry_with_qgroupid(bq, curr, 0);
 746                 if (ret < 0)
 747                         p = &(*p)->rb_left;
 748                 else if (ret > 0)
 749                         p = &(*p)->rb_right;
 750                 else
 751                         return -EEXIST;
 752         }
 753         rb_link_node(&bq->all_parent_node, parent, p);
 754         rb_insert_color(&bq->all_parent_node, &sort_tree->root);
 755         return 0;
 756 }
 757
 758 static int filter_by_parent(struct btrfs_qgroup *bq, u64 data)
 759 {
 760         struct btrfs_qgroup *qgroup =
 761                 (struct btrfs_qgroup *)(unsigned long)data;
 762
 763         if (data == 0)
 764                 return 0;
 765         if (qgroup->qgroupid == bq->qgroupid)
 766                 return 1;
 767         return 0;
 768 }
 769
 770 static int filter_by_all_parent(struct btrfs_qgroup *bq, u64 data)
 771 {
 772         struct qgroup_lookup lookup;
 773         struct qgroup_lookup *ql = &lookup;
 774         struct btrfs_qgroup_list *list;
 775         struct rb_node *n;
 776         struct btrfs_qgroup *qgroup =
 777                          (struct btrfs_qgroup *)(unsigned long)data;
 778
 779         if (data == 0)
 780                 return 0;
 781         if (bq->qgroupid == qgroup->qgroupid)
 782                 return 1;
 783
 784         qgroup_lookup_init(ql);
 785         filter_all_parent_insert(ql, qgroup);
 786         n = rb_first(&ql->root);
 787         while (n) {
 788                 qgroup = rb_entry(n, struct btrfs_qgroup, all_parent_node);
 789                 if (!list_empty(&qgroup->qgroups)) {
 790                         list_for_each_entry(list, &qgroup->qgroups,
 791                                             next_qgroup) {
 792                                 if ((list->qgroup)->qgroupid == bq->qgroupid)
 793                                         return 1;
 794                                 filter_all_parent_insert(ql, list->qgroup);
 795                         }
 796                 }
 797                 rb_erase(n, &ql->root);
 798                 n = rb_first(&ql->root);
 799         }
 800         return 0;
 801 }
 802
 803 static btrfs_qgroup_filter_func all_filter_funcs[] = {
 804         [BTRFS_QGROUP_FILTER_PARENT]            = filter_by_parent,
 805         [BTRFS_QGROUP_FILTER_ALL_PARENT]        = filter_by_all_parent,
 806 };
 807
 808 struct btrfs_qgroup_filter_set *btrfs_qgroup_alloc_filter_set(void)
 809 {
 810         struct btrfs_qgroup_filter_set *set;
 811         int size;
 812
 813         size = sizeof(struct btrfs_qgroup_filter_set) +
 814                BTRFS_QGROUP_NFILTERS_INCREASE *
 815                sizeof(struct btrfs_qgroup_filter);
 816         set = malloc(size);
 817         if (!set) {
 818                 fprintf(stderr, "memory allocation failed\n");
 819                 exit(1);
 820         }
 821         memset(set, 0, size);
 822         set->total = BTRFS_QGROUP_NFILTERS_INCREASE;
 823
 824         return set;
 825 }
 826
 827 void btrfs_qgroup_free_filter_set(struct btrfs_qgroup_filter_set *filter_set)
 828 {
 829         free(filter_set);
 830 }
 831
 832 int btrfs_qgroup_setup_filter(struct btrfs_qgroup_filter_set **filter_set,
 833                               enum btrfs_qgroup_filter_enum filter, u64 data)
 834 {
 835         struct btrfs_qgroup_filter_set *set = *filter_set;
 836         int size;
 837
 838         BUG_ON(!set);
 839         BUG_ON(filter >= BTRFS_QGROUP_FILTER_MAX);
 840         BUG_ON(set->nfilters > set->total);
 841
 842         if (set->nfilters == set->total) {
 843                 void *tmp;
 844
 845                 size = set->total + BTRFS_QGROUP_NFILTERS_INCREASE;
 846                 size = sizeof(*set) + size * sizeof(struct btrfs_qgroup_filter);
 847
 848                 tmp = set;
 849                 set = realloc(set, size);
 850                 if (!set) {
 851                         fprintf(stderr, "memory allocation failed\n");
 852                         free(tmp);
 853                         exit(1);
 854                 }
 855                 memset(&set->filters[set->total], 0,
 856                        BTRFS_QGROUP_NFILTERS_INCREASE *
 857                        sizeof(struct btrfs_qgroup_filter));
 858                 set->total += BTRFS_QGROUP_NFILTERS_INCREASE;
 859                 *filter_set = set;
 860         }
 861         BUG_ON(set->filters[set->nfilters].filter_func);
 862         set->filters[set->nfilters].filter_func = all_filter_funcs[filter];
 863         set->filters[set->nfilters].data = data;
 864         set->nfilters++;
 865         return 0;
 866 }
 867
 868 static int filter_qgroup(struct btrfs_qgroup *bq,
 869                          struct btrfs_qgroup_filter_set *set)
 870 {
 871         int i, ret;
 872
 873         if (!set || !set->nfilters)
 874                 return 1;
 875         for (i = 0; i < set->nfilters; i++) {
 876                 if (!set->filters[i].filter_func)
 877                         break;
 878                 ret = set->filters[i].filter_func(bq, set->filters[i].data);
 879                 if (!ret)
 880                         return 0;
 881         }
 882         return 1;
 883 }
 884
 885 static void pre_process_filter_set(struct qgroup_lookup *lookup,
 886                                    struct btrfs_qgroup_filter_set *set)
 887 {
 888         int i;
 889         struct btrfs_qgroup *qgroup_for_filter = NULL;
 890
 891         for (i = 0; i < set->nfilters; i++) {
 892
 893                 if (set->filters[i].filter_func == filter_by_all_parent
 894                     || set->filters[i].filter_func == filter_by_parent) {
 895                         qgroup_for_filter = qgroup_tree_search(lookup,
 896                                             set->filters[i].data);
 897                         set->filters[i].data =
 898                                  (u64)(unsigned long)qgroup_for_filter;
 899                 }
 900         }
 901 }
 902
 903 static int sort_tree_insert(struct qgroup_lookup *sort_tree,
 904                             struct btrfs_qgroup *bq,
 905                             struct btrfs_qgroup_comparer_set *comp_set)
 906 {
 907         struct rb_node **p = &sort_tree->root.rb_node;
 908         struct rb_node *parent = NULL;
 909         struct btrfs_qgroup *curr;
 910         int ret;
 911
 912         while (*p) {
 913                 parent = *p;
 914                 curr = rb_entry(parent, struct btrfs_qgroup, sort_node);
 915
 916                 ret = sort_comp(bq, curr, comp_set);
 917                 if (ret < 0)
 918                         p = &(*p)->rb_left;
 919                 else if (ret > 0)
 920                         p = &(*p)->rb_right;
 921                 else
 922                         return -EEXIST;
 923         }
 924         rb_link_node(&bq->sort_node, parent, p);
 925         rb_insert_color(&bq->sort_node, &sort_tree->root);
 926         return 0;
 927 }
 928
 929 static void __update_columns_max_len(struct btrfs_qgroup *bq,
 930                                      enum btrfs_qgroup_column_enum column)
 931 {
 932         BUG_ON(column >= BTRFS_QGROUP_ALL || column < 0);
 933         struct btrfs_qgroup_list *list = NULL;
 934         char tmp[100];
 935         int len;
 936         unsigned unit_mode = btrfs_qgroup_columns[column].unit_mode;
 937
 938         switch (column) {
 939
 940         case BTRFS_QGROUP_QGROUPID:
 941                 sprintf(tmp, "%llu/%llu",
 942                         btrfs_qgroup_level(bq->qgroupid),
 943                         btrfs_qgroup_subvid(bq->qgroupid));
 944                 len = strlen(tmp);
 945                 if (btrfs_qgroup_columns[column].max_len < len)
 946                         btrfs_qgroup_columns[column].max_len = len;
 947                 break;
 948         case BTRFS_QGROUP_RFER:
 949                 len = strlen(pretty_size_mode(bq->rfer, unit_mode));
 950                 if (btrfs_qgroup_columns[column].max_len < len)
 951                         btrfs_qgroup_columns[column].max_len = len;
 952                 break;
 953         case BTRFS_QGROUP_EXCL:
 954                 len = strlen(pretty_size_mode(bq->excl, unit_mode));
 955                 if (btrfs_qgroup_columns[column].max_len < len)
 956                         btrfs_qgroup_columns[column].max_len = len;
 957                 break;
 958         case BTRFS_QGROUP_MAX_RFER:
 959                 len = strlen(pretty_size_mode(bq->max_rfer, unit_mode));
 960                 if (btrfs_qgroup_columns[column].max_len < len)
 961                         btrfs_qgroup_columns[column].max_len = len;
 962                 break;
 963         case BTRFS_QGROUP_MAX_EXCL:
 964                 len = strlen(pretty_size_mode(bq->max_excl, unit_mode));
 965                 if (btrfs_qgroup_columns[column].max_len < len)
 966                         btrfs_qgroup_columns[column].max_len = len;
 967                 break;
 968         case BTRFS_QGROUP_PARENT:
 969                 len = 0;
 970                 list_for_each_entry(list, &bq->qgroups, next_qgroup) {
 971                         len += sprintf(tmp, "%llu/%llu",
 972                                 btrfs_qgroup_level(list->qgroup->qgroupid),
 973                                 btrfs_qgroup_subvid(list->qgroup->qgroupid));
 974                         if (!list_is_last(&list->next_qgroup, &bq->qgroups))
 975                                 len += 1;
 976                 }
 977                 if (btrfs_qgroup_columns[column].max_len < len)
 978                         btrfs_qgroup_columns[column].max_len = len;
 979                 break;
 980         case BTRFS_QGROUP_CHILD:
 981                 len = 0;
 982                 list_for_each_entry(list, &bq->members, next_member) {
 983                         len += sprintf(tmp, "%llu/%llu",
 984                                 btrfs_qgroup_level(list->member->qgroupid),
 985                                 btrfs_qgroup_subvid(list->member->qgroupid));
 986                         if (!list_is_last(&list->next_member, &bq->members))
 987                                 len += 1;
 988                 }
 989                 if (btrfs_qgroup_columns[column].max_len < len)
 990                         btrfs_qgroup_columns[column].max_len = len;
 991                 break;
 992         default:
 993                 break;
 994         }
 995
 996 }
 997
 998 static void update_columns_max_len(struct btrfs_qgroup *bq)
 999 {
1000         int i;
1001
1002         for (i = 0; i < BTRFS_QGROUP_ALL; i++) {
1003                 if (!btrfs_qgroup_columns[i].need_print)
1004                         continue;
1005                 __update_columns_max_len(bq, i);
1006         }
1007 }
1008
1009 static void __filter_and_sort_qgroups(struct qgroup_lookup *all_qgroups,
1010                                  struct qgroup_lookup *sort_tree,
1011                                  struct btrfs_qgroup_filter_set *filter_set,
1012                                  struct btrfs_qgroup_comparer_set *comp_set)
1013 {
1014         struct rb_node *n;
1015         struct btrfs_qgroup *entry;
1016         int ret;
1017
1018         qgroup_lookup_init(sort_tree);
1019         pre_process_filter_set(all_qgroups, filter_set);
1020
1021         n = rb_last(&all_qgroups->root);
1022         while (n) {
1023                 entry = rb_entry(n, struct btrfs_qgroup, rb_node);
1024
1025                 ret = filter_qgroup(entry, filter_set);
1026                 if (ret) {
1027                         sort_tree_insert(sort_tree, entry, comp_set);
1028
1029                         update_columns_max_len(entry);
1030                 }
1031                 n = rb_prev(n);
1032         }
1033 }
1034
1035 static inline void print_status_flag_warning(u64 flags)
1036 {
1037         if (!(flags & BTRFS_QGROUP_STATUS_FLAG_ON))
1038                 fprintf(stderr,
1039                 "WARNING: Quota disabled, qgroup data may be out of date\n");
1040         else if (flags & BTRFS_QGROUP_STATUS_FLAG_RESCAN)
1041                 fprintf(stderr,
1042                 "WARNING: Rescan is running, qgroup data may be incorrect\n");
1043         else if (flags & BTRFS_QGROUP_STATUS_FLAG_INCONSISTENT)
1044                 fprintf(stderr,
1045                 "WARNING: Qgroup data inconsistent, rescan recommended\n");
1046 }
1047
1048 static int __qgroups_search(int fd, struct qgroup_lookup *qgroup_lookup)
1049 {
1050         int ret;
1051         struct btrfs_ioctl_search_args args;
1052         struct btrfs_ioctl_search_key *sk = &args.key;
1053         struct btrfs_ioctl_search_header *sh;
1054         unsigned long off = 0;
1055         unsigned int i;
1056         int e;
1057         struct btrfs_qgroup_info_item *info;
1058         struct btrfs_qgroup_limit_item *limit;
1059         struct btrfs_qgroup *bq;
1060         struct btrfs_qgroup *bq1;
1061         u64 a1;
1062         u64 a2;
1063         u64 a3;
1064         u64 a4;
1065         u64 a5;
1066
1067         memset(&args, 0, sizeof(args));
1068
1069         sk->tree_id = BTRFS_QUOTA_TREE_OBJECTID;
1070         sk->max_type = BTRFS_QGROUP_RELATION_KEY;
1071         sk->min_type = BTRFS_QGROUP_STATUS_KEY;
1072         sk->max_objectid = (u64)-1;
1073         sk->max_offset = (u64)-1;
1074         sk->max_transid = (u64)-1;
1075         sk->nr_items = 4096;
1076
1077         qgroup_lookup_init(qgroup_lookup);
1078
1079         while (1) {
1080                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1081                 e = errno;
1082                 if (ret < 0) {
1083                         fprintf(stderr,
1084                                 "ERROR: can't perform the search - %s\n",
1085                                 strerror(e));
1086                         return ret;
1087                 }
1088                 /* the ioctl returns the number of item it found in nr_items */
1089                 if (sk->nr_items == 0)
1090                         break;
1091
1092                 off = 0;
1093                 /*
1094                  * for each item, pull the key out of the header and then
1095                  * read the root_ref item it contains
1096                  */
1097                 for (i = 0; i < sk->nr_items; i++) {
1098                         sh = (struct btrfs_ioctl_search_header *)(args.buf +
1099                                                                   off);
1100                         off += sizeof(*sh);
1101
1102                         if (sh->type == BTRFS_QGROUP_STATUS_KEY) {
1103                                 struct btrfs_qgroup_status_item *si;
1104                                 u64 flags;
1105
1106                                 si = (struct btrfs_qgroup_status_item *)
1107                                      (args.buf + off);
1108                                 flags = btrfs_stack_qgroup_status_flags(si);
1109                                 print_status_flag_warning(flags);
1110                         } else if (sh->type == BTRFS_QGROUP_INFO_KEY) {
1111                                 info = (struct btrfs_qgroup_info_item *)
1112                                        (args.buf + off);
1113                                 a1 = btrfs_stack_qgroup_info_generation(info);
1114                                 a2 = btrfs_stack_qgroup_info_referenced(info);
1115                                 a3 =
1116                                   btrfs_stack_qgroup_info_referenced_compressed
1117                                   (info);
1118                                 a4 = btrfs_stack_qgroup_info_exclusive(info);
1119                                 a5 =
1120                                   btrfs_stack_qgroup_info_exclusive_compressed
1121                                   (info);
1122                                 add_qgroup(qgroup_lookup, sh->offset, a1, a2,
1123                                            a3, a4, a5, 0, 0, 0, 0, 0, 0, 0);
1124                         } else if (sh->type == BTRFS_QGROUP_LIMIT_KEY) {
1125                                 limit = (struct btrfs_qgroup_limit_item *)
1126                                     (args.buf + off);
1127
1128                                 a1 = btrfs_stack_qgroup_limit_flags(limit);
1129                                 a2 = btrfs_stack_qgroup_limit_max_referenced
1130                                      (limit);
1131                                 a3 = btrfs_stack_qgroup_limit_max_exclusive
1132                                      (limit);
1133                                 a4 = btrfs_stack_qgroup_limit_rsv_referenced
1134                                      (limit);
1135                                 a5 = btrfs_stack_qgroup_limit_rsv_exclusive
1136                                      (limit);
1137                                 add_qgroup(qgroup_lookup, sh->offset, 0, 0,
1138                                            0, 0, 0, a1, a2, a3, a4, a5, 0, 0);
1139                         } else if (sh->type == BTRFS_QGROUP_RELATION_KEY) {
1140                                 if (sh->offset < sh->objectid)
1141                                         goto skip;
1142                                 bq = qgroup_tree_search(qgroup_lookup,
1143                                                         sh->offset);
1144                                 if (!bq)
1145                                         goto skip;
1146                                 bq1 = qgroup_tree_search(qgroup_lookup,
1147                                                          sh->objectid);
1148                                 if (!bq1)
1149                                         goto skip;
1150                                 add_qgroup(qgroup_lookup, sh->offset, 0, 0,
1151                                            0, 0, 0, 0, 0, 0, 0, 0, bq, bq1);
1152                         } else
1153                                 goto done;
1154 skip:
1155                         off += sh->len;
1156
1157                         /*
1158                          * record the mins in sk so we can make sure the
1159                          * next search doesn't repeat this root
1160                          */
1161                         sk->min_type = sh->type;
1162                         sk->min_offset = sh->offset;
1163                         sk->min_objectid = sh->objectid;
1164                 }
1165                 sk->nr_items = 4096;
1166                 /*
1167                  * this iteration is done, step forward one qgroup for the next
1168                  * ioctl
1169                  */
1170                 if (sk->min_offset < (u64)-1)
1171                         sk->min_offset++;
1172                 else
1173                         break;
1174         }
1175
1176 done:
1177         return ret;
1178 }
1179
1180 static void print_all_qgroups(struct qgroup_lookup *qgroup_lookup)
1181 {
1182
1183         struct rb_node *n;
1184         struct btrfs_qgroup *entry;
1185
1186         print_table_head();
1187
1188         n = rb_first(&qgroup_lookup->root);
1189         while (n) {
1190                 entry = rb_entry(n, struct btrfs_qgroup, sort_node);
1191                 print_single_qgroup_table(entry);
1192                 n = rb_next(n);
1193         }
1194 }
1195
1196 int btrfs_show_qgroups(int fd,
1197                        struct btrfs_qgroup_filter_set *filter_set,
1198                        struct btrfs_qgroup_comparer_set *comp_set)
1199 {
1200
1201         struct qgroup_lookup qgroup_lookup;
1202         struct qgroup_lookup sort_tree;
1203         int ret;
1204
1205         ret = __qgroups_search(fd, &qgroup_lookup);
1206         if (ret)
1207                 return ret;
1208         __filter_and_sort_qgroups(&qgroup_lookup, &sort_tree,
1209                                   filter_set, comp_set);
1210         print_all_qgroups(&sort_tree);
1211
1212         __free_all_qgroups(&qgroup_lookup);
1213         btrfs_qgroup_free_filter_set(filter_set);
1214         return ret;
1215 }
1216
1217 u64 btrfs_get_path_rootid(int fd)
1218 {
1219         int  ret;
1220         struct btrfs_ioctl_ino_lookup_args args;
1221
1222         memset(&args, 0, sizeof(args));
1223         args.objectid = BTRFS_FIRST_FREE_OBJECTID;
1224
1225         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
1226         if (ret < 0) {
1227                 fprintf(stderr,
1228                         "ERROR: can't perform the search - %s\n",
1229                         strerror(errno));
1230                 return ret;
1231         }
1232         return args.treeid;
1233 }
1234
1235 int btrfs_qgroup_parse_sort_string(char *opt_arg,
1236                                    struct btrfs_qgroup_comparer_set **comps)
1237 {
1238         int order;
1239         int flag;
1240         char *p;
1241         char **ptr_argv;
1242         int what_to_sort;
1243
1244         while ((p = strtok(opt_arg, ",")) != NULL) {
1245                 flag = 0;
1246                 ptr_argv = all_sort_items;
1247
1248                 while (*ptr_argv) {
1249                         if (strcmp(*ptr_argv, p) == 0) {
1250                                 flag = 1;
1251                                 break;
1252                         } else {
1253                                 p++;
1254                                 if (strcmp(*ptr_argv, p) == 0) {
1255                                         flag = 1;
1256                                         p--;
1257                                         break;
1258                                 }
1259                                 p--;
1260                         }
1261                         ptr_argv++;
1262                 }
1263
1264                 if (flag == 0)
1265                         return -1;
1266
1267                 else {
1268                         if (*p == '+') {
1269                                 order = 0;
1270                                 p++;
1271                         } else if (*p == '-') {
1272                                 order = 1;
1273                                 p++;
1274                         } else
1275                                 order = 0;
1276
1277                         what_to_sort = btrfs_qgroup_get_sort_item(p);
1278                         if (what_to_sort < 0)
1279                                 return -1;
1280                         btrfs_qgroup_setup_comparer(comps, what_to_sort, order);
1281                 }
1282                 opt_arg = NULL;
1283         }
1284
1285         return 0;
1286 }
1287
1288 int qgroup_inherit_size(struct btrfs_qgroup_inherit *p)
1289 {
1290         return sizeof(*p) + sizeof(p->qgroups[0]) *
1291                             (p->num_qgroups + 2 * p->num_ref_copies +
1292                              2 * p->num_excl_copies);
1293 }
1294
1295 static int
1296 qgroup_inherit_realloc(struct btrfs_qgroup_inherit **inherit, int n, int pos)
1297 {
1298         struct btrfs_qgroup_inherit *out;
1299         int nitems = 0;
1300
1301         if (*inherit) {
1302                 nitems = (*inherit)->num_qgroups +
1303                          (*inherit)->num_ref_copies +
1304                          (*inherit)->num_excl_copies;
1305         }
1306
1307         out = calloc(sizeof(*out) + sizeof(out->qgroups[0]) * (nitems + n), 1);
1308         if (out == NULL) {
1309                 fprintf(stderr, "ERROR: Not enough memory\n");
1310                 return -ENOMEM;
1311         }
1312
1313         if (*inherit) {
1314                 struct btrfs_qgroup_inherit *i = *inherit;
1315                 int s = sizeof(out->qgroups[0]);
1316
1317                 out->num_qgroups = i->num_qgroups;
1318                 out->num_ref_copies = i->num_ref_copies;
1319                 out->num_excl_copies = i->num_excl_copies;
1320                 memcpy(out->qgroups, i->qgroups, pos * s);
1321                 memcpy(out->qgroups + pos + n, i->qgroups + pos,
1322                        (nitems - pos) * s);
1323         }
1324         free(*inherit);
1325         *inherit = out;
1326
1327         return 0;
1328 }
1329
1330 int qgroup_inherit_add_group(struct btrfs_qgroup_inherit **inherit, char *arg)
1331 {
1332         int ret;
1333         u64 qgroupid = parse_qgroupid(arg);
1334         int pos = 0;
1335
1336         if (qgroupid == 0) {
1337                 fprintf(stderr, "ERROR: bad qgroup specification\n");
1338                 return -EINVAL;
1339         }
1340
1341         if (*inherit)
1342                 pos = (*inherit)->num_qgroups;
1343         ret = qgroup_inherit_realloc(inherit, 1, pos);
1344         if (ret)
1345                 return ret;
1346
1347         (*inherit)->qgroups[(*inherit)->num_qgroups++] = qgroupid;
1348
1349         return 0;
1350 }
1351
1352 int qgroup_inherit_add_copy(struct btrfs_qgroup_inherit **inherit, char *arg,
1353                             int type)
1354 {
1355         int ret;
1356         u64 qgroup_src;
1357         u64 qgroup_dst;
1358         char *p;
1359         int pos = 0;
1360
1361         p = strchr(arg, ':');
1362         if (!p) {
1363 bad:
1364                 fprintf(stderr, "ERROR: bad copy specification\n");
1365                 return -EINVAL;
1366         }
1367         *p = 0;
1368         qgroup_src = parse_qgroupid(arg);
1369         qgroup_dst = parse_qgroupid(p + 1);
1370         *p = ':';
1371
1372         if (!qgroup_src || !qgroup_dst)
1373                 goto bad;
1374
1375         if (*inherit)
1376                 pos = (*inherit)->num_qgroups +
1377                       (*inherit)->num_ref_copies * 2 * type;
1378
1379         ret = qgroup_inherit_realloc(inherit, 2, pos);
1380         if (ret)
1381                 return ret;
1382
1383         (*inherit)->qgroups[pos++] = qgroup_src;
1384         (*inherit)->qgroups[pos++] = qgroup_dst;
1385
1386         if (!type)
1387                 ++(*inherit)->num_ref_copies;
1388         else
1389                 ++(*inherit)->num_excl_copies;
1390
1391         return 0;
1392 }