forked from kdave/btrfs-progs
-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcmds-filesystem.c
1211 lines (1042 loc) · 28.5 KB
/
cmds-filesystem.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public
* License v2 as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 021110-1307, USA.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <sys/ioctl.h>
#include <errno.h>
#include <uuid/uuid.h>
#include <ctype.h>
#include <fcntl.h>
#include <ftw.h>
#include <mntent.h>
#include <linux/limits.h>
#include <getopt.h>
#include <btrfsutil.h>
#include "kerncompat.h"
#include "ctree.h"
#include "utils.h"
#include "volumes.h"
#include "commands.h"
#include "cmds-fi-usage.h"
#include "list_sort.h"
#include "disk-io.h"
#include "help.h"
/*
* for btrfs fi show, we maintain a hash of fsids we've already printed.
* This way we don't print dups if a given FS is mounted more than once.
*/
static struct seen_fsid *seen_fsid_hash[SEEN_FSID_HASH_SIZE] = {NULL,};
static const char * const filesystem_cmd_group_usage[] = {
"btrfs filesystem [<group>] <command> [<args>]",
NULL
};
static const char * const cmd_filesystem_df_usage[] = {
"btrfs filesystem df [options] <path>",
"Show space usage information for a mount point",
HELPINFO_UNITS_SHORT_LONG,
NULL
};
static int get_df(int fd, struct btrfs_ioctl_space_args **sargs_ret)
{
u64 count = 0;
int ret;
struct btrfs_ioctl_space_args *sargs;
sargs = malloc(sizeof(struct btrfs_ioctl_space_args));
if (!sargs)
return -ENOMEM;
sargs->space_slots = 0;
sargs->total_spaces = 0;
ret = ioctl(fd, BTRFS_IOC_SPACE_INFO, sargs);
if (ret < 0) {
error("cannot get space info: %m");
free(sargs);
return -errno;
}
/* This really should never happen */
if (!sargs->total_spaces) {
free(sargs);
return -ENOENT;
}
count = sargs->total_spaces;
free(sargs);
sargs = malloc(sizeof(struct btrfs_ioctl_space_args) +
(count * sizeof(struct btrfs_ioctl_space_info)));
if (!sargs)
return -ENOMEM;
sargs->space_slots = count;
sargs->total_spaces = 0;
ret = ioctl(fd, BTRFS_IOC_SPACE_INFO, sargs);
if (ret < 0) {
error("cannot get space info with %llu slots: %m",
count);
free(sargs);
return -errno;
}
*sargs_ret = sargs;
return 0;
}
static void print_df(struct btrfs_ioctl_space_args *sargs, unsigned unit_mode)
{
u64 i;
struct btrfs_ioctl_space_info *sp = sargs->spaces;
for (i = 0; i < sargs->total_spaces; i++, sp++) {
printf("%s, %s: total=%s, used=%s\n",
btrfs_group_type_str(sp->flags),
btrfs_group_profile_str(sp->flags),
pretty_size_mode(sp->total_bytes, unit_mode),
pretty_size_mode(sp->used_bytes, unit_mode));
}
}
static int cmd_filesystem_df(int argc, char **argv)
{
struct btrfs_ioctl_space_args *sargs = NULL;
int ret;
int fd;
char *path;
DIR *dirstream = NULL;
unsigned unit_mode;
unit_mode = get_unit_mode_from_arg(&argc, argv, 1);
clean_args_no_options(argc, argv, cmd_filesystem_df_usage);
if (check_argc_exact(argc - optind, 1))
usage(cmd_filesystem_df_usage);
path = argv[optind];
fd = btrfs_open_dir(path, &dirstream, 1);
if (fd < 0)
return 1;
ret = get_df(fd, &sargs);
if (ret == 0) {
print_df(sargs, unit_mode);
free(sargs);
} else {
error("get_df failed %s", strerror(-ret));
}
close_file_or_dir(fd, dirstream);
return !!ret;
}
static int match_search_item_kernel(u8 *fsid, char *mnt, char *label,
char *search)
{
char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
int search_len = strlen(search);
search_len = min(search_len, BTRFS_UUID_UNPARSED_SIZE);
uuid_unparse(fsid, uuidbuf);
if (!strncmp(uuidbuf, search, search_len))
return 1;
if (*label && strcmp(label, search) == 0)
return 1;
if (strcmp(mnt, search) == 0)
return 1;
return 0;
}
static int uuid_search(struct btrfs_fs_devices *fs_devices, const char *search)
{
char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
struct btrfs_device *device;
int search_len = strlen(search);
search_len = min(search_len, BTRFS_UUID_UNPARSED_SIZE);
uuid_unparse(fs_devices->fsid, uuidbuf);
if (!strncmp(uuidbuf, search, search_len))
return 1;
list_for_each_entry(device, &fs_devices->devices, dev_list) {
if ((device->label && strcmp(device->label, search) == 0) ||
strcmp(device->name, search) == 0)
return 1;
}
return 0;
}
/*
* Sort devices by devid, ascending
*/
static int cmp_device_id(void *priv, struct list_head *a,
struct list_head *b)
{
const struct btrfs_device *da = list_entry(a, struct btrfs_device,
dev_list);
const struct btrfs_device *db = list_entry(b, struct btrfs_device,
dev_list);
return da->devid < db->devid ? -1 :
da->devid > db->devid ? 1 : 0;
}
static void splice_device_list(struct list_head *seed_devices,
struct list_head *all_devices)
{
struct btrfs_device *in_all, *next_all;
struct btrfs_device *in_seed, *next_seed;
list_for_each_entry_safe(in_all, next_all, all_devices, dev_list) {
list_for_each_entry_safe(in_seed, next_seed, seed_devices,
dev_list) {
if (in_all->devid == in_seed->devid) {
/*
* When do dev replace in a sprout fs
* to a dev in its seed fs, the replacing
* dev will reside in the sprout fs and
* the replaced dev will still exist
* in the seed fs.
* So pick the latest one when showing
* the sprout fs.
*/
if (in_all->generation
< in_seed->generation) {
list_del(&in_all->dev_list);
free(in_all);
} else if (in_all->generation
> in_seed->generation) {
list_del(&in_seed->dev_list);
free(in_seed);
}
break;
}
}
}
list_splice(seed_devices, all_devices);
}
static void print_devices(struct btrfs_fs_devices *fs_devices,
u64 *devs_found, unsigned unit_mode)
{
struct btrfs_device *device;
struct btrfs_fs_devices *cur_fs;
struct list_head *all_devices;
all_devices = &fs_devices->devices;
cur_fs = fs_devices->seed;
/* add all devices of seed fs to the fs to be printed */
while (cur_fs) {
splice_device_list(&cur_fs->devices, all_devices);
cur_fs = cur_fs->seed;
}
list_sort(NULL, all_devices, cmp_device_id);
list_for_each_entry(device, all_devices, dev_list) {
printf("\tdevid %4llu size %s used %s path %s\n",
(unsigned long long)device->devid,
pretty_size_mode(device->total_bytes, unit_mode),
pretty_size_mode(device->bytes_used, unit_mode),
device->name);
(*devs_found)++;
}
}
static void print_one_uuid(struct btrfs_fs_devices *fs_devices,
unsigned unit_mode)
{
char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
struct btrfs_device *device;
u64 devs_found = 0;
u64 total;
if (add_seen_fsid(fs_devices->fsid, seen_fsid_hash, -1, NULL))
return;
uuid_unparse(fs_devices->fsid, uuidbuf);
device = list_entry(fs_devices->devices.next, struct btrfs_device,
dev_list);
if (device->label && device->label[0])
printf("Label: '%s' ", device->label);
else
printf("Label: none ");
total = device->total_devs;
printf(" uuid: %s\n\tTotal devices %llu FS bytes used %s\n", uuidbuf,
(unsigned long long)total,
pretty_size_mode(device->super_bytes_used, unit_mode));
print_devices(fs_devices, &devs_found, unit_mode);
if (devs_found < total) {
printf("\t*** Some devices missing\n");
}
printf("\n");
}
/* adds up all the used spaces as reported by the space info ioctl
*/
static u64 calc_used_bytes(struct btrfs_ioctl_space_args *si)
{
u64 ret = 0;
int i;
for (i = 0; i < si->total_spaces; i++)
ret += si->spaces[i].used_bytes;
return ret;
}
static int print_one_fs(struct btrfs_ioctl_fs_info_args *fs_info,
struct btrfs_ioctl_dev_info_args *dev_info,
struct btrfs_ioctl_space_args *space_info,
char *label, unsigned unit_mode)
{
int i;
int fd;
int missing = 0;
char uuidbuf[BTRFS_UUID_UNPARSED_SIZE];
struct btrfs_ioctl_dev_info_args *tmp_dev_info;
int ret;
ret = add_seen_fsid(fs_info->fsid, seen_fsid_hash, -1, NULL);
if (ret == -EEXIST)
return 0;
else if (ret)
return ret;
uuid_unparse(fs_info->fsid, uuidbuf);
if (label && *label)
printf("Label: '%s' ", label);
else
printf("Label: none ");
printf(" uuid: %s\n\tTotal devices %llu FS bytes used %s\n", uuidbuf,
fs_info->num_devices,
pretty_size_mode(calc_used_bytes(space_info),
unit_mode));
for (i = 0; i < fs_info->num_devices; i++) {
char *canonical_path;
tmp_dev_info = (struct btrfs_ioctl_dev_info_args *)&dev_info[i];
/* Add check for missing devices even mounted */
fd = open((char *)tmp_dev_info->path, O_RDONLY);
if (fd < 0) {
missing = 1;
continue;
}
close(fd);
canonical_path = canonicalize_path((char *)tmp_dev_info->path);
printf("\tdevid %4llu size %s used %s path %s\n",
tmp_dev_info->devid,
pretty_size_mode(tmp_dev_info->total_bytes, unit_mode),
pretty_size_mode(tmp_dev_info->bytes_used, unit_mode),
canonical_path);
free(canonical_path);
}
if (missing)
printf("\t*** Some devices missing\n");
printf("\n");
return 0;
}
static int btrfs_scan_kernel(void *search, unsigned unit_mode)
{
int ret = 0, fd;
int found = 0;
FILE *f;
struct mntent *mnt;
struct btrfs_ioctl_fs_info_args fs_info_arg;
struct btrfs_ioctl_dev_info_args *dev_info_arg = NULL;
struct btrfs_ioctl_space_args *space_info_arg = NULL;
char label[BTRFS_LABEL_SIZE];
f = setmntent("/proc/self/mounts", "r");
if (f == NULL)
return 1;
memset(label, 0, sizeof(label));
while ((mnt = getmntent(f)) != NULL) {
free(dev_info_arg);
dev_info_arg = NULL;
if (strcmp(mnt->mnt_type, "btrfs"))
continue;
ret = get_fs_info(mnt->mnt_dir, &fs_info_arg,
&dev_info_arg);
if (ret)
goto out;
/* skip all fs already shown as mounted fs */
if (is_seen_fsid(fs_info_arg.fsid, seen_fsid_hash))
continue;
ret = get_label_mounted(mnt->mnt_dir, label);
/* provide backward kernel compatibility */
if (ret == -ENOTTY)
ret = get_label_unmounted(
(const char *)dev_info_arg->path, label);
if (ret)
goto out;
if (search && !match_search_item_kernel(fs_info_arg.fsid,
mnt->mnt_dir, label, search)) {
continue;
}
fd = open(mnt->mnt_dir, O_RDONLY);
if ((fd != -1) && !get_df(fd, &space_info_arg)) {
print_one_fs(&fs_info_arg, dev_info_arg,
space_info_arg, label, unit_mode);
free(space_info_arg);
memset(label, 0, sizeof(label));
found = 1;
}
if (fd != -1)
close(fd);
}
out:
free(dev_info_arg);
endmntent(f);
return !found;
}
static void free_fs_devices(struct btrfs_fs_devices *fs_devices)
{
struct btrfs_fs_devices *cur_seed, *next_seed;
struct btrfs_device *device;
while (!list_empty(&fs_devices->devices)) {
device = list_entry(fs_devices->devices.next,
struct btrfs_device, dev_list);
list_del(&device->dev_list);
free(device->name);
free(device->label);
free(device);
}
/* free seed fs chain */
cur_seed = fs_devices->seed;
fs_devices->seed = NULL;
while (cur_seed) {
next_seed = cur_seed->seed;
free(cur_seed);
cur_seed = next_seed;
}
list_del(&fs_devices->list);
free(fs_devices);
}
static int copy_device(struct btrfs_device *dst,
struct btrfs_device *src)
{
dst->devid = src->devid;
memcpy(dst->uuid, src->uuid, BTRFS_UUID_SIZE);
if (src->name == NULL)
dst->name = NULL;
else {
dst->name = strdup(src->name);
if (!dst->name)
return -ENOMEM;
}
if (src->label == NULL)
dst->label = NULL;
else {
dst->label = strdup(src->label);
if (!dst->label) {
free(dst->name);
return -ENOMEM;
}
}
dst->total_devs = src->total_devs;
dst->super_bytes_used = src->super_bytes_used;
dst->total_bytes = src->total_bytes;
dst->bytes_used = src->bytes_used;
dst->generation = src->generation;
return 0;
}
static int copy_fs_devices(struct btrfs_fs_devices *dst,
struct btrfs_fs_devices *src)
{
struct btrfs_device *cur_dev, *dev_copy;
int ret = 0;
memcpy(dst->fsid, src->fsid, BTRFS_FSID_SIZE);
INIT_LIST_HEAD(&dst->devices);
dst->seed = NULL;
list_for_each_entry(cur_dev, &src->devices, dev_list) {
dev_copy = malloc(sizeof(*dev_copy));
if (!dev_copy) {
ret = -ENOMEM;
break;
}
ret = copy_device(dev_copy, cur_dev);
if (ret) {
free(dev_copy);
break;
}
list_add(&dev_copy->dev_list, &dst->devices);
dev_copy->fs_devices = dst;
}
return ret;
}
static int find_and_copy_seed(struct btrfs_fs_devices *seed,
struct btrfs_fs_devices *copy,
struct list_head *fs_uuids) {
struct btrfs_fs_devices *cur_fs;
list_for_each_entry(cur_fs, fs_uuids, list)
if (!memcmp(seed->fsid, cur_fs->fsid, BTRFS_FSID_SIZE))
return copy_fs_devices(copy, cur_fs);
return 1;
}
static int has_seed_devices(struct btrfs_fs_devices *fs_devices)
{
struct btrfs_device *device;
int dev_cnt_total, dev_cnt = 0;
device = list_first_entry(&fs_devices->devices, struct btrfs_device,
dev_list);
dev_cnt_total = device->total_devs;
list_for_each_entry(device, &fs_devices->devices, dev_list)
dev_cnt++;
return dev_cnt_total != dev_cnt;
}
static int search_umounted_fs_uuids(struct list_head *all_uuids,
char *search, int *found)
{
struct btrfs_fs_devices *cur_fs, *fs_copy;
struct list_head *fs_uuids;
int ret = 0;
fs_uuids = btrfs_scanned_uuids();
/*
* The fs_uuids list is global, and open_ctree_* will
* modify it, make a private copy here
*/
list_for_each_entry(cur_fs, fs_uuids, list) {
/* don't bother handle all fs, if search target specified */
if (search) {
if (uuid_search(cur_fs, search) == 0)
continue;
if (found)
*found = 1;
}
/* skip all fs already shown as mounted fs */
if (is_seen_fsid(cur_fs->fsid, seen_fsid_hash))
continue;
fs_copy = calloc(1, sizeof(*fs_copy));
if (!fs_copy) {
ret = -ENOMEM;
goto out;
}
ret = copy_fs_devices(fs_copy, cur_fs);
if (ret) {
free(fs_copy);
goto out;
}
list_add(&fs_copy->list, all_uuids);
}
out:
return ret;
}
static int map_seed_devices(struct list_head *all_uuids)
{
struct btrfs_fs_devices *cur_fs, *cur_seed;
struct btrfs_fs_devices *seed_copy;
struct btrfs_fs_devices *opened_fs;
struct btrfs_device *device;
struct btrfs_fs_info *fs_info;
struct list_head *fs_uuids;
int ret = 0;
fs_uuids = btrfs_scanned_uuids();
list_for_each_entry(cur_fs, all_uuids, list) {
device = list_first_entry(&cur_fs->devices,
struct btrfs_device, dev_list);
if (!device)
continue;
/* skip fs without seeds */
if (!has_seed_devices(cur_fs))
continue;
/*
* open_ctree_* detects seed/sprout mapping
*/
fs_info = open_ctree_fs_info(device->name, 0, 0, 0,
OPEN_CTREE_PARTIAL);
if (!fs_info)
continue;
/*
* copy the seed chain under the opened fs
*/
opened_fs = fs_info->fs_devices;
cur_seed = cur_fs;
while (opened_fs->seed) {
seed_copy = malloc(sizeof(*seed_copy));
if (!seed_copy) {
ret = -ENOMEM;
goto fail_out;
}
ret = find_and_copy_seed(opened_fs->seed, seed_copy,
fs_uuids);
if (ret) {
free(seed_copy);
goto fail_out;
}
cur_seed->seed = seed_copy;
opened_fs = opened_fs->seed;
cur_seed = cur_seed->seed;
}
close_ctree(fs_info->chunk_root);
}
out:
return ret;
fail_out:
close_ctree(fs_info->chunk_root);
goto out;
}
static const char * const cmd_filesystem_show_usage[] = {
"btrfs filesystem show [options] [<path>|<uuid>|<device>|label]",
"Show the structure of a filesystem",
"-d|--all-devices show only disks under /dev containing btrfs filesystem",
"-m|--mounted show only mounted btrfs",
HELPINFO_UNITS_LONG,
"If no argument is given, structure of all present filesystems is shown.",
NULL
};
static int cmd_filesystem_show(int argc, char **argv)
{
LIST_HEAD(all_uuids);
struct btrfs_fs_devices *fs_devices;
char *search = NULL;
int ret;
/* default, search both kernel and udev */
int where = -1;
int type = 0;
char mp[PATH_MAX];
char path[PATH_MAX];
u8 fsid[BTRFS_FSID_SIZE];
char uuid_buf[BTRFS_UUID_UNPARSED_SIZE];
unsigned unit_mode;
int found = 0;
unit_mode = get_unit_mode_from_arg(&argc, argv, 0);
optind = 0;
while (1) {
int c;
static const struct option long_options[] = {
{ "all-devices", no_argument, NULL, 'd'},
{ "mounted", no_argument, NULL, 'm'},
{ NULL, 0, NULL, 0 }
};
c = getopt_long(argc, argv, "dm", long_options, NULL);
if (c < 0)
break;
switch (c) {
case 'd':
where = BTRFS_SCAN_LBLKID;
break;
case 'm':
where = BTRFS_SCAN_MOUNTED;
break;
default:
usage(cmd_filesystem_show_usage);
}
}
if (check_argc_max(argc, optind + 1))
usage(cmd_filesystem_show_usage);
if (argc > optind) {
search = argv[optind];
if (*search == 0)
usage(cmd_filesystem_show_usage);
type = check_arg_type(search);
/*
* For search is a device:
* realpath do /dev/mapper/XX => /dev/dm-X
* which is required by BTRFS_SCAN_DEV
* For search is a mountpoint:
* realpath do /mnt/btrfs/ => /mnt/btrfs
* which shall be recognized by btrfs_scan_kernel()
*/
if (realpath(search, path))
search = path;
/*
* Needs special handling if input arg is block dev And if
* input arg is mount-point just print it right away
*/
if (type == BTRFS_ARG_BLKDEV && where != BTRFS_SCAN_LBLKID) {
ret = get_btrfs_mount(search, mp, sizeof(mp));
if (!ret) {
/* given block dev is mounted */
search = mp;
type = BTRFS_ARG_MNTPOINT;
} else {
ret = dev_to_fsid(search, fsid);
if (ret) {
error("no btrfs on %s", search);
return 1;
}
uuid_unparse(fsid, uuid_buf);
search = uuid_buf;
type = BTRFS_ARG_UUID;
goto devs_only;
}
}
}
if (where == BTRFS_SCAN_LBLKID)
goto devs_only;
/* show mounted btrfs */
ret = btrfs_scan_kernel(search, unit_mode);
if (search && !ret) {
/* since search is found we are done */
goto out;
}
/* shows mounted only */
if (where == BTRFS_SCAN_MOUNTED)
goto out;
devs_only:
ret = btrfs_scan_devices();
if (ret) {
error("blkid device scan returned %d", ret);
return 1;
}
ret = search_umounted_fs_uuids(&all_uuids, search, &found);
if (ret < 0) {
error("searching target device returned error %d", ret);
return 1;
}
/*
* The seed/sprout mapping are not detected yet,
* do mapping build for all umounted fs
*/
ret = map_seed_devices(&all_uuids);
if (ret) {
error("mapping seed devices returned error %d", ret);
return 1;
}
list_for_each_entry(fs_devices, &all_uuids, list)
print_one_uuid(fs_devices, unit_mode);
if (search && !found) {
error("not a valid btrfs filesystem: %s", search);
ret = 1;
}
while (!list_empty(&all_uuids)) {
fs_devices = list_entry(all_uuids.next,
struct btrfs_fs_devices, list);
free_fs_devices(fs_devices);
}
out:
free_seen_fsid(seen_fsid_hash);
return ret;
}
static const char * const cmd_filesystem_sync_usage[] = {
"btrfs filesystem sync <path>",
"Force a sync on a filesystem",
NULL
};
static int cmd_filesystem_sync(int argc, char **argv)
{
enum btrfs_util_error err;
clean_args_no_options(argc, argv, cmd_filesystem_sync_usage);
if (check_argc_exact(argc - optind, 1))
usage(cmd_filesystem_sync_usage);
err = btrfs_util_sync(argv[optind]);
if (err) {
error_btrfs_util(err);
return 1;
}
return 0;
}
static int parse_compress_type(char *s)
{
if (strcmp(optarg, "zlib") == 0)
return BTRFS_COMPRESS_ZLIB;
else if (strcmp(optarg, "lzo") == 0)
return BTRFS_COMPRESS_LZO;
else if (strcmp(optarg, "zstd") == 0)
return BTRFS_COMPRESS_ZSTD;
else {
error("unknown compression type %s", s);
exit(1);
};
}
static const char * const cmd_filesystem_defrag_usage[] = {
"btrfs filesystem defragment [options] <file>|<dir> [<file>|<dir>...]",
"Defragment a file or a directory",
"",
"-v be verbose",
"-r defragment files recursively",
"-c[zlib,lzo,zstd] compress the file while defragmenting",
"-f flush data to disk immediately after defragmenting",
"-s start defragment only from byte onward",
"-l len defragment only up to len bytes",
"-t size target extent size hint (default: 32M)",
"",
"Warning: most Linux kernels will break up the ref-links of COW data",
"(e.g., files copied with 'cp --reflink', snapshots) which may cause",
"considerable increase of space usage. See btrfs-filesystem(8) for",
"more information.",
NULL
};
static struct btrfs_ioctl_defrag_range_args defrag_global_range;
static int defrag_global_verbose;
static int defrag_global_errors;
static int defrag_callback(const char *fpath, const struct stat *sb,
int typeflag, struct FTW *ftwbuf)
{
int ret = 0;
int fd = 0;
if ((typeflag == FTW_F) && S_ISREG(sb->st_mode)) {
if (defrag_global_verbose)
printf("%s\n", fpath);
fd = open(fpath, O_RDWR);
if (fd < 0) {
goto error;
}
ret = ioctl(fd, BTRFS_IOC_DEFRAG_RANGE, &defrag_global_range);
close(fd);
if (ret && errno == ENOTTY) {
error(
"defrag range ioctl not supported in this kernel version, 2.6.33 and newer is required");
defrag_global_errors++;
return ENOTTY;
}
if (ret) {
goto error;
}
}
return 0;
error:
error("defrag failed on %s: %m", fpath);
defrag_global_errors++;
return 0;
}
static int cmd_filesystem_defrag(int argc, char **argv)
{
int fd;
int flush = 0;
u64 start = 0;
u64 len = (u64)-1;
u64 thresh;
int i;
int recursive = 0;
int ret = 0;
int compress_type = BTRFS_COMPRESS_NONE;
DIR *dirstream;
/*
* Kernel has a different default (256K) that is supposed to be safe,
* but it does not defragment very well. The 32M will likely lead to
* better results and is independent of the kernel default. We have to
* use the v2 defrag ioctl.
*/
thresh = SZ_32M;
defrag_global_errors = 0;
defrag_global_verbose = 0;
defrag_global_errors = 0;
optind = 0;
while(1) {
int c = getopt(argc, argv, "vrc::fs:l:t:");
if (c < 0)
break;
switch(c) {
case 'c':
compress_type = BTRFS_COMPRESS_ZLIB;
if (optarg)
compress_type = parse_compress_type(optarg);
break;
case 'f':
flush = 1;
break;
case 'v':
defrag_global_verbose = 1;
break;
case 's':
start = parse_size(optarg);
break;
case 'l':
len = parse_size(optarg);
break;
case 't':
thresh = parse_size(optarg);
if (thresh > (u32)-1) {
warning(
"target extent size %llu too big, trimmed to %u",
thresh, (u32)-1);
thresh = (u32)-1;
}
break;
case 'r':
recursive = 1;
break;
default:
usage(cmd_filesystem_defrag_usage);
}
}
if (check_argc_min(argc - optind, 1))
usage(cmd_filesystem_defrag_usage);
memset(&defrag_global_range, 0, sizeof(defrag_global_range));
defrag_global_range.start = start;
defrag_global_range.len = len;
defrag_global_range.extent_thresh = (u32)thresh;
if (compress_type) {
defrag_global_range.flags |= BTRFS_DEFRAG_RANGE_COMPRESS;
defrag_global_range.compress_type = compress_type;
}
if (flush)
defrag_global_range.flags |= BTRFS_DEFRAG_RANGE_START_IO;
/*
* Look for directory arguments and warn if the recursive mode is not
* requested, as this is not implemented as recursive defragmentation
* in kernel. The stat errors are silent here as we check them below.
*/
if (!recursive) {
int found = 0;
for (i = optind; i < argc; i++) {
struct stat st;
if (stat(argv[i], &st))
continue;
if (S_ISDIR(st.st_mode)) {
warning(
"directory specified but recursive mode not requested: %s",
argv[i]);