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                 printf("failed to insert tree %llu\n", (unsigned long long)root_id);
 516                 exit(1);
 517         }
 518         return 0;
 519 }
 520
 521 static void __free_root_info(struct rb_node *node)
 522 {
 523         struct root_info *ri;
 524
 525         ri = rb_entry(node, struct root_info, rb_node);
 526         free(ri->name);
 527         free(ri->path);
 528         free(ri->full_path);
 529         free(ri);
 530 }
 531
 532 static inline void __free_all_subvolumn(struct root_lookup *root_tree)
 533 {
 534         rb_free_nodes(&root_tree->root, __free_root_info);
 535 }
 536
 537 /*
 538  * for a given root_info, search through the root_lookup tree to construct
 539  * the full path name to it.
 540  *
 541  * This can't be called until all the root_info->path fields are filled
 542  * in by lookup_ino_path
 543  */
 544 static int resolve_root(struct root_lookup *rl, struct root_info *ri,
 545                        u64 top_id)
 546 {
 547         char *full_path = NULL;
 548         int len = 0;
 549         struct root_info *found;
 550
 551         /*
 552          * we go backwards from the root_info object and add pathnames
 553          * from parent directories as we go.
 554          */
 555         found = ri;
 556         while (1) {
 557                 char *tmp;
 558                 u64 next;
 559                 int add_len;
 560
 561                 /*
 562                  * ref_tree = 0 indicates the subvolume
 563                  * has been deleted.
 564                  */
 565                 if (!found->ref_tree) {
 566                         free(full_path);
 567                         return -ENOENT;
 568                 }
 569
 570                 add_len = strlen(found->path);
 571
 572                 if (full_path) {
 573                         /* room for / and for null */
 574                         tmp = malloc(add_len + 2 + len);
 575                         if (!tmp) {
 576                                 perror("malloc failed");
 577                                 exit(1);
 578                         }
 579                         memcpy(tmp + add_len + 1, full_path, len);
 580                         tmp[add_len] = '/';
 581                         memcpy(tmp, found->path, add_len);
 582                         tmp [add_len + len + 1] = '\0';
 583                         free(full_path);
 584                         full_path = tmp;
 585                         len += add_len + 1;
 586                 } else {
 587                         full_path = strdup(found->path);
 588                         len = add_len;
 589                 }
 590                 if (!ri->top_id)
 591                         ri->top_id = found->ref_tree;
 592
 593                 next = found->ref_tree;
 594                 if (next == top_id)
 595                         break;
 596                 /*
 597                 * if the ref_tree = BTRFS_FS_TREE_OBJECTID,
 598                 * we are at the top
 599                 */
 600                 if (next == BTRFS_FS_TREE_OBJECTID)
 601                         break;
 602                 /*
 603                 * if the ref_tree wasn't in our tree of roots, the
 604                 * subvolume was deleted.
 605                 */
 606                 found = root_tree_search(rl, next);
 607                 if (!found) {
 608                         free(full_path);
 609                         return -ENOENT;
 610                 }
 611         }
 612
 613         ri->full_path = full_path;
 614
 615         return 0;
 616 }
 617
 618 /*
 619  * for a single root_info, ask the kernel to give us a path name
 620  * inside it's ref_root for the dir_id where it lives.
 621  *
 622  * This fills in root_info->path with the path to the directory and and
 623  * appends this root's name.
 624  */
 625 static int lookup_ino_path(int fd, struct root_info *ri)
 626 {
 627         struct btrfs_ioctl_ino_lookup_args args;
 628         int ret;
 629
 630         if (ri->path)
 631                 return 0;
 632
 633         if (!ri->ref_tree)
 634                 return -ENOENT;
 635
 636         memset(&args, 0, sizeof(args));
 637         args.treeid = ri->ref_tree;
 638         args.objectid = ri->dir_id;
 639
 640         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
 641         if (ret < 0) {
 642                 if (errno == ENOENT) {
 643                         ri->ref_tree = 0;
 644                         return -ENOENT;
 645                 }
 646                 fprintf(stderr, "ERROR: Failed to lookup path for root %llu - %s\n",
 647                         (unsigned long long)ri->ref_tree,
 648                         strerror(errno));
 649                 return ret;
 650         }
 651
 652         if (args.name[0]) {
 653                 /*
 654                  * we're in a subdirectory of ref_tree, the kernel ioctl
 655                  * puts a / in there for us
 656                  */
 657                 ri->path = malloc(strlen(ri->name) + strlen(args.name) + 1);
 658                 if (!ri->path) {
 659                         perror("malloc failed");
 660                         exit(1);
 661                 }
 662                 strcpy(ri->path, args.name);
 663                 strcat(ri->path, ri->name);
 664         } else {
 665                 /* we're at the root of ref_tree */
 666                 ri->path = strdup(ri->name);
 667                 if (!ri->path) {
 668                         perror("strdup failed");
 669                         exit(1);
 670                 }
 671         }
 672         return 0;
 673 }
 674
 675 /* finding the generation for a given path is a two step process.
 676  * First we use the inode lookup routine to find out the root id
 677  *
 678  * Then we use the tree search ioctl to scan all the root items for a
 679  * given root id and spit out the latest generation we can find
 680  */
 681 static u64 find_root_gen(int fd)
 682 {
 683         struct btrfs_ioctl_ino_lookup_args ino_args;
 684         int ret;
 685         struct btrfs_ioctl_search_args args;
 686         struct btrfs_ioctl_search_key *sk = &args.key;
 687         struct btrfs_ioctl_search_header sh;
 688         unsigned long off = 0;
 689         u64 max_found = 0;
 690         int i;
 691
 692         memset(&ino_args, 0, sizeof(ino_args));
 693         ino_args.objectid = BTRFS_FIRST_FREE_OBJECTID;
 694
 695         /* this ioctl fills in ino_args->treeid */
 696         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &ino_args);
 697         if (ret < 0) {
 698                 fprintf(stderr, "ERROR: Failed to lookup path for dirid %llu - %s\n",
 699                         (unsigned long long)BTRFS_FIRST_FREE_OBJECTID,
 700                         strerror(errno));
 701                 return 0;
 702         }
 703
 704         memset(&args, 0, sizeof(args));
 705
 706         sk->tree_id = 1;
 707
 708         /*
 709          * there may be more than one ROOT_ITEM key if there are
 710          * snapshots pending deletion, we have to loop through
 711          * them.
 712          */
 713         sk->min_objectid = ino_args.treeid;
 714         sk->max_objectid = ino_args.treeid;
 715         sk->max_type = BTRFS_ROOT_ITEM_KEY;
 716         sk->min_type = BTRFS_ROOT_ITEM_KEY;
 717         sk->max_offset = (u64)-1;
 718         sk->max_transid = (u64)-1;
 719         sk->nr_items = 4096;
 720
 721         while (1) {
 722                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
 723                 if (ret < 0) {
 724                         fprintf(stderr, "ERROR: can't perform the search - %s\n",
 725                                 strerror(errno));
 726                         return 0;
 727                 }
 728                 /* the ioctl returns the number of item it found in nr_items */
 729                 if (sk->nr_items == 0)
 730                         break;
 731
 732                 off = 0;
 733                 for (i = 0; i < sk->nr_items; i++) {
 734                         struct btrfs_root_item *item;
 735
 736                         memcpy(&sh, args.buf + off, sizeof(sh));
 737                         off += sizeof(sh);
 738                         item = (struct btrfs_root_item *)(args.buf + off);
 739                         off += sh.len;
 740
 741                         sk->min_objectid = sh.objectid;
 742                         sk->min_type = sh.type;
 743                         sk->min_offset = sh.offset;
 744
 745                         if (sh.objectid > ino_args.treeid)
 746                                 break;
 747
 748                         if (sh.objectid == ino_args.treeid &&
 749                             sh.type == BTRFS_ROOT_ITEM_KEY) {
 750                                 max_found = max(max_found,
 751                                                 btrfs_root_generation(item));
 752                         }
 753                 }
 754                 if (sk->min_offset < (u64)-1)
 755                         sk->min_offset++;
 756                 else
 757                         break;
 758
 759                 if (sk->min_type != BTRFS_ROOT_ITEM_KEY)
 760                         break;
 761                 if (sk->min_objectid != ino_args.treeid)
 762                         break;
 763         }
 764         return max_found;
 765 }
 766
 767 /* pass in a directory id and this will return
 768  * the full path of the parent directory inside its
 769  * subvolume root.
 770  *
 771  * It may return NULL if it is in the root, or an ERR_PTR if things
 772  * go badly.
 773  */
 774 static char *__ino_resolve(int fd, u64 dirid)
 775 {
 776         struct btrfs_ioctl_ino_lookup_args args;
 777         int ret;
 778         char *full;
 779
 780         memset(&args, 0, sizeof(args));
 781         args.objectid = dirid;
 782
 783         ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
 784         if (ret < 0) {
 785                 fprintf(stderr, "ERROR: Failed to lookup path for dirid %llu - %s\n",
 786                         (unsigned long long)dirid, strerror(errno));
 787                 return ERR_PTR(ret);
 788         }
 789
 790         if (args.name[0]) {
 791                 /*
 792                  * we're in a subdirectory of ref_tree, the kernel ioctl
 793                  * puts a / in there for us
 794                  */
 795                 full = strdup(args.name);
 796                 if (!full) {
 797                         perror("malloc failed");
 798                         return ERR_PTR(-ENOMEM);
 799                 }
 800         } else {
 801                 /* we're at the root of ref_tree */
 802                 full = NULL;
 803         }
 804         return full;
 805 }
 806
 807 /*
 808  * simple string builder, returning a new string with both
 809  * dirid and name
 810  */
 811 static char *build_name(const char *dirid, const char *name)
 812 {
 813         char *full;
 814
 815         if (!dirid)
 816                 return strdup(name);
 817
 818         full = malloc(strlen(dirid) + strlen(name) + 1);
 819         if (!full)
 820                 return NULL;
 821         strcpy(full, dirid);
 822         strcat(full, name);
 823         return full;
 824 }
 825
 826 /*
 827  * given an inode number, this returns the full path name inside the subvolume
 828  * to that file/directory.  cache_dirid and cache_name are used to
 829  * cache the results so we can avoid tree searches if a later call goes
 830  * to the same directory or file name
 831  */
 832 static char *ino_resolve(int fd, u64 ino, u64 *cache_dirid, char **cache_name)
 833
 834 {
 835         u64 dirid;
 836         char *dirname;
 837         char *name;
 838         char *full;
 839         int ret;
 840         struct btrfs_ioctl_search_args args;
 841         struct btrfs_ioctl_search_key *sk = &args.key;
 842         struct btrfs_ioctl_search_header *sh;
 843         unsigned long off = 0;
 844         int namelen;
 845
 846         memset(&args, 0, sizeof(args));
 847
 848         sk->tree_id = 0;
 849
 850         /*
 851          * step one, we search for the inode back ref.  We just use the first
 852          * one
 853          */
 854         sk->min_objectid = ino;
 855         sk->max_objectid = ino;
 856         sk->max_type = BTRFS_INODE_REF_KEY;
 857         sk->max_offset = (u64)-1;
 858         sk->min_type = BTRFS_INODE_REF_KEY;
 859         sk->max_transid = (u64)-1;
 860         sk->nr_items = 1;
 861
 862         ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
 863         if (ret < 0) {
 864                 fprintf(stderr, "ERROR: can't perform the search - %s\n",
 865                         strerror(errno));
 866                 return NULL;
 867         }
 868         /* the ioctl returns the number of item it found in nr_items */
 869         if (sk->nr_items == 0)
 870                 return NULL;
 871
 872         off = 0;
 873         sh = (struct btrfs_ioctl_search_header *)(args.buf + off);
 874
 875         if (btrfs_search_header_type(sh) == BTRFS_INODE_REF_KEY) {
 876                 struct btrfs_inode_ref *ref;
 877                 dirid = btrfs_search_header_offset(sh);
 878
 879                 ref = (struct btrfs_inode_ref *)(sh + 1);
 880                 namelen = btrfs_stack_inode_ref_name_len(ref);
 881
 882                 name = (char *)(ref + 1);
 883                 name = strndup(name, namelen);
 884
 885                 /* use our cached value */
 886                 if (dirid == *cache_dirid && *cache_name) {
 887                         dirname = *cache_name;
 888                         goto build;
 889                 }
 890         } else {
 891                 return NULL;
 892         }
 893         /*
 894          * the inode backref gives us the file name and the parent directory id.
 895          * From here we use __ino_resolve to get the path to the parent
 896          */
 897         dirname = __ino_resolve(fd, dirid);
 898 build:
 899         full = build_name(dirname, name);
 900         if (*cache_name && dirname != *cache_name)
 901                 free(*cache_name);
 902
 903         *cache_name = dirname;
 904         *cache_dirid = dirid;
 905         free(name);
 906
 907         return full;
 908 }
 909
 910 int btrfs_list_get_default_subvolume(int fd, u64 *default_id)
 911 {
 912         struct btrfs_ioctl_search_args args;
 913         struct btrfs_ioctl_search_key *sk = &args.key;
 914         struct btrfs_ioctl_search_header *sh;
 915         u64 found = 0;
 916         int ret;
 917
 918         memset(&args, 0, sizeof(args));
 919
 920         /*
 921          * search for a dir item with a name 'default' in the tree of
 922          * tree roots, it should point us to a default root
 923          */
 924         sk->tree_id = 1;
 925
 926         /* don't worry about ancient format and request only one item */
 927         sk->nr_items = 1;
 928
 929         sk->max_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
 930         sk->min_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
 931         sk->max_type = BTRFS_DIR_ITEM_KEY;
 932         sk->min_type = BTRFS_DIR_ITEM_KEY;
 933         sk->max_offset = (u64)-1;
 934         sk->max_transid = (u64)-1;
 935
 936         ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
 937         if (ret < 0)
 938                 return ret;
 939
 940         /* the ioctl returns the number of items it found in nr_items */
 941         if (sk->nr_items == 0)
 942                 goto out;
 943
 944         sh = (struct btrfs_ioctl_search_header *)args.buf;
 945
 946         if (btrfs_search_header_type(sh) == BTRFS_DIR_ITEM_KEY) {
 947                 struct btrfs_dir_item *di;
 948                 int name_len;
 949                 char *name;
 950
 951                 di = (struct btrfs_dir_item *)(sh + 1);
 952                 name_len = btrfs_stack_dir_name_len(di);
 953                 name = (char *)(di + 1);
 954
 955                 if (!strncmp("default", name, name_len))
 956                         found = btrfs_disk_key_objectid(&di->location);
 957         }
 958
 959 out:
 960         *default_id = found;
 961         return 0;
 962 }
 963
 964 static int __list_subvol_search(int fd, struct root_lookup *root_lookup)
 965 {
 966         int ret;
 967         struct btrfs_ioctl_search_args args;
 968         struct btrfs_ioctl_search_key *sk = &args.key;
 969         struct btrfs_ioctl_search_header sh;
 970         struct btrfs_root_ref *ref;
 971         struct btrfs_root_item *ri;
 972         unsigned long off = 0;
 973         int name_len;
 974         char *name;
 975         u64 dir_id;
 976         u64 gen = 0;
 977         u64 ogen;
 978         u64 flags;
 979         int i;
 980         time_t t;
 981         u8 uuid[BTRFS_UUID_SIZE];
 982         u8 puuid[BTRFS_UUID_SIZE];
 983         u8 ruuid[BTRFS_UUID_SIZE];
 984
 985         root_lookup_init(root_lookup);
 986         memset(&args, 0, sizeof(args));
 987
 988         /* search in the tree of tree roots */
 989         sk->tree_id = 1;
 990
 991         /*
 992          * set the min and max to backref keys.  The search will
 993          * only send back this type of key now.
 994          */
 995         sk->max_type = BTRFS_ROOT_BACKREF_KEY;
 996         sk->min_type = BTRFS_ROOT_ITEM_KEY;
 997
 998         sk->min_objectid = BTRFS_FIRST_FREE_OBJECTID;
 999
1000         /*
1001          * set all the other params to the max, we'll take any objectid
1002          * and any trans
1003          */
1004         sk->max_objectid = BTRFS_LAST_FREE_OBJECTID;
1005         sk->max_offset = (u64)-1;
1006         sk->max_transid = (u64)-1;
1007
1008         /* just a big number, doesn't matter much */
1009         sk->nr_items = 4096;
1010
1011         while(1) {
1012                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1013                 if (ret < 0)
1014                         return ret;
1015                 /* the ioctl returns the number of item it found in nr_items */
1016                 if (sk->nr_items == 0)
1017                         break;
1018
1019                 off = 0;
1020
1021                 /*
1022                  * for each item, pull the key out of the header and then
1023                  * read the root_ref item it contains
1024                  */
1025                 for (i = 0; i < sk->nr_items; i++) {
1026                         memcpy(&sh, args.buf + off, sizeof(sh));
1027                         off += sizeof(sh);
1028                         if (sh.type == BTRFS_ROOT_BACKREF_KEY) {
1029                                 ref = (struct btrfs_root_ref *)(args.buf + off);
1030                                 name_len = btrfs_stack_root_ref_name_len(ref);
1031                                 name = (char *)(ref + 1);
1032                                 dir_id = btrfs_stack_root_ref_dirid(ref);
1033
1034                                 add_root(root_lookup, sh.objectid, sh.offset,
1035                                          0, 0, dir_id, name, name_len, 0, 0, 0,
1036                                          NULL, NULL, NULL);
1037                         } else if (sh.type == BTRFS_ROOT_ITEM_KEY) {
1038                                 ri = (struct btrfs_root_item *)(args.buf + off);
1039                                 gen = btrfs_root_generation(ri);
1040                                 flags = btrfs_root_flags(ri);
1041                                 if(sh.len >
1042                                    sizeof(struct btrfs_root_item_v0)) {
1043                                         t = btrfs_stack_timespec_sec(&ri->otime);
1044                                         ogen = btrfs_root_otransid(ri);
1045                                         memcpy(uuid, ri->uuid, BTRFS_UUID_SIZE);
1046                                         memcpy(puuid, ri->parent_uuid, BTRFS_UUID_SIZE);
1047                                         memcpy(ruuid, ri->received_uuid, BTRFS_UUID_SIZE);
1048                                 } else {
1049                                         t = 0;
1050                                         ogen = 0;
1051                                         memset(uuid, 0, BTRFS_UUID_SIZE);
1052                                         memset(puuid, 0, BTRFS_UUID_SIZE);
1053                                         memset(ruuid, 0, BTRFS_UUID_SIZE);
1054                                 }
1055
1056                                 add_root(root_lookup, sh.objectid, 0,
1057                                          sh.offset, flags, 0, NULL, 0, ogen,
1058                                          gen, t, uuid, puuid, ruuid);
1059                         }
1060
1061                         off += sh.len;
1062
1063                         /*
1064                          * record the mins in sk so we can make sure the
1065                          * next search doesn't repeat this root
1066                          */
1067                         sk->min_objectid = sh.objectid;
1068                         sk->min_type = sh.type;
1069                         sk->min_offset = sh.offset;
1070                 }
1071                 sk->nr_items = 4096;
1072                 sk->min_offset++;
1073                 if (!sk->min_offset)    /* overflow */
1074                         sk->min_type++;
1075                 else
1076                         continue;
1077
1078                 if (sk->min_type > BTRFS_ROOT_BACKREF_KEY) {
1079                         sk->min_type = BTRFS_ROOT_ITEM_KEY;
1080                         sk->min_objectid++;
1081                 } else
1082                         continue;
1083
1084                 if (sk->min_objectid > sk->max_objectid)
1085                         break;
1086         }
1087
1088         return 0;
1089 }
1090
1091 static int filter_by_rootid(struct root_info *ri, u64 data)
1092 {
1093         return ri->root_id == data;
1094 }
1095
1096 static int filter_snapshot(struct root_info *ri, u64 data)
1097 {
1098         return !!ri->root_offset;
1099 }
1100
1101 static int filter_flags(struct root_info *ri, u64 flags)
1102 {
1103         return ri->flags & flags;
1104 }
1105
1106 static int filter_gen_more(struct root_info *ri, u64 data)
1107 {
1108         return ri->gen >= data;
1109 }
1110
1111 static int filter_gen_less(struct root_info *ri, u64 data)
1112 {
1113         return ri->gen <= data;
1114 }
1115
1116 static int filter_gen_equal(struct root_info  *ri, u64 data)
1117 {
1118         return ri->gen == data;
1119 }
1120
1121 static int filter_cgen_more(struct root_info *ri, u64 data)
1122 {
1123         return ri->ogen >= data;
1124 }
1125
1126 static int filter_cgen_less(struct root_info *ri, u64 data)
1127 {
1128         return ri->ogen <= data;
1129 }
1130
1131 static int filter_cgen_equal(struct root_info *ri, u64 data)
1132 {
1133         return ri->ogen == data;
1134 }
1135
1136 static int filter_topid_equal(struct root_info *ri, u64 data)
1137 {
1138         return ri->top_id == data;
1139 }
1140
1141 static int filter_full_path(struct root_info *ri, u64 data)
1142 {
1143         if (ri->full_path && ri->top_id != data) {
1144                 char *tmp;
1145                 char p[] = "<FS_TREE>";
1146                 int add_len = strlen(p);
1147                 int len = strlen(ri->full_path);
1148
1149                 tmp = malloc(len + add_len + 2);
1150                 if (!tmp) {
1151                         fprintf(stderr, "memory allocation failed\n");
1152                         exit(1);
1153                 }
1154                 memcpy(tmp + add_len + 1, ri->full_path, len);
1155                 tmp[len + add_len + 1] = '\0';
1156                 tmp[add_len] = '/';
1157                 memcpy(tmp, p, add_len);
1158                 free(ri->full_path);
1159                 ri->full_path = tmp;
1160         }
1161         return 1;
1162 }
1163
1164 static int filter_by_parent(struct root_info *ri, u64 data)
1165 {
1166         return !uuid_compare(ri->puuid, (u8 *)(unsigned long)data);
1167 }
1168
1169 static int filter_deleted(struct root_info *ri, u64 data)
1170 {
1171         return ri->deleted;
1172 }
1173
1174 static btrfs_list_filter_func all_filter_funcs[] = {
1175         [BTRFS_LIST_FILTER_ROOTID]              = filter_by_rootid,
1176         [BTRFS_LIST_FILTER_SNAPSHOT_ONLY]       = filter_snapshot,
1177         [BTRFS_LIST_FILTER_FLAGS]               = filter_flags,
1178         [BTRFS_LIST_FILTER_GEN_MORE]            = filter_gen_more,
1179         [BTRFS_LIST_FILTER_GEN_LESS]            = filter_gen_less,
1180         [BTRFS_LIST_FILTER_GEN_EQUAL]           = filter_gen_equal,
1181         [BTRFS_LIST_FILTER_CGEN_MORE]           = filter_cgen_more,
1182         [BTRFS_LIST_FILTER_CGEN_LESS]           = filter_cgen_less,
1183         [BTRFS_LIST_FILTER_CGEN_EQUAL]          = filter_cgen_equal,
1184         [BTRFS_LIST_FILTER_TOPID_EQUAL]         = filter_topid_equal,
1185         [BTRFS_LIST_FILTER_FULL_PATH]           = filter_full_path,
1186         [BTRFS_LIST_FILTER_BY_PARENT]           = filter_by_parent,
1187         [BTRFS_LIST_FILTER_DELETED]             = filter_deleted,
1188 };
1189
1190 struct btrfs_list_filter_set *btrfs_list_alloc_filter_set(void)
1191 {
1192         struct btrfs_list_filter_set *set;
1193         int size;
1194
1195         size = sizeof(struct btrfs_list_filter_set) +
1196                BTRFS_LIST_NFILTERS_INCREASE * sizeof(struct btrfs_list_filter);
1197         set = calloc(1, size);
1198         if (!set) {
1199                 fprintf(stderr, "memory allocation failed\n");
1200                 exit(1);
1201         }
1202
1203         set->total = BTRFS_LIST_NFILTERS_INCREASE;
1204
1205         return set;
1206 }
1207
1208 int btrfs_list_setup_filter(struct btrfs_list_filter_set **filter_set,
1209                             enum btrfs_list_filter_enum filter, u64 data)
1210 {
1211         struct btrfs_list_filter_set *set = *filter_set;
1212         int size;
1213
1214         ASSERT(set != NULL);
1215         ASSERT(filter < BTRFS_LIST_FILTER_MAX);
1216         ASSERT(set->nfilters <= set->total);
1217
1218         if (set->nfilters == set->total) {
1219                 void *tmp;
1220
1221                 size = set->total + BTRFS_LIST_NFILTERS_INCREASE;
1222                 size = sizeof(*set) + size * sizeof(struct btrfs_list_filter);
1223                 tmp = set;
1224                 set = realloc(set, size);
1225                 if (!set) {
1226                         fprintf(stderr, "memory allocation failed\n");
1227                         free(tmp);
1228                         exit(1);
1229                 }
1230
1231                 memset(&set->filters[set->total], 0,
1232                        BTRFS_LIST_NFILTERS_INCREASE *
1233                        sizeof(struct btrfs_list_filter));
1234                 set->total += BTRFS_LIST_NFILTERS_INCREASE;
1235                 *filter_set = set;
1236         }
1237
1238         ASSERT(set->filters[set->nfilters].filter_func == NULL);
1239
1240         if (filter == BTRFS_LIST_FILTER_DELETED)
1241                 set->only_deleted = 1;
1242
1243         set->filters[set->nfilters].filter_func = all_filter_funcs[filter];
1244         set->filters[set->nfilters].data = data;
1245         set->nfilters++;
1246         return 0;
1247 }
1248
1249 static int filter_root(struct root_info *ri,
1250                        struct btrfs_list_filter_set *set)
1251 {
1252         int i, ret;
1253
1254         if (!set)
1255                 return 1;
1256
1257         if (set->only_deleted && !ri->deleted)
1258                 return 0;
1259
1260         if (!set->only_deleted && ri->deleted)
1261                 return 0;
1262
1263         for (i = 0; i < set->nfilters; i++) {
1264                 if (!set->filters[i].filter_func)
1265                         break;
1266                 ret = set->filters[i].filter_func(ri, set->filters[i].data);
1267                 if (!ret)
1268                         return 0;
1269         }
1270         return 1;
1271 }
1272
1273 static void __filter_and_sort_subvol(struct root_lookup *all_subvols,
1274                                     struct root_lookup *sort_tree,
1275                                     struct btrfs_list_filter_set *filter_set,
1276                                     struct btrfs_list_comparer_set *comp_set,
1277                                     u64 top_id)
1278 {
1279         struct rb_node *n;
1280         struct root_info *entry;
1281         int ret;
1282
1283         root_lookup_init(sort_tree);
1284
1285         n = rb_last(&all_subvols->root);
1286         while (n) {
1287                 entry = rb_entry(n, struct root_info, rb_node);
1288
1289                 ret = resolve_root(all_subvols, entry, top_id);
1290                 if (ret == -ENOENT) {
1291                         entry->full_path = strdup("DELETED");
1292                         entry->deleted = 1;
1293                 }
1294                 ret = filter_root(entry, filter_set);
1295                 if (ret)
1296                         sort_tree_insert(sort_tree, entry, comp_set);
1297                 n = rb_prev(n);
1298         }
1299 }
1300
1301 static int __list_subvol_fill_paths(int fd, struct root_lookup *root_lookup)
1302 {
1303         struct rb_node *n;
1304
1305         n = rb_first(&root_lookup->root);
1306         while (n) {
1307                 struct root_info *entry;
1308                 int ret;
1309                 entry = rb_entry(n, struct root_info, rb_node);
1310                 ret = lookup_ino_path(fd, entry);
1311                 if (ret && ret != -ENOENT)
1312                         return ret;
1313                 n = rb_next(n);
1314         }
1315
1316         return 0;
1317 }
1318
1319 static void print_subvolume_column(struct root_info *subv,
1320                                    enum btrfs_list_column_enum column)
1321 {
1322         char tstr[256];
1323         char uuidparse[BTRFS_UUID_UNPARSED_SIZE];
1324
1325         ASSERT(0 <= column && column < BTRFS_LIST_ALL);
1326
1327         switch (column) {
1328         case BTRFS_LIST_OBJECTID:
1329                 printf("%llu", subv->root_id);
1330                 break;
1331         case BTRFS_LIST_GENERATION:
1332                 printf("%llu", subv->gen);
1333                 break;
1334         case BTRFS_LIST_OGENERATION:
1335                 printf("%llu", subv->ogen);
1336                 break;
1337         case BTRFS_LIST_PARENT:
1338                 printf("%llu", subv->ref_tree);
1339                 break;
1340         case BTRFS_LIST_TOP_LEVEL:
1341                 printf("%llu", subv->top_id);
1342                 break;
1343         case BTRFS_LIST_OTIME:
1344                 if (subv->otime) {
1345                         struct tm tm;
1346
1347                         localtime_r(&subv->otime, &tm);
1348                         strftime(tstr, 256, "%Y-%m-%d %X", &tm);
1349                 } else
1350                         strcpy(tstr, "-");
1351                 printf("%s", tstr);
1352                 break;
1353         case BTRFS_LIST_UUID:
1354                 if (uuid_is_null(subv->uuid))
1355                         strcpy(uuidparse, "-");
1356                 else
1357                         uuid_unparse(subv->uuid, uuidparse);
1358                 printf("%s", uuidparse);
1359                 break;
1360         case BTRFS_LIST_PUUID:
1361                 if (uuid_is_null(subv->puuid))
1362                         strcpy(uuidparse, "-");
1363                 else
1364                         uuid_unparse(subv->puuid, uuidparse);
1365                 printf("%s", uuidparse);
1366                 break;
1367         case BTRFS_LIST_RUUID:
1368                 if (uuid_is_null(subv->ruuid))
1369                         strcpy(uuidparse, "-");
1370                 else
1371                         uuid_unparse(subv->ruuid, uuidparse);
1372                 printf("%s", uuidparse);
1373                 break;
1374         case BTRFS_LIST_PATH:
1375                 BUG_ON(!subv->full_path);
1376                 printf("%s", subv->full_path);
1377                 break;
1378         default:
1379                 break;
1380         }
1381 }
1382
1383 static void print_single_volume_info_raw(struct root_info *subv, char *raw_prefix)
1384 {
1385         int i;
1386
1387         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1388                 if (!btrfs_list_columns[i].need_print)
1389                         continue;
1390
1391                 if (raw_prefix)
1392                         printf("%s",raw_prefix);
1393
1394                 print_subvolume_column(subv, i);
1395         }
1396         printf("\n");
1397 }
1398
1399 static void print_single_volume_info_table(struct root_info *subv)
1400 {
1401         int i;
1402
1403         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1404                 if (!btrfs_list_columns[i].need_print)
1405                         continue;
1406
1407                 print_subvolume_column(subv, i);
1408
1409                 if (i != BTRFS_LIST_PATH)
1410                         printf("\t");
1411
1412                 if (i == BTRFS_LIST_TOP_LEVEL)
1413                         printf("\t");
1414         }
1415         printf("\n");
1416 }
1417
1418 static void print_single_volume_info_default(struct root_info *subv)
1419 {
1420         int i;
1421
1422         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1423                 if (!btrfs_list_columns[i].need_print)
1424                         continue;
1425
1426                 printf("%s ", btrfs_list_columns[i].name);
1427                 print_subvolume_column(subv, i);
1428
1429                 if (i != BTRFS_LIST_PATH)
1430                         printf(" ");
1431         }
1432         printf("\n");
1433 }
1434
1435 static void print_all_volume_info_tab_head(void)
1436 {
1437         int i;
1438         int len;
1439         char barrier[20];
1440
1441         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1442                 if (btrfs_list_columns[i].need_print)
1443                         printf("%s\t", btrfs_list_columns[i].name);
1444
1445                 if (i == BTRFS_LIST_ALL-1)
1446                         printf("\n");
1447         }
1448
1449         for (i = 0; i < BTRFS_LIST_ALL; i++) {
1450                 memset(barrier, 0, sizeof(barrier));
1451
1452                 if (btrfs_list_columns[i].need_print) {
1453                         len = strlen(btrfs_list_columns[i].name);
1454                         while (len--)
1455                                 strcat(barrier, "-");
1456
1457                         printf("%s\t", barrier);
1458                 }
1459                 if (i == BTRFS_LIST_ALL-1)
1460                         printf("\n");
1461         }
1462 }
1463
1464 static void print_all_volume_info(struct root_lookup *sorted_tree,
1465                                   int layout, char *raw_prefix)
1466 {
1467         struct rb_node *n;
1468         struct root_info *entry;
1469
1470         if (layout == BTRFS_LIST_LAYOUT_TABLE)
1471                 print_all_volume_info_tab_head();
1472
1473         n = rb_first(&sorted_tree->root);
1474         while (n) {
1475                 entry = rb_entry(n, struct root_info, sort_node);
1476                 switch (layout) {
1477                 case BTRFS_LIST_LAYOUT_DEFAULT:
1478                         print_single_volume_info_default(entry);
1479                         break;
1480                 case BTRFS_LIST_LAYOUT_TABLE:
1481                         print_single_volume_info_table(entry);
1482                         break;
1483                 case BTRFS_LIST_LAYOUT_RAW:
1484                         print_single_volume_info_raw(entry, raw_prefix);
1485                         break;
1486                 }
1487                 n = rb_next(n);
1488         }
1489 }
1490
1491 static int btrfs_list_subvols(int fd, struct root_lookup *root_lookup)
1492 {
1493         int ret;
1494
1495         ret = __list_subvol_search(fd, root_lookup);
1496         if (ret) {
1497                 fprintf(stderr, "ERROR: can't perform the search - %s\n",
1498                                 strerror(errno));
1499                 return ret;
1500         }
1501
1502         /*
1503          * now we have an rbtree full of root_info objects, but we need to fill
1504          * in their path names within the subvol that is referencing each one.
1505          */
1506         ret = __list_subvol_fill_paths(fd, root_lookup);
1507         return ret;
1508 }
1509
1510 int btrfs_list_subvols_print(int fd, struct btrfs_list_filter_set *filter_set,
1511                        struct btrfs_list_comparer_set *comp_set,
1512                        int layout, int full_path, char *raw_prefix)
1513 {
1514         struct root_lookup root_lookup;
1515         struct root_lookup root_sort;
1516         int ret = 0;
1517         u64 top_id = 0;
1518
1519         if (full_path)
1520                 ret = btrfs_list_get_path_rootid(fd, &top_id);
1521         if (ret)
1522                 return ret;
1523
1524         ret = btrfs_list_subvols(fd, &root_lookup);
1525         if (ret)
1526                 return ret;
1527         __filter_and_sort_subvol(&root_lookup, &root_sort, filter_set,
1528                                  comp_set, top_id);
1529
1530         print_all_volume_info(&root_sort, layout, raw_prefix);
1531         __free_all_subvolumn(&root_lookup);
1532
1533         return 0;
1534 }
1535
1536 static char *strdup_or_null(const char *s)
1537 {
1538         if (!s)
1539                 return NULL;
1540         return strdup(s);
1541 }
1542
1543 int btrfs_get_subvol(int fd, struct root_info *the_ri)
1544 {
1545         int ret, rr;
1546         struct root_lookup rl;
1547         struct rb_node *rbn;
1548         struct root_info *ri;
1549         u64 root_id;
1550
1551         ret = btrfs_list_get_path_rootid(fd, &root_id);
1552         if (ret)
1553                 return ret;
1554
1555         ret = btrfs_list_subvols(fd, &rl);
1556         if (ret)
1557                 return ret;
1558
1559         rbn = rb_first(&rl.root);
1560         while(rbn) {
1561                 ri = rb_entry(rbn, struct root_info, rb_node);
1562                 rr = resolve_root(&rl, ri, root_id);
1563                 if (rr == -ENOENT) {
1564                         ret = -ENOENT;
1565                         rbn = rb_next(rbn);
1566                         continue;
1567                 }
1568                 if (!comp_entry_with_rootid(the_ri, ri, 0)) {
1569                         memcpy(the_ri, ri, offsetof(struct root_info, path));
1570                         the_ri->path = strdup_or_null(ri->path);
1571                         the_ri->name = strdup_or_null(ri->name);
1572                         the_ri->full_path = strdup_or_null(ri->full_path);
1573                         ret = 0;
1574                         break;
1575                 }
1576                 rbn = rb_next(rbn);
1577         }
1578         __free_all_subvolumn(&rl);
1579         return ret;
1580 }
1581
1582 static int print_one_extent(int fd, struct btrfs_ioctl_search_header *sh,
1583                             struct btrfs_file_extent_item *item,
1584                             u64 found_gen, u64 *cache_dirid,
1585                             char **cache_dir_name, u64 *cache_ino,
1586                             char **cache_full_name)
1587 {
1588         u64 len = 0;
1589         u64 disk_start = 0;
1590         u64 disk_offset = 0;
1591         u8 type;
1592         int compressed = 0;
1593         int flags = 0;
1594         char *name = NULL;
1595
1596         if (btrfs_search_header_objectid(sh) == *cache_ino) {
1597                 name = *cache_full_name;
1598         } else if (*cache_full_name) {
1599                 free(*cache_full_name);
1600                 *cache_full_name = NULL;
1601         }
1602         if (!name) {
1603                 name = ino_resolve(fd, btrfs_search_header_objectid(sh),
1604                                    cache_dirid,
1605                                    cache_dir_name);
1606                 *cache_full_name = name;
1607                 *cache_ino = btrfs_search_header_objectid(sh);
1608         }
1609         if (!name)
1610                 return -EIO;
1611
1612         type = btrfs_stack_file_extent_type(item);
1613         compressed = btrfs_stack_file_extent_compression(item);
1614
1615         if (type == BTRFS_FILE_EXTENT_REG ||
1616             type == BTRFS_FILE_EXTENT_PREALLOC) {
1617                 disk_start = btrfs_stack_file_extent_disk_bytenr(item);
1618                 disk_offset = btrfs_stack_file_extent_offset(item);
1619                 len = btrfs_stack_file_extent_num_bytes(item);
1620         } else if (type == BTRFS_FILE_EXTENT_INLINE) {
1621                 disk_start = 0;
1622                 disk_offset = 0;
1623                 len = btrfs_stack_file_extent_ram_bytes(item);
1624         } else {
1625                 printf("unhandled extent type %d for inode %llu "
1626                        "file offset %llu gen %llu\n",
1627                         type,
1628                         (unsigned long long)btrfs_search_header_objectid(sh),
1629                         (unsigned long long)btrfs_search_header_offset(sh),
1630                         (unsigned long long)found_gen);
1631
1632                 return -EIO;
1633         }
1634         printf("inode %llu file offset %llu len %llu disk start %llu "
1635                "offset %llu gen %llu flags ",
1636                (unsigned long long)btrfs_search_header_objectid(sh),
1637                (unsigned long long)btrfs_search_header_offset(sh),
1638                (unsigned long long)len,
1639                (unsigned long long)disk_start,
1640                (unsigned long long)disk_offset,
1641                (unsigned long long)found_gen);
1642
1643         if (compressed) {
1644                 printf("COMPRESS");
1645                 flags++;
1646         }
1647         if (type == BTRFS_FILE_EXTENT_PREALLOC) {
1648                 printf("%sPREALLOC", flags ? "|" : "");
1649                 flags++;
1650         }
1651         if (type == BTRFS_FILE_EXTENT_INLINE) {
1652                 printf("%sINLINE", flags ? "|" : "");
1653                 flags++;
1654         }
1655         if (!flags)
1656                 printf("NONE");
1657
1658         printf(" %s\n", name);
1659         return 0;
1660 }
1661
1662 int btrfs_list_find_updated_files(int fd, u64 root_id, u64 oldest_gen)
1663 {
1664         int ret;
1665         struct btrfs_ioctl_search_args args;
1666         struct btrfs_ioctl_search_key *sk = &args.key;
1667         struct btrfs_ioctl_search_header sh;
1668         struct btrfs_file_extent_item *item;
1669         unsigned long off = 0;
1670         u64 found_gen;
1671         u64 max_found = 0;
1672         int i;
1673         u64 cache_dirid = 0;
1674         u64 cache_ino = 0;
1675         char *cache_dir_name = NULL;
1676         char *cache_full_name = NULL;
1677         struct btrfs_file_extent_item backup;
1678
1679         memset(&backup, 0, sizeof(backup));
1680         memset(&args, 0, sizeof(args));
1681
1682         sk->tree_id = root_id;
1683
1684         /*
1685          * set all the other params to the max, we'll take any objectid
1686          * and any trans
1687          */
1688         sk->max_objectid = (u64)-1;
1689         sk->max_offset = (u64)-1;
1690         sk->max_transid = (u64)-1;
1691         sk->max_type = BTRFS_EXTENT_DATA_KEY;
1692         sk->min_transid = oldest_gen;
1693         /* just a big number, doesn't matter much */
1694         sk->nr_items = 4096;
1695
1696         max_found = find_root_gen(fd);
1697         while(1) {
1698                 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1699                 if (ret < 0) {
1700                         fprintf(stderr, "ERROR: can't perform the search - %s\n",
1701                                 strerror(errno));
1702                         break;
1703                 }
1704                 /* the ioctl returns the number of item it found in nr_items */
1705                 if (sk->nr_items == 0)
1706                         break;
1707
1708                 off = 0;
1709
1710                 /*
1711                  * for each item, pull the key out of the header and then
1712                  * read the root_ref item it contains
1713                  */
1714                 for (i = 0; i < sk->nr_items; i++) {
1715                         memcpy(&sh, args.buf + off, sizeof(sh));
1716                         off += sizeof(sh);
1717
1718                         /*
1719                          * just in case the item was too big, pass something other
1720                          * than garbage
1721                          */
1722                         if (sh.len == 0)
1723                                 item = &backup;
1724                         else
1725                                 item = (struct btrfs_file_extent_item *)(args.buf +
1726                                                                  off);
1727                         found_gen = btrfs_stack_file_extent_generation(item);
1728                         if (sh.type == BTRFS_EXTENT_DATA_KEY &&
1729                             found_gen >= oldest_gen) {
1730                                 print_one_extent(fd, &sh, item, found_gen,
1731                                                  &cache_dirid, &cache_dir_name,
1732                                                  &cache_ino, &cache_full_name);
1733                         }
1734                         off += sh.len;
1735
1736                         /*
1737                          * record the mins in sk so we can make sure the
1738                          * next search doesn't repeat this root
1739                          */
1740                         sk->min_objectid = sh.objectid;
1741                         sk->min_offset = sh.offset;
1742                         sk->min_type = sh.type;
1743                 }
1744                 sk->nr_items = 4096;
1745                 if (sk->min_offset < (u64)-1)
1746                         sk->min_offset++;
1747                 else if (sk->min_objectid < (u64)-1) {
1748                         sk->min_objectid++;
1749                         sk->min_offset = 0;
1750                         sk->min_type = 0;
1751                 } else
1752                         break;
1753         }
1754         free(cache_dir_name);
1755         free(cache_full_name);
1756         printf("transid marker was %llu\n", (unsigned long long)max_found);
1757         return ret;
1758 }
1759
1760 char *btrfs_list_path_for_root(int fd, u64 root)
1761 {
1762         struct root_lookup root_lookup;
1763         struct rb_node *n;
1764         char *ret_path = NULL;
1765         int ret;
1766         u64 top_id;
1767
1768         ret = btrfs_list_get_path_rootid(fd, &top_id);
1769         if (ret)
1770                 return ERR_PTR(ret);
1771
1772         ret = __list_subvol_search(fd, &root_lookup);
1773         if (ret < 0)
1774                 return ERR_PTR(ret);
1775
1776         ret = __list_subvol_fill_paths(fd, &root_lookup);
1777         if (ret < 0)
1778                 return ERR_PTR(ret);
1779
1780         n = rb_last(&root_lookup.root);
1781         while (n) {
1782                 struct root_info *entry;
1783
1784                 entry = rb_entry(n, struct root_info, rb_node);
1785                 ret = resolve_root(&root_lookup, entry, top_id);
1786                 if (ret == -ENOENT && entry->root_id == root) {
1787                         ret_path = NULL;
1788                         break;
1789                 }
1790                 if (entry->root_id == root) {
1791                         ret_path = entry->full_path;
1792                         entry->full_path = NULL;
1793                 }
1794
1795                 n = rb_prev(n);
1796         }
1797         __free_all_subvolumn(&root_lookup);
1798
1799         return ret_path;
1800 }
1801
1802 int btrfs_list_parse_sort_string(char *opt_arg,
1803                                  struct btrfs_list_comparer_set **comps)
1804 {
1805         int order;
1806         int flag;
1807         char *p;
1808         char **ptr_argv;
1809         int what_to_sort;
1810
1811         while ((p = strtok(opt_arg, ",")) != NULL) {
1812                 flag = 0;
1813                 ptr_argv = all_sort_items;
1814
1815                 while (*ptr_argv) {
1816                         if (strcmp(*ptr_argv, p) == 0) {
1817                                 flag = 1;
1818                                 break;
1819                         } else {
1820                                 p++;
1821                                 if (strcmp(*ptr_argv, p) == 0) {
1822                                         flag = 1;
1823                                         p--;
1824                                         break;
1825                                 }
1826                                 p--;
1827                         }
1828                         ptr_argv++;
1829                 }
1830
1831                 if (flag == 0)
1832                         return -1;
1833
1834                 else {
1835                         if (*p == '+') {
1836                                 order = 0;
1837                                 p++;
1838                         } else if (*p == '-') {
1839                                 order = 1;
1840                                 p++;
1841                         } else
1842                                 order = 0;
1843
1844                         what_to_sort = btrfs_list_get_sort_item(p);
1845                         btrfs_list_setup_comparer(comps, what_to_sort, order);
1846                 }
1847                 opt_arg = NULL;
1848         }
1849
1850         return 0;
1851 }
1852
1853 /*
1854  * This function is used to parse the argument of filter condition.
1855  *
1856  * type is the filter object.
1857  */
1858 int btrfs_list_parse_filter_string(char *opt_arg,
1859                                    struct btrfs_list_filter_set **filters,
1860                                    enum btrfs_list_filter_enum type)
1861 {
1862
1863         u64 arg;
1864
1865         switch (*(opt_arg++)) {
1866         case '+':
1867                 arg = arg_strtou64(opt_arg);
1868                 type += 2;
1869
1870                 btrfs_list_setup_filter(filters, type, arg);
1871                 break;
1872         case '-':
1873                 arg = arg_strtou64(opt_arg);
1874                 type += 1;
1875
1876                 btrfs_list_setup_filter(filters, type, arg);
1877                 break;
1878         default:
1879                 opt_arg--;
1880                 arg = arg_strtou64(opt_arg);
1881
1882                 btrfs_list_setup_filter(filters, type, arg);
1883                 break;
1884         }
1885
1886         return 0;
1887 }
1888
1889 int btrfs_list_get_path_rootid(int fd, u64 *treeid)
1890 {
1891         int ret;
1892
1893         ret = lookup_path_rootid(fd, treeid);
1894         if (ret < 0)
1895                 error("cannot resolve rootid for path: %s",
1896                         strerror(errno));
1897
1898         return ret;
1899 }