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.
19 #include <sys/ioctl.h>
20 #include <sys/mount.h>
23 #include <sys/types.h>
30 #include "transaction.h"
33 #include <uuid/uuid.h>
34 #include "btrfs-list.h"
35 #include "rbtree-utils.h"
37 #define BTRFS_LIST_NFILTERS_INCREASE (2 * BTRFS_LIST_FILTER_MAX)
38 #define BTRFS_LIST_NCOMPS_INCREASE (2 * BTRFS_LIST_COMP_MAX)
40 /* we store all the roots we find in an rbtree so that we can
41 * search for them later.
51 } btrfs_list_columns[] = {
64 .column_name = "CGen",
69 .column_name = "Parent",
74 .column_name = "Top Level",
79 .column_name = "OTime",
83 .name = "parent_uuid",
84 .column_name = "Parent UUID",
88 .name = "received_uuid",
89 .column_name = "Received UUID",
94 .column_name = "UUID",
99 .column_name = "Path",
109 static btrfs_list_filter_func all_filter_funcs[];
110 static btrfs_list_comp_func all_comp_funcs[];
112 void btrfs_list_setup_print_column(enum btrfs_list_column_enum column)
116 ASSERT(0 <= column && column <= BTRFS_LIST_ALL);
118 if (column < BTRFS_LIST_ALL) {
119 btrfs_list_columns[column].need_print = 1;
123 for (i = 0; i < BTRFS_LIST_ALL; i++)
124 btrfs_list_columns[i].need_print = 1;
127 static void root_lookup_init(struct root_lookup *tree)
129 tree->root.rb_node = NULL;
132 static int comp_entry_with_rootid(struct root_info *entry1,
133 struct root_info *entry2,
138 if (entry1->root_id > entry2->root_id)
140 else if (entry1->root_id < entry2->root_id)
145 return is_descending ? -ret : ret;
148 static int comp_entry_with_gen(struct root_info *entry1,
149 struct root_info *entry2,
154 if (entry1->gen > entry2->gen)
156 else if (entry1->gen < entry2->gen)
161 return is_descending ? -ret : ret;
164 static int comp_entry_with_ogen(struct root_info *entry1,
165 struct root_info *entry2,
170 if (entry1->ogen > entry2->ogen)
172 else if (entry1->ogen < entry2->ogen)
177 return is_descending ? -ret : ret;
180 static int comp_entry_with_path(struct root_info *entry1,
181 struct root_info *entry2,
186 if (strcmp(entry1->full_path, entry2->full_path) > 0)
188 else if (strcmp(entry1->full_path, entry2->full_path) < 0)
193 return is_descending ? -ret : ret;
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,
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,
211 static int btrfs_list_get_sort_item(char *sort_name)
215 for (i = 0; i < BTRFS_LIST_COMP_MAX; i++) {
216 if (strcmp(sort_name, all_sort_items[i]) == 0)
222 struct btrfs_list_comparer_set *btrfs_list_alloc_comparer_set(void)
224 struct btrfs_list_comparer_set *set;
227 size = sizeof(struct btrfs_list_comparer_set) +
228 BTRFS_LIST_NCOMPS_INCREASE * sizeof(struct btrfs_list_comparer);
229 set = calloc(1, size);
231 fprintf(stderr, "memory allocation failed\n");
235 set->total = BTRFS_LIST_NCOMPS_INCREASE;
240 static int btrfs_list_setup_comparer(struct btrfs_list_comparer_set **comp_set,
241 enum btrfs_list_comp_enum comparer, int is_descending)
243 struct btrfs_list_comparer_set *set = *comp_set;
247 ASSERT(comparer < BTRFS_LIST_COMP_MAX);
248 ASSERT(set->ncomps <= set->total);
250 if (set->ncomps == set->total) {
253 size = set->total + BTRFS_LIST_NCOMPS_INCREASE;
254 size = sizeof(*set) + size * sizeof(struct btrfs_list_comparer);
256 set = realloc(set, size);
258 fprintf(stderr, "memory allocation failed\n");
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;
270 ASSERT(set->comps[set->ncomps].comp_func == NULL);
272 set->comps[set->ncomps].comp_func = all_comp_funcs[comparer];
273 set->comps[set->ncomps].is_descending = is_descending;
278 static int sort_comp(struct root_info *entry1, struct root_info *entry2,
279 struct btrfs_list_comparer_set *set)
281 int rootid_compared = 0;
284 if (!set || !set->ncomps)
287 for (i = 0; i < set->ncomps; i++) {
288 if (!set->comps[i].comp_func)
291 ret = set->comps[i].comp_func(entry1, entry2,
292 set->comps[i].is_descending);
296 if (set->comps[i].comp_func == comp_entry_with_rootid)
300 if (!rootid_compared) {
302 ret = comp_entry_with_rootid(entry1, entry2, 0);
308 static int sort_tree_insert(struct root_lookup *sort_tree,
309 struct root_info *ins,
310 struct btrfs_list_comparer_set *comp_set)
312 struct rb_node **p = &sort_tree->root.rb_node;
313 struct rb_node *parent = NULL;
314 struct root_info *curr;
319 curr = rb_entry(parent, struct root_info, sort_node);
321 ret = sort_comp(ins, curr, comp_set);
330 rb_link_node(&ins->sort_node, parent, p);
331 rb_insert_color(&ins->sort_node, &sort_tree->root);
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
340 static int root_tree_insert(struct root_lookup *root_tree,
341 struct root_info *ins)
343 struct rb_node **p = &root_tree->root.rb_node;
344 struct rb_node * parent = NULL;
345 struct root_info *curr;
350 curr = rb_entry(parent, struct root_info, rb_node);
352 ret = comp_entry_with_rootid(ins, curr, 0);
361 rb_link_node(&ins->rb_node, parent, p);
362 rb_insert_color(&ins->rb_node, &root_tree->root);
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
370 static struct root_info *root_tree_search(struct root_lookup *root_tree,
373 struct rb_node *n = root_tree->root.rb_node;
374 struct root_info *entry;
375 struct root_info tmp;
378 tmp.root_id = root_id;
381 entry = rb_entry(n, struct root_info, rb_node);
383 ret = comp_entry_with_rootid(&tmp, entry, 0);
394 static int update_root(struct root_lookup *root_lookup,
395 u64 root_id, u64 ref_tree, u64 root_offset, u64 flags,
396 u64 dir_id, char *name, int name_len, u64 ogen, u64 gen,
397 time_t ot, void *uuid, void *puuid, void *ruuid)
399 struct root_info *ri;
401 ri = root_tree_search(root_lookup, root_id);
402 if (!ri || ri->root_id != root_id)
404 if (name && name_len > 0) {
407 ri->name = malloc(name_len + 1);
409 fprintf(stderr, "memory allocation failed\n");
412 strncpy(ri->name, name, name_len);
413 ri->name[name_len] = 0;
416 ri->ref_tree = ref_tree;
418 ri->root_offset = root_offset;
427 if (!ri->ogen && root_offset)
428 ri->ogen = root_offset;
432 memcpy(&ri->uuid, uuid, BTRFS_UUID_SIZE);
434 memcpy(&ri->puuid, puuid, BTRFS_UUID_SIZE);
436 memcpy(&ri->ruuid, ruuid, BTRFS_UUID_SIZE);
442 * add_root - update the existed root, or allocate a new root and insert it
443 * into the lookup tree.
444 * root_id: object id of the root
445 * ref_tree: object id of the referring root.
446 * root_offset: offset value of the root'key
447 * dir_id: inode id of the directory in ref_tree where this root can be found.
448 * name: the name of root_id in that directory
449 * name_len: the length of name
450 * ogen: the original generation of the root
451 * gen: the current generation of the root
452 * ot: the original time(create time) of the root
453 * uuid: uuid of the root
454 * puuid: uuid of the root parent if any
455 * ruuid: uuid of the received subvol, if any
457 static int add_root(struct root_lookup *root_lookup,
458 u64 root_id, u64 ref_tree, u64 root_offset, u64 flags,
459 u64 dir_id, char *name, int name_len, u64 ogen, u64 gen,
460 time_t ot, void *uuid, void *puuid, void *ruuid)
462 struct root_info *ri;
465 ret = update_root(root_lookup, root_id, ref_tree, root_offset, flags,
466 dir_id, name, name_len, ogen, gen, ot,
471 ri = calloc(1, sizeof(*ri));
473 printf("memory allocation failed\n");
476 ri->root_id = root_id;
478 if (name && name_len > 0) {
479 ri->name = malloc(name_len + 1);
481 fprintf(stderr, "memory allocation failed\n");
484 strncpy(ri->name, name, name_len);
485 ri->name[name_len] = 0;
488 ri->ref_tree = ref_tree;
492 ri->root_offset = root_offset;
499 if (!ri->ogen && root_offset)
500 ri->ogen = root_offset;
505 memcpy(&ri->uuid, uuid, BTRFS_UUID_SIZE);
508 memcpy(&ri->puuid, puuid, BTRFS_UUID_SIZE);
511 memcpy(&ri->ruuid, ruuid, BTRFS_UUID_SIZE);
513 ret = root_tree_insert(root_lookup, ri);
515 printf("failed to insert tree %llu\n", (unsigned long long)root_id);
521 static void __free_root_info(struct rb_node *node)
523 struct root_info *ri;
525 ri = rb_entry(node, struct root_info, rb_node);
532 static inline void __free_all_subvolumn(struct root_lookup *root_tree)
534 rb_free_nodes(&root_tree->root, __free_root_info);
538 * for a given root_info, search through the root_lookup tree to construct
539 * the full path name to it.
541 * This can't be called until all the root_info->path fields are filled
542 * in by lookup_ino_path
544 static int resolve_root(struct root_lookup *rl, struct root_info *ri,
547 char *full_path = NULL;
549 struct root_info *found;
552 * we go backwards from the root_info object and add pathnames
553 * from parent directories as we go.
562 * ref_tree = 0 indicates the subvolume
565 if (!found->ref_tree) {
570 add_len = strlen(found->path);
573 /* room for / and for null */
574 tmp = malloc(add_len + 2 + len);
576 perror("malloc failed");
579 memcpy(tmp + add_len + 1, full_path, len);
581 memcpy(tmp, found->path, add_len);
582 tmp [add_len + len + 1] = '\0';
587 full_path = strdup(found->path);
591 ri->top_id = found->ref_tree;
593 next = found->ref_tree;
597 * if the ref_tree = BTRFS_FS_TREE_OBJECTID,
600 if (next == BTRFS_FS_TREE_OBJECTID)
603 * if the ref_tree wasn't in our tree of roots, the
604 * subvolume was deleted.
606 found = root_tree_search(rl, next);
613 ri->full_path = full_path;
619 * for a single root_info, ask the kernel to give us a path name
620 * inside it's ref_root for the dir_id where it lives.
622 * This fills in root_info->path with the path to the directory and and
623 * appends this root's name.
625 static int lookup_ino_path(int fd, struct root_info *ri)
627 struct btrfs_ioctl_ino_lookup_args args;
636 memset(&args, 0, sizeof(args));
637 args.treeid = ri->ref_tree;
638 args.objectid = ri->dir_id;
640 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
642 if (errno == ENOENT) {
646 fprintf(stderr, "ERROR: Failed to lookup path for root %llu - %s\n",
647 (unsigned long long)ri->ref_tree,
654 * we're in a subdirectory of ref_tree, the kernel ioctl
655 * puts a / in there for us
657 ri->path = malloc(strlen(ri->name) + strlen(args.name) + 1);
659 perror("malloc failed");
662 strcpy(ri->path, args.name);
663 strcat(ri->path, ri->name);
665 /* we're at the root of ref_tree */
666 ri->path = strdup(ri->name);
668 perror("strdup failed");
675 /* finding the generation for a given path is a two step process.
676 * First we use the inode lookup routine to find out the root id
678 * Then we use the tree search ioctl to scan all the root items for a
679 * given root id and spit out the latest generation we can find
681 static u64 find_root_gen(int fd)
683 struct btrfs_ioctl_ino_lookup_args ino_args;
685 struct btrfs_ioctl_search_args args;
686 struct btrfs_ioctl_search_key *sk = &args.key;
687 struct btrfs_ioctl_search_header sh;
688 unsigned long off = 0;
692 memset(&ino_args, 0, sizeof(ino_args));
693 ino_args.objectid = BTRFS_FIRST_FREE_OBJECTID;
695 /* this ioctl fills in ino_args->treeid */
696 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &ino_args);
698 fprintf(stderr, "ERROR: Failed to lookup path for dirid %llu - %s\n",
699 (unsigned long long)BTRFS_FIRST_FREE_OBJECTID,
704 memset(&args, 0, sizeof(args));
709 * there may be more than one ROOT_ITEM key if there are
710 * snapshots pending deletion, we have to loop through
713 sk->min_objectid = ino_args.treeid;
714 sk->max_objectid = ino_args.treeid;
715 sk->max_type = BTRFS_ROOT_ITEM_KEY;
716 sk->min_type = BTRFS_ROOT_ITEM_KEY;
717 sk->max_offset = (u64)-1;
718 sk->max_transid = (u64)-1;
722 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
724 fprintf(stderr, "ERROR: can't perform the search - %s\n",
728 /* the ioctl returns the number of item it found in nr_items */
729 if (sk->nr_items == 0)
733 for (i = 0; i < sk->nr_items; i++) {
734 struct btrfs_root_item *item;
736 memcpy(&sh, args.buf + off, sizeof(sh));
738 item = (struct btrfs_root_item *)(args.buf + off);
741 sk->min_objectid = sh.objectid;
742 sk->min_type = sh.type;
743 sk->min_offset = sh.offset;
745 if (sh.objectid > ino_args.treeid)
748 if (sh.objectid == ino_args.treeid &&
749 sh.type == BTRFS_ROOT_ITEM_KEY) {
750 max_found = max(max_found,
751 btrfs_root_generation(item));
754 if (sk->min_offset < (u64)-1)
759 if (sk->min_type != BTRFS_ROOT_ITEM_KEY)
761 if (sk->min_objectid != ino_args.treeid)
767 /* pass in a directory id and this will return
768 * the full path of the parent directory inside its
771 * It may return NULL if it is in the root, or an ERR_PTR if things
774 static char *__ino_resolve(int fd, u64 dirid)
776 struct btrfs_ioctl_ino_lookup_args args;
780 memset(&args, 0, sizeof(args));
781 args.objectid = dirid;
783 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
785 fprintf(stderr, "ERROR: Failed to lookup path for dirid %llu - %s\n",
786 (unsigned long long)dirid, strerror(errno));
792 * we're in a subdirectory of ref_tree, the kernel ioctl
793 * puts a / in there for us
795 full = strdup(args.name);
797 perror("malloc failed");
798 return ERR_PTR(-ENOMEM);
801 /* we're at the root of ref_tree */
808 * simple string builder, returning a new string with both
811 static char *build_name(const char *dirid, const char *name)
818 full = malloc(strlen(dirid) + strlen(name) + 1);
827 * given an inode number, this returns the full path name inside the subvolume
828 * to that file/directory. cache_dirid and cache_name are used to
829 * cache the results so we can avoid tree searches if a later call goes
830 * to the same directory or file name
832 static char *ino_resolve(int fd, u64 ino, u64 *cache_dirid, char **cache_name)
840 struct btrfs_ioctl_search_args args;
841 struct btrfs_ioctl_search_key *sk = &args.key;
842 struct btrfs_ioctl_search_header *sh;
843 unsigned long off = 0;
846 memset(&args, 0, sizeof(args));
851 * step one, we search for the inode back ref. We just use the first
854 sk->min_objectid = ino;
855 sk->max_objectid = ino;
856 sk->max_type = BTRFS_INODE_REF_KEY;
857 sk->max_offset = (u64)-1;
858 sk->min_type = BTRFS_INODE_REF_KEY;
859 sk->max_transid = (u64)-1;
862 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
864 fprintf(stderr, "ERROR: can't perform the search - %s\n",
868 /* the ioctl returns the number of item it found in nr_items */
869 if (sk->nr_items == 0)
873 sh = (struct btrfs_ioctl_search_header *)(args.buf + off);
875 if (btrfs_search_header_type(sh) == BTRFS_INODE_REF_KEY) {
876 struct btrfs_inode_ref *ref;
877 dirid = btrfs_search_header_offset(sh);
879 ref = (struct btrfs_inode_ref *)(sh + 1);
880 namelen = btrfs_stack_inode_ref_name_len(ref);
882 name = (char *)(ref + 1);
883 name = strndup(name, namelen);
885 /* use our cached value */
886 if (dirid == *cache_dirid && *cache_name) {
887 dirname = *cache_name;
894 * the inode backref gives us the file name and the parent directory id.
895 * From here we use __ino_resolve to get the path to the parent
897 dirname = __ino_resolve(fd, dirid);
899 full = build_name(dirname, name);
900 if (*cache_name && dirname != *cache_name)
903 *cache_name = dirname;
904 *cache_dirid = dirid;
910 int btrfs_list_get_default_subvolume(int fd, u64 *default_id)
912 struct btrfs_ioctl_search_args args;
913 struct btrfs_ioctl_search_key *sk = &args.key;
914 struct btrfs_ioctl_search_header *sh;
918 memset(&args, 0, sizeof(args));
921 * search for a dir item with a name 'default' in the tree of
922 * tree roots, it should point us to a default root
926 /* don't worry about ancient format and request only one item */
929 sk->max_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
930 sk->min_objectid = BTRFS_ROOT_TREE_DIR_OBJECTID;
931 sk->max_type = BTRFS_DIR_ITEM_KEY;
932 sk->min_type = BTRFS_DIR_ITEM_KEY;
933 sk->max_offset = (u64)-1;
934 sk->max_transid = (u64)-1;
936 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
940 /* the ioctl returns the number of items it found in nr_items */
941 if (sk->nr_items == 0)
944 sh = (struct btrfs_ioctl_search_header *)args.buf;
946 if (btrfs_search_header_type(sh) == BTRFS_DIR_ITEM_KEY) {
947 struct btrfs_dir_item *di;
951 di = (struct btrfs_dir_item *)(sh + 1);
952 name_len = btrfs_stack_dir_name_len(di);
953 name = (char *)(di + 1);
955 if (!strncmp("default", name, name_len))
956 found = btrfs_disk_key_objectid(&di->location);
964 static int __list_subvol_search(int fd, struct root_lookup *root_lookup)
967 struct btrfs_ioctl_search_args args;
968 struct btrfs_ioctl_search_key *sk = &args.key;
969 struct btrfs_ioctl_search_header sh;
970 struct btrfs_root_ref *ref;
971 struct btrfs_root_item *ri;
972 unsigned long off = 0;
981 u8 uuid[BTRFS_UUID_SIZE];
982 u8 puuid[BTRFS_UUID_SIZE];
983 u8 ruuid[BTRFS_UUID_SIZE];
985 root_lookup_init(root_lookup);
986 memset(&args, 0, sizeof(args));
988 /* search in the tree of tree roots */
992 * set the min and max to backref keys. The search will
993 * only send back this type of key now.
995 sk->max_type = BTRFS_ROOT_BACKREF_KEY;
996 sk->min_type = BTRFS_ROOT_ITEM_KEY;
998 sk->min_objectid = BTRFS_FIRST_FREE_OBJECTID;
1001 * set all the other params to the max, we'll take any objectid
1004 sk->max_objectid = BTRFS_LAST_FREE_OBJECTID;
1005 sk->max_offset = (u64)-1;
1006 sk->max_transid = (u64)-1;
1008 /* just a big number, doesn't matter much */
1009 sk->nr_items = 4096;
1012 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1015 /* the ioctl returns the number of item it found in nr_items */
1016 if (sk->nr_items == 0)
1022 * for each item, pull the key out of the header and then
1023 * read the root_ref item it contains
1025 for (i = 0; i < sk->nr_items; i++) {
1026 memcpy(&sh, args.buf + off, sizeof(sh));
1028 if (sh.type == BTRFS_ROOT_BACKREF_KEY) {
1029 ref = (struct btrfs_root_ref *)(args.buf + off);
1030 name_len = btrfs_stack_root_ref_name_len(ref);
1031 name = (char *)(ref + 1);
1032 dir_id = btrfs_stack_root_ref_dirid(ref);
1034 add_root(root_lookup, sh.objectid, sh.offset,
1035 0, 0, dir_id, name, name_len, 0, 0, 0,
1037 } else if (sh.type == BTRFS_ROOT_ITEM_KEY) {
1038 ri = (struct btrfs_root_item *)(args.buf + off);
1039 gen = btrfs_root_generation(ri);
1040 flags = btrfs_root_flags(ri);
1042 sizeof(struct btrfs_root_item_v0)) {
1043 t = btrfs_stack_timespec_sec(&ri->otime);
1044 ogen = btrfs_root_otransid(ri);
1045 memcpy(uuid, ri->uuid, BTRFS_UUID_SIZE);
1046 memcpy(puuid, ri->parent_uuid, BTRFS_UUID_SIZE);
1047 memcpy(ruuid, ri->received_uuid, BTRFS_UUID_SIZE);
1051 memset(uuid, 0, BTRFS_UUID_SIZE);
1052 memset(puuid, 0, BTRFS_UUID_SIZE);
1053 memset(ruuid, 0, BTRFS_UUID_SIZE);
1056 add_root(root_lookup, sh.objectid, 0,
1057 sh.offset, flags, 0, NULL, 0, ogen,
1058 gen, t, uuid, puuid, ruuid);
1064 * record the mins in sk so we can make sure the
1065 * next search doesn't repeat this root
1067 sk->min_objectid = sh.objectid;
1068 sk->min_type = sh.type;
1069 sk->min_offset = sh.offset;
1071 sk->nr_items = 4096;
1073 if (!sk->min_offset) /* overflow */
1078 if (sk->min_type > BTRFS_ROOT_BACKREF_KEY) {
1079 sk->min_type = BTRFS_ROOT_ITEM_KEY;
1084 if (sk->min_objectid > sk->max_objectid)
1091 static int filter_by_rootid(struct root_info *ri, u64 data)
1093 return ri->root_id == data;
1096 static int filter_snapshot(struct root_info *ri, u64 data)
1098 return !!ri->root_offset;
1101 static int filter_flags(struct root_info *ri, u64 flags)
1103 return ri->flags & flags;
1106 static int filter_gen_more(struct root_info *ri, u64 data)
1108 return ri->gen >= data;
1111 static int filter_gen_less(struct root_info *ri, u64 data)
1113 return ri->gen <= data;
1116 static int filter_gen_equal(struct root_info *ri, u64 data)
1118 return ri->gen == data;
1121 static int filter_cgen_more(struct root_info *ri, u64 data)
1123 return ri->ogen >= data;
1126 static int filter_cgen_less(struct root_info *ri, u64 data)
1128 return ri->ogen <= data;
1131 static int filter_cgen_equal(struct root_info *ri, u64 data)
1133 return ri->ogen == data;
1136 static int filter_topid_equal(struct root_info *ri, u64 data)
1138 return ri->top_id == data;
1141 static int filter_full_path(struct root_info *ri, u64 data)
1143 if (ri->full_path && ri->top_id != data) {
1145 char p[] = "<FS_TREE>";
1146 int add_len = strlen(p);
1147 int len = strlen(ri->full_path);
1149 tmp = malloc(len + add_len + 2);
1151 fprintf(stderr, "memory allocation failed\n");
1154 memcpy(tmp + add_len + 1, ri->full_path, len);
1155 tmp[len + add_len + 1] = '\0';
1157 memcpy(tmp, p, add_len);
1158 free(ri->full_path);
1159 ri->full_path = tmp;
1164 static int filter_by_parent(struct root_info *ri, u64 data)
1166 return !uuid_compare(ri->puuid, (u8 *)(unsigned long)data);
1169 static int filter_deleted(struct root_info *ri, u64 data)
1174 static btrfs_list_filter_func all_filter_funcs[] = {
1175 [BTRFS_LIST_FILTER_ROOTID] = filter_by_rootid,
1176 [BTRFS_LIST_FILTER_SNAPSHOT_ONLY] = filter_snapshot,
1177 [BTRFS_LIST_FILTER_FLAGS] = filter_flags,
1178 [BTRFS_LIST_FILTER_GEN_MORE] = filter_gen_more,
1179 [BTRFS_LIST_FILTER_GEN_LESS] = filter_gen_less,
1180 [BTRFS_LIST_FILTER_GEN_EQUAL] = filter_gen_equal,
1181 [BTRFS_LIST_FILTER_CGEN_MORE] = filter_cgen_more,
1182 [BTRFS_LIST_FILTER_CGEN_LESS] = filter_cgen_less,
1183 [BTRFS_LIST_FILTER_CGEN_EQUAL] = filter_cgen_equal,
1184 [BTRFS_LIST_FILTER_TOPID_EQUAL] = filter_topid_equal,
1185 [BTRFS_LIST_FILTER_FULL_PATH] = filter_full_path,
1186 [BTRFS_LIST_FILTER_BY_PARENT] = filter_by_parent,
1187 [BTRFS_LIST_FILTER_DELETED] = filter_deleted,
1190 struct btrfs_list_filter_set *btrfs_list_alloc_filter_set(void)
1192 struct btrfs_list_filter_set *set;
1195 size = sizeof(struct btrfs_list_filter_set) +
1196 BTRFS_LIST_NFILTERS_INCREASE * sizeof(struct btrfs_list_filter);
1197 set = calloc(1, size);
1199 fprintf(stderr, "memory allocation failed\n");
1203 set->total = BTRFS_LIST_NFILTERS_INCREASE;
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;
1214 ASSERT(set != NULL);
1215 ASSERT(filter < BTRFS_LIST_FILTER_MAX);
1216 ASSERT(set->nfilters <= set->total);
1218 if (set->nfilters == set->total) {
1221 size = set->total + BTRFS_LIST_NFILTERS_INCREASE;
1222 size = sizeof(*set) + size * sizeof(struct btrfs_list_filter);
1224 set = realloc(set, size);
1226 fprintf(stderr, "memory allocation failed\n");
1231 memset(&set->filters[set->total], 0,
1232 BTRFS_LIST_NFILTERS_INCREASE *
1233 sizeof(struct btrfs_list_filter));
1234 set->total += BTRFS_LIST_NFILTERS_INCREASE;
1238 ASSERT(set->filters[set->nfilters].filter_func == NULL);
1240 if (filter == BTRFS_LIST_FILTER_DELETED)
1241 set->only_deleted = 1;
1243 set->filters[set->nfilters].filter_func = all_filter_funcs[filter];
1244 set->filters[set->nfilters].data = data;
1249 static int filter_root(struct root_info *ri,
1250 struct btrfs_list_filter_set *set)
1257 if (set->only_deleted && !ri->deleted)
1260 if (!set->only_deleted && ri->deleted)
1263 for (i = 0; i < set->nfilters; i++) {
1264 if (!set->filters[i].filter_func)
1266 ret = set->filters[i].filter_func(ri, set->filters[i].data);
1273 static void __filter_and_sort_subvol(struct root_lookup *all_subvols,
1274 struct root_lookup *sort_tree,
1275 struct btrfs_list_filter_set *filter_set,
1276 struct btrfs_list_comparer_set *comp_set,
1280 struct root_info *entry;
1283 root_lookup_init(sort_tree);
1285 n = rb_last(&all_subvols->root);
1287 entry = rb_entry(n, struct root_info, rb_node);
1289 ret = resolve_root(all_subvols, entry, top_id);
1290 if (ret == -ENOENT) {
1291 entry->full_path = strdup("DELETED");
1294 ret = filter_root(entry, filter_set);
1296 sort_tree_insert(sort_tree, entry, comp_set);
1301 static int __list_subvol_fill_paths(int fd, struct root_lookup *root_lookup)
1305 n = rb_first(&root_lookup->root);
1307 struct root_info *entry;
1309 entry = rb_entry(n, struct root_info, rb_node);
1310 ret = lookup_ino_path(fd, entry);
1311 if (ret && ret != -ENOENT)
1319 static void print_subvolume_column(struct root_info *subv,
1320 enum btrfs_list_column_enum column)
1323 char uuidparse[BTRFS_UUID_UNPARSED_SIZE];
1325 ASSERT(0 <= column && column < BTRFS_LIST_ALL);
1328 case BTRFS_LIST_OBJECTID:
1329 printf("%llu", subv->root_id);
1331 case BTRFS_LIST_GENERATION:
1332 printf("%llu", subv->gen);
1334 case BTRFS_LIST_OGENERATION:
1335 printf("%llu", subv->ogen);
1337 case BTRFS_LIST_PARENT:
1338 printf("%llu", subv->ref_tree);
1340 case BTRFS_LIST_TOP_LEVEL:
1341 printf("%llu", subv->top_id);
1343 case BTRFS_LIST_OTIME:
1347 localtime_r(&subv->otime, &tm);
1348 strftime(tstr, 256, "%Y-%m-%d %X", &tm);
1353 case BTRFS_LIST_UUID:
1354 if (uuid_is_null(subv->uuid))
1355 strcpy(uuidparse, "-");
1357 uuid_unparse(subv->uuid, uuidparse);
1358 printf("%s", uuidparse);
1360 case BTRFS_LIST_PUUID:
1361 if (uuid_is_null(subv->puuid))
1362 strcpy(uuidparse, "-");
1364 uuid_unparse(subv->puuid, uuidparse);
1365 printf("%s", uuidparse);
1367 case BTRFS_LIST_RUUID:
1368 if (uuid_is_null(subv->ruuid))
1369 strcpy(uuidparse, "-");
1371 uuid_unparse(subv->ruuid, uuidparse);
1372 printf("%s", uuidparse);
1374 case BTRFS_LIST_PATH:
1375 BUG_ON(!subv->full_path);
1376 printf("%s", subv->full_path);
1383 static void print_single_volume_info_raw(struct root_info *subv, char *raw_prefix)
1387 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1388 if (!btrfs_list_columns[i].need_print)
1392 printf("%s",raw_prefix);
1394 print_subvolume_column(subv, i);
1399 static void print_single_volume_info_table(struct root_info *subv)
1403 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1404 if (!btrfs_list_columns[i].need_print)
1407 print_subvolume_column(subv, i);
1409 if (i != BTRFS_LIST_PATH)
1412 if (i == BTRFS_LIST_TOP_LEVEL)
1418 static void print_single_volume_info_default(struct root_info *subv)
1422 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1423 if (!btrfs_list_columns[i].need_print)
1426 printf("%s ", btrfs_list_columns[i].name);
1427 print_subvolume_column(subv, i);
1429 if (i != BTRFS_LIST_PATH)
1435 static void print_all_volume_info_tab_head(void)
1441 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1442 if (btrfs_list_columns[i].need_print)
1443 printf("%s\t", btrfs_list_columns[i].name);
1445 if (i == BTRFS_LIST_ALL-1)
1449 for (i = 0; i < BTRFS_LIST_ALL; i++) {
1450 memset(barrier, 0, sizeof(barrier));
1452 if (btrfs_list_columns[i].need_print) {
1453 len = strlen(btrfs_list_columns[i].name);
1455 strcat(barrier, "-");
1457 printf("%s\t", barrier);
1459 if (i == BTRFS_LIST_ALL-1)
1464 static void print_all_volume_info(struct root_lookup *sorted_tree,
1465 int layout, char *raw_prefix)
1468 struct root_info *entry;
1470 if (layout == BTRFS_LIST_LAYOUT_TABLE)
1471 print_all_volume_info_tab_head();
1473 n = rb_first(&sorted_tree->root);
1475 entry = rb_entry(n, struct root_info, sort_node);
1477 case BTRFS_LIST_LAYOUT_DEFAULT:
1478 print_single_volume_info_default(entry);
1480 case BTRFS_LIST_LAYOUT_TABLE:
1481 print_single_volume_info_table(entry);
1483 case BTRFS_LIST_LAYOUT_RAW:
1484 print_single_volume_info_raw(entry, raw_prefix);
1491 static int btrfs_list_subvols(int fd, struct root_lookup *root_lookup)
1495 ret = __list_subvol_search(fd, root_lookup);
1497 fprintf(stderr, "ERROR: can't perform the search - %s\n",
1503 * now we have an rbtree full of root_info objects, but we need to fill
1504 * in their path names within the subvol that is referencing each one.
1506 ret = __list_subvol_fill_paths(fd, root_lookup);
1510 int btrfs_list_subvols_print(int fd, struct btrfs_list_filter_set *filter_set,
1511 struct btrfs_list_comparer_set *comp_set,
1512 int layout, int full_path, char *raw_prefix)
1514 struct root_lookup root_lookup;
1515 struct root_lookup root_sort;
1520 ret = btrfs_list_get_path_rootid(fd, &top_id);
1524 ret = btrfs_list_subvols(fd, &root_lookup);
1527 __filter_and_sort_subvol(&root_lookup, &root_sort, filter_set,
1530 print_all_volume_info(&root_sort, layout, raw_prefix);
1531 __free_all_subvolumn(&root_lookup);
1536 static char *strdup_or_null(const char *s)
1543 int btrfs_get_subvol(int fd, struct root_info *the_ri)
1546 struct root_lookup rl;
1547 struct rb_node *rbn;
1548 struct root_info *ri;
1551 ret = btrfs_list_get_path_rootid(fd, &root_id);
1555 ret = btrfs_list_subvols(fd, &rl);
1559 rbn = rb_first(&rl.root);
1561 ri = rb_entry(rbn, struct root_info, rb_node);
1562 rr = resolve_root(&rl, ri, root_id);
1563 if (rr == -ENOENT) {
1568 if (!comp_entry_with_rootid(the_ri, ri, 0)) {
1569 memcpy(the_ri, ri, offsetof(struct root_info, path));
1570 the_ri->path = strdup_or_null(ri->path);
1571 the_ri->name = strdup_or_null(ri->name);
1572 the_ri->full_path = strdup_or_null(ri->full_path);
1578 __free_all_subvolumn(&rl);
1582 static int print_one_extent(int fd, struct btrfs_ioctl_search_header *sh,
1583 struct btrfs_file_extent_item *item,
1584 u64 found_gen, u64 *cache_dirid,
1585 char **cache_dir_name, u64 *cache_ino,
1586 char **cache_full_name)
1590 u64 disk_offset = 0;
1596 if (btrfs_search_header_objectid(sh) == *cache_ino) {
1597 name = *cache_full_name;
1598 } else if (*cache_full_name) {
1599 free(*cache_full_name);
1600 *cache_full_name = NULL;
1603 name = ino_resolve(fd, btrfs_search_header_objectid(sh),
1606 *cache_full_name = name;
1607 *cache_ino = btrfs_search_header_objectid(sh);
1612 type = btrfs_stack_file_extent_type(item);
1613 compressed = btrfs_stack_file_extent_compression(item);
1615 if (type == BTRFS_FILE_EXTENT_REG ||
1616 type == BTRFS_FILE_EXTENT_PREALLOC) {
1617 disk_start = btrfs_stack_file_extent_disk_bytenr(item);
1618 disk_offset = btrfs_stack_file_extent_offset(item);
1619 len = btrfs_stack_file_extent_num_bytes(item);
1620 } else if (type == BTRFS_FILE_EXTENT_INLINE) {
1623 len = btrfs_stack_file_extent_ram_bytes(item);
1625 printf("unhandled extent type %d for inode %llu "
1626 "file offset %llu gen %llu\n",
1628 (unsigned long long)btrfs_search_header_objectid(sh),
1629 (unsigned long long)btrfs_search_header_offset(sh),
1630 (unsigned long long)found_gen);
1634 printf("inode %llu file offset %llu len %llu disk start %llu "
1635 "offset %llu gen %llu flags ",
1636 (unsigned long long)btrfs_search_header_objectid(sh),
1637 (unsigned long long)btrfs_search_header_offset(sh),
1638 (unsigned long long)len,
1639 (unsigned long long)disk_start,
1640 (unsigned long long)disk_offset,
1641 (unsigned long long)found_gen);
1647 if (type == BTRFS_FILE_EXTENT_PREALLOC) {
1648 printf("%sPREALLOC", flags ? "|" : "");
1651 if (type == BTRFS_FILE_EXTENT_INLINE) {
1652 printf("%sINLINE", flags ? "|" : "");
1658 printf(" %s\n", name);
1662 int btrfs_list_find_updated_files(int fd, u64 root_id, u64 oldest_gen)
1665 struct btrfs_ioctl_search_args args;
1666 struct btrfs_ioctl_search_key *sk = &args.key;
1667 struct btrfs_ioctl_search_header sh;
1668 struct btrfs_file_extent_item *item;
1669 unsigned long off = 0;
1673 u64 cache_dirid = 0;
1675 char *cache_dir_name = NULL;
1676 char *cache_full_name = NULL;
1677 struct btrfs_file_extent_item backup;
1679 memset(&backup, 0, sizeof(backup));
1680 memset(&args, 0, sizeof(args));
1682 sk->tree_id = root_id;
1685 * set all the other params to the max, we'll take any objectid
1688 sk->max_objectid = (u64)-1;
1689 sk->max_offset = (u64)-1;
1690 sk->max_transid = (u64)-1;
1691 sk->max_type = BTRFS_EXTENT_DATA_KEY;
1692 sk->min_transid = oldest_gen;
1693 /* just a big number, doesn't matter much */
1694 sk->nr_items = 4096;
1696 max_found = find_root_gen(fd);
1698 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
1700 fprintf(stderr, "ERROR: can't perform the search - %s\n",
1704 /* the ioctl returns the number of item it found in nr_items */
1705 if (sk->nr_items == 0)
1711 * for each item, pull the key out of the header and then
1712 * read the root_ref item it contains
1714 for (i = 0; i < sk->nr_items; i++) {
1715 memcpy(&sh, args.buf + off, sizeof(sh));
1719 * just in case the item was too big, pass something other
1725 item = (struct btrfs_file_extent_item *)(args.buf +
1727 found_gen = btrfs_stack_file_extent_generation(item);
1728 if (sh.type == BTRFS_EXTENT_DATA_KEY &&
1729 found_gen >= oldest_gen) {
1730 print_one_extent(fd, &sh, item, found_gen,
1731 &cache_dirid, &cache_dir_name,
1732 &cache_ino, &cache_full_name);
1737 * record the mins in sk so we can make sure the
1738 * next search doesn't repeat this root
1740 sk->min_objectid = sh.objectid;
1741 sk->min_offset = sh.offset;
1742 sk->min_type = sh.type;
1744 sk->nr_items = 4096;
1745 if (sk->min_offset < (u64)-1)
1747 else if (sk->min_objectid < (u64)-1) {
1754 free(cache_dir_name);
1755 free(cache_full_name);
1756 printf("transid marker was %llu\n", (unsigned long long)max_found);
1760 char *btrfs_list_path_for_root(int fd, u64 root)
1762 struct root_lookup root_lookup;
1764 char *ret_path = NULL;
1768 ret = btrfs_list_get_path_rootid(fd, &top_id);
1770 return ERR_PTR(ret);
1772 ret = __list_subvol_search(fd, &root_lookup);
1774 return ERR_PTR(ret);
1776 ret = __list_subvol_fill_paths(fd, &root_lookup);
1778 return ERR_PTR(ret);
1780 n = rb_last(&root_lookup.root);
1782 struct root_info *entry;
1784 entry = rb_entry(n, struct root_info, rb_node);
1785 ret = resolve_root(&root_lookup, entry, top_id);
1786 if (ret == -ENOENT && entry->root_id == root) {
1790 if (entry->root_id == root) {
1791 ret_path = entry->full_path;
1792 entry->full_path = NULL;
1797 __free_all_subvolumn(&root_lookup);
1802 int btrfs_list_parse_sort_string(char *opt_arg,
1803 struct btrfs_list_comparer_set **comps)
1811 while ((p = strtok(opt_arg, ",")) != NULL) {
1813 ptr_argv = all_sort_items;
1816 if (strcmp(*ptr_argv, p) == 0) {
1821 if (strcmp(*ptr_argv, p) == 0) {
1838 } else if (*p == '-') {
1844 what_to_sort = btrfs_list_get_sort_item(p);
1845 btrfs_list_setup_comparer(comps, what_to_sort, order);
1854 * This function is used to parse the argument of filter condition.
1856 * type is the filter object.
1858 int btrfs_list_parse_filter_string(char *opt_arg,
1859 struct btrfs_list_filter_set **filters,
1860 enum btrfs_list_filter_enum type)
1865 switch (*(opt_arg++)) {
1867 arg = arg_strtou64(opt_arg);
1870 btrfs_list_setup_filter(filters, type, arg);
1873 arg = arg_strtou64(opt_arg);
1876 btrfs_list_setup_filter(filters, type, arg);
1880 arg = arg_strtou64(opt_arg);
1882 btrfs_list_setup_filter(filters, type, arg);
1889 int btrfs_list_get_path_rootid(int fd, u64 *treeid)
1892 struct btrfs_ioctl_ino_lookup_args args;
1894 memset(&args, 0, sizeof(args));
1895 args.objectid = BTRFS_FIRST_FREE_OBJECTID;
1897 ret = ioctl(fd, BTRFS_IOC_INO_LOOKUP, &args);
1900 "ERROR: can't perform the search - %s\n",
1904 *treeid = args.treeid;