btrfs-progs: use on-stack buffer for btrfs_scan_one_device
[btrfs-progs-unstable/devel.git] / cmds-fi-usage.c
blob72d80278e2599dc51cf2b0cf3d4b978c9eb97104
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.
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.
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.
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>
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"
33 #include "version.h"
36 * Add the chunk info to the chunk_info list
38 static int add_info_to_list(struct chunk_info **info_ptr,
39 int *info_count,
40 struct btrfs_chunk *chunk)
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;
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;
54 stripe = btrfs_stripe_nr(chunk, j);
55 devid = btrfs_stack_stripe_devid(stripe);
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;
65 if (!p) {
66 int size = sizeof(struct btrfs_chunk) * (*info_count+1);
67 struct chunk_info *res = realloc(*info_ptr, size);
69 if (!res) {
70 free(*info_ptr);
71 fprintf(stderr, "ERROR: not enough memory\n");
72 return -ENOMEM;
75 *info_ptr = res;
76 p = res + *info_count;
77 (*info_count)++;
79 p->devid = devid;
80 p->type = type;
81 p->size = 0;
82 p->num_stripes = num_stripes;
85 p->size += size;
89 return 0;
94 * Helper to sort the chunk type
96 static int cmp_chunk_block_group(u64 f1, u64 f2)
99 u64 mask;
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;
111 if ((f1 & mask) > (f2 & mask))
112 return +1;
113 else if ((f1 & mask) < (f2 & mask))
114 return -1;
115 else
116 return 0;
120 * Helper to sort the chunk
122 static int cmp_chunk_info(const void *a, const void *b)
124 return cmp_chunk_block_group(
125 ((struct chunk_info *)a)->type,
126 ((struct chunk_info *)b)->type);
129 static int load_chunk_info(int fd, struct chunk_info **info_ptr, int *info_count)
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;
138 memset(&args, 0, sizeof(args));
141 * there may be more than one ROOT_ITEM key if there are
142 * snapshots pending deletion, we have to loop through
143 * them.
145 sk->tree_id = BTRFS_CHUNK_TREE_OBJECTID;
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;
157 while (1) {
158 ret = ioctl(fd, BTRFS_IOC_TREE_SEARCH, &args);
159 e = errno;
160 if (e == EPERM)
161 return -e;
163 if (ret < 0) {
164 fprintf(stderr,
165 "ERROR: can't perform the search - %s\n",
166 strerror(e));
167 return 1;
169 /* the ioctl returns the number of item it found in nr_items */
171 if (sk->nr_items == 0)
172 break;
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);
180 off += sizeof(*sh);
181 item = (struct btrfs_chunk *)(args.buf + off);
183 ret = add_info_to_list(info_ptr, info_count, item);
184 if (ret) {
185 *info_ptr = 0;
186 return 1;
189 off += sh->len;
191 sk->min_objectid = sh->objectid;
192 sk->min_type = sh->type;
193 sk->min_offset = sh->offset+1;
196 if (!sk->min_offset) /* overflow */
197 sk->min_type++;
198 else
199 continue;
201 if (!sk->min_type)
202 sk->min_objectid++;
203 else
204 continue;
206 if (!sk->min_objectid)
207 break;
210 qsort(*info_ptr, *info_count, sizeof(struct chunk_info),
211 cmp_chunk_info);
213 return 0;
217 * Helper to sort the struct btrfs_ioctl_space_info
219 static int cmp_btrfs_ioctl_space_info(const void *a, const void *b)
221 return cmp_chunk_block_group(
222 ((struct btrfs_ioctl_space_info *)a)->flags,
223 ((struct btrfs_ioctl_space_info *)b)->flags);
227 * This function load all the information about the space usage
229 static struct btrfs_ioctl_space_args *load_space_info(int fd, char *path)
231 struct btrfs_ioctl_space_args *sargs = 0, *sargs_orig = 0;
232 int e, ret, count;
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;
240 sargs->space_slots = 0;
241 sargs->total_spaces = 0;
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;
252 if (!sargs->total_spaces) {
253 free(sargs);
254 printf("No chunks found\n");
255 return NULL;
258 count = sargs->total_spaces;
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;
268 sargs->space_slots = count;
269 sargs->total_spaces = 0;
271 ret = ioctl(fd, BTRFS_IOC_SPACE_INFO, sargs);
272 e = errno;
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;
282 qsort(&(sargs->spaces), count, sizeof(struct btrfs_ioctl_space_info),
283 cmp_btrfs_ioctl_space_info);
285 return sargs;
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.
294 static void get_raid56_used(int fd, struct chunk_info *chunks, int chunkcount,
295 u64 *raid5_used, u64 *raid6_used)
297 struct chunk_info *info_ptr = chunks;
298 *raid5_used = 0;
299 *raid6_used = 0;
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++;
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)
315 struct btrfs_ioctl_space_args *sargs = 0;
316 int i;
317 int ret = 0;
318 int width = 10; /* default 10 for human units */
320 * r_* prefix is for raw data
321 * l_* is for logical
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;
347 sargs = load_space_info(fd, path);
348 if (!sargs) {
349 ret = 1;
350 goto exit;
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;
360 if (r_total_size == 0) {
361 fprintf(stderr,
362 "ERROR: couldn't get space info on '%s' - %s\n",
363 path, strerror(errno));
365 ret = 1;
366 goto exit;
368 get_raid56_used(fd, chunkinfo, chunkcount, &raid5_used, &raid6_used);
370 for (i = 0; i < sargs->total_spaces; i++) {
371 int ratio;
372 u64 flags = sargs->spaces[i].flags;
375 * The raid5/raid6 ratio depends by the stripes number
376 * used by every chunk. It is computed separately
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;
393 if (!ratio)
394 fprintf(stderr, "WARNING: RAID56 detected, not implemented\n");
396 if (ratio > max_data_ratio)
397 max_data_ratio = ratio;
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;
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");
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;
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;
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;
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;
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;
432 #if 0
433 /* add the raid5/6 allocated space */
434 total_chunks += raid5_used + raid6_used;
435 #endif
438 * We're able to fill at least DATA for the unused space
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)
444 * In non-mixed case there's no difference.
446 free_estimated = (r_data_chunks - r_data_used) / data_ratio;
447 free_min = free_estimated;
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;
457 if (unit_mode != UNITS_HUMAN)
458 width = 18;
460 printf("Overall:\n");
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));
484 exit:
486 if (sargs)
487 free(sargs);
489 return ret;
493 * Helper to sort the device_info structure
495 static int cmp_device_info(const void *a, const void *b)
497 return strcmp(((struct device_info *)a)->path,
498 ((struct device_info *)b)->path);
502 * This function loads the device_info structure and put them in an array
504 static int load_device_info(int fd, struct device_info **device_info_ptr,
505 int *device_info_count)
507 int ret, i, ndevs;
508 struct btrfs_ioctl_fs_info_args fi_args;
509 struct btrfs_ioctl_dev_info_args dev_info;
510 struct device_info *info;
512 *device_info_count = 0;
513 *device_info_ptr = 0;
515 ret = ioctl(fd, BTRFS_IOC_FS_INFO, &fi_args);
516 if (ret < 0) {
517 if (errno == EPERM)
518 return -errno;
519 fprintf(stderr, "ERROR: cannot get filesystem info - %s\n",
520 strerror(errno));
521 return 1;
524 info = calloc(fi_args.num_devices, sizeof(struct device_info));
525 if (!info) {
526 fprintf(stderr, "ERROR: not enough memory\n");
527 return 1;
530 for (i = 0, ndevs = 0 ; i <= fi_args.max_id ; i++) {
531 BUG_ON(ndevs >= fi_args.num_devices);
532 memset(&dev_info, 0, sizeof(dev_info));
533 ret = get_device_info(fd, i, &dev_info);
535 if (ret == -ENODEV)
536 continue;
537 if (ret) {
538 fprintf(stderr,
539 "ERROR: cannot get info about device devid=%d\n",
541 free(info);
542 return ret;
545 info[ndevs].devid = dev_info.devid;
546 if (!dev_info.path[0]) {
547 strcpy(info[ndevs].path, "missing");
548 } else {
549 strcpy(info[ndevs].path, (char *)dev_info.path);
550 info[ndevs].device_size =
551 get_partition_size((char *)dev_info.path);
553 info[ndevs].size = dev_info.total_bytes;
554 ++ndevs;
557 BUG_ON(ndevs != fi_args.num_devices);
558 qsort(info, fi_args.num_devices,
559 sizeof(struct device_info), cmp_device_info);
561 *device_info_count = fi_args.num_devices;
562 *device_info_ptr = info;
564 return 0;
567 int load_chunk_and_device_info(int fd, struct chunk_info **chunkinfo,
568 int *chunkcount, struct device_info **devinfo, int *devcount)
570 int ret;
572 ret = load_chunk_info(fd, chunkinfo, chunkcount);
573 if (ret == -EPERM) {
574 fprintf(stderr,
575 "WARNING: can't read detailed chunk info, RAID5/6 numbers will be incorrect, run as root\n");
576 } else if (ret) {
577 return ret;
580 ret = load_device_info(fd, devinfo, devcount);
581 if (ret == -EPERM) {
582 fprintf(stderr,
583 "WARNING: can't get filesystem info from ioctl(FS_INFO), run as root\n");
584 ret = 0;
587 return ret;
591 * This function computes the size of a chunk in a disk
593 static u64 calc_chunk_size(struct chunk_info *ci)
595 if (ci->type & BTRFS_BLOCK_GROUP_RAID0)
596 return ci->size / ci->num_stripes;
597 else if (ci->type & BTRFS_BLOCK_GROUP_RAID1)
598 return ci->size ;
599 else if (ci->type & BTRFS_BLOCK_GROUP_DUP)
600 return ci->size ;
601 else if (ci->type & BTRFS_BLOCK_GROUP_RAID5)
602 return ci->size / (ci->num_stripes -1);
603 else if (ci->type & BTRFS_BLOCK_GROUP_RAID6)
604 return ci->size / (ci->num_stripes -2);
605 else if (ci->type & BTRFS_BLOCK_GROUP_RAID10)
606 return ci->size / ci->num_stripes;
607 return ci->size;
611 * This function print the results of the command "btrfs fi usage"
612 * in tabular format
614 static void _cmd_filesystem_usage_tabular(unsigned unit_mode,
615 struct btrfs_ioctl_space_args *sargs,
616 struct chunk_info *chunks_info_ptr,
617 int chunks_info_count,
618 struct device_info *device_info_ptr,
619 int device_info_count)
621 int i;
622 u64 total_unused = 0;
623 struct string_table *matrix = 0;
624 int ncols, nrows;
625 int col;
626 int unallocated_col;
627 int spaceinfos_col;
628 const int vhdr_skip = 3; /* amount of vertical header space */
630 /* id, path, unallocated */
631 ncols = 3;
632 spaceinfos_col = 2;
633 /* Properly count the real space infos */
634 for (i = 0; i < sargs->total_spaces; i++) {
635 if (sargs->spaces[i].flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
636 continue;
637 ncols++;
640 /* 2 for header, empty line, devices, ===, total, used */
641 nrows = vhdr_skip + device_info_count + 1 + 2;
643 matrix = table_create(ncols, nrows);
644 if (!matrix) {
645 fprintf(stderr, "ERROR: not enough memory\n");
646 return;
650 * We have to skip the global block reserve everywhere as it's an
651 * artificial blockgroup
654 /* header */
655 for (i = 0, col = spaceinfos_col; i < sargs->total_spaces; i++) {
656 u64 flags = sargs->spaces[i].flags;
658 if (flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
659 continue;
661 table_printf(matrix, col, 0, "<%s",
662 btrfs_group_type_str(flags));
663 table_printf(matrix, col, 1, "<%s",
664 btrfs_group_profile_str(flags));
665 col++;
667 unallocated_col = col;
669 table_printf(matrix, 0, 1, "<Id");
670 table_printf(matrix, 1, 1, "<Path");
671 table_printf(matrix, unallocated_col, 1, "<Unallocated");
673 /* body */
674 for (i = 0; i < device_info_count; i++) {
675 int k;
676 char *p;
678 u64 total_allocated = 0, unused;
680 p = strrchr(device_info_ptr[i].path, '/');
681 if (!p)
682 p = device_info_ptr[i].path;
683 else
684 p++;
686 table_printf(matrix, 0, vhdr_skip + i, ">%llu",
687 device_info_ptr[i].devid);
688 table_printf(matrix, 1, vhdr_skip + i, "<%s",
689 device_info_ptr[i].path);
691 for (col = spaceinfos_col, k = 0; k < sargs->total_spaces; k++) {
692 u64 flags = sargs->spaces[k].flags;
693 u64 devid = device_info_ptr[i].devid;
694 int j;
695 u64 size = 0;
697 if (flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
698 continue;
700 for (j = 0 ; j < chunks_info_count ; j++) {
701 if (chunks_info_ptr[j].type != flags )
702 continue;
703 if (chunks_info_ptr[j].devid != devid)
704 continue;
706 size += calc_chunk_size(chunks_info_ptr+j);
709 if (size)
710 table_printf(matrix, col, vhdr_skip+ i,
711 ">%s", pretty_size_mode(size, unit_mode));
712 else
713 table_printf(matrix, col, vhdr_skip + i, ">-");
715 total_allocated += size;
716 col++;
719 unused = get_partition_size(device_info_ptr[i].path)
720 - total_allocated;
722 table_printf(matrix, unallocated_col, vhdr_skip + i,
723 ">%s", pretty_size_mode(unused, unit_mode));
724 total_unused += unused;
728 for (i = 0; i < spaceinfos_col; i++) {
729 table_printf(matrix, i, vhdr_skip - 1, "*-");
730 table_printf(matrix, i, vhdr_skip + device_info_count, "*-");
733 for (i = 0, col = spaceinfos_col; i < sargs->total_spaces; i++) {
734 if (sargs->spaces[i].flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
735 continue;
737 table_printf(matrix, col, vhdr_skip - 1, "*-");
738 table_printf(matrix, col, vhdr_skip + device_info_count, "*-");
739 col++;
741 /* One for Unallocated */
742 table_printf(matrix, col, vhdr_skip - 1, "*-");
743 table_printf(matrix, col, vhdr_skip + device_info_count, "*-");
745 /* footer */
746 table_printf(matrix, 1, vhdr_skip + device_info_count + 1, "<Total");
747 for (i = 0, col = spaceinfos_col; i < sargs->total_spaces; i++) {
748 if (sargs->spaces[i].flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
749 continue;
751 table_printf(matrix, col++, vhdr_skip + device_info_count + 1,
752 ">%s",
753 pretty_size_mode(sargs->spaces[i].total_bytes, unit_mode));
756 table_printf(matrix, unallocated_col, vhdr_skip + device_info_count + 1,
757 ">%s", pretty_size_mode(total_unused, unit_mode));
759 table_printf(matrix, 1, vhdr_skip + device_info_count + 2, "<Used");
760 for (i = 0, col = spaceinfos_col; i < sargs->total_spaces; i++) {
761 if (sargs->spaces[i].flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
762 continue;
764 table_printf(matrix, col++, vhdr_skip + device_info_count + 2,
765 ">%s",
766 pretty_size_mode(sargs->spaces[i].used_bytes, unit_mode));
769 table_dump(matrix);
770 table_free(matrix);
774 * This function prints the unused space per every disk
776 static void print_unused(struct chunk_info *info_ptr,
777 int info_count,
778 struct device_info *device_info_ptr,
779 int device_info_count,
780 unsigned unit_mode)
782 int i;
783 for (i = 0; i < device_info_count; i++) {
784 int j;
785 u64 total = 0;
787 for (j = 0; j < info_count; j++)
788 if (info_ptr[j].devid == device_info_ptr[i].devid)
789 total += calc_chunk_size(info_ptr+j);
791 printf(" %s\t%10s\n",
792 device_info_ptr[i].path,
793 pretty_size_mode(device_info_ptr[i].size - total,
794 unit_mode));
799 * This function prints the allocated chunk per every disk
801 static void print_chunk_device(u64 chunk_type,
802 struct chunk_info *chunks_info_ptr,
803 int chunks_info_count,
804 struct device_info *device_info_ptr,
805 int device_info_count,
806 unsigned unit_mode)
808 int i;
810 for (i = 0; i < device_info_count; i++) {
811 int j;
812 u64 total = 0;
814 for (j = 0; j < chunks_info_count; j++) {
816 if (chunks_info_ptr[j].type != chunk_type)
817 continue;
818 if (chunks_info_ptr[j].devid != device_info_ptr[i].devid)
819 continue;
821 total += calc_chunk_size(&(chunks_info_ptr[j]));
822 //total += chunks_info_ptr[j].size;
825 if (total > 0)
826 printf(" %s\t%10s\n",
827 device_info_ptr[i].path,
828 pretty_size_mode(total, unit_mode));
833 * This function print the results of the command "btrfs fi usage"
834 * in linear format
836 static void _cmd_filesystem_usage_linear(unsigned unit_mode,
837 struct btrfs_ioctl_space_args *sargs,
838 struct chunk_info *info_ptr,
839 int info_count,
840 struct device_info *device_info_ptr,
841 int device_info_count)
843 int i;
845 for (i = 0; i < sargs->total_spaces; i++) {
846 const char *description;
847 const char *r_mode;
848 u64 flags = sargs->spaces[i].flags;
850 if (flags & BTRFS_SPACE_INFO_GLOBAL_RSV)
851 continue;
853 description = btrfs_group_type_str(flags);
854 r_mode = btrfs_group_profile_str(flags);
856 printf("%s,%s: Size:%s, ",
857 description,
858 r_mode,
859 pretty_size_mode(sargs->spaces[i].total_bytes,
860 unit_mode));
861 printf("Used:%s\n",
862 pretty_size_mode(sargs->spaces[i].used_bytes, unit_mode));
863 print_chunk_device(flags, info_ptr, info_count,
864 device_info_ptr, device_info_count, unit_mode);
865 printf("\n");
868 printf("Unallocated:\n");
869 print_unused(info_ptr, info_count, device_info_ptr, device_info_count,
870 unit_mode);
873 static int print_filesystem_usage_by_chunk(int fd,
874 struct chunk_info *chunkinfo, int chunkcount,
875 struct device_info *devinfo, int devcount,
876 char *path, unsigned unit_mode, int tabular)
878 struct btrfs_ioctl_space_args *sargs;
879 int ret = 0;
881 if (!chunkinfo)
882 return 0;
884 sargs = load_space_info(fd, path);
885 if (!sargs) {
886 ret = 1;
887 goto out;
890 if (tabular)
891 _cmd_filesystem_usage_tabular(unit_mode, sargs, chunkinfo,
892 chunkcount, devinfo, devcount);
893 else
894 _cmd_filesystem_usage_linear(unit_mode, sargs, chunkinfo,
895 chunkcount, devinfo, devcount);
897 free(sargs);
898 out:
899 return ret;
902 const char * const cmd_filesystem_usage_usage[] = {
903 "btrfs filesystem usage [options] <path> [<path>..]",
904 "Show detailed information about internal filesystem usage .",
905 HELPINFO_UNITS_SHORT_LONG,
906 "-T show data in tabular format",
907 NULL
910 int cmd_filesystem_usage(int argc, char **argv)
912 int ret = 0;
913 unsigned unit_mode;
914 int i;
915 int more_than_one = 0;
916 int tabular = 0;
918 unit_mode = get_unit_mode_from_arg(&argc, argv, 1);
920 optind = 1;
921 while (1) {
922 int c;
924 c = getopt(argc, argv, "T");
925 if (c < 0)
926 break;
928 switch (c) {
929 case 'T':
930 tabular = 1;
931 break;
932 default:
933 usage(cmd_filesystem_usage_usage);
937 if (check_argc_min(argc - optind, 1))
938 usage(cmd_filesystem_usage_usage);
940 for (i = optind; i < argc; i++) {
941 int fd;
942 DIR *dirstream = NULL;
943 struct chunk_info *chunkinfo = NULL;
944 struct device_info *devinfo = NULL;
945 int chunkcount = 0;
946 int devcount = 0;
948 fd = btrfs_open_dir(argv[i], &dirstream, 1);
949 if (fd < 0) {
950 ret = 1;
951 goto out;
953 if (more_than_one)
954 printf("\n");
956 ret = load_chunk_and_device_info(fd, &chunkinfo, &chunkcount,
957 &devinfo, &devcount);
958 if (ret)
959 goto cleanup;
961 ret = print_filesystem_usage_overall(fd, chunkinfo, chunkcount,
962 devinfo, devcount, argv[i], unit_mode);
963 if (ret)
964 goto cleanup;
965 printf("\n");
966 ret = print_filesystem_usage_by_chunk(fd, chunkinfo, chunkcount,
967 devinfo, devcount, argv[i], unit_mode, tabular);
968 cleanup:
969 close_file_or_dir(fd, dirstream);
970 free(chunkinfo);
971 free(devinfo);
973 if (ret)
974 goto out;
975 more_than_one = 1;
978 out:
979 return !!ret;
982 void print_device_chunks(int fd, struct device_info *devinfo,
983 struct chunk_info *chunks_info_ptr,
984 int chunks_info_count, unsigned unit_mode)
986 int i;
987 u64 allocated = 0;
989 for (i = 0 ; i < chunks_info_count ; i++) {
990 const char *description;
991 const char *r_mode;
992 u64 flags;
993 u64 size;
995 if (chunks_info_ptr[i].devid != devinfo->devid)
996 continue;
998 flags = chunks_info_ptr[i].type;
1000 description = btrfs_group_type_str(flags);
1001 r_mode = btrfs_group_profile_str(flags);
1002 size = calc_chunk_size(chunks_info_ptr+i);
1003 printf(" %s,%s:%*s%10s\n",
1004 description,
1005 r_mode,
1006 (int)(20 - strlen(description) - strlen(r_mode)), "",
1007 pretty_size_mode(size, unit_mode));
1009 allocated += size;
1012 printf(" Unallocated: %*s%10s\n",
1013 (int)(20 - strlen("Unallocated")), "",
1014 pretty_size_mode(devinfo->size - allocated, unit_mode));
1017 void print_device_sizes(int fd, struct device_info *devinfo, unsigned unit_mode)
1019 printf(" Device size: %*s%10s\n",
1020 (int)(20 - strlen("Device size")), "",
1021 pretty_size_mode(devinfo->device_size, unit_mode));
1022 #if 0
1024 * The term has not seen an agreement and we don't want to change it
1025 * once it's in non-development branches or even released.
1027 printf(" FS occupied: %*s%10s\n",
1028 (int)(20 - strlen("FS occupied")), "",
1029 pretty_size_mode(devinfo->size, unit_mode));
1030 #endif