btrfs-list.c

   1 /*
   2  * Copyright (C) 2010 Oracle.  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 <sys/ioctl.h>
  20 #include <sys/mount.h>
  21 #include <stdio.h>
  22 #include <stdlib.h>
  23 #include <sys/types.h>
  24 #include <sys/stat.h>
  25 #include <fcntl.h>
  26 #include <unistd.h>
  27 #include <dirent.h>
  28 #include <libgen.h>
  29 #include "ctree.h"
  30 #include "transaction.h"
  31 #include "utils.h"
  32 #include "ioctl.h"
  33 #include <uuid/uuid.h>
  34 #include "btrfs-list.h"
  35 #include "rbtree-utils.h"
  36
  37 #define BTRFS_LIST_NFILTERS_INCREASE    (2 * BTRFS_LIST_FILTER_MAX)
  38 #define BTRFS_LIST_NCOMPS_INCREASE      (2 * BTRFS_LIST_COMP_MAX)
  39
  40 /* we store all the roots we find in an rbtree so that we can
  41  * search for them later.
  42  */
  43 struct root_lookup {
  44         struct rb_root root;
  45 };
  46
  47 static struct {
  48         char    *name;
  49         char    *column_name;
  50         int     need_print;
  51 } btrfs_list_columns[] = {
  52         {
  53                 .name           = "ID",
  54                 .column_name    = "ID",
  55                 .need_print     = 0,
  56         },
  57         {
  58                 .name           = "gen",
  59                 .column_name    = "Gen",
  60                 .need_print     = 0,
  61         },
  62         {
  63                 .name           = "cgen",
  64                 .column_name    = "CGen",
  65                 .need_print     = 0,
  66         },
  67         {
  68                 .name           = "parent",
  69                 .column_name    = "Parent",
  70                 .need_print     = 0,
  71         },
  72         {
  73                 .name           = "top level",
  74                 .column_name    = "Top Level",
  75                 .need_print     = 0,
  76         },
  77         {
  78                 .name           = "otime",
  79                 .column_name    = "OTime",
  80                 .need_print     = 0,
  81         },
  82         {
  83                 .name           = "parent_uuid",
  84                 .column_name    = "Parent UUID",
  85                 .need_print     = 0,
  86         },
  87         {
  88                 .name           = "received_uuid",
  89                 .column_name    = "Received UUID",
  90                 .need_print     = 0,
  91         },
  92         {
  93                 .name           = "uuid",
  94                 .column_name    = "UUID",
  95                 .need_print     = 0,
  96         },
  97         {
  98                 .name           = "path",
  99                 .column_name    = "Path",
 100                 .need_print     = 0,
 101         },
 102         {
 103                 .name           = NULL,
 104                 .column_name    = NULL,
 105                 .need_print     = 0,
 106         },
 107 };
 108
 109 static btrfs_list_filter_func all_filter_funcs[];
 110 static btrfs_list_comp_func all_comp_funcs[];
 111
 112 void btrfs_list_setup_print_column(enum btrfs_list_column_enum column)
 113 {
 114         int i;
 115
 116         ASSERT(0 <= column && column <= BTRFS_LIST_ALL);
 117
 118         if (column < BTRFS_LIST_ALL) {
 119                 btrfs_list_columns[column].need_print = 1;
 120                 return;
 121         }
 122
 123         for (i = 0; i < BTRFS_LIST_ALL; i++)
 124                 btrfs_list_columns[i].need_print = 1;
 125 }
 126
 127 static void root_lookup_init(struct root_lookup *tree)
 128 {
 129         tree->root.rb_node = NULL;
 130 }
 131
 132 static int comp_entry_with_rootid(struct root_info *entry1,
 133                                   struct root_info *entry2,
 134                                   int is_descending)
 135 {
 136         int ret;
 137
 138         if (entry1->root_id > entry2->root_id)
 139                 ret = 1;
 140         else if (entry1->root_id < entry2->root_id)
 141                 ret = -1;
 142         else
 143                 ret = 0;
 144
 145         return is_descending ? -ret : ret;
 146 }
 147
 148 static int comp_entry_with_gen(struct root_info *entry1,
 149                                struct root_info *entry2,
 150                                int is_descending)
 151 {
 152         int ret;
 153
 154         if (entry1->gen > entry2->gen)
 155                 ret = 1;
 156         else if (entry1->gen < entry2->gen)
 157                 ret = -1;
 158         else
 159                 ret = 0;
 160
 161         return is_descending ? -ret : ret;
 162 }
 163
 164 static int comp_entry_with_ogen(struct root_info *entry1,
 165                                 struct root_info *entry2,
 166                                 int is_descending)
 167 {
 168         int ret;
 169
 170         if (entry1->ogen > entry2->ogen)
 171                 ret = 1;
 172         else if (entry1->ogen < entry2->ogen)
 173                 ret = -1;
 174         else
 175                 ret = 0;
 176
 177         return is_descending ? -ret : ret;
 178 }
 179
 180 static int comp_entry_with_path(struct root_info *entry1,
 181                                 struct root_info *entry2,
 182                                 int is_descending)
 183 {
 184         int ret;
 185
 186         if (strcmp(entry1->full_path, entry2->full_path) > 0)
 187                 ret = 1;
 188         else if (strcmp(entry1->full_path, entry2->full_path) < 0)
 189                 ret = -1;
 190         else
 191                 ret = 0;
 192
 193         return is_descending ? -ret : ret;
 194 }
 195
 196 static btrfs_list_comp_func all_comp_funcs[] = {
 197         [BTRFS_LIST_COMP_ROOTID]        = comp_entry_with_rootid,
 198         [BTRFS_LIST_COMP_OGEN]          = comp_entry_with_ogen,
 199         [BTRFS_LIST_COMP_GEN]           = comp_entry_with_gen,
 200         [BTRFS_LIST_COMP_PATH]          = comp_entry_with_path,
 201 };
 202
 203 static char *all_sort_items[] = {
 204         [BTRFS_LIST_COMP_ROOTID]        = "rootid",
 205         [BTRFS_LIST_COMP_OGEN]          = "ogen",
 206         [BTRFS_LIST_COMP_GEN]           = "gen",
 207         [BTRFS_LIST_COMP_PATH]          = "path",
 208         [BTRFS_LIST_COMP_MAX]           = NULL,
 209 };
 210
 211 static int  btrfs_list_get_sort_item(char *sort_name)
 212 {
 213         int i;
 214
 215         for (i = 0; i < BTRFS_LIST_COMP_MAX; i++) {
 216                 if (strcmp(sort_name, all_sort_items[i]) == 0)
 217                         return i;
 218         }
 219         return -1;
 220 }
 221
 222 struct btrfs_list_comparer_set *btrfs_list_alloc_comparer_set(void)
 223 {
 224         struct btrfs_list_comparer_set *set;
 225         int size;
 226
 227         size = sizeof(struct btrfs_list_comparer_set) +
 228                BTRFS_LIST_NCOMPS_INCREASE * sizeof(struct btrfs_list_comparer);
 229         set = calloc(1, size);
 230         if (!set) {
 231                 fprintf(stderr, "memory allocation failed\n");
 232                 exit(1);
 233         }
 234
 235         set->total = BTRFS_LIST_NCOMPS_INCREASE;
 236
 237         return set;
 238 }
 239
 240 static int btrfs_list_setup_comparer(struct btrfs_list_comparer_set **comp_set,
 241                 enum btrfs_list_comp_enum comparer, int is_descending)
 242 {
 243         struct btrfs_list_comparer_set *set = *comp_set;
 244         int size;
 245
 246         ASSERT(set != NULL);
 247         ASSERT(comparer < BTRFS_LIST_COMP_MAX);
 248         ASSERT(set->ncomps <= set->total);
 249
 250         if (set->ncomps == set->total) {
 251                 void *tmp;
 252
 253                 size = set->total + BTRFS_LIST_NCOMPS_INCREASE;
 254                 size = sizeof(*set) + size * sizeof(struct btrfs_list_comparer);
 255                 tmp = set;
 256                 set = realloc(set, size);
 257                 if (!set) {
 258                         fprintf(stderr, "memory allocation failed\n");
 259                         free(tmp);
 260                         exit(1);
 261                 }
 262
 263                 memset(&set->comps[set->total], 0,
 264                        BTRFS_LIST_NCOMPS_INCREASE *
 265                        sizeof(struct btrfs_list_comparer));
 266                 set->total += BTRFS_LIST_NCOMPS_INCREASE;
 267                 *comp_set = set;
 268         }
 269
 270         ASSERT(set->comps[set->ncomps].comp_func == NULL);
 271
 272         set->comps[set->ncomps].comp_func = all_comp_funcs[comparer];
 273         set->comps[set->ncomps].is_descending = is_descending;
 274         set->ncomps++;
 275         return 0;
 276 }
 277
 278 static int sort_comp(struct root_info *entry1, struct root_info *entry2,
 279                      struct btrfs_list_comparer_set *set)
 280 {
 281         int rootid_compared = 0;
 282         int i, ret = 0;
 283
 284         if (!set || !set->ncomps)
 285                 goto comp_rootid;
 286
 287         for (i = 0; i < set->ncomps; i++) {
 288                 if (!set->comps[i].comp_func)
 289                         break;
 290
 291                 ret = set->comps[i].comp_func(entry1, entry2,
 292                                               set->comps[i].is_descending);
 293                 if (ret)
 294                         return ret;
 295
 296                 if (set->comps[i].comp_func == comp_entry_with_rootid)
 297                         rootid_compared = 1;
 298         }
 299
 300         if (!rootid_compared) {
 301 comp_rootid:
 302                 ret = comp_entry_with_rootid(entry1, entry2, 0);
 303         }
 304
 305         return ret;
 306 }
 307
 308 static int sort_tree_insert(struct root_lookup *sort_tree,
 309                             struct root_info *ins,
 310                             struct btrfs_list_comparer_set *comp_set)
 311 {
 312         struct rb_node **p = &sort_tree->root.rb_node;
 313         struct rb_node *parent = NULL;
 314         struct root_info *curr;
 315         int ret;
 316
 317         while (*p) {
 318                 parent = *p;
 319                 curr = rb_entry(parent, struct root_info, sort_node);
 320
 321                 ret = sort_comp(ins, curr, comp_set);
 322                 if (ret < 0)
 323                         p = &(*p)->rb_left;
 324                 else if (ret > 0)
 325                         p = &(*p)->rb_right;
 326                 else
 327                         return -EEXIST;
 328         }
 329
 330         rb_link_node(&ins->sort_node, parent, p);
 331         rb_insert_color(&ins->sort_node, &sort_tree->root);
 332         return 0;
 333 }
 334
 335 /*
 336  * insert a new root into the tree.  returns the existing root entry
 337  * if one is already there.  Both root_id and ref_tree are used
 338  * as the key
 339  */
 340 static int root_tree_insert(struct root_lookup *root_tree,
 341                             struct root_info *ins)
 342 {
 343         struct rb_node **p = &root_tree->root.rb_node;
 344         struct rb_node * parent = NULL;
 345         struct root_info *curr;
 346         int ret;
 347
 348         while(*p) {
 349                 parent = *p;
 350                 curr = rb_entry(parent, struct root_info, rb_node);
 351
 352                 ret = comp_entry_with_rootid(ins, curr, 0);
 353                 if (ret < 0)
 354                         p = &(*p)->rb_left;
 355                 else if (ret > 0)
 356                         p = &(*p)->rb_right;
 357                 else
 358                         return -EEXIST;
 359         }
 360
 361         rb_link_node(&ins->rb_node, parent, p);
 362         rb_insert_color(&ins->rb_node, &root_tree->root);
 363         return 0;
 364 }
 365
 366 /*
 367  * find a given root id in the tree.  We return the smallest one,
 368  * rb_next can be used to move forward looking for more if required
 369  */
 370 static struct root_info *root_tree_search(struct root_lookup *root_tree,
 371                                           u64 root_id)
 372 {
 373         struct rb_node *n = root_tree->root.rb_node;
 374         struct root_info *entry;
 375         struct root_info tmp;
 376         int ret;
 377
 378         tmp.root_id = root_id;
 379
 380         while(n) {
 381                 entry = rb_entry(n, struct root_info, rb_node);
 382
 383                 ret = comp_entry_with_rootid(&tmp, entry, 0);
 384                 if (ret < 0)
 385                         n = n->rb_left;
 386                 else if (ret > 0)
 387                         n = n->rb_right;
 388                 else
 389                         return entry;
 390         }
 391         return NULL;
 392 }
 393
 394 static int update_root(struct root_lookup *root_lookup,
 395                        u64 root_id, u64 ref_tree, u64 root_offset, u64 flags,
 396                        u64 dir_id, char *name, int name_len, u64 ogen, u64 gen,
 397                        time_t ot, void *uuid, void *puuid, void *ruuid)
 398 {
 399         struct root_info *ri;
 400
 401         ri = root_tree_search(root_lookup, root_id);
 402         if (!ri || ri->root_id != root_id)
 403                 return -ENOENT;
 404         if (name && name_len > 0) {
 405                 free(ri->name);
 406
 407                 ri->name = malloc(name_len + 1);
 408                 if (!ri->name) {
 409                         fprintf(stderr, "memory allocation failed\n");
 410                         exit(1);
 411                 }
 412                 strncpy(ri->name, name, name_len);
 413                 ri->name[name_len] = 0;
 414         }
 415         if (ref_tree)
 416                 ri->ref_tree = ref_tree;
 417         if (root_offset)
 418                 ri->root_offset = root_offset;
 419         if (flags)
 420                 ri->flags = flags;
 421         if (dir_id)
 422                 ri->dir_id = dir_id;
 423         if (gen)
 424                 ri->gen = gen;
 425         if (ogen)
 426                 ri->ogen = ogen;
 427         if (!ri->ogen && root_offset)
 428                 ri->ogen = root_offset;
 429         if (ot)
 430                 ri->otime = ot;
 431         if (uuid)
 432                 memcpy(&ri->uuid, uuid, BTRFS_UUID_SIZE);
 433         if (puuid)
 434                 memcpy(&ri->puuid, puuid, BTRFS_UUID_SIZE);
 435         if (ruuid)
 436                 memcpy(&ri->ruuid, ruuid, BTRFS_UUID_SIZE);
 437
 438         return 0;
 439 }
 440
 441 /*
 442  * add_root - update the existed root, or allocate a new root and insert it
 443  *            into the lookup tree.
 444  * root_id: object id of the root
 445  * ref_tree: object id of the referring root.
 446  * root_offset: offset value of the root'key
 447  * dir_id: inode id of the directory in ref_tree where this root can be found.
 448  * name: the name of root_id in that directory
 449  * name_len: the length of name
 450  * ogen: the original generation of the root
 451  * gen: the current generation of the root
 452  * ot: the original time(create time) of the root
 453  * uuid: uuid of the root
 454  * puuid: uuid of the root parent if any
 455  * ruuid: uuid of the received subvol, if any
 456  */
 457 static int add_root(struct root_lookup *root_lookup,
 458                     u64 root_id, u64 ref_tree, u64 root_offset, u64 flags,
 459                     u64 dir_id, char *name, int name_len, u64 ogen, u64 gen,
 460                     time_t ot, void *uuid, void *puuid, void *ruuid)
 461 {
 462         struct root_info *ri;
 463         int ret;
 464
 465         ret = update_root(root_lookup, root_id, ref_tree, root_offset, flags,
 466                           dir_id, name, name_len, ogen, gen, ot,
 467                           uuid, puuid, ruuid);
 468         if (!ret)
 469                 return 0;
 470
 471         ri = calloc(1, sizeof(*ri));
 472         if (!ri) {
 473                 printf("memory allocation failed\n");
 474                 exit(1);
 475         }
 476         ri->root_id = root_id;
 477
 478         if (name && name_len > 0) {
 479                 ri->name = malloc(name_len + 1);
 480                 if (!ri->name) {
 481                         fprintf(stderr, "memory allocation failed\n");
 482                         exit(1);
 483                 }
 484                 strncpy(ri->name, name, name_len);
 485                 ri->name[name_len] = 0;
 486         }
 487         if (ref_tree)
 488                 ri->ref_tree = ref_tree;
 489         if (dir_id)
 490                 ri->dir_id = dir_id;
 491         if (root_offset)
 492                 ri->root_offset = root_offset;
 493         if (flags)
 494                 ri->flags = flags;
 495         if (gen)
 496                 ri->gen = gen;
 497         if (ogen)
 498                 ri->ogen = ogen;
 499         if (!ri->ogen && root_offset)
 500                 ri->ogen = root_offset;
 501         if (ot)
 502                 ri->otime = ot;
 503
 504         if (uuid)
 505                 memcpy(&ri->uuid, uuid, BTRFS_UUID_SIZE);
 506
 507         if (puuid)
 508                 memcpy(&ri->puuid, puuid, BTRFS_UUID_SIZE);
 509
 510         if (ruuid)
 511                 memcpy(&ri->ruuid, ruuid, BTRFS_UUID_SIZE);
 512
 513         ret = root_tree_insert(root_lookup, ri);
 514         if (ret) {
 515                 error("failed to insert tree %llu",
 516                                 (unsigned long long)root_id);
 517                 exit(1);
 518         }
 519         return 0;
 520 }
 521
 522 static void free_root_info(struct rb_node *node)
 523 {
 524         struct root_info *ri;
 525
 526         ri = rb_entry(node, struct root_info, rb_node);
 527         free(ri->name);
 528         free(ri->path);
 529         free(ri->full_path);
 530         free(ri);
 531 }
 532
 533 /*
 534  * for a given root_info, search through the root_lookup tree to construct
 535  * the full path name to it.
 536  *
 537  * This can't be called until all the root_info->path fields are filled
 538  * in by lookup_ino_path
 539  */
 540 static int resolve_root(struct root_lookup *rl, struct root_info *ri,
 541                        u64 top_id)
 542 {
 543         char *full_path = NULL;
 544         int len = 0;
 545         struct root_info *found;
 546
 547         /*
 548          * we go backwards from the root_info object and add pathnames
 549          * from parent directories as we go.
 550          */
 551         found = ri;
 552         while (1) {
 553                 char *tmp;
 554                 u64 next;
 555                 int add_len;
 556
 557                 /*
 558                  * ref_tree = 0 indicates the subvolume
 559                  * has been deleted.
 560                  */
 561                 if (!found->ref_tree) {
 562                         free(full_path);
 563                         return -ENOENT;
 564                 }
 565
 566                 add_len = strlen(found->path);
 567
 568                 if (full_path) {
 569                         /* room for / and for null */
 570                         tmp = malloc(add_len + 2 + len);
 571                         if (!tmp) {
 572                                 perror("malloc failed");
 573                                 exit(1);
 574                         }
 575                         memcpy(tmp + add_len + 1, full_path, len);
 576                         tmp[add_len] = '/';
 577                         memcpy(tmp, found->path, add_len);
 578                         tmp [add_len + len + 1] = '\0';
 579                         free(full_path);
 580                         full_path = tmp;
 581                         len += add_len + 1;
 582                 } else {
 583                         full_path = strdup(found->path);
 584                         len = add_len;
 585                 }
 586                 if (!ri->top_id)
 587                         ri->top_id = found->ref_tree;
 588
 589                 next = found->ref_tree;
 590                 if (next == top_id)
 591                         break;
 592                 /*
 593                 * if the ref_tree = BTRFS_FS_TREE_OBJECTID,
 594                 * we are at the top
 595                 */
 596                 if (next == BTRFS_FS_TREE_OBJECTID)
 597                         break;
 598                 /*
 599                 * if the ref_tree wasn't in our tree of roots, the
 600                 * subvolume was deleted.
 601                 */
 602                 found = root_tree_search(rl, next);
 603                 if (!found) {
 604                         free(full_path);
 605                         return -ENOENT;
 606                 }
 607         }
 608
 609         ri->full_path = full_path;
 610
 611         return 0;
 612 }
 613
 614 /*
 615  * for a single root_info, ask the kernel to give us a path name
 616  * inside it's ref_root for the dir_id where it lives.
 617  *
 618  * This fills in root_info->path with the path to the directory and and
 619  * appends this root's name.
 620  */
 621 static int lookup_ino_path(int fd, struct root_info *ri)
 622 {
 623         struct btrfs_ioctl_ino_lookup_args args;
 624         int ret;
 625
 626         if (ri->path)
 627                 return 0;
 628
 629         if (!ri->ref_tree)
 630                 return -ENOENT;
 631
 632         memset(&args, 0, sizeof(args));
 633         args.treeid = ri->ref_tree;
 634         args.objectid = ri->dir_id;
 635
 636         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
 637         if (ret < 0) {
 638                 if (errno == ENOENT) {
 639                         ri->ref_tree = 0;
 640                         return -ENOENT;
 641                 }
 642                 error("failed to lookup path for root %llu: %s",
 643                         (unsigned long long)ri->ref_tree, strerror(errno));
 644                 return ret;
 645         }
 646
 647         if (args.name[0]) {
 648                 /*
 649                  * we're in a subdirectory of ref_tree, the kernel ioctl
 650                  * puts a / in there for us
 651                  */
 652                 ri->path = malloc(strlen(ri->name) + strlen(args.name) + 1);
 653                 if (!ri->path) {
 654                         perror("malloc failed");
 655                         exit(1);
 656                 }
 657                 strcpy(ri->path, args.name);
 658                 strcat(ri->path, ri->name);
 659         } else {
 660                 /* we're at the root of ref_tree */
 661                 ri->path = strdup(ri->name);
 662                 if (!ri->path) {
 663                         perror("strdup failed");
 664                         exit(1);
 665                 }
 666         }
 667         return 0;
 668 }
 669
 670 /* finding the generation for a given path is a two step process.
 671  * First we use the inode lookup routine to find out the root id
 672  *
 673  * Then we use the tree search ioctl to scan all the root items for a
 674  * given root id and spit out the latest generation we can find
 675  */
 676 static u64 find_root_gen(int fd)
 677 {
 678         struct btrfs_ioctl_ino_lookup_args ino_args;
 679         int ret;
 680         struct btrfs_ioctl_search_args args;
 681         struct btrfs_ioctl_search_key *sk = &args.key;
 682         struct btrfs_ioctl_search_header sh;
 683         unsigned long off = 0;
 684         u64 max_found = 0;
 685         int i;
 686
 687         memset(&ino_args, 0, sizeof(ino_args));
 688         ino_args.objectid = BTRFS_FIRST_FREE_OBJECTID;
 689
 690         /* this ioctl fills in ino_args->treeid */
 691         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &ino_args);
 692         if (ret < 0) {
 693                 error("failed to lookup path for dirid %llu: %s",
 694                         (unsigned long long)BTRFS_FIRST_FREE_OBJECTID,
 695                         strerror(errno));
 696                 return 0;
 697         }
 698
 699         memset(&args, 0, sizeof(args));
 700
 701         sk->tree_id = BTRFS_ROOT_TREE_OBJECTID;
 702
 703         /*
 704          * there may be more than one ROOT_ITEM key if there are
 705          * snapshots pending deletion, we have to loop through
 706          * them.
 707          */
 708         sk->min_objectid = ino_args.treeid;
 709         sk->max_objectid = ino_args.treeid;
 710         sk->max_type = BTRFS_ROOT_ITEM_KEY;
 711         sk->min_type = BTRFS_ROOT_ITEM_KEY;
 712         sk->max_offset = (u64)-1;
 713         sk->max_transid = (u64)-1;
 714         sk->nr_items = 4096;
 715
 716         while (1) {
 717                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
 718                 if (ret < 0) {
 719                         error("can't perform the search: %s", strerror(errno));
 720                         return 0;
 721                 }
 722                 /* the ioctl returns the number of item it found in nr_items */
 723                 if (sk->nr_items == 0)
 724                         break;
 725
 726                 off = 0;
 727                 for (i = 0; i < sk->nr_items; i++) {
 728                         struct btrfs_root_item *item;
 729
 730                         memcpy(&sh, args.buf + off, sizeof(sh));
 731                         off += sizeof(sh);
 732                         item = (struct btrfs_root_item *)(args.buf + off);
 733                         off += sh.len;
 734
 735                         sk->min_objectid = sh.objectid;
 736                         sk->min_type = sh.type;
 737                         sk->min_offset = sh.offset;
 738
 739                         if (sh.objectid > ino_args.treeid)
 740                                 break;
 741
 742                         if (sh.objectid == ino_args.treeid &&
 743                             sh.type == BTRFS_ROOT_ITEM_KEY) {
 744                                 max_found = max(max_found,
 745                                                 btrfs_root_generation(item));
 746                         }
 747                 }
 748                 if (sk->min_offset < (u64)-1)
 749                         sk->min_offset++;
 750                 else
 751                         break;
 752
 753                 if (sk->min_type != BTRFS_ROOT_ITEM_KEY)
 754                         break;
 755                 if (sk->min_objectid != ino_args.treeid)
 756                         break;
 757         }
 758         return max_found;
 759 }
 760
 761 /* pass in a directory id and this will return
 762  * the full path of the parent directory inside its
 763  * subvolume root.
 764  *
 765  * It may return NULL if it is in the root, or an ERR_PTR if things
 766  * go badly.
 767  */
 768 static char *__ino_resolve(int fd, u64 dirid)
 769 {
 770         struct btrfs_ioctl_ino_lookup_args args;
 771         int ret;
 772         char *full;
 773
 774         memset(&args, 0, sizeof(args));
 775         args.objectid = dirid;
 776
 777         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
 778         if (ret < 0) {
 779                 error("failed to lookup path for dirid %llu: %s",
 780                         (unsigned long long)dirid, strerror(errno));
 781                 return ERR_PTR(ret);
 782         }
 783
 784         if (args.name[0]) {
 785                 /*
 786                  * we're in a subdirectory of ref_tree, the kernel ioctl
 787                  * puts a / in there for us
 788                  */
 789                 full = strdup(args.name);
 790                 if (!full) {
 791                         perror("malloc failed");
 792                         return ERR_PTR(-ENOMEM);
 793                 }
 794         } else {
 795                 /* we're at the root of ref_tree */
 796                 full = NULL;
 797         }
 798         return full;
 799 }
 800
 801 /*
 802  * simple string builder, returning a new string with both
 803  * dirid and name
 804  */
 805 static char *build_name(const char *dirid, const char *name)
 806 {
 807         char *full;
 808
 809         if (!dirid)
 810                 return strdup(name);
 811
 812         full = malloc(strlen(dirid) + strlen(name) + 1);
 813         if (!full)
 814                 return NULL;
 815         strcpy(full, dirid);
 816         strcat(full, name);
 817         return full;
 818 }
 819
 820 /*
 821  * given an inode number, this returns the full path name inside the subvolume
 822  * to that file/directory.  cache_dirid and cache_name are used to
 823  * cache the results so we can avoid tree searches if a later call goes
 824  * to the same directory or file name
 825  */
 826 static char *ino_resolve(int fd, u64 ino, u64 *cache_dirid, char **cache_name)
 827
 828 {
 829         u64 dirid;
 830         char *dirname;
 831         char *name;
 832         char *full;
 833         int ret;
 834         struct btrfs_ioctl_search_args args;
 835         struct btrfs_ioctl_search_key *sk = &args.key;
 836         struct btrfs_ioctl_search_header *sh;
 837         unsigned long off = 0;
 838         int namelen;
 839
 840         memset(&args, 0, sizeof(args));
 841
 842         sk->tree_id = 0;
 843
 844         /*
 845          * step one, we search for the inode back ref.  We just use the first
 846          * one
 847          */
 848         sk->min_objectid = ino;
 849         sk->max_objectid = ino;
 850         sk->max_type = BTRFS_INODE_REF_KEY;
 851         sk->max_offset = (u64)-1;
 852         sk->min_type = BTRFS_INODE_REF_KEY;
 853         sk->max_transid = (u64)-1;
 854         sk->nr_items = 1;
 855
 856         ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
 857         if (ret < 0) {
 858                 error("can't perform the search: %s", strerror(errno));
 859                 return NULL;
 860         }
 861         /* the ioctl returns the number of item it found in nr_items */
 862         if (sk->nr_items == 0)
 863                 return NULL;
 864
 865         off = 0;
 866         sh = (struct btrfs_ioctl_search_header *)(args.buf + off);
 867
 868         if (btrfs_search_header_type(sh) == BTRFS_INODE_REF_KEY) {
 869                 struct btrfs_inode_ref *ref;
 870                 dirid = btrfs_search_header_offset(sh);
 871
 872                 ref = (struct btrfs_inode_ref *)(sh + 1);
 873                 namelen = btrfs_stack_inode_ref_name_len(ref);
 874
 875                 name = (char *)(ref + 1);
 876                 name = strndup(name, namelen);
 877
 878                 /* use our cached value */
 879                 if (dirid == *cache_dirid && *cache_name) {
 880                         dirname = *cache_name;
 881                         goto build;
 882                 }
 883         } else {
 884                 return NULL;
 885         }
 886         /*
 887          * the inode backref gives us the file name and the parent directory id.
 888          * From here we use __ino_resolve to get the path to the parent
 889          */
 890         dirname = __ino_resolve(fd, dirid);
 891 build:
 892         full = build_name(dirname, name);
 893         if (*cache_name && dirname != *cache_name)
 894                 free(*cache_name);
 895
 896         *cache_name = dirname;
 897         *cache_dirid = dirid;
 898         free(name);
 899
 900         return full;
 901 }
 902
 903 int btrfs_list_get_default_subvolume(int fd, u64 *default_id)
 904 {
 905         struct btrfs_ioctl_search_args args;
 906         struct btrfs_ioctl_search_key *sk = &args.key;
 907         struct btrfs_ioctl_search_header *sh;
 908         u64 found = 0;
 909         int ret;
 910
 911         memset(&args, 0, sizeof(args));
 912
 913         /*
 914          * search for a dir item with a name 'default' in the tree of
 915          * tree roots, it should point us to a default root
 916          */
 917         sk->tree_id = BTRFS_ROOT_TREE_OBJECTID;
 918
 919         /* don't worry about ancient format and request only one item */
 920         sk->nr_items = 1;
 921
 922         sk->max_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
 923         sk->min_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
 924         sk->max_type = BTRFS_DIR_ITEM_KEY;
 925         sk->min_type = BTRFS_DIR_ITEM_KEY;
 926         sk->max_offset = (u64)-1;
 927         sk->max_transid = (u64)-1;
 928
 929         ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
 930         if (ret < 0)
 931                 return ret;
 932
 933         /* the ioctl returns the number of items it found in nr_items */
 934         if (sk->nr_items == 0)
 935                 goto out;
 936
 937         sh = (struct btrfs_ioctl_search_header *)args.buf;
 938
 939         if (btrfs_search_header_type(sh) == BTRFS_DIR_ITEM_KEY) {
 940                 struct btrfs_dir_item *di;
 941                 int name_len;
 942                 char *name;
 943
 944                 di = (struct btrfs_dir_item *)(sh + 1);
 945                 name_len = btrfs_stack_dir_name_len(di);
 946                 name = (char *)(di + 1);
 947
 948                 if (!strncmp("default", name, name_len))
 949                         found = btrfs_disk_key_objectid(&di->location);
 950         }
 951
 952 out:
 953         *default_id = found;
 954         return 0;
 955 }
 956
 957 static int list_subvol_search(int fd, struct root_lookup *root_lookup)
 958 {
 959         int ret;
 960         struct btrfs_ioctl_search_args args;
 961         struct btrfs_ioctl_search_key *sk = &args.key;
 962         struct btrfs_ioctl_search_header sh;
 963         struct btrfs_root_ref *ref;
 964         struct btrfs_root_item *ri;
 965         unsigned long off = 0;
 966         int name_len;
 967         char *name;
 968         u64 dir_id;
 969         u64 gen = 0;
 970         u64 ogen;
 971         u64 flags;
 972         int i;
 973         time_t t;
 974         u8 uuid[BTRFS_UUID_SIZE];
 975         u8 puuid[BTRFS_UUID_SIZE];
 976         u8 ruuid[BTRFS_UUID_SIZE];
 977
 978         root_lookup_init(root_lookup);
 979         memset(&args, 0, sizeof(args));
 980
 981         sk->tree_id = BTRFS_ROOT_TREE_OBJECTID;
 982
 983         /*
 984          * set the min and max to backref keys.  The search will
 985          * only send back this type of key now.
 986          */
 987         sk->max_type = BTRFS_ROOT_BACKREF_KEY;
 988         sk->min_type = BTRFS_ROOT_ITEM_KEY;
 989
 990         sk->min_objectid = BTRFS_FIRST_FREE_OBJECTID;
 991
 992         /*
 993          * set all the other params to the max, we'll take any objectid
 994          * and any trans
 995          */
 996         sk->max_objectid = BTRFS_LAST_FREE_OBJECTID;
 997         sk->max_offset = (u64)-1;
 998         sk->max_transid = (u64)-1;
 999
1000         /* just a big number, doesn't matter much */
1001         sk->nr_items = 4096;
1002
1003         while(1) {
1004                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1005                 if (ret < 0)
1006                         return ret;
1007                 /* the ioctl returns the number of item it found in nr_items */
1008                 if (sk->nr_items == 0)
1009                         break;
1010
1011                 off = 0;
1012
1013                 /*
1014                  * for each item, pull the key out of the header and then
1015                  * read the root_ref item it contains
1016                  */
1017                 for (i = 0; i < sk->nr_items; i++) {
1018                         memcpy(&sh, args.buf + off, sizeof(sh));
1019                         off += sizeof(sh);
1020                         if (sh.type == BTRFS_ROOT_BACKREF_KEY) {
1021                                 ref = (struct btrfs_root_ref *)(args.buf + off);
1022                                 name_len = btrfs_stack_root_ref_name_len(ref);
1023                                 name = (char *)(ref + 1);
1024                                 dir_id = btrfs_stack_root_ref_dirid(ref);
1025
1026                                 add_root(root_lookup, sh.objectid, sh.offset,
1027                                          0, 0, dir_id, name, name_len, 0, 0, 0,
1028                                          NULL, NULL, NULL);
1029                         } else if (sh.type == BTRFS_ROOT_ITEM_KEY) {
1030                                 ri = (struct btrfs_root_item *)(args.buf + off);
1031                                 gen = btrfs_root_generation(ri);
1032                                 flags = btrfs_root_flags(ri);
1033                                 if(sh.len >
1034                                    sizeof(struct btrfs_root_item_v0)) {
1035                                         t = btrfs_stack_timespec_sec(&ri->otime);
1036                                         ogen = btrfs_root_otransid(ri);
1037                                         memcpy(uuid, ri->uuid, BTRFS_UUID_SIZE);
1038                                         memcpy(puuid, ri->parent_uuid, BTRFS_UUID_SIZE);
1039                                         memcpy(ruuid, ri->received_uuid, BTRFS_UUID_SIZE);
1040                                 } else {
1041                                         t = 0;
1042                                         ogen = 0;
1043                                         memset(uuid, 0, BTRFS_UUID_SIZE);
1044                                         memset(puuid, 0, BTRFS_UUID_SIZE);
1045                                         memset(ruuid, 0, BTRFS_UUID_SIZE);
1046                                 }
1047
1048                                 add_root(root_lookup, sh.objectid, 0,
1049                                          sh.offset, flags, 0, NULL, 0, ogen,
1050                                          gen, t, uuid, puuid, ruuid);
1051                         }
1052
1053                         off += sh.len;
1054
1055                         /*
1056                          * record the mins in sk so we can make sure the
1057                          * next search doesn't repeat this root
1058                          */
1059                         sk->min_objectid = sh.objectid;
1060                         sk->min_type = sh.type;
1061                         sk->min_offset = sh.offset;
1062                 }
1063                 sk->nr_items = 4096;
1064                 sk->min_offset++;
1065                 if (!sk->min_offset)    /* overflow */
1066                         sk->min_type++;
1067                 else
1068                         continue;
1069
1070                 if (sk->min_type > BTRFS_ROOT_BACKREF_KEY) {
1071                         sk->min_type = BTRFS_ROOT_ITEM_KEY;
1072                         sk->min_objectid++;
1073                 } else
1074                         continue;
1075
1076                 if (sk->min_objectid > sk->max_objectid)
1077                         break;
1078         }
1079
1080         return 0;
1081 }
1082
1083 static int filter_by_rootid(struct root_info *ri, u64 data)
1084 {
1085         return ri->root_id == data;
1086 }
1087
1088 static int filter_snapshot(struct root_info *ri, u64 data)
1089 {
1090         return !!ri->root_offset;
1091 }
1092
1093 static int filter_flags(struct root_info *ri, u64 flags)
1094 {
1095         return ri->flags & flags;
1096 }
1097
1098 static int filter_gen_more(struct root_info *ri, u64 data)
1099 {
1100         return ri->gen >= data;
1101 }
1102
1103 static int filter_gen_less(struct root_info *ri, u64 data)
1104 {
1105         return ri->gen <= data;
1106 }
1107
1108 static int filter_gen_equal(struct root_info  *ri, u64 data)
1109 {
1110         return ri->gen == data;
1111 }
1112
1113 static int filter_cgen_more(struct root_info *ri, u64 data)
1114 {
1115         return ri->ogen >= data;
1116 }
1117
1118 static int filter_cgen_less(struct root_info *ri, u64 data)
1119 {
1120         return ri->ogen <= data;
1121 }
1122
1123 static int filter_cgen_equal(struct root_info *ri, u64 data)
1124 {
1125         return ri->ogen == data;
1126 }
1127
1128 static int filter_topid_equal(struct root_info *ri, u64 data)
1129 {
1130         return ri->top_id == data;
1131 }
1132
1133 static int filter_full_path(struct root_info *ri, u64 data)
1134 {
1135         if (ri->full_path && ri->top_id != data) {
1136                 char *tmp;
1137                 char p[] = "<FS_TREE>";
1138                 int add_len = strlen(p);
1139                 int len = strlen(ri->full_path);
1140
1141                 tmp = malloc(len + add_len + 2);
1142                 if (!tmp) {
1143                         fprintf(stderr, "memory allocation failed\n");
1144                         exit(1);
1145                 }
1146                 memcpy(tmp + add_len + 1, ri->full_path, len);
1147                 tmp[len + add_len + 1] = '\0';
1148                 tmp[add_len] = '/';
1149                 memcpy(tmp, p, add_len);
1150                 free(ri->full_path);
1151                 ri->full_path = tmp;
1152         }
1153         return 1;
1154 }
1155
1156 static int filter_by_parent(struct root_info *ri, u64 data)
1157 {
1158         return !uuid_compare(ri->puuid, (u8 *)(unsigned long)data);
1159 }
1160
1161 static int filter_deleted(struct root_info *ri, u64 data)
1162 {
1163         return ri->deleted;
1164 }
1165
1166 static btrfs_list_filter_func all_filter_funcs[] = {
1167         [BTRFS_LIST_FILTER_ROOTID]              = filter_by_rootid,
1168         [BTRFS_LIST_FILTER_SNAPSHOT_ONLY]       = filter_snapshot,
1169         [BTRFS_LIST_FILTER_FLAGS]               = filter_flags,
1170         [BTRFS_LIST_FILTER_GEN_MORE]            = filter_gen_more,
1171         [BTRFS_LIST_FILTER_GEN_LESS]            = filter_gen_less,
1172         [BTRFS_LIST_FILTER_GEN_EQUAL]           = filter_gen_equal,
1173         [BTRFS_LIST_FILTER_CGEN_MORE]           = filter_cgen_more,
1174         [BTRFS_LIST_FILTER_CGEN_LESS]           = filter_cgen_less,
1175         [BTRFS_LIST_FILTER_CGEN_EQUAL]          = filter_cgen_equal,
1176         [BTRFS_LIST_FILTER_TOPID_EQUAL]         = filter_topid_equal,
1177         [BTRFS_LIST_FILTER_FULL_PATH]           = filter_full_path,
1178         [BTRFS_LIST_FILTER_BY_PARENT]           = filter_by_parent,
1179         [BTRFS_LIST_FILTER_DELETED]             = filter_deleted,
1180 };
1181
1182 struct btrfs_list_filter_set *btrfs_list_alloc_filter_set(void)
1183 {
1184         struct btrfs_list_filter_set *set;
1185         int size;
1186
1187         size = sizeof(struct btrfs_list_filter_set) +
1188                BTRFS_LIST_NFILTERS_INCREASE * sizeof(struct btrfs_list_filter);
1189         set = calloc(1, size);
1190         if (!set) {
1191                 fprintf(stderr, "memory allocation failed\n");
1192                 exit(1);
1193         }
1194
1195         set->total = BTRFS_LIST_NFILTERS_INCREASE;
1196
1197         return set;
1198 }
1199
1200 /*
1201  * Setup list filters. Exit if there's not enough memory, as we can't continue
1202  * without the structures set up properly.
1203  */
1204 void btrfs_list_setup_filter(struct btrfs_list_filter_set **filter_set,
1205                             enum btrfs_list_filter_enum filter, u64 data)
1206 {
1207         struct btrfs_list_filter_set *set = *filter_set;
1208         int size;
1209
1210         ASSERT(set != NULL);
1211         ASSERT(filter < BTRFS_LIST_FILTER_MAX);
1212         ASSERT(set->nfilters <= set->total);
1213
1214         if (set->nfilters == set->total) {
1215                 void *tmp;
1216
1217                 size = set->total + BTRFS_LIST_NFILTERS_INCREASE;
1218                 size = sizeof(*set) + size * sizeof(struct btrfs_list_filter);
1219                 tmp = set;
1220                 set = realloc(set, size);
1221                 if (!set) {
1222                         fprintf(stderr, "memory allocation failed\n");
1223                         free(tmp);
1224                         exit(1);
1225                 }
1226
1227                 memset(&set->filters[set->total], 0,
1228                        BTRFS_LIST_NFILTERS_INCREASE *
1229                        sizeof(struct btrfs_list_filter));
1230                 set->total += BTRFS_LIST_NFILTERS_INCREASE;
1231                 *filter_set = set;
1232         }
1233
1234         ASSERT(set->filters[set->nfilters].filter_func == NULL);
1235
1236         if (filter == BTRFS_LIST_FILTER_DELETED)
1237                 set->only_deleted = 1;
1238
1239         set->filters[set->nfilters].filter_func = all_filter_funcs[filter];
1240         set->filters[set->nfilters].data = data;
1241         set->nfilters++;
1242 }
1243
1244 static int filter_root(struct root_info *ri,
1245                        struct btrfs_list_filter_set *set)
1246 {
1247         int i, ret;
1248
1249         if (!set)
1250                 return 1;
1251
1252         if (set->only_deleted && !ri->deleted)
1253                 return 0;
1254
1255         if (!set->only_deleted && ri->deleted)
1256                 return 0;
1257
1258         for (i = 0; i < set->nfilters; i++) {
1259                 if (!set->filters[i].filter_func)
1260                         break;
1261                 ret = set->filters[i].filter_func(ri, set->filters[i].data);
1262                 if (!ret)
1263                         return 0;
1264         }
1265         return 1;
1266 }
1267
1268 static void filter_and_sort_subvol(struct root_lookup *all_subvols,
1269                                     struct root_lookup *sort_tree,
1270                                     struct btrfs_list_filter_set *filter_set,
1271                                     struct btrfs_list_comparer_set *comp_set,
1272                                     u64 top_id)
1273 {
1274         struct rb_node *n;
1275         struct root_info *entry;
1276         int ret;
1277
1278         root_lookup_init(sort_tree);
1279
1280         n = rb_last(&all_subvols->root);
1281         while (n) {
1282                 entry = rb_entry(n, struct root_info, rb_node);
1283
1284                 ret = resolve_root(all_subvols, entry, top_id);
1285                 if (ret == -ENOENT) {
1286                         entry->full_path = strdup("DELETED");
1287                         entry->deleted = 1;
1288                 }
1289                 ret = filter_root(entry, filter_set);
1290                 if (ret)
1291                         sort_tree_insert(sort_tree, entry, comp_set);
1292                 n = rb_prev(n);
1293         }
1294 }
1295
1296 static int list_subvol_fill_paths(int fd, struct root_lookup *root_lookup)
1297 {
1298         struct rb_node *n;
1299
1300         n = rb_first(&root_lookup->root);
1301         while (n) {
1302                 struct root_info *entry;
1303                 int ret;
1304                 entry = rb_entry(n, struct root_info, rb_node);
1305                 ret = lookup_ino_path(fd, entry);
1306                 if (ret && ret != -ENOENT)
1307                         return ret;
1308                 n = rb_next(n);
1309         }
1310
1311         return 0;
1312 }
1313
1314 static void print_subvolume_column(struct root_info *subv,
1315                                    enum btrfs_list_column_enum column)
1316 {
1317         char tstr[256];
1318         char uuidparse[BTRFS_UUID_UNPARSED_SIZE];
1319
1320         ASSERT(0 <= column && column < BTRFS_LIST_ALL);
1321
1322         switch (column) {
1323         case BTRFS_LIST_OBJECTID:
1324                 printf("%llu", subv->root_id);
1325                 break;
1326         case BTRFS_LIST_GENERATION:
1327                 printf("%llu", subv->gen);
1328                 break;
1329         case BTRFS_LIST_OGENERATION:
1330                 printf("%llu", subv->ogen);
1331                 break;
1332         case BTRFS_LIST_PARENT:
1333                 printf("%llu", subv->ref_tree);
1334                 break;
1335         case BTRFS_LIST_TOP_LEVEL:
1336                 printf("%llu", subv->top_id);
1337                 break;
1338         case BTRFS_LIST_OTIME:
1339                 if (subv->otime) {
1340                         struct tm tm;
1341
1342                         localtime_r(&subv->otime, &tm);
1343                         strftime(tstr, 256, "%Y-%m-%d %X", &tm);
1344                 } else
1345                         strcpy(tstr, "-");
1346                 printf("%s", tstr);
1347                 break;
1348         case BTRFS_LIST_UUID:
1349                 if (uuid_is_null(subv->uuid))
1350                         strcpy(uuidparse, "-");
1351                 else
1352                         uuid_unparse(subv->uuid, uuidparse);
1353                 printf("%s", uuidparse);
1354                 break;
1355         case BTRFS_LIST_PUUID:
1356                 if (uuid_is_null(subv->puuid))
1357                         strcpy(uuidparse, "-");
1358                 else
1359                         uuid_unparse(subv->puuid, uuidparse);
1360                 printf("%s", uuidparse);
1361                 break;
1362         case BTRFS_LIST_RUUID:
1363                 if (uuid_is_null(subv->ruuid))
1364                         strcpy(uuidparse, "-");
1365                 else
1366                         uuid_unparse(subv->ruuid, uuidparse);
1367                 printf("%s", uuidparse);
1368                 break;
1369         case BTRFS_LIST_PATH:
1370                 BUG_ON(!subv->full_path);
1371                 printf("%s", subv->full_path);
1372                 break;
1373         default:
1374                 break;
1375         }
1376 }
1377
1378 static void print_one_subvol_info_raw(struct root_info *subv,
1379                 const char *raw_prefix)
1380 {
1381         int i;
1382
1383         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1384                 if (!btrfs_list_columns[i].need_print)
1385                         continue;
1386
1387                 if (raw_prefix)
1388                         printf("%s",raw_prefix);
1389
1390                 print_subvolume_column(subv, i);
1391         }
1392         printf("\n");
1393 }
1394
1395 static void print_one_subvol_info_table(struct root_info *subv)
1396 {
1397         int i;
1398
1399         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1400                 if (!btrfs_list_columns[i].need_print)
1401                         continue;
1402
1403                 print_subvolume_column(subv, i);
1404
1405                 if (i != BTRFS_LIST_PATH)
1406                         printf("\t");
1407
1408                 if (i == BTRFS_LIST_TOP_LEVEL)
1409                         printf("\t");
1410         }
1411         printf("\n");
1412 }
1413
1414 static void print_one_subvol_info_default(struct root_info *subv)
1415 {
1416         int i;
1417
1418         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1419                 if (!btrfs_list_columns[i].need_print)
1420                         continue;
1421
1422                 printf("%s ", btrfs_list_columns[i].name);
1423                 print_subvolume_column(subv, i);
1424
1425                 if (i != BTRFS_LIST_PATH)
1426                         printf(" ");
1427         }
1428         printf("\n");
1429 }
1430
1431 static void print_all_subvol_info_tab_head(void)
1432 {
1433         int i;
1434         int len;
1435         char barrier[20];
1436
1437         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1438                 if (btrfs_list_columns[i].need_print)
1439                         printf("%s\t", btrfs_list_columns[i].name);
1440
1441                 if (i == BTRFS_LIST_ALL-1)
1442                         printf("\n");
1443         }
1444
1445         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1446                 memset(barrier, 0, sizeof(barrier));
1447
1448                 if (btrfs_list_columns[i].need_print) {
1449                         len = strlen(btrfs_list_columns[i].name);
1450                         while (len--)
1451                                 strcat(barrier, "-");
1452
1453                         printf("%s\t", barrier);
1454                 }
1455                 if (i == BTRFS_LIST_ALL-1)
1456                         printf("\n");
1457         }
1458 }
1459
1460 static void print_all_subvol_info(struct root_lookup *sorted_tree,
1461                   enum btrfs_list_layout layout, const char *raw_prefix)
1462 {
1463         struct rb_node *n;
1464         struct root_info *entry;
1465
1466         if (layout == BTRFS_LIST_LAYOUT_TABLE)
1467                 print_all_subvol_info_tab_head();
1468
1469         n = rb_first(&sorted_tree->root);
1470         while (n) {
1471                 entry = rb_entry(n, struct root_info, sort_node);
1472                 switch (layout) {
1473                 case BTRFS_LIST_LAYOUT_DEFAULT:
1474                         print_one_subvol_info_default(entry);
1475                         break;
1476                 case BTRFS_LIST_LAYOUT_TABLE:
1477                         print_one_subvol_info_table(entry);
1478                         break;
1479                 case BTRFS_LIST_LAYOUT_RAW:
1480                         print_one_subvol_info_raw(entry, raw_prefix);
1481                         break;
1482                 }
1483                 n = rb_next(n);
1484         }
1485 }
1486
1487 static int btrfs_list_subvols(int fd, struct root_lookup *root_lookup)
1488 {
1489         int ret;
1490
1491         ret = list_subvol_search(fd, root_lookup);
1492         if (ret) {
1493                 error("can't perform the search: %s", strerror(errno));
1494                 return ret;
1495         }
1496
1497         /*
1498          * now we have an rbtree full of root_info objects, but we need to fill
1499          * in their path names within the subvol that is referencing each one.
1500          */
1501         ret = list_subvol_fill_paths(fd, root_lookup);
1502         return ret;
1503 }
1504
1505 int btrfs_list_subvols_print(int fd, struct btrfs_list_filter_set *filter_set,
1506                        struct btrfs_list_comparer_set *comp_set,
1507                        enum btrfs_list_layout layout, int full_path,
1508                        const char *raw_prefix)
1509 {
1510         struct root_lookup root_lookup;
1511         struct root_lookup root_sort;
1512         int ret = 0;
1513         u64 top_id = 0;
1514
1515         if (full_path)
1516                 ret = btrfs_list_get_path_rootid(fd, &top_id);
1517         if (ret)
1518                 return ret;
1519
1520         ret = btrfs_list_subvols(fd, &root_lookup);
1521         if (ret)
1522                 return ret;
1523         filter_and_sort_subvol(&root_lookup, &root_sort, filter_set,
1524                                  comp_set, top_id);
1525
1526         print_all_subvol_info(&root_sort, layout, raw_prefix);
1527         rb_free_nodes(&root_lookup.root, free_root_info);
1528
1529         return 0;
1530 }
1531
1532 static char *strdup_or_null(const char *s)
1533 {
1534         if (!s)
1535                 return NULL;
1536         return strdup(s);
1537 }
1538
1539 int btrfs_get_subvol(int fd, struct root_info *the_ri)
1540 {
1541         int ret, rr;
1542         struct root_lookup rl;
1543         struct rb_node *rbn;
1544         struct root_info *ri;
1545         u64 root_id;
1546
1547         ret = btrfs_list_get_path_rootid(fd, &root_id);
1548         if (ret)
1549                 return ret;
1550
1551         ret = btrfs_list_subvols(fd, &rl);
1552         if (ret)
1553                 return ret;
1554
1555         rbn = rb_first(&rl.root);
1556         while(rbn) {
1557                 ri = rb_entry(rbn, struct root_info, rb_node);
1558                 rr = resolve_root(&rl, ri, root_id);
1559                 if (rr == -ENOENT) {
1560                         ret = -ENOENT;
1561                         rbn = rb_next(rbn);
1562                         continue;
1563                 }
1564                 if (!comp_entry_with_rootid(the_ri, ri, 0)) {
1565                         memcpy(the_ri, ri, offsetof(struct root_info, path));
1566                         the_ri->path = strdup_or_null(ri->path);
1567                         the_ri->name = strdup_or_null(ri->name);
1568                         the_ri->full_path = strdup_or_null(ri->full_path);
1569                         ret = 0;
1570                         break;
1571                 }
1572                 rbn = rb_next(rbn);
1573         }
1574         rb_free_nodes(&rl.root, free_root_info);
1575         return ret;
1576 }
1577
1578 static int print_one_extent(int fd, struct btrfs_ioctl_search_header *sh,
1579                             struct btrfs_file_extent_item *item,
1580                             u64 found_gen, u64 *cache_dirid,
1581                             char **cache_dir_name, u64 *cache_ino,
1582                             char **cache_full_name)
1583 {
1584         u64 len = 0;
1585         u64 disk_start = 0;
1586         u64 disk_offset = 0;
1587         u8 type;
1588         int compressed = 0;
1589         int flags = 0;
1590         char *name = NULL;
1591
1592         if (btrfs_search_header_objectid(sh) == *cache_ino) {
1593                 name = *cache_full_name;
1594         } else if (*cache_full_name) {
1595                 free(*cache_full_name);
1596                 *cache_full_name = NULL;
1597         }
1598         if (!name) {
1599                 name = ino_resolve(fd, btrfs_search_header_objectid(sh),
1600                                    cache_dirid,
1601                                    cache_dir_name);
1602                 *cache_full_name = name;
1603                 *cache_ino = btrfs_search_header_objectid(sh);
1604         }
1605         if (!name)
1606                 return -EIO;
1607
1608         type = btrfs_stack_file_extent_type(item);
1609         compressed = btrfs_stack_file_extent_compression(item);
1610
1611         if (type == BTRFS_FILE_EXTENT_REG ||
1612             type == BTRFS_FILE_EXTENT_PREALLOC) {
1613                 disk_start = btrfs_stack_file_extent_disk_bytenr(item);
1614                 disk_offset = btrfs_stack_file_extent_offset(item);
1615                 len = btrfs_stack_file_extent_num_bytes(item);
1616         } else if (type == BTRFS_FILE_EXTENT_INLINE) {
1617                 disk_start = 0;
1618                 disk_offset = 0;
1619                 len = btrfs_stack_file_extent_ram_bytes(item);
1620         } else {
1621                 error(
1622         "unhandled extent type %d for inode %llu file offset %llu gen %llu",
1623                         type,
1624                         (unsigned long long)btrfs_search_header_objectid(sh),
1625                         (unsigned long long)btrfs_search_header_offset(sh),
1626                         (unsigned long long)found_gen);
1627
1628                 return -EIO;
1629         }
1630         printf("inode %llu file offset %llu len %llu disk start %llu "
1631                "offset %llu gen %llu flags ",
1632                (unsigned long long)btrfs_search_header_objectid(sh),
1633                (unsigned long long)btrfs_search_header_offset(sh),
1634                (unsigned long long)len,
1635                (unsigned long long)disk_start,
1636                (unsigned long long)disk_offset,
1637                (unsigned long long)found_gen);
1638
1639         if (compressed) {
1640                 printf("COMPRESS");
1641                 flags++;
1642         }
1643         if (type == BTRFS_FILE_EXTENT_PREALLOC) {
1644                 printf("%sPREALLOC", flags ? "|" : "");
1645                 flags++;
1646         }
1647         if (type == BTRFS_FILE_EXTENT_INLINE) {
1648                 printf("%sINLINE", flags ? "|" : "");
1649                 flags++;
1650         }
1651         if (!flags)
1652                 printf("NONE");
1653
1654         printf(" %s\n", name);
1655         return 0;
1656 }
1657
1658 int btrfs_list_find_updated_files(int fd, u64 root_id, u64 oldest_gen)
1659 {
1660         int ret;
1661         struct btrfs_ioctl_search_args args;
1662         struct btrfs_ioctl_search_key *sk = &args.key;
1663         struct btrfs_ioctl_search_header sh;
1664         struct btrfs_file_extent_item *item;
1665         unsigned long off = 0;
1666         u64 found_gen;
1667         u64 max_found = 0;
1668         int i;
1669         u64 cache_dirid = 0;
1670         u64 cache_ino = 0;
1671         char *cache_dir_name = NULL;
1672         char *cache_full_name = NULL;
1673         struct btrfs_file_extent_item backup;
1674
1675         memset(&backup, 0, sizeof(backup));
1676         memset(&args, 0, sizeof(args));
1677
1678         sk->tree_id = root_id;
1679
1680         /*
1681          * set all the other params to the max, we'll take any objectid
1682          * and any trans
1683          */
1684         sk->max_objectid = (u64)-1;
1685         sk->max_offset = (u64)-1;
1686         sk->max_transid = (u64)-1;
1687         sk->max_type = BTRFS_EXTENT_DATA_KEY;
1688         sk->min_transid = oldest_gen;
1689         /* just a big number, doesn't matter much */
1690         sk->nr_items = 4096;
1691
1692         max_found = find_root_gen(fd);
1693         while(1) {
1694                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1695                 if (ret < 0) {
1696                         error("can't perform the search: %s", strerror(errno));
1697                         break;
1698                 }
1699                 /* the ioctl returns the number of item it found in nr_items */
1700                 if (sk->nr_items == 0)
1701                         break;
1702
1703                 off = 0;
1704
1705                 /*
1706                  * for each item, pull the key out of the header and then
1707                  * read the root_ref item it contains
1708                  */
1709                 for (i = 0; i < sk->nr_items; i++) {
1710                         memcpy(&sh, args.buf + off, sizeof(sh));
1711                         off += sizeof(sh);
1712
1713                         /*
1714                          * just in case the item was too big, pass something other
1715                          * than garbage
1716                          */
1717                         if (sh.len == 0)
1718                                 item = &backup;
1719                         else
1720                                 item = (struct btrfs_file_extent_item *)(args.buf +
1721                                                                  off);
1722                         found_gen = btrfs_stack_file_extent_generation(item);
1723                         if (sh.type == BTRFS_EXTENT_DATA_KEY &&
1724                             found_gen >= oldest_gen) {
1725                                 print_one_extent(fd, &sh, item, found_gen,
1726                                                  &cache_dirid, &cache_dir_name,
1727                                                  &cache_ino, &cache_full_name);
1728                         }
1729                         off += sh.len;
1730
1731                         /*
1732                          * record the mins in sk so we can make sure the
1733                          * next search doesn't repeat this root
1734                          */
1735                         sk->min_objectid = sh.objectid;
1736                         sk->min_offset = sh.offset;
1737                         sk->min_type = sh.type;
1738                 }
1739                 sk->nr_items = 4096;
1740                 if (sk->min_offset < (u64)-1)
1741                         sk->min_offset++;
1742                 else if (sk->min_objectid < (u64)-1) {
1743                         sk->min_objectid++;
1744                         sk->min_offset = 0;
1745                         sk->min_type = 0;
1746                 } else
1747                         break;
1748         }
1749         free(cache_dir_name);
1750         free(cache_full_name);
1751         printf("transid marker was %llu\n", (unsigned long long)max_found);
1752         return ret;
1753 }
1754
1755 char *btrfs_list_path_for_root(int fd, u64 root)
1756 {
1757         struct root_lookup root_lookup;
1758         struct rb_node *n;
1759         char *ret_path = NULL;
1760         int ret;
1761         u64 top_id;
1762
1763         ret = btrfs_list_get_path_rootid(fd, &top_id);
1764         if (ret)
1765                 return ERR_PTR(ret);
1766
1767         ret = list_subvol_search(fd, &root_lookup);
1768         if (ret < 0)
1769                 return ERR_PTR(ret);
1770
1771         ret = list_subvol_fill_paths(fd, &root_lookup);
1772         if (ret < 0)
1773                 return ERR_PTR(ret);
1774
1775         n = rb_last(&root_lookup.root);
1776         while (n) {
1777                 struct root_info *entry;
1778
1779                 entry = rb_entry(n, struct root_info, rb_node);
1780                 ret = resolve_root(&root_lookup, entry, top_id);
1781                 if (ret == -ENOENT && entry->root_id == root) {
1782                         ret_path = NULL;
1783                         break;
1784                 }
1785                 if (entry->root_id == root) {
1786                         ret_path = entry->full_path;
1787                         entry->full_path = NULL;
1788                 }
1789
1790                 n = rb_prev(n);
1791         }
1792         rb_free_nodes(&root_lookup.root, free_root_info);
1793
1794         return ret_path;
1795 }
1796
1797 int btrfs_list_parse_sort_string(char *opt_arg,
1798                                  struct btrfs_list_comparer_set **comps)
1799 {
1800         int order;
1801         int flag;
1802         char *p;
1803         char **ptr_argv;
1804         int what_to_sort;
1805
1806         while ((p = strtok(opt_arg, ",")) != NULL) {
1807                 flag = 0;
1808                 ptr_argv = all_sort_items;
1809
1810                 while (*ptr_argv) {
1811                         if (strcmp(*ptr_argv, p) == 0) {
1812                                 flag = 1;
1813                                 break;
1814                         } else {
1815                                 p++;
1816                                 if (strcmp(*ptr_argv, p) == 0) {
1817                                         flag = 1;
1818                                         p--;
1819                                         break;
1820                                 }
1821                                 p--;
1822                         }
1823                         ptr_argv++;
1824                 }
1825
1826                 if (flag == 0)
1827                         return -1;
1828
1829                 else {
1830                         if (*p == '+') {
1831                                 order = 0;
1832                                 p++;
1833                         } else if (*p == '-') {
1834                                 order = 1;
1835                                 p++;
1836                         } else
1837                                 order = 0;
1838
1839                         what_to_sort = btrfs_list_get_sort_item(p);
1840                         btrfs_list_setup_comparer(comps, what_to_sort, order);
1841                 }
1842                 opt_arg = NULL;
1843         }
1844
1845         return 0;
1846 }
1847
1848 /*
1849  * This function is used to parse the argument of filter condition.
1850  *
1851  * type is the filter object.
1852  */
1853 int btrfs_list_parse_filter_string(char *opt_arg,
1854                                    struct btrfs_list_filter_set **filters,
1855                                    enum btrfs_list_filter_enum type)
1856 {
1857
1858         u64 arg;
1859
1860         switch (*(opt_arg++)) {
1861         case '+':
1862                 arg = arg_strtou64(opt_arg);
1863                 type += 2;
1864
1865                 btrfs_list_setup_filter(filters, type, arg);
1866                 break;
1867         case '-':
1868                 arg = arg_strtou64(opt_arg);
1869                 type += 1;
1870
1871                 btrfs_list_setup_filter(filters, type, arg);
1872                 break;
1873         default:
1874                 opt_arg--;
1875                 arg = arg_strtou64(opt_arg);
1876
1877                 btrfs_list_setup_filter(filters, type, arg);
1878                 break;
1879         }
1880
1881         return 0;
1882 }
1883
1884 int btrfs_list_get_path_rootid(int fd, u64 *treeid)
1885 {
1886         int ret;
1887
1888         ret = lookup_path_rootid(fd, treeid);
1889         if (ret < 0)
1890                 error("cannot resolve rootid for path: %s",
1891                         strerror(errno));
1892
1893         return ret;
1894 }