?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
btrfs-progs: alias btrfs device delete to btrfs device remove
[btrfs-progs-unstable/devel.git] / cmds-fi-usage.c
blobadf1c27f43354dbfc4375c598a430bfd8e16baa0
1 /*
2 * This program is free software; you can redistribute it and/or
3 * modify it under the terms of the GNU General Public
4 * License v2 as published by the Free Software Foundation.
5 *
6 * This program is distributed in the hope that it will be useful,
7 * but WITHOUT ANY WARRANTY; without even the implied warranty of
8 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
9 * General Public License for more details.
10 *
11 * You should have received a copy of the GNU General Public
12 * License along with this program; if not, write to the
13 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
14 * Boston, MA 021110-1307, USA.
15 */
16
17 #include <stdio.h>
18 #include <stdlib.h>
19 #include <string.h>
20 #include <unistd.h>
21 #include <sys/ioctl.h>
22 #include <errno.h>
23 #include <stdarg.h>
24 #include <getopt.h>
25
26 #include "utils.h"
27 #include "kerncompat.h"
28 #include "ctree.h"
29 #include "string-table.h"
30 #include "cmds-fi-usage.h"
31 #include "commands.h"
32
33 #include "version.h"
34
35 /*
36 * Add the chunk info to the chunk_info list
37 */
38 static int add_info_to_list(struct chunk_info **info_ptr,
39 int *info_count,
40 struct btrfs_chunk *chunk)
41 {
42
43 u64 type = btrfs_stack_chunk_type(chunk);
44 u64 size = btrfs_stack_chunk_length(chunk);
45 int num_stripes = btrfs_stack_chunk_num_stripes(chunk);
46 int j;
47
48 for (j = 0 ; j < num_stripes ; j++) {
49 int i;
50 struct chunk_info *p = 0;
51 struct btrfs_stripe *stripe;
52 u64 devid;
53
54 stripe = btrfs_stripe_nr(chunk, j);
55 devid = btrfs_stack_stripe_devid(stripe);
56
57 for (i = 0 ; i < *info_count ; i++)
58 if ((*info_ptr)[i].type == type &&
59 (*info_ptr)[i].devid == devid &&
60 (*info_ptr)[i].num_stripes == num_stripes ) {
61 p = (*info_ptr) + i;
62 break;
63 }
64
65 if (!p) {
66 int size = sizeof(struct btrfs_chunk) * (*info_count+1);
67 struct chunk_info *res = realloc(*info_ptr, size);
68
69 if (!res) {
70 free(*info_ptr);
71 fprintf(stderr, "ERROR: not enough memory\n");
72 return -ENOMEM;
73 }
74
75 *info_ptr = res;
76 p = res + *info_count;
77 (*info_count)++;
78
79 p->devid = devid;
80 p->type = type;
81 p->size = 0;
82 p->num_stripes = num_stripes;
83 }
84
85 p->size += size;
86
87 }
88
89 return 0;
90
91 }
92
93 /*
94 * Helper to sort the chunk type
95 */
96 static int cmp_chunk_block_group(u64 f1, u64 f2)
97 {
98
99 u64 mask;
100
101 if ((f1 & BTRFS_BLOCK_GROUP_TYPE_MASK) ==
102 (f2 & BTRFS_BLOCK_GROUP_TYPE_MASK))
103 mask = BTRFS_BLOCK_GROUP_PROFILE_MASK;
104 else if (f2 & BTRFS_BLOCK_GROUP_SYSTEM)
105 return -1;
106 else if (f1 & BTRFS_BLOCK_GROUP_SYSTEM)
107 return +1;
108 else
109 mask = BTRFS_BLOCK_GROUP_TYPE_MASK;
110
111 if ((f1 & mask) > (f2 & mask))
112 return +1;
113 else if ((f1 & mask) < (f2 & mask))
114 return -1;
115 else
116 return 0;
117 }
118
119 /*
120 * Helper to sort the chunk
121 */
122 static int cmp_chunk_info(const void *a, const void *b)
123 {
124 return cmp_chunk_block_group(
125 ((struct chunk_info *)a)->type,
126 ((struct chunk_info *)b)->type);
127 }
128
129 static int load_chunk_info(int fd, struct chunk_info **info_ptr, int *info_count)
130 {
131 int ret;
132 struct btrfs_ioctl_search_args args;
133 struct btrfs_ioctl_search_key *sk = &args.key;
134 struct btrfs_ioctl_search_header *sh;
135 unsigned long off = 0;
136 int i, e;
137
138 memset(&args, 0, sizeof(args));
139
140 /*
141 * there may be more than one ROOT_ITEM key if there are
142 * snapshots pending deletion, we have to loop through
143 * them.
144 */
145 sk->tree_id = BTRFS_CHUNK_TREE_OBJECTID;
146
147 sk->min_objectid = 0;
148 sk->max_objectid = (u64)-1;
149 sk->max_type = 0;
150 sk->min_type = (u8)-1;
151 sk->min_offset = 0;
152 sk->max_offset = (u64)-1;
153 sk->min_transid = 0;
154 sk->max_transid = (u64)-1;
155 sk->nr_items = 4096;
156
157 while (1) {
158 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
159 e = errno;
160 if (e == EPERM)
161 return -e;
162
163 if (ret < 0) {
164 fprintf(stderr,
165 "ERROR: can't perform the search - %s\n",
166 strerror(e));
167 return 1;
168 }
169 /* the ioctl returns the number of item it found in nr_items */
170
171 if (sk->nr_items == 0)
172 break;
173
174 off = 0;
175 for (i = 0; i < sk->nr_items; i++) {
176 struct btrfs_chunk *item;
177 sh = (struct btrfs_ioctl_search_header *)(args.buf +
178 off);
179
180 off += sizeof(*sh);
181 item = (struct btrfs_chunk *)(args.buf + off);
182
183 ret = add_info_to_list(info_ptr, info_count, item);
184 if (ret) {
185 *info_ptr = 0;
186 return 1;
187 }
188
189 off += sh->len;
190
191 sk->min_objectid = sh->objectid;
192 sk->min_type = sh->type;
193 sk->min_offset = sh->offset+1;
194
195 }
196 if (!sk->min_offset) /* overflow */
197 sk->min_type++;
198 else
199 continue;
200
201 if (!sk->min_type)
202 sk->min_objectid++;
203 else
204 continue;
205
206 if (!sk->min_objectid)
207 break;
208 }
209
210 qsort(*info_ptr, *info_count, sizeof(struct chunk_info),
211 cmp_chunk_info);
212
213 return 0;
214 }
215
216 /*
217 * Helper to sort the struct btrfs_ioctl_space_info
218 */
219 static int cmp_btrfs_ioctl_space_info(const void *a, const void *b)
220 {
221 return cmp_chunk_block_group(
222 ((struct btrfs_ioctl_space_info *)a)->flags,
223 ((struct btrfs_ioctl_space_info *)b)->flags);
224 }
225
226 /*
227 * This function load all the information about the space usage
228 */
229 static struct btrfs_ioctl_space_args *load_space_info(int fd, char *path)
230 {
231 struct btrfs_ioctl_space_args *sargs = 0, *sargs_orig = 0;
232 int e, ret, count;
233
234 sargs_orig = sargs = calloc(1, sizeof(struct btrfs_ioctl_space_args));
235 if (!sargs) {
236 fprintf(stderr, "ERROR: not enough memory\n");
237 return NULL;
238 }
239
240 sargs->space_slots = 0;
241 sargs->total_spaces = 0;
242
243 ret = ioctl(fd, BTRFS_IOC_SPACE_INFO, sargs);
244 e = errno;
245 if (ret) {
246 fprintf(stderr,
247 "ERROR: couldn't get space info on '%s' - %s\n",
248 path, strerror(e));
249 free(sargs);
250 return NULL;
251 }
252 if (!sargs->total_spaces) {
253 free(sargs);
254 printf("No chunks found\n");
255 return NULL;
256 }
257
258 count = sargs->total_spaces;
259
260 sargs = realloc(sargs, sizeof(struct btrfs_ioctl_space_args) +
261 (count * sizeof(struct btrfs_ioctl_space_info)));
262 if (!sargs) {
263 free(sargs_orig);
264 fprintf(stderr, "ERROR: not enough memory\n");
265 return NULL;
266 }
267
268 sargs->space_slots = count;
269 sargs->total_spaces = 0;
270
271 ret = ioctl(fd, BTRFS_IOC_SPACE_INFO, sargs);
272 e = errno;
273
274 if (ret) {
275 fprintf(stderr,
276 "ERROR: couldn't get space info on '%s' - %s\n",
277 path, strerror(e));
278 free(sargs);
279 return NULL;
280 }
281
282 qsort(&(sargs->spaces), count, sizeof(struct btrfs_ioctl_space_info),
283 cmp_btrfs_ioctl_space_info);
284
285 return sargs;
286 }
287
288 /*
289 * This function computes the space occuped by a *single* RAID5/RAID6 chunk.
290 * The computation is performed on the basis of the number of stripes
291 * which compose the chunk, which could be different from the number of devices
292 * if a disk is added later.
293 */
294 static void get_raid56_used(int fd, struct chunk_info *chunks, int chunkcount,
295 u64 *raid5_used, u64 *raid6_used)
296 {
297 struct chunk_info *info_ptr = chunks;
298 *raid5_used = 0;
299 *raid6_used = 0;
300
301 while (chunkcount-- > 0) {
302 if (info_ptr->type & BTRFS_BLOCK_GROUP_RAID5)
303 (*raid5_used) += info_ptr->size / (info_ptr->num_stripes - 1);
304 if (info_ptr->type & BTRFS_BLOCK_GROUP_RAID6)
305 (*raid6_used) += info_ptr->size / (info_ptr->num_stripes - 2);
306 info_ptr++;
307 }
308 }
309
310 #define MIN_UNALOCATED_THRESH (16 * 1024 * 1024)
311 static int print_filesystem_usage_overall(int fd, struct chunk_info *chunkinfo,
312 int chunkcount, struct device_info *devinfo, int devcount,
313 char *path, unsigned unit_mode)
314 {
315 struct btrfs_ioctl_space_args *sargs = 0;
316 int i;
317 int ret = 0;
318 int width = 10; /* default 10 for human units */
319 /*
320 * r_* prefix is for raw data
321 * l_* is for logical
322 */
323 u64 r_total_size = 0; /* filesystem size, sum of device sizes */
324 u64 r_total_chunks = 0; /* sum of chunks sizes on disk(s) */
325 u64 r_total_used = 0;
326 u64 r_total_unused = 0;
327 u64 r_total_missing = 0; /* sum of missing devices size */
328 u64 r_data_used = 0;
329 u64 r_data_chunks = 0;
330 u64 l_data_chunks = 0;
331 u64 r_metadata_used = 0;
332 u64 r_metadata_chunks = 0;
333 u64 l_metadata_chunks = 0;
334 u64 r_system_used = 0;
335 u64 r_system_chunks = 0;
336 double data_ratio;
337 double metadata_ratio;
338 /* logical */
339 u64 raid5_used = 0;
340 u64 raid6_used = 0;
341 u64 l_global_reserve = 0;
342 u64 l_global_reserve_used = 0;
343 u64 free_estimated = 0;
344 u64 free_min = 0;
345 int max_data_ratio = 1;
346
347 sargs = load_space_info(fd, path);
348 if (!sargs) {
349 ret = 1;
350 goto exit;
351 }
352
353 r_total_size = 0;
354 for (i = 0; i < devcount; i++) {
355 r_total_size += devinfo[i].size;
356 if (!devinfo[i].device_size)
357 r_total_missing += devinfo[i].size;
358 }
359
360 if (r_total_size == 0) {
361 fprintf(stderr,
362 "ERROR: couldn't get space info on '%s' - %s\n",
363 path, strerror(errno));
364
365 ret = 1;
366 goto exit;
367 }
368 get_raid56_used(fd, chunkinfo, chunkcount, &raid5_used, &raid6_used);
369
370 for (i = 0; i < sargs->total_spaces; i++) {
371 int ratio;
372 u64 flags = sargs->spaces[i].flags;
373
374 /*
375 * The raid5/raid6 ratio depends by the stripes number
376 * used by every chunk. It is computed separately
377 */
378 if (flags & BTRFS_BLOCK_GROUP_RAID0)
379 ratio = 1;
380 else if (flags & BTRFS_BLOCK_GROUP_RAID1)
381 ratio = 2;
382 else if (flags & BTRFS_BLOCK_GROUP_RAID5)
383 ratio = 0;
384 else if (flags & BTRFS_BLOCK_GROUP_RAID6)
385 ratio = 0;
386 else if (flags & BTRFS_BLOCK_GROUP_DUP)
387 ratio = 2;
388 else if (flags & BTRFS_BLOCK_GROUP_RAID10)
389 ratio = 2;
390 else
391 ratio = 1;
392
393 if (!ratio)
394 fprintf(stderr, "WARNING: RAID56 detected, not implemented\n");
395
396 if (ratio > max_data_ratio)
397 max_data_ratio = ratio;
398
399 if (flags & BTRFS_SPACE_INFO_GLOBAL_RSV) {
400 l_global_reserve = sargs->spaces[i].total_bytes;
401 l_global_reserve_used = sargs->spaces[i].used_bytes;
402 }
403 if ((flags & (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA))
404 == (BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA)) {
405 fprintf(stderr, "WARNING: MIXED blockgroups not handled\n");
406 }
407
408 if (flags & BTRFS_BLOCK_GROUP_DATA) {
409 r_data_used += sargs->spaces[i].used_bytes * ratio;
410 r_data_chunks += sargs->spaces[i].total_bytes * ratio;
411 l_data_chunks += sargs->spaces[i].total_bytes;
412 }
413 if (flags & BTRFS_BLOCK_GROUP_METADATA) {
414 r_metadata_used += sargs->spaces[i].used_bytes * ratio;
415 r_metadata_chunks += sargs->spaces[i].total_bytes * ratio;
416 l_metadata_chunks += sargs->spaces[i].total_bytes;
417 }
418 if (flags & BTRFS_BLOCK_GROUP_SYSTEM) {
419 r_system_used += sargs->spaces[i].used_bytes * ratio;
420 r_system_chunks += sargs->spaces[i].total_bytes * ratio;
421 }
422 }
423
424 r_total_chunks = r_data_chunks + r_metadata_chunks + r_system_chunks;
425 r_total_used = r_data_used + r_metadata_used + r_system_used;
426 r_total_unused = r_total_size - r_total_chunks;
427
428 /* Raw / Logical = raid factor, >= 1 */
429 data_ratio = (double)r_data_chunks / l_data_chunks;
430 metadata_ratio = (double)r_metadata_chunks / l_metadata_chunks;
431
432 #if 0
433 /* add the raid5/6 allocated space */
434 total_chunks += raid5_used + raid6_used;
435 #endif
436
437 /*
438 * We're able to fill at least DATA for the unused space
439 *
440 * With mixed raid levels, this gives a rough estimate but more
441 * accurate than just counting the logical free space
442 * (l_data_chunks - l_data_used)
443 *
444 * In non-mixed case there's no difference.
445 */
446 free_estimated = (r_data_chunks - r_data_used) / data_ratio;
447 free_min = free_estimated;
448
449 /* Chop unallocatable space */
450 /* FIXME: must be applied per device */
451 if (r_total_unused >= MIN_UNALOCATED_THRESH) {
452 free_estimated += r_total_unused / data_ratio;
453 /* Match the calculation of 'df', use the highest raid ratio */
454 free_min += r_total_unused / max_data_ratio;
455 }
456
457 if (unit_mode != UNITS_HUMAN)
458 width = 18;
459
460 printf("Overall:\n");
461
462 printf(" Device size:\t\t%*s\n", width,
463 pretty_size_mode(r_total_size, unit_mode));
464 printf(" Device allocated:\t\t%*s\n", width,
465 pretty_size_mode(r_total_chunks, unit_mode));
466 printf(" Device unallocated:\t\t%*s\n", width,
467 pretty_size_mode(r_total_unused, unit_mode));
468 printf(" Device missing:\t\t%*s\n", width,
469 pretty_size_mode(r_total_missing, unit_mode));
470 printf(" Used:\t\t\t%*s\n", width,
471 pretty_size_mode(r_total_used, unit_mode));
472 printf(" Free (estimated):\t\t%*s\t(",
473 width,
474 pretty_size_mode(free_estimated, unit_mode));
475 printf("min: %s)\n", pretty_size_mode(free_min, unit_mode));
476 printf(" Data ratio:\t\t\t%*.2f\n",
477 width, data_ratio);
478 printf(" Metadata ratio:\t\t%*.2f\n",
479 width, metadata_ratio);
480 printf(" Global reserve:\t\t%*s\t(used: %s)\n", width,
481 pretty_size_mode(l_global_reserve, unit_mode),
482 pretty_size_mode(l_global_reserve_used, unit_mode));
483
484 exit:
485
486 if (sargs)
487 free(sargs);
488
489 return ret;
490 }
491
492 /*
493 * Helper to sort the device_info structure
494 */
495 static int cmp_device_info(const void *a, const void *b)
496 {
497 return strcmp(((struct device_info *)a)->path,
498 ((struct device_info *)b)->path);
499 }
500
501 /*
502 * This function loads the device_info structure and put them in an array
503 */
504 static int load_device_info(int fd, struct device_info **device_info_ptr,
505 int *device_info_count)
506 {
507 int ret, i, ndevs, e;
508 struct btrfs_ioctl_fs_info_args fi_args;
509 struct btrfs_ioctl_dev_info_args dev_info;
510 struct device_info *info;
511
512 *device_info_count = 0;
513 *device_info_ptr = 0;
514
515 ret = ioctl(fd, BTRFS_IOC_FS_INFO, &fi_args);
516 e = errno;
517 if (e == EPERM)
518 return -e;
519 if (ret < 0) {
520 fprintf(stderr, "ERROR: cannot get filesystem info - %s\n",
521 strerror(e));
522 return 1;
523 }
524
525 info = calloc(fi_args.num_devices, sizeof(struct device_info));
526 if (!info) {
527 fprintf(stderr, "ERROR: not enough memory\n");
528 return 1;
529 }
530
531 for (i = 0, ndevs = 0 ; i <= fi_args.max_id ; i++) {
532 BUG_ON(ndevs >= fi_args.num_devices);
533 memset(&dev_info, 0, sizeof(dev_info));
534 ret = get_device_info(fd, i, &dev_info);
535
536 if (ret == -ENODEV)
537 continue;
538 if (ret) {
539 fprintf(stderr,
540 "ERROR: cannot get info about device devid=%d\n",
541 i);
542 free(info);
543 return ret;
544 }
545
546 info[ndevs].devid = dev_info.devid;
547 if (!dev_info.path[0]) {
548 strcpy(info[ndevs].path, "missing");
549 } else {
550 strcpy(info[ndevs].path, (char *)dev_info.path);
551 info[ndevs].device_size =
552 get_partition_size((char *)dev_info.path);
553 }
554 info[ndevs].size = dev_info.total_bytes;
555 ++ndevs;
556 }
557
558 BUG_ON(ndevs != fi_args.num_devices);
559 qsort(info, fi_args.num_devices,
560 sizeof(struct device_info), cmp_device_info);
561
562 *device_info_count = fi_args.num_devices;
563 *device_info_ptr = info;
564
565 return 0;
566 }
567
568 int load_chunk_and_device_info(int fd, struct chunk_info **chunkinfo,
569 int *chunkcount, struct device_info **devinfo, int *devcount)
570 {
571 int ret;
572
573 ret = load_chunk_info(fd, chunkinfo, chunkcount);
574 if (ret == -EPERM) {
575 fprintf(stderr,
576 "WARNING: can't read detailed chunk info, RAID5/6 numbers will be incorrect, run as root\n");
577 } else if (ret) {
578 return ret;
579 }
580
581 ret = load_device_info(fd, devinfo, devcount);
582 if (ret == -EPERM) {
583 fprintf(stderr,
584 "WARNING: can't get filesystem info from ioctl(FS_INFO), run as root\n");
585 ret = 0;
586 }
587
588 return ret;
589 }
590
591 /*
592 * This function computes the size of a chunk in a disk
593 */
594 static u64 calc_chunk_size(struct chunk_info *ci)
595 {
596 if (ci->type & BTRFS_BLOCK_GROUP_RAID0)
597 return ci->size / ci->num_stripes;
598 else if (ci->type & BTRFS_BLOCK_GROUP_RAID1)
599 return ci->size ;
600 else if (ci->type & BTRFS_BLOCK_GROUP_DUP)
601 return ci->size ;
602 else if (ci->type & BTRFS_BLOCK_GROUP_RAID5)
603 return ci->size / (ci->num_stripes -1);
604 else if (ci->type & BTRFS_BLOCK_GROUP_RAID6)
605 return ci->size / (ci->num_stripes -2);
606 else if (ci->type & BTRFS_BLOCK_GROUP_RAID10)
607 return ci->size / ci->num_stripes;
608 return ci->size;
609 }
610
611 /*
612 * This function print the results of the command "btrfs fi usage"
613 * in tabular format
614 */
615 static void _cmd_filesystem_usage_tabular(unsigned unit_mode,
616 struct btrfs_ioctl_space_args *sargs,
617 struct chunk_info *chunks_info_ptr,
618 int chunks_info_count,
619 struct device_info *device_info_ptr,
620 int device_info_count)
621 {
622 int i;
623 u64 total_unused = 0;
624 struct string_table *matrix = 0;
625 int ncols, nrows;
626
627 ncols = sargs->total_spaces + 2;
628 nrows = 2 + 1 + device_info_count + 1 + 2;
629
630 matrix = table_create(ncols, nrows);
631 if (!matrix) {
632 fprintf(stderr, "ERROR: not enough memory\n");
633 return;
634 }
635
636 /* header */
637 for (i = 0; i < sargs->total_spaces; i++) {
638 const char *description;
639 u64 flags = sargs->spaces[i].flags;
640
641 if (flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
642 continue;
643
644 description = btrfs_group_type_str(flags);
645
646 table_printf(matrix, 1+i, 0, "<%s", description);
647 }
648
649 for (i = 0; i < sargs->total_spaces; i++) {
650 const char *r_mode;
651
652 u64 flags = sargs->spaces[i].flags;
653 r_mode = btrfs_group_profile_str(flags);
654
655 table_printf(matrix, 1+i, 1, "<%s", r_mode);
656 }
657
658 table_printf(matrix, 1+sargs->total_spaces, 1, "<Unallocated");
659
660 /* body */
661 for (i = 0; i < device_info_count; i++) {
662 int k, col;
663 char *p;
664
665 u64 total_allocated = 0, unused;
666
667 p = strrchr(device_info_ptr[i].path, '/');
668 if (!p)
669 p = device_info_ptr[i].path;
670 else
671 p++;
672
673 table_printf(matrix, 0, i + 3, "<%s", device_info_ptr[i].path);
674
675 for (col = 1, k = 0 ; k < sargs->total_spaces ; k++) {
676 u64 flags = sargs->spaces[k].flags;
677 u64 devid = device_info_ptr[i].devid;
678 int j;
679 u64 size = 0;
680
681 for (j = 0 ; j < chunks_info_count ; j++) {
682 if (chunks_info_ptr[j].type != flags )
683 continue;
684 if (chunks_info_ptr[j].devid != devid)
685 continue;
686
687 size += calc_chunk_size(chunks_info_ptr+j);
688 }
689
690 if (size)
691 table_printf(matrix, col, i+3,
692 ">%s", pretty_size_mode(size, unit_mode));
693 else
694 table_printf(matrix, col, i+3, ">-");
695
696 total_allocated += size;
697 col++;
698 }
699
700 unused = get_partition_size(device_info_ptr[i].path)
701 - total_allocated;
702
703 table_printf(matrix, sargs->total_spaces + 1, i + 3,
704 ">%s", pretty_size_mode(unused, unit_mode));
705 total_unused += unused;
706
707 }
708
709 for (i = 0; i <= sargs->total_spaces; i++)
710 table_printf(matrix, i + 1, device_info_count + 3, "=");
711
712 /* footer */
713 table_printf(matrix, 0, device_info_count + 4, "<Total");
714 for (i = 0; i < sargs->total_spaces; i++)
715 table_printf(matrix, 1 + i, device_info_count + 4, ">%s",
716 pretty_size_mode(sargs->spaces[i].total_bytes, unit_mode));
717
718 table_printf(matrix, sargs->total_spaces + 1, device_info_count + 4,
719 ">%s", pretty_size_mode(total_unused, unit_mode));
720
721 table_printf(matrix, 0, device_info_count + 5, "<Used");
722 for (i = 0; i < sargs->total_spaces; i++)
723 table_printf(matrix, 1 + i, device_info_count+5, ">%s",
724 pretty_size_mode(sargs->spaces[i].used_bytes, unit_mode));
725
726 table_dump(matrix);
727 table_free(matrix);
728 }
729
730 /*
731 * This function prints the unused space per every disk
732 */
733 static void print_unused(struct chunk_info *info_ptr,
734 int info_count,
735 struct device_info *device_info_ptr,
736 int device_info_count,
737 unsigned unit_mode)
738 {
739 int i;
740 for (i = 0; i < device_info_count; i++) {
741 int j;
742 u64 total = 0;
743
744 for (j = 0; j < info_count; j++)
745 if (info_ptr[j].devid == device_info_ptr[i].devid)
746 total += calc_chunk_size(info_ptr+j);
747
748 printf(" %s\t%10s\n",
749 device_info_ptr[i].path,
750 pretty_size_mode(device_info_ptr[i].size - total,
751 unit_mode));
752 }
753 }
754
755 /*
756 * This function prints the allocated chunk per every disk
757 */
758 static void print_chunk_device(u64 chunk_type,
759 struct chunk_info *chunks_info_ptr,
760 int chunks_info_count,
761 struct device_info *device_info_ptr,
762 int device_info_count,
763 unsigned unit_mode)
764 {
765 int i;
766
767 for (i = 0; i < device_info_count; i++) {
768 int j;
769 u64 total = 0;
770
771 for (j = 0; j < chunks_info_count; j++) {
772
773 if (chunks_info_ptr[j].type != chunk_type)
774 continue;
775 if (chunks_info_ptr[j].devid != device_info_ptr[i].devid)
776 continue;
777
778 total += calc_chunk_size(&(chunks_info_ptr[j]));
779 //total += chunks_info_ptr[j].size;
780 }
781
782 if (total > 0)
783 printf(" %s\t%10s\n",
784 device_info_ptr[i].path,
785 pretty_size_mode(total, unit_mode));
786 }
787 }
788
789 /*
790 * This function print the results of the command "btrfs fi usage"
791 * in linear format
792 */
793 static void _cmd_filesystem_usage_linear(unsigned unit_mode,
794 struct btrfs_ioctl_space_args *sargs,
795 struct chunk_info *info_ptr,
796 int info_count,
797 struct device_info *device_info_ptr,
798 int device_info_count)
799 {
800 int i;
801
802 for (i = 0; i < sargs->total_spaces; i++) {
803 const char *description;
804 const char *r_mode;
805 u64 flags = sargs->spaces[i].flags;
806
807 if (flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
808 continue;
809
810 description = btrfs_group_type_str(flags);
811 r_mode = btrfs_group_profile_str(flags);
812
813 printf("%s,%s: Size:%s, ",
814 description,
815 r_mode,
816 pretty_size_mode(sargs->spaces[i].total_bytes,
817 unit_mode));
818 printf("Used:%s\n",
819 pretty_size_mode(sargs->spaces[i].used_bytes, unit_mode));
820 print_chunk_device(flags, info_ptr, info_count,
821 device_info_ptr, device_info_count, unit_mode);
822 printf("\n");
823 }
824
825 printf("Unallocated:\n");
826 print_unused(info_ptr, info_count, device_info_ptr, device_info_count,
827 unit_mode);
828 }
829
830 static int print_filesystem_usage_by_chunk(int fd,
831 struct chunk_info *chunkinfo, int chunkcount,
832 struct device_info *devinfo, int devcount,
833 char *path, unsigned unit_mode, int tabular)
834 {
835 struct btrfs_ioctl_space_args *sargs;
836 int ret = 0;
837
838 if (!chunkinfo)
839 return 0;
840
841 sargs = load_space_info(fd, path);
842 if (!sargs) {
843 ret = 1;
844 goto out;
845 }
846
847 if (tabular)
848 _cmd_filesystem_usage_tabular(unit_mode, sargs, chunkinfo,
849 chunkcount, devinfo, devcount);
850 else
851 _cmd_filesystem_usage_linear(unit_mode, sargs, chunkinfo,
852 chunkcount, devinfo, devcount);
853
854 free(sargs);
855 out:
856 return ret;
857 }
858
859 const char * const cmd_filesystem_usage_usage[] = {
860 "btrfs filesystem usage [options] <path> [<path>..]",
861 "Show detailed information about internal filesystem usage .",
862 "-b|--raw raw numbers in bytes",
863 "-h|--human-readable",
864 " human friendly numbers, base 1024 (default)",
865 "-H human friendly numbers, base 1000",
866 "--iec use 1024 as a base (KiB, MiB, GiB, TiB)",
867 "--si use 1000 as a base (kB, MB, GB, TB)",
868 "-k|--kbytes show sizes in KiB, or kB with --si",
869 "-m|--mbytes show sizes in MiB, or MB with --si",
870 "-g|--gbytes show sizes in GiB, or GB with --si",
871 "-t|--tbytes show sizes in TiB, or TB with --si",
872 "-T show data in tabular format",
873 NULL
874 };
875
876 int cmd_filesystem_usage(int argc, char **argv)
877 {
878 unsigned unit_mode = UNITS_DEFAULT;
879 int ret = 0;
880 int i, more_than_one = 0;
881 int tabular = 0;
882
883 optind = 1;
884 while (1) {
885 int c;
886 static const struct option long_options[] = {
887 { "raw", no_argument, NULL, 'b'},
888 { "kbytes", no_argument, NULL, 'k'},
889 { "mbytes", no_argument, NULL, 'm'},
890 { "gbytes", no_argument, NULL, 'g'},
891 { "tbytes", no_argument, NULL, 't'},
892 { "si", no_argument, NULL, GETOPT_VAL_SI},
893 { "iec", no_argument, NULL, GETOPT_VAL_IEC},
894 { "human-readable", no_argument, NULL,
895 GETOPT_VAL_HUMAN_READABLE},
896 { NULL, 0, NULL, 0 }
897 };
898
899 c = getopt_long(argc, argv, "bhHkmgtT", long_options, NULL);
900
901 if (c < 0)
902 break;
903 switch (c) {
904 case 'b':
905 unit_mode = UNITS_RAW;
906 break;
907 case 'k':
908 units_set_base(&unit_mode, UNITS_KBYTES);
909 break;
910 case 'm':
911 units_set_base(&unit_mode, UNITS_MBYTES);
912 break;
913 case 'g':
914 units_set_base(&unit_mode, UNITS_GBYTES);
915 break;
916 case 't':
917 units_set_base(&unit_mode, UNITS_TBYTES);
918 break;
919 case GETOPT_VAL_HUMAN_READABLE:
920 case 'h':
921 unit_mode = UNITS_HUMAN_BINARY;
922 break;
923 case 'H':
924 unit_mode = UNITS_HUMAN_DECIMAL;
925 break;
926 case GETOPT_VAL_SI:
927 units_set_mode(&unit_mode, UNITS_DECIMAL);
928 break;
929 case GETOPT_VAL_IEC:
930 units_set_mode(&unit_mode, UNITS_BINARY);
931 break;
932 case 'T':
933 tabular = 1;
934 break;
935 default:
936 usage(cmd_filesystem_usage_usage);
937 }
938 }
939
940 if (check_argc_min(argc - optind, 1))
941 usage(cmd_filesystem_usage_usage);
942
943 for (i = optind; i < argc; i++) {
944 int fd;
945 DIR *dirstream = NULL;
946 struct chunk_info *chunkinfo = NULL;
947 struct device_info *devinfo = NULL;
948 int chunkcount = 0;
949 int devcount = 0;
950
951 fd = open_file_or_dir(argv[i], &dirstream);
952 if (fd < 0) {
953 fprintf(stderr, "ERROR: can't access '%s'\n",
954 argv[i]);
955 ret = 1;
956 goto out;
957 }
958 if (more_than_one)
959 printf("\n");
960
961 ret = load_chunk_and_device_info(fd, &chunkinfo, &chunkcount,
962 &devinfo, &devcount);
963 if (ret)
964 goto cleanup;
965
966 ret = print_filesystem_usage_overall(fd, chunkinfo, chunkcount,
967 devinfo, devcount, argv[i], unit_mode);
968 if (ret)
969 goto cleanup;
970 printf("\n");
971 ret = print_filesystem_usage_by_chunk(fd, chunkinfo, chunkcount,
972 devinfo, devcount, argv[i], unit_mode, tabular);
973 cleanup:
974 close_file_or_dir(fd, dirstream);
975 free(chunkinfo);
976 free(devinfo);
977
978 if (ret)
979 goto out;
980 more_than_one = 1;
981 }
982
983 out:
984 return !!ret;
985 }
986
987 void print_device_chunks(int fd, struct device_info *devinfo,
988 struct chunk_info *chunks_info_ptr,
989 int chunks_info_count, unsigned unit_mode)
990 {
991 int i;
992 u64 allocated = 0;
993
994 for (i = 0 ; i < chunks_info_count ; i++) {
995 const char *description;
996 const char *r_mode;
997 u64 flags;
998 u64 size;
999
1000 if (chunks_info_ptr[i].devid != devinfo->devid)
1001 continue;
1002
1003 flags = chunks_info_ptr[i].type;
1004
1005 description = btrfs_group_type_str(flags);
1006 r_mode = btrfs_group_profile_str(flags);
1007 size = calc_chunk_size(chunks_info_ptr+i);
1008 printf(" %s,%s:%*s%10s\n",
1009 description,
1010 r_mode,
1011 (int)(20 - strlen(description) - strlen(r_mode)), "",
1012 pretty_size_mode(size, unit_mode));
1013
1014 allocated += size;
1015
1016 }
1017 printf(" Unallocated: %*s%10s\n",
1018 (int)(20 - strlen("Unallocated")), "",
1019 pretty_size_mode(devinfo->size - allocated, unit_mode));
1020 }
1021
1022 void print_device_sizes(int fd, struct device_info *devinfo, unsigned unit_mode)
1023 {
1024 printf(" Device size: %*s%10s\n",
1025 (int)(20 - strlen("Device size")), "",
1026 pretty_size_mode(devinfo->device_size, unit_mode));
1027 #if 0
1028 /*
1029 * The term has not seen an agreement and we don't want to change it
1030 * once it's in non-development branches or even released.
1031 */
1032 printf(" FS occupied: %*s%10s\n",
1033 (int)(20 - strlen("FS occupied")), "",
1034 pretty_size_mode(devinfo->size, unit_mode));
1035 #endif
1036 }
(deprecated) Btrfs progs developments and patch integration