3 * dus is a simple utility to display the files and directories
4 * according to their total disk occupancy.
6 * Copyright (c) 2010 Francois Fleuret
7 * Written by Francois Fleuret <francois@fleuret.org>
9 * This file is part of dus.
11 * dus is free software: you can redistribute it and/or modify it
12 * under the terms of the GNU General Public License version 3 as
13 * published by the Free Software Foundation.
15 * dus is distributed in the hope that it will be useful, but WITHOUT
16 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
17 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
18 * License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with dus. If not, see <http://www.gnu.org/licenses/>.
25 #define VERSION_NUMBER "1.2"
29 #include <sys/types.h>
31 #include <sys/param.h>
38 #include <sys/ioctl.h>
42 #define BUFFER_SIZE 4096
44 typedef int64_t size_sum_t;
46 /* Yeah, global variables! */
48 int ignore_dotfiles = 0; /* 1 means ignore files and directories
49 starting with a dot */
51 int forced_width = 0; /* -1 means no width limit, strictly positive
52 means limit, 0 means not active */
54 int forced_height = 0; /* -1 means no height limit, strictly positive
55 means limit, 0 means not active */
57 int fancy_size_display = 0; /* 1 means to use floating values with K, M and G
60 int reverse_sorting = 0; /* 1 means to show the large ones first */
62 int show_top = 0; /* 1 means to show the top of the sorted list
63 instead of the bottom */
65 size_sum_t size_min = -1; /* -1 means no minimum size, otherwise lower
66 bound on the size to display a
69 int ignore_protected_files = 0; /* Should we simply ignore files or
70 directories which are protected
73 /********************************************************************/
75 /* malloc with error checking. */
77 void *safe_malloc(size_t n) {
81 "dus: Can not allocate memory: %s\n",
88 /********************************************************************/
90 int ignore_entry(const char *name) {
92 strcmp(name, ".") == 0 ||
93 strcmp(name, "..") == 0 ||
94 (ignore_dotfiles && name[0] == '.' && name[1] != '/');
97 size_sum_t entry_size(const char *name) {
102 char subname[PATH_MAX];
106 if(lstat(name, &dummy) != 0) {
108 "dus: Can not stat %s: %s\n",
109 name, strerror(errno));
113 if(S_ISLNK(dummy.st_mode)) {
117 if(S_ISDIR(dummy.st_mode)) {
120 while((dir_e = readdir(dir))) {
121 if(!ignore_entry(dir_e->d_name)) {
122 snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
123 result += entry_size(subname);
128 if(!(errno == EACCES && ignore_protected_files)) {
130 "dus: Can not open directory %s: %s\n",
131 name, strerror(errno));
135 } else if(S_ISREG(dummy.st_mode)) {
136 result += dummy.st_size;
142 size_sum_t atoss(const char *string) {
143 size_sum_t total, partial_total;
148 for(c = string; *c; c++) {
149 if(*c >= '0' && *c <= '9') {
150 partial_total = 10 * partial_total + ((int) (*c - '0'));
151 } else if(*c == 'B' || *c == 'b') {
152 total += partial_total;
154 } else if(*c == 'K' || *c == 'k') {
155 total += partial_total * 1024;
157 } else if(*c == 'M' || *c == 'm') {
158 total += partial_total * 1024 * 1024;
160 } else if(*c == 'G' || *c == 'g') {
161 total += partial_total * 1024 * 1024 * 1024;
165 "dus: Syntax error in size specification `%s'\n",
171 total += partial_total;
176 /**********************************************************************/
179 struct entry_node *next;
184 struct entry_node *push_entry(char *name, struct entry_node *head) {
185 struct entry_node *result;
186 result = safe_malloc(sizeof(struct entry_node));
187 result->name = strdup(name);
188 result->size = entry_size(name);
193 struct entry_node *push_dir_content(char *name, struct entry_node *head) {
194 char subname[PATH_MAX];
196 struct dirent *dir_e;
199 while((dir_e = readdir(dir))) {
200 if(!ignore_entry(dir_e->d_name)) {
201 snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
202 head = push_entry(subname, head);
208 "dus: Can not open directory %s: %s\n",
209 name, strerror(errno));
215 void destroy_entry_list(struct entry_node *node) {
216 struct entry_node *next;
225 /**********************************************************************/
227 int compare_files(const void *x1, const void *x2) {
228 const struct entry_node **f1, **f2;
230 f1 = (const struct entry_node **) x1;
231 f2 = (const struct entry_node **) x2;
233 if(reverse_sorting) {
234 if((*f1)->size < (*f2)->size) {
236 } else if((*f1)->size > (*f2)->size) {
242 if((*f1)->size < (*f2)->size) {
244 } else if((*f1)->size > (*f2)->size) {
252 void raw_print(char *buffer, size_t buffer_size,
253 char *filename, size_sum_t size) {
258 if(b >= buffer + buffer_size) {
260 "dus: Buffer overflow in raw_print (hu?!).\n");
263 *(b++) = size%10 + '0';
277 snprintf(b, buffer_size - (b - buffer), "%s\n", filename);
280 void fancy_print(char *buffer, size_t buffer_size,
281 char *filename, size_sum_t size) {
288 } else if(size < 1024 * 1024) {
292 ((double) (size))/(1024.0),
294 } else if(size < 1024 * 1024 * 1024) {
298 ((double) (size))/(1024.0 * 1024),
304 ((double) (size))/(1024.0 * 1024.0 * 1024.0),
309 void print_sorted(struct entry_node *root, int width, int height) {
310 char line[BUFFER_SIZE];
311 struct entry_node *node;
312 struct entry_node **nodes;
313 int nb_nodes, n, first, last;
316 for(node = root; node; node = node->next) {
317 if(size_min < 0 || node->size >= size_min) {
322 nodes = safe_malloc(nb_nodes * sizeof(struct entry_node *));
325 for(node = root; node; node = node->next) {
326 if(size_min < 0 || node->size >= size_min) {
331 qsort(nodes, nb_nodes, sizeof(struct entry_node *), compare_files);
337 height = forced_height;
341 width = forced_width;
344 if(height >= 0 && nb_nodes > height && !show_top && !forced_height) {
348 if(height > 0 && height < nb_nodes) {
349 first = nb_nodes - height;
354 last = nb_nodes - first;
355 first = nb_nodes - n;
358 /* I do not like valgrind to complain about uninitialized data */
359 if(width < BUFFER_SIZE) {
363 for(n = first; n < last; n++) {
364 if(fancy_size_display) {
365 fancy_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size);
367 raw_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size);
369 if(width >= 1 && width + 1 < BUFFER_SIZE && line[width]) {
371 line[width + 1] = '\0';
376 if(height >= 0 && nb_nodes > height && show_top && !forced_height) {
383 /**********************************************************************/
385 void usage(FILE *out) {
386 fprintf(out, "Usage: dus [OPTION]... [FILE]...\n");
387 fprintf(out, "Version %s (%s)\n", VERSION_NUMBER, UNAME);
388 fprintf(out, "Lists files and directories according to their size. The sizes are computed by summing recursively exact file sizes through directories. If a given directory has its name appended with '/', it is not listed, but the elements it contains are. If no files or directories are provided as arguments, the current directory is used as default.\n");
390 /* 01234567890123456789012345678901234567890123456789012345678901234567890123456789*/
391 fprintf(out, " -h, --help show this help.\n");
392 fprintf(out, " -v, --version prints the version number and exit\n");
393 fprintf(out, " -d, --ignore-dots ignore files and directories starting with a '.'\n");
394 fprintf(out, " -i, --ignore-protected ignore files and directories for which we do not\n");
395 fprintf(out, " have permission\n");
396 fprintf(out, " -f, --fancy display size with float values and K, M and G\n");
397 fprintf(out, " units.\n");
398 fprintf(out, " -r, --reverse-order reverse the sorting order.\n");
399 fprintf(out, " -t, --show-top show the top of the list.\n");
400 fprintf(out, " -c <cols>, --nb-columns <cols>\n");
401 fprintf(out, " specificy the number of columns to display. The\n");
402 fprintf(out, " value -1 corresponds to no constraint. By default\n");
403 fprintf(out, " the command uses the tty width, or no constraint\n");
404 fprintf(out, " if the stdout is not a tty.\n");
405 fprintf(out, " -l <lines>, --nb-lines <lines>\n");
406 fprintf(out, " same as -c for number of lines.\n");
407 fprintf(out, " -m <size>, --size-min <size>\n");
408 fprintf(out, " set the listed entries minimum size. The size\n");
409 fprintf(out, " can be specified using the G, M, K, and B units.\n");
411 fprintf(out, "Report bugs and comments to <francois@fleuret.org>.\n");
414 /**********************************************************************/
416 static struct option long_options[] = {
417 { "version", no_argument, 0, 'v' },
418 { "ignore-dots", no_argument, 0, 'd' },
419 { "ignore-protected", no_argument, 0, 'i' },
420 { "reverse-order", no_argument, 0, 'r' },
421 { "show-top", no_argument, 0, 't' },
422 { "help", no_argument, 0, 'h' },
423 { "fancy", no_argument, 0, 'f' },
424 { "nb-columns", 1, 0, 'c' },
425 { "nb-lines", 1, 0, 'l' },
426 { "size-min", 1, 0, 'm' },
430 int main(int argc, char **argv) {
432 struct entry_node *root;
437 setlocale (LC_ALL, "");
439 while ((c = getopt_long(argc, argv, "ivdfrtl:c:m:hd",
440 long_options, NULL)) != -1) {
444 printf("dus version %s (%s)\n", VERSION_NUMBER, UNAME);
453 ignore_protected_files = 1;
457 fancy_size_display = 1;
469 forced_height = atoi(optarg);
473 forced_width = atoi(optarg);
477 size_min = atoss(optarg);
493 while (optind < argc) {
494 l = strlen(argv[optind]);
495 if(l > 0 && argv[optind][l - 1] == '/') {
496 argv[optind][l - 1] = '\0';
497 root = push_dir_content(argv[optind++], root);
499 root = push_entry(argv[optind++], root);
503 root = push_dir_content(".", root);
506 if(isatty(STDOUT_FILENO) &&
507 !ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) {
508 print_sorted(root, win.ws_col, win.ws_row - 2);
510 print_sorted(root, -1, -1);
513 destroy_entry_list(root);