7 #include "ccan/darray/darray.h"
9 #include "linux/sort.h"
11 #include "libbcachefs/bcachefs_ioctl.h"
12 #include "libbcachefs/opts.h"
15 #include "libbcachefs.h"
17 static void print_dev_usage(struct bchfs_handle fs,
21 struct bch_ioctl_dev_usage u = bchu_dev_usage(fs, d->idx);
22 u64 available = u.nr_buckets;
26 printf_pad(20, "%s (device %u):", d->label ?: "(no label)", d->idx);
27 printf("%24s%12s\n", d->dev ?: "(device not found)", bch2_dev_state[u.state]);
29 printf("%-20s%12s%12s%12s\n",
30 "", "data", "buckets", "fragmented");
32 for (i = BCH_DATA_SB; i < BCH_DATA_NR; i++) {
33 u64 frag = max((s64) u.buckets[i] * u.bucket_size -
34 (s64) u.sectors[i], 0LL);
36 printf_pad(20, " %s:", bch2_data_types[i]);
37 printf("%12s%12llu%12s\n",
38 pr_units(u.sectors[i], units),
40 pr_units(frag, units));
42 if (i != BCH_DATA_CACHED)
43 available -= u.buckets[i];
46 printf_pad(20, " available:");
47 printf("%12s%12llu\n",
48 pr_units(available * u.bucket_size, units),
51 printf_pad(20, " capacity:");
52 printf("%12s%12llu\n",
53 pr_units(u.nr_buckets * u.bucket_size, units),
57 static int dev_by_label_cmp(const void *_l, const void *_r)
59 const struct dev_name *l = _l, *r = _r;
61 return (l->label && r->label
62 ? strcmp(l->label, r->label) : 0) ?:
64 ? strcmp(l->dev, r->dev) : 0) ?:
65 cmp_int(l->idx, r->idx);
68 static void print_fs_usage(const char *path, enum units units)
73 struct bchfs_handle fs = bcache_fs_open(path);
76 dev_names dev_names = bchu_fs_get_devices(fs);
78 struct bch_ioctl_fs_usage *u = bchu_fs_usage(fs);
80 uuid_unparse(fs.uuid.b, uuid);
81 printf("Filesystem %s:\n", uuid);
83 printf("%-20s%12s\n", "Size:", pr_units(u->capacity, units));
84 printf("%-20s%12s\n", "Used:", pr_units(u->used, units));
86 printf("%-20s%12s\n", "Online reserved:", pr_units(u->online_reserved, units));
89 printf("%-16s%-16s%s\n", "Data type", "Required/total", "Devices");
91 for (i = 0; i < BCH_REPLICAS_MAX; i++) {
92 if (!u->persistent_reserved[i])
95 printf_pad(16, "%s: ", "reserved");
96 printf_pad(16, "%u/%u ", 1, i);
97 printf_pad(32, "[] ");
98 printf("%s\n", pr_units(u->persistent_reserved[i], units));
101 struct bch_replicas_usage *r;
103 for (r = u->replicas;
104 r != (void *) u->replicas + u->replica_entries_bytes;
105 r = replicas_usage_next(r)) {
106 BUG_ON((void *) r > (void *) u->replicas + u->replica_entries_bytes);
111 char devs[4096], *d = devs;
114 for (i = 0; i < r->r.nr_devs; i++) {
115 unsigned dev_idx = r->r.devs[i];
119 darray_foreach(dev, dev_names)
120 if (dev->idx == dev_idx)
125 ? sprintf(d, "%s", dev->dev)
126 : sprintf(d, "%u", dev_idx);
131 printf_pad(16, "%s: ", bch2_data_types[r->r.data_type]);
132 printf_pad(16, "%u/%u ", r->r.nr_required, r->r.nr_devs);
133 printf_pad(32, "%s ", devs);
134 printf(" %s\n", pr_units(r->sectors, units));
139 sort(&darray_item(dev_names, 0), darray_size(dev_names),
140 sizeof(darray_item(dev_names, 0)), dev_by_label_cmp, NULL);
142 darray_foreach(dev, dev_names)
143 print_dev_usage(fs, dev, units);
145 darray_foreach(dev, dev_names) {
149 darray_free(dev_names);
154 int cmd_fs_usage(int argc, char *argv[])
156 enum units units = BYTES;
160 while ((opt = getopt(argc, argv, "h")) != -1)
163 units = HUMAN_READABLE;
169 print_fs_usage(".", units);
171 while ((fs = arg_pop()))
172 print_fs_usage(fs, units);