2 * Copyright (C) 2010 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
21 #include <sys/ioctl.h>
22 #include <sys/mount.h>
27 #include <sys/types.h>
34 #include "transaction.h"
36 #include <uuid/uuid.h>
37 #include "btrfs-list.h"
39 #define BTRFS_LIST_NFILTERS_INCREASE (2 * BTRFS_LIST_FILTER_MAX)
40 #define BTRFS_LIST_NCOMPS_INCREASE (2 * BTRFS_LIST_COMP_MAX)
42 /* we store all the roots we find in an rbtree so that we can
43 * search for them later.
50 * one of these for each root we find.
53 struct rb_node rb_node;
54 struct rb_node sort_node;
59 /* equal the offset of the root's key */
62 /* flags of the root */
65 /* the id of the root that references this one */
68 /* the dir id we're in from ref_tree */
73 /* generation when the root is created or last updated */
76 /* creation generation of this root in sec*/
79 /* creation time of this root in sec*/
82 u8 uuid[BTRFS_UUID_SIZE];
84 /* path from the subvol we live in to this root, including the
85 * root's name. This is null until we do the extra lookup ioctl.
89 /* the name of this root in the directory it lives in */
99 } btrfs_list_columns[] = {
107 .column_name = "Gen",
112 .column_name = "CGen",
117 .column_name = "Parent",
122 .column_name = "Top Level",
127 .column_name = "OTime",
132 .column_name = "UUID",
137 .column_name = "Path",
147 static btrfs_list_filter_func all_filter_funcs[];
148 static btrfs_list_comp_func all_comp_funcs[];
150 void btrfs_list_setup_print_column(enum btrfs_list_column_enum column)
154 BUG_ON(column < 0 || column > BTRFS_LIST_ALL);
156 if (column < BTRFS_LIST_ALL) {
157 btrfs_list_columns[column].need_print = 1;
161 for (i = 0; i < BTRFS_LIST_ALL; i++)
162 btrfs_list_columns[i].need_print = 1;
165 static void root_lookup_init(struct root_lookup *tree)
167 tree->root.rb_node = NULL;
170 static int comp_entry_with_rootid(struct root_info *entry1,
171 struct root_info *entry2,
176 if (entry1->root_id > entry2->root_id)
178 else if (entry1->root_id < entry2->root_id)
183 return is_descending ? -ret : ret;
186 static int comp_entry_with_gen(struct root_info *entry1,
187 struct root_info *entry2,
192 if (entry1->gen > entry2->gen)
194 else if (entry1->gen < entry2->gen)
199 return is_descending ? -ret : ret;
202 static int comp_entry_with_ogen(struct root_info *entry1,
203 struct root_info *entry2,
208 if (entry1->ogen > entry2->ogen)
210 else if (entry1->ogen < entry2->ogen)
215 return is_descending ? -ret : ret;
218 static int comp_entry_with_path(struct root_info *entry1,
219 struct root_info *entry2,
224 if (strcmp(entry1->full_path, entry2->full_path) > 0)
226 else if (strcmp(entry1->full_path, entry2->full_path) < 0)
231 return is_descending ? -ret : ret;
234 static btrfs_list_comp_func all_comp_funcs[] = {
235 [BTRFS_LIST_COMP_ROOTID] = comp_entry_with_rootid,
236 [BTRFS_LIST_COMP_OGEN] = comp_entry_with_ogen,
237 [BTRFS_LIST_COMP_GEN] = comp_entry_with_gen,
238 [BTRFS_LIST_COMP_PATH] = comp_entry_with_path,
241 static char *all_sort_items[] = {
242 [BTRFS_LIST_COMP_ROOTID] = "rootid",
243 [BTRFS_LIST_COMP_OGEN] = "ogen",
244 [BTRFS_LIST_COMP_GEN] = "gen",
245 [BTRFS_LIST_COMP_PATH] = "path",
246 [BTRFS_LIST_COMP_MAX] = NULL,
249 static int btrfs_list_get_sort_item(char *sort_name)
253 for (i = 0; i < BTRFS_LIST_COMP_MAX; i++) {
254 if (strcmp(sort_name, all_sort_items[i]) == 0)
260 struct btrfs_list_comparer_set *btrfs_list_alloc_comparer_set(void)
262 struct btrfs_list_comparer_set *set;
265 size = sizeof(struct btrfs_list_comparer_set) +
266 BTRFS_LIST_NCOMPS_INCREASE * sizeof(struct btrfs_list_comparer);
269 fprintf(stderr, "memory allocation failed\n");
273 memset(set, 0, size);
274 set->total = BTRFS_LIST_NCOMPS_INCREASE;
279 void btrfs_list_free_comparer_set(struct btrfs_list_comparer_set *comp_set)
284 int btrfs_list_setup_comparer(struct btrfs_list_comparer_set **comp_set,
285 enum btrfs_list_comp_enum comparer,
288 struct btrfs_list_comparer_set *set = *comp_set;
292 BUG_ON(comparer >= BTRFS_LIST_COMP_MAX);
293 BUG_ON(set->ncomps > set->total);
295 if (set->ncomps == set->total) {
296 size = set->total + BTRFS_LIST_NCOMPS_INCREASE;
297 size = sizeof(*set) + size * sizeof(struct btrfs_list_comparer);
298 set = realloc(set, size);
300 fprintf(stderr, "memory allocation failed\n");
304 memset(&set->comps[set->total], 0,
305 BTRFS_LIST_NCOMPS_INCREASE *
306 sizeof(struct btrfs_list_comparer));
307 set->total += BTRFS_LIST_NCOMPS_INCREASE;
311 BUG_ON(set->comps[set->ncomps].comp_func);
313 set->comps[set->ncomps].comp_func = all_comp_funcs[comparer];
314 set->comps[set->ncomps].is_descending = is_descending;
319 static int sort_comp(struct root_info *entry1, struct root_info *entry2,
320 struct btrfs_list_comparer_set *set)
322 int rootid_compared = 0;
325 if (!set || !set->ncomps)
328 for (i = 0; i < set->ncomps; i++) {
329 if (!set->comps[i].comp_func)
332 ret = set->comps[i].comp_func(entry1, entry2,
333 set->comps[i].is_descending);
337 if (set->comps[i].comp_func == comp_entry_with_rootid)
341 if (!rootid_compared) {
343 ret = comp_entry_with_rootid(entry1, entry2, 0);
349 static int sort_tree_insert(struct root_lookup *sort_tree,
350 struct root_info *ins,
351 struct btrfs_list_comparer_set *comp_set)
353 struct rb_node **p = &sort_tree->root.rb_node;
354 struct rb_node *parent = NULL;
355 struct root_info *curr;
360 curr = rb_entry(parent, struct root_info, sort_node);
362 ret = sort_comp(ins, curr, comp_set);
371 rb_link_node(&ins->sort_node, parent, p);
372 rb_insert_color(&ins->sort_node, &sort_tree->root);
377 * insert a new root into the tree. returns the existing root entry
378 * if one is already there. Both root_id and ref_tree are used
381 static int root_tree_insert(struct root_lookup *root_tree,
382 struct root_info *ins)
384 struct rb_node **p = &root_tree->root.rb_node;
385 struct rb_node * parent = NULL;
386 struct root_info *curr;
391 curr = rb_entry(parent, struct root_info, rb_node);
393 ret = comp_entry_with_rootid(ins, curr, 0);
402 rb_link_node(&ins->rb_node, parent, p);
403 rb_insert_color(&ins->rb_node, &root_tree->root);
408 * find a given root id in the tree. We return the smallest one,
409 * rb_next can be used to move forward looking for more if required
411 static struct root_info *root_tree_search(struct root_lookup *root_tree,
414 struct rb_node *n = root_tree->root.rb_node;
415 struct root_info *entry;
416 struct root_info tmp;
419 tmp.root_id = root_id;
422 entry = rb_entry(n, struct root_info, rb_node);
424 ret = comp_entry_with_rootid(&tmp, entry, 0);
435 static int update_root(struct root_lookup *root_lookup,
436 u64 root_id, u64 ref_tree, u64 root_offset, u64 flags,
437 u64 dir_id, char *name, int name_len, u64 ogen, u64 gen,
438 time_t ot, void *uuid)
440 struct root_info *ri;
442 ri = root_tree_search(root_lookup, root_id);
443 if (!ri || ri->root_id != root_id)
445 if (name && name_len > 0) {
449 ri->name = malloc(name_len + 1);
451 fprintf(stderr, "memory allocation failed\n");
454 strncpy(ri->name, name, name_len);
455 ri->name[name_len] = 0;
458 ri->ref_tree = ref_tree;
460 ri->root_offset = root_offset;
469 if (!ri->ogen && root_offset)
470 ri->ogen = root_offset;
474 memcpy(&ri->uuid, uuid, BTRFS_UUID_SIZE);
480 * add_root - update the existed root, or allocate a new root and insert it
481 * into the lookup tree.
482 * root_id: object id of the root
483 * ref_tree: object id of the referring root.
484 * root_offset: offset value of the root'key
485 * dir_id: inode id of the directory in ref_tree where this root can be found.
486 * name: the name of root_id in that directory
487 * name_len: the length of name
488 * ogen: the original generation of the root
489 * gen: the current generation of the root
490 * ot: the original time(create time) of the root
491 * uuid: uuid of the root
493 static int add_root(struct root_lookup *root_lookup,
494 u64 root_id, u64 ref_tree, u64 root_offset, u64 flags,
495 u64 dir_id, char *name, int name_len, u64 ogen, u64 gen,
496 time_t ot, void *uuid)
498 struct root_info *ri;
501 ret = update_root(root_lookup, root_id, ref_tree, root_offset, flags,
502 dir_id, name, name_len, ogen, gen, ot, uuid);
506 ri = malloc(sizeof(*ri));
508 printf("memory allocation failed\n");
511 memset(ri, 0, sizeof(*ri));
512 ri->root_id = root_id;
514 if (name && name_len > 0) {
515 ri->name = malloc(name_len + 1);
517 fprintf(stderr, "memory allocation failed\n");
520 strncpy(ri->name, name, name_len);
521 ri->name[name_len] = 0;
524 ri->ref_tree = ref_tree;
528 ri->root_offset = root_offset;
535 if (!ri->ogen && root_offset)
536 ri->ogen = root_offset;
541 memcpy(&ri->uuid, uuid, BTRFS_UUID_SIZE);
543 ret = root_tree_insert(root_lookup, ri);
545 printf("failed to insert tree %llu\n", (unsigned long long)root_id);
551 void __free_root_info(struct root_info *ri)
565 void __free_all_subvolumn(struct root_lookup *root_tree)
567 struct root_info *entry;
570 n = rb_first(&root_tree->root);
572 entry = rb_entry(n, struct root_info, rb_node);
573 rb_erase(n, &root_tree->root);
574 __free_root_info(entry);
576 n = rb_first(&root_tree->root);
581 * for a given root_info, search through the root_lookup tree to construct
582 * the full path name to it.
584 * This can't be called until all the root_info->path fields are filled
585 * in by lookup_ino_path
587 static int resolve_root(struct root_lookup *rl, struct root_info *ri,
590 char *full_path = NULL;
592 struct root_info *found;
595 * we go backwards from the root_info object and add pathnames
596 * from parent directories as we go.
602 int add_len = strlen(found->path);
604 /* room for / and for null */
605 tmp = malloc(add_len + 2 + len);
607 perror("malloc failed");
611 memcpy(tmp + add_len + 1, full_path, len);
613 memcpy(tmp, found->path, add_len);
614 tmp [add_len + len + 1] = '\0';
619 full_path = strdup(found->path);
623 next = found->ref_tree;
625 if (next == top_id) {
630 /* if the ref_tree refers to ourselves, we're at the top */
631 if (next == found->root_id) {
637 * if the ref_tree wasn't in our tree of roots, we're
640 found = root_tree_search(rl, next);
647 ri->full_path = full_path;
653 * for a single root_info, ask the kernel to give us a path name
654 * inside it's ref_root for the dir_id where it lives.
656 * This fills in root_info->path with the path to the directory and and
657 * appends this root's name.
659 static int lookup_ino_path(int fd, struct root_info *ri)
661 struct btrfs_ioctl_ino_lookup_args args;
667 memset(&args, 0, sizeof(args));
668 args.treeid = ri->ref_tree;
669 args.objectid = ri->dir_id;
671 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
674 fprintf(stderr, "ERROR: Failed to lookup path for root %llu - %s\n",
675 (unsigned long long)ri->ref_tree,
682 * we're in a subdirectory of ref_tree, the kernel ioctl
683 * puts a / in there for us
685 ri->path = malloc(strlen(ri->name) + strlen(args.name) + 1);
687 perror("malloc failed");
690 strcpy(ri->path, args.name);
691 strcat(ri->path, ri->name);
693 /* we're at the root of ref_tree */
694 ri->path = strdup(ri->name);
696 perror("strdup failed");
703 /* finding the generation for a given path is a two step process.
704 * First we use the inode loookup routine to find out the root id
706 * Then we use the tree search ioctl to scan all the root items for a
707 * given root id and spit out the latest generation we can find
709 static u64 find_root_gen(int fd)
711 struct btrfs_ioctl_ino_lookup_args ino_args;
713 struct btrfs_ioctl_search_args args;
714 struct btrfs_ioctl_search_key *sk = &args.key;
715 struct btrfs_ioctl_search_header *sh;
716 unsigned long off = 0;
721 memset(&ino_args, 0, sizeof(ino_args));
722 ino_args.objectid = BTRFS_FIRST_FREE_OBJECTID;
724 /* this ioctl fills in ino_args->treeid */
725 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &ino_args);
728 fprintf(stderr, "ERROR: Failed to lookup path for dirid %llu - %s\n",
729 (unsigned long long)BTRFS_FIRST_FREE_OBJECTID,
734 memset(&args, 0, sizeof(args));
739 * there may be more than one ROOT_ITEM key if there are
740 * snapshots pending deletion, we have to loop through
743 sk->min_objectid = ino_args.treeid;
744 sk->max_objectid = ino_args.treeid;
745 sk->max_type = BTRFS_ROOT_ITEM_KEY;
746 sk->min_type = BTRFS_ROOT_ITEM_KEY;
747 sk->max_offset = (u64)-1;
748 sk->max_transid = (u64)-1;
752 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
755 fprintf(stderr, "ERROR: can't perform the search - %s\n",
759 /* the ioctl returns the number of item it found in nr_items */
760 if (sk->nr_items == 0)
764 for (i = 0; i < sk->nr_items; i++) {
765 struct btrfs_root_item *item;
766 sh = (struct btrfs_ioctl_search_header *)(args.buf +
770 item = (struct btrfs_root_item *)(args.buf + off);
773 sk->min_objectid = sh->objectid;
774 sk->min_type = sh->type;
775 sk->min_offset = sh->offset;
777 if (sh->objectid > ino_args.treeid)
780 if (sh->objectid == ino_args.treeid &&
781 sh->type == BTRFS_ROOT_ITEM_KEY) {
782 max_found = max(max_found,
783 btrfs_root_generation(item));
786 if (sk->min_offset < (u64)-1)
791 if (sk->min_type != BTRFS_ROOT_ITEM_KEY)
793 if (sk->min_objectid != BTRFS_ROOT_ITEM_KEY)
799 /* pass in a directory id and this will return
800 * the full path of the parent directory inside its
803 * It may return NULL if it is in the root, or an ERR_PTR if things
806 static char *__ino_resolve(int fd, u64 dirid)
808 struct btrfs_ioctl_ino_lookup_args args;
813 memset(&args, 0, sizeof(args));
814 args.objectid = dirid;
816 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
819 fprintf(stderr, "ERROR: Failed to lookup path for dirid %llu - %s\n",
820 (unsigned long long)dirid, strerror(e) );
826 * we're in a subdirectory of ref_tree, the kernel ioctl
827 * puts a / in there for us
829 full = strdup(args.name);
831 perror("malloc failed");
832 return ERR_PTR(-ENOMEM);
835 /* we're at the root of ref_tree */
842 * simple string builder, returning a new string with both
845 char *build_name(char *dirid, char *name)
851 full = malloc(strlen(dirid) + strlen(name) + 1);
860 * given an inode number, this returns the full path name inside the subvolume
861 * to that file/directory. cache_dirid and cache_name are used to
862 * cache the results so we can avoid tree searches if a later call goes
863 * to the same directory or file name
865 static char *ino_resolve(int fd, u64 ino, u64 *cache_dirid, char **cache_name)
873 struct btrfs_ioctl_search_args args;
874 struct btrfs_ioctl_search_key *sk = &args.key;
875 struct btrfs_ioctl_search_header *sh;
876 unsigned long off = 0;
880 memset(&args, 0, sizeof(args));
885 * step one, we search for the inode back ref. We just use the first
888 sk->min_objectid = ino;
889 sk->max_objectid = ino;
890 sk->max_type = BTRFS_INODE_REF_KEY;
891 sk->max_offset = (u64)-1;
892 sk->min_type = BTRFS_INODE_REF_KEY;
893 sk->max_transid = (u64)-1;
896 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
899 fprintf(stderr, "ERROR: can't perform the search - %s\n",
903 /* the ioctl returns the number of item it found in nr_items */
904 if (sk->nr_items == 0)
908 sh = (struct btrfs_ioctl_search_header *)(args.buf + off);
910 if (sh->type == BTRFS_INODE_REF_KEY) {
911 struct btrfs_inode_ref *ref;
914 ref = (struct btrfs_inode_ref *)(sh + 1);
915 namelen = btrfs_stack_inode_ref_name_len(ref);
917 name = (char *)(ref + 1);
918 name = strndup(name, namelen);
920 /* use our cached value */
921 if (dirid == *cache_dirid && *cache_name) {
922 dirname = *cache_name;
929 * the inode backref gives us the file name and the parent directory id.
930 * From here we use __ino_resolve to get the path to the parent
932 dirname = __ino_resolve(fd, dirid);
934 full = build_name(dirname, name);
935 if (*cache_name && dirname != *cache_name)
938 *cache_name = dirname;
939 *cache_dirid = dirid;
945 int btrfs_list_get_default_subvolume(int fd, u64 *default_id)
947 struct btrfs_ioctl_search_args args;
948 struct btrfs_ioctl_search_key *sk = &args.key;
949 struct btrfs_ioctl_search_header *sh;
953 memset(&args, 0, sizeof(args));
956 * search for a dir item with a name 'default' in the tree of
957 * tree roots, it should point us to a default root
961 /* don't worry about ancient format and request only one item */
964 sk->max_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
965 sk->min_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
966 sk->max_type = BTRFS_DIR_ITEM_KEY;
967 sk->min_type = BTRFS_DIR_ITEM_KEY;
968 sk->max_offset = (u64)-1;
969 sk->max_transid = (u64)-1;
971 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
975 /* the ioctl returns the number of items it found in nr_items */
976 if (sk->nr_items == 0)
979 sh = (struct btrfs_ioctl_search_header *)args.buf;
981 if (sh->type == BTRFS_DIR_ITEM_KEY) {
982 struct btrfs_dir_item *di;
986 di = (struct btrfs_dir_item *)(sh + 1);
987 name_len = btrfs_stack_dir_name_len(di);
988 name = (char *)(di + 1);
990 if (!strncmp("default", name, name_len))
991 found = btrfs_disk_key_objectid(&di->location);
999 static int __list_subvol_search(int fd, struct root_lookup *root_lookup)
1002 struct btrfs_ioctl_search_args args;
1003 struct btrfs_ioctl_search_key *sk = &args.key;
1004 struct btrfs_ioctl_search_header *sh;
1005 struct btrfs_root_ref *ref;
1006 struct btrfs_root_item *ri;
1007 unsigned long off = 0;
1016 u8 uuid[BTRFS_UUID_SIZE];
1018 root_lookup_init(root_lookup);
1019 memset(&args, 0, sizeof(args));
1021 /* search in the tree of tree roots */
1025 * set the min and max to backref keys. The search will
1026 * only send back this type of key now.
1028 sk->max_type = BTRFS_ROOT_BACKREF_KEY;
1029 sk->min_type = BTRFS_ROOT_ITEM_KEY;
1031 sk->min_objectid = BTRFS_FIRST_FREE_OBJECTID;
1034 * set all the other params to the max, we'll take any objectid
1037 sk->max_objectid = BTRFS_LAST_FREE_OBJECTID;
1038 sk->max_offset = (u64)-1;
1039 sk->max_transid = (u64)-1;
1041 /* just a big number, doesn't matter much */
1042 sk->nr_items = 4096;
1045 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1048 /* the ioctl returns the number of item it found in nr_items */
1049 if (sk->nr_items == 0)
1055 * for each item, pull the key out of the header and then
1056 * read the root_ref item it contains
1058 for (i = 0; i < sk->nr_items; i++) {
1059 sh = (struct btrfs_ioctl_search_header *)(args.buf +
1062 if (sh->type == BTRFS_ROOT_BACKREF_KEY) {
1063 ref = (struct btrfs_root_ref *)(args.buf + off);
1064 name_len = btrfs_stack_root_ref_name_len(ref);
1065 name = (char *)(ref + 1);
1066 dir_id = btrfs_stack_root_ref_dirid(ref);
1068 add_root(root_lookup, sh->objectid, sh->offset,
1069 0, 0, dir_id, name, name_len, 0, 0, 0,
1071 } else if (sh->type == BTRFS_ROOT_ITEM_KEY) {
1072 ri = (struct btrfs_root_item *)(args.buf + off);
1073 gen = btrfs_root_generation(ri);
1074 flags = btrfs_root_flags(ri);
1076 sizeof(struct btrfs_root_item_v0)) {
1078 ogen = btrfs_root_otransid(ri);
1079 memcpy(uuid, ri->uuid, BTRFS_UUID_SIZE);
1083 memset(uuid, 0, BTRFS_UUID_SIZE);
1086 add_root(root_lookup, sh->objectid, 0,
1087 sh->offset, flags, 0, NULL, 0, ogen,
1094 * record the mins in sk so we can make sure the
1095 * next search doesn't repeat this root
1097 sk->min_objectid = sh->objectid;
1098 sk->min_type = sh->type;
1099 sk->min_offset = sh->offset;
1101 sk->nr_items = 4096;
1103 if (!sk->min_offset) /* overflow */
1108 if (sk->min_type > BTRFS_ROOT_BACKREF_KEY) {
1109 sk->min_type = BTRFS_ROOT_ITEM_KEY;
1114 if (sk->min_objectid > sk->max_objectid)
1121 static int filter_by_rootid(struct root_info *ri, u64 data)
1123 return ri->root_id == data;
1126 static int filter_snapshot(struct root_info *ri, u64 data)
1128 return !!ri->root_offset;
1131 static int filter_flags(struct root_info *ri, u64 flags)
1133 return ri->flags & flags;
1136 static int filter_gen_more(struct root_info *ri, u64 data)
1138 return ri->gen >= data;
1141 static int filter_gen_less(struct root_info *ri, u64 data)
1143 return ri->gen <= data;
1146 static int filter_gen_equal(struct root_info *ri, u64 data)
1148 return ri->gen == data;
1151 static int filter_cgen_more(struct root_info *ri, u64 data)
1153 return ri->ogen >= data;
1156 static int filter_cgen_less(struct root_info *ri, u64 data)
1158 return ri->ogen <= data;
1161 static int filter_cgen_equal(struct root_info *ri, u64 data)
1163 return ri->ogen == data;
1166 static int filter_topid_equal(struct root_info *ri, u64 data)
1168 return ri->top_id == data;
1171 static btrfs_list_filter_func all_filter_funcs[] = {
1172 [BTRFS_LIST_FILTER_ROOTID] = filter_by_rootid,
1173 [BTRFS_LIST_FILTER_SNAPSHOT_ONLY] = filter_snapshot,
1174 [BTRFS_LIST_FILTER_FLAGS] = filter_flags,
1175 [BTRFS_LIST_FILTER_GEN_MORE] = filter_gen_more,
1176 [BTRFS_LIST_FILTER_GEN_LESS] = filter_gen_less,
1177 [BTRFS_LIST_FILTER_GEN_EQUAL] = filter_gen_equal,
1178 [BTRFS_LIST_FILTER_CGEN_MORE] = filter_cgen_more,
1179 [BTRFS_LIST_FILTER_CGEN_LESS] = filter_cgen_less,
1180 [BTRFS_LIST_FILTER_CGEN_EQUAL] = filter_cgen_equal,
1181 [BTRFS_LIST_FILTER_TOPID_EQUAL] = filter_topid_equal,
1184 struct btrfs_list_filter_set *btrfs_list_alloc_filter_set(void)
1186 struct btrfs_list_filter_set *set;
1189 size = sizeof(struct btrfs_list_filter_set) +
1190 BTRFS_LIST_NFILTERS_INCREASE * sizeof(struct btrfs_list_filter);
1193 fprintf(stderr, "memory allocation failed\n");
1197 memset(set, 0, size);
1198 set->total = BTRFS_LIST_NFILTERS_INCREASE;
1203 void btrfs_list_free_filter_set(struct btrfs_list_filter_set *filter_set)
1208 int btrfs_list_setup_filter(struct btrfs_list_filter_set **filter_set,
1209 enum btrfs_list_filter_enum filter, u64 data)
1211 struct btrfs_list_filter_set *set = *filter_set;
1215 BUG_ON(filter >= BTRFS_LIST_FILTER_MAX);
1216 BUG_ON(set->nfilters > set->total);
1218 if (set->nfilters == set->total) {
1219 size = set->total + BTRFS_LIST_NFILTERS_INCREASE;
1220 size = sizeof(*set) + size * sizeof(struct btrfs_list_filter);
1221 set = realloc(set, size);
1223 fprintf(stderr, "memory allocation failed\n");
1227 memset(&set->filters[set->total], 0,
1228 BTRFS_LIST_NFILTERS_INCREASE *
1229 sizeof(struct btrfs_list_filter));
1230 set->total += BTRFS_LIST_NFILTERS_INCREASE;
1234 BUG_ON(set->filters[set->nfilters].filter_func);
1236 set->filters[set->nfilters].filter_func = all_filter_funcs[filter];
1237 set->filters[set->nfilters].data = data;
1242 static int filter_root(struct root_info *ri,
1243 struct btrfs_list_filter_set *set)
1247 if (!set || !set->nfilters)
1250 for (i = 0; i < set->nfilters; i++) {
1251 if (!set->filters[i].filter_func)
1253 ret = set->filters[i].filter_func(ri, set->filters[i].data);
1260 static void __filter_and_sort_subvol(struct root_lookup *all_subvols,
1261 struct root_lookup *sort_tree,
1262 struct btrfs_list_filter_set *filter_set,
1263 struct btrfs_list_comparer_set *comp_set,
1267 struct root_info *entry;
1269 u64 top_id = btrfs_list_get_path_rootid(fd);
1271 root_lookup_init(sort_tree);
1273 n = rb_last(&all_subvols->root);
1275 entry = rb_entry(n, struct root_info, rb_node);
1277 resolve_root(all_subvols, entry, top_id);
1278 ret = filter_root(entry, filter_set);
1280 sort_tree_insert(sort_tree, entry, comp_set);
1285 static int __list_subvol_fill_paths(int fd, struct root_lookup *root_lookup)
1289 n = rb_first(&root_lookup->root);
1291 struct root_info *entry;
1293 entry = rb_entry(n, struct root_info, rb_node);
1294 ret = lookup_ino_path(fd, entry);
1303 static void print_subvolume_column(struct root_info *subv,
1304 enum btrfs_list_column_enum column)
1309 BUG_ON(column >= BTRFS_LIST_ALL || column < 0);
1312 case BTRFS_LIST_OBJECTID:
1313 printf("%llu", subv->root_id);
1315 case BTRFS_LIST_GENERATION:
1316 printf("%llu", subv->gen);
1318 case BTRFS_LIST_OGENERATION:
1319 printf("%llu", subv->ogen);
1321 case BTRFS_LIST_PARENT:
1322 printf("%llu", subv->ref_tree);
1324 case BTRFS_LIST_TOP_LEVEL:
1325 printf("%llu", subv->top_id);
1327 case BTRFS_LIST_OTIME:
1329 strftime(tstr, 256, "%Y-%m-%d %X",
1330 localtime(&subv->otime));
1335 case BTRFS_LIST_UUID:
1336 if (uuid_is_null(subv->uuid))
1337 strcpy(uuidparse, "-");
1339 uuid_unparse(subv->uuid, uuidparse);
1340 printf("%s", uuidparse);
1342 case BTRFS_LIST_PATH:
1343 BUG_ON(!subv->full_path);
1344 printf("%s", subv->full_path);
1351 static void print_single_volume_info_table(struct root_info *subv)
1355 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1356 if (!btrfs_list_columns[i].need_print)
1359 print_subvolume_column(subv, i);
1361 if (i != BTRFS_LIST_PATH)
1364 if (i == BTRFS_LIST_TOP_LEVEL)
1370 static void print_single_volume_info_default(struct root_info *subv)
1374 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1375 if (!btrfs_list_columns[i].need_print)
1378 printf("%s ", btrfs_list_columns[i].name);
1379 print_subvolume_column(subv, i);
1381 if (i != BTRFS_LIST_PATH)
1387 static void print_all_volume_info_tab_head()
1393 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1394 if (btrfs_list_columns[i].need_print)
1395 printf("%s\t", btrfs_list_columns[i].name);
1397 if (i == BTRFS_LIST_ALL-1)
1401 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1402 memset(barrier, 0, sizeof(barrier));
1404 if (btrfs_list_columns[i].need_print) {
1405 len = strlen(btrfs_list_columns[i].name);
1407 strcat(barrier, "-");
1409 printf("%s\t", barrier);
1411 if (i == BTRFS_LIST_ALL-1)
1416 static void print_all_volume_info(struct root_lookup *sorted_tree,
1420 struct root_info *entry;
1423 print_all_volume_info_tab_head();
1425 n = rb_first(&sorted_tree->root);
1427 entry = rb_entry(n, struct root_info, sort_node);
1429 print_single_volume_info_table(entry);
1431 print_single_volume_info_default(entry);
1436 int btrfs_list_subvols(int fd, struct btrfs_list_filter_set *filter_set,
1437 struct btrfs_list_comparer_set *comp_set,
1440 struct root_lookup root_lookup;
1441 struct root_lookup root_sort;
1444 ret = __list_subvol_search(fd, &root_lookup);
1446 fprintf(stderr, "ERROR: can't perform the search - %s\n",
1452 * now we have an rbtree full of root_info objects, but we need to fill
1453 * in their path names within the subvol that is referencing each one.
1455 ret = __list_subvol_fill_paths(fd, &root_lookup);
1459 __filter_and_sort_subvol(&root_lookup, &root_sort, filter_set,
1462 print_all_volume_info(&root_sort, is_tab_result);
1463 __free_all_subvolumn(&root_lookup);
1467 static int print_one_extent(int fd, struct btrfs_ioctl_search_header *sh,
1468 struct btrfs_file_extent_item *item,
1469 u64 found_gen, u64 *cache_dirid,
1470 char **cache_dir_name, u64 *cache_ino,
1471 char **cache_full_name)
1475 u64 disk_offset = 0;
1481 if (sh->objectid == *cache_ino) {
1482 name = *cache_full_name;
1483 } else if (*cache_full_name) {
1484 free(*cache_full_name);
1485 *cache_full_name = NULL;
1488 name = ino_resolve(fd, sh->objectid, cache_dirid,
1490 *cache_full_name = name;
1491 *cache_ino = sh->objectid;
1496 type = btrfs_stack_file_extent_type(item);
1497 compressed = btrfs_stack_file_extent_compression(item);
1499 if (type == BTRFS_FILE_EXTENT_REG ||
1500 type == BTRFS_FILE_EXTENT_PREALLOC) {
1501 disk_start = btrfs_stack_file_extent_disk_bytenr(item);
1502 disk_offset = btrfs_stack_file_extent_offset(item);
1503 len = btrfs_stack_file_extent_num_bytes(item);
1504 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
1507 len = btrfs_stack_file_extent_ram_bytes(item);
1509 printf("unhandled extent type %d for inode %llu "
1510 "file offset %llu gen %llu\n",
1512 (unsigned long long)sh->objectid,
1513 (unsigned long long)sh->offset,
1514 (unsigned long long)found_gen);
1518 printf("inode %llu file offset %llu len %llu disk start %llu "
1519 "offset %llu gen %llu flags ",
1520 (unsigned long long)sh->objectid,
1521 (unsigned long long)sh->offset,
1522 (unsigned long long)len,
1523 (unsigned long long)disk_start,
1524 (unsigned long long)disk_offset,
1525 (unsigned long long)found_gen);
1531 if (type == BTRFS_FILE_EXTENT_PREALLOC) {
1532 printf("%sPREALLOC", flags ? "|" : "");
1535 if (type == BTRFS_FILE_EXTENT_INLINE) {
1536 printf("%sINLINE", flags ? "|" : "");
1542 printf(" %s\n", name);
1546 int btrfs_list_find_updated_files(int fd, u64 root_id, u64 oldest_gen)
1549 struct btrfs_ioctl_search_args args;
1550 struct btrfs_ioctl_search_key *sk = &args.key;
1551 struct btrfs_ioctl_search_header *sh;
1552 struct btrfs_file_extent_item *item;
1553 unsigned long off = 0;
1558 u64 cache_dirid = 0;
1560 char *cache_dir_name = NULL;
1561 char *cache_full_name = NULL;
1562 struct btrfs_file_extent_item backup;
1564 memset(&backup, 0, sizeof(backup));
1565 memset(&args, 0, sizeof(args));
1567 sk->tree_id = root_id;
1570 * set all the other params to the max, we'll take any objectid
1573 sk->max_objectid = (u64)-1;
1574 sk->max_offset = (u64)-1;
1575 sk->max_transid = (u64)-1;
1576 sk->max_type = BTRFS_EXTENT_DATA_KEY;
1577 sk->min_transid = oldest_gen;
1578 /* just a big number, doesn't matter much */
1579 sk->nr_items = 4096;
1581 max_found = find_root_gen(fd);
1583 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1586 fprintf(stderr, "ERROR: can't perform the search- %s\n",
1590 /* the ioctl returns the number of item it found in nr_items */
1591 if (sk->nr_items == 0)
1597 * for each item, pull the key out of the header and then
1598 * read the root_ref item it contains
1600 for (i = 0; i < sk->nr_items; i++) {
1601 sh = (struct btrfs_ioctl_search_header *)(args.buf +
1606 * just in case the item was too big, pass something other
1612 item = (struct btrfs_file_extent_item *)(args.buf +
1614 found_gen = btrfs_stack_file_extent_generation(item);
1615 if (sh->type == BTRFS_EXTENT_DATA_KEY &&
1616 found_gen >= oldest_gen) {
1617 print_one_extent(fd, sh, item, found_gen,
1618 &cache_dirid, &cache_dir_name,
1619 &cache_ino, &cache_full_name);
1624 * record the mins in sk so we can make sure the
1625 * next search doesn't repeat this root
1627 sk->min_objectid = sh->objectid;
1628 sk->min_offset = sh->offset;
1629 sk->min_type = sh->type;
1631 sk->nr_items = 4096;
1632 if (sk->min_offset < (u64)-1)
1634 else if (sk->min_objectid < (u64)-1) {
1641 free(cache_dir_name);
1642 free(cache_full_name);
1643 printf("transid marker was %llu\n", (unsigned long long)max_found);
1647 char *btrfs_list_path_for_root(int fd, u64 root)
1649 struct root_lookup root_lookup;
1651 char *ret_path = NULL;
1653 u64 top_id = btrfs_list_get_path_rootid(fd);
1655 ret = __list_subvol_search(fd, &root_lookup);
1657 return ERR_PTR(ret);
1659 ret = __list_subvol_fill_paths(fd, &root_lookup);
1661 return ERR_PTR(ret);
1663 n = rb_last(&root_lookup.root);
1665 struct root_info *entry;
1667 entry = rb_entry(n, struct root_info, rb_node);
1668 resolve_root(&root_lookup, entry, top_id);
1669 if (entry->root_id == root) {
1670 ret_path = entry->full_path;
1671 entry->full_path = NULL;
1676 __free_all_subvolumn(&root_lookup);
1681 int btrfs_list_parse_sort_string(char *optarg,
1682 struct btrfs_list_comparer_set **comps)
1690 while ((p = strtok(optarg, ",")) != NULL) {
1692 ptr_argv = all_sort_items;
1695 if (strcmp(*ptr_argv, p) == 0) {
1700 if (strcmp(*ptr_argv, p) == 0) {
1717 } else if (*p == '-') {
1723 what_to_sort = btrfs_list_get_sort_item(p);
1724 btrfs_list_setup_comparer(comps, what_to_sort, order);
1733 * This function is used to parse the argument of filter condition.
1735 * type is the filter object.
1737 int btrfs_list_parse_filter_string(char *optarg,
1738 struct btrfs_list_filter_set **filters,
1739 enum btrfs_list_filter_enum type)
1743 char *ptr_parse_end = NULL;
1744 char *ptr_optarg_end = optarg + strlen(optarg);
1746 switch (*(optarg++)) {
1748 arg = (u64)strtol(optarg, &ptr_parse_end, 10);
1750 if (ptr_parse_end != ptr_optarg_end)
1753 btrfs_list_setup_filter(filters, type, arg);
1756 arg = (u64)strtoll(optarg, &ptr_parse_end, 10);
1758 if (ptr_parse_end != ptr_optarg_end)
1761 btrfs_list_setup_filter(filters, type, arg);
1765 arg = (u64)strtoll(optarg, &ptr_parse_end, 10);
1767 if (ptr_parse_end != ptr_optarg_end)
1769 btrfs_list_setup_filter(filters, type, arg);
1776 u64 btrfs_list_get_path_rootid(int fd)
1779 struct btrfs_ioctl_ino_lookup_args args;
1781 memset(&args, 0, sizeof(args));
1782 args.objectid = BTRFS_FIRST_FREE_OBJECTID;
1784 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
1787 "ERROR: can't perform the search -%s\n",