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