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