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 /********************************************************************/
71 /* malloc with error checking. */
73 void *safe_malloc(size_t n) {
76 fprintf(stderr, "Can not allocate memory: %s\n", strerror(errno));
82 /********************************************************************/
84 int ignore_entry(const char *name) {
86 strcmp(name, ".") == 0 ||
87 strcmp(name, "..") == 0 ||
88 (ignore_dotfiles && name[0] == '.' && name[1] != '/');
91 size_sum_t entry_size(const char *name) {
96 char subname[PATH_MAX];
100 if(lstat(name, &dummy) != 0) {
101 fprintf(stderr, "Can not stat %s: %s\n", name, strerror(errno));
105 if(S_ISLNK(dummy.st_mode)) {
109 if(S_ISDIR(dummy.st_mode)) {
112 while((dir_e = readdir(dir))) {
113 if(!ignore_entry(dir_e->d_name)) {
114 snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
115 result += entry_size(subname);
120 fprintf(stderr, "Can not open directory %s: %s\n", name, strerror(errno));
123 } else if(S_ISREG(dummy.st_mode)) {
124 result += dummy.st_size;
130 size_sum_t atoss(const char *string) {
131 size_sum_t total, partial_total;
136 for(c = string; *c; c++) {
137 if(*c >= '0' && *c <= '9') {
138 partial_total = 10 * partial_total + ((int) (*c - '0'));
139 } else if(*c == 'B' || *c == 'b') {
140 total += partial_total;
142 } else if(*c == 'K' || *c == 'k') {
143 total += partial_total * 1024;
145 } else if(*c == 'M' || *c == 'm') {
146 total += partial_total * 1024 * 1024;
148 } else if(*c == 'G' || *c == 'g') {
149 total += partial_total * 1024 * 1024 * 1024;
152 fprintf(stderr, "Syntax error in %s\n", string);
156 total += partial_total;
161 /**********************************************************************/
164 struct entry_node *next;
169 struct entry_node *push_entry(char *name, struct entry_node *head) {
170 struct entry_node *result;
171 result = safe_malloc(sizeof(struct entry_node));
172 result->name = strdup(name);
173 result->size = entry_size(name);
178 struct entry_node *push_dir_content(char *name, struct entry_node *head) {
179 char subname[PATH_MAX];
181 struct dirent *dir_e;
184 while((dir_e = readdir(dir))) {
185 if(!ignore_entry(dir_e->d_name)) {
186 snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
187 head = push_entry(subname, head);
192 fprintf(stderr, "Can not open directory %s: %s\n", name, strerror(errno));
198 void destroy_entry_list(struct entry_node *node) {
199 struct entry_node *next;
208 /**********************************************************************/
210 int compare_files(const void *x1, const void *x2) {
211 const struct entry_node **f1, **f2;
213 f1 = (const struct entry_node **) x1;
214 f2 = (const struct entry_node **) x2;
216 if(reverse_sorting) {
217 if((*f1)->size < (*f2)->size) {
219 } else if((*f1)->size > (*f2)->size) {
225 if((*f1)->size < (*f2)->size) {
227 } else if((*f1)->size > (*f2)->size) {
235 void raw_print(char *buffer, size_t buffer_size,
236 char *filename, size_sum_t size) {
241 if(b >= buffer + buffer_size) {
242 fprintf(stderr, "Buffer overflow in raw_print (hu?!).\n");
245 *(b++) = size%10 + '0';
259 snprintf(b, buffer_size - (b - buffer), "%s\n", filename);
262 void fancy_print(char *buffer, size_t buffer_size,
263 char *filename, size_sum_t size) {
270 } else if(size < 1024 * 1024) {
274 ((double) (size))/(1024.0),
276 } else if(size < 1024 * 1024 * 1024) {
280 ((double) (size))/(1024.0 * 1024),
286 ((double) (size))/(1024.0 * 1024.0 * 1024.0),
291 void print_sorted(struct entry_node *root, int width, int height) {
292 char line[BUFFER_SIZE];
293 struct entry_node *node;
294 struct entry_node **nodes;
295 int nb_nodes, n, first, last;
298 for(node = root; node; node = node->next) {
299 if(size_min < 0 || node->size >= size_min) {
304 nodes = safe_malloc(nb_nodes * sizeof(struct entry_node *));
307 for(node = root; node; node = node->next) {
308 if(size_min < 0 || node->size >= size_min) {
313 qsort(nodes, nb_nodes, sizeof(struct entry_node *), compare_files);
319 height = forced_height;
323 width = forced_width;
326 if(height >= 0 && nb_nodes > height && !show_top && !forced_height) {
330 if(height > 0 && height < nb_nodes) {
331 first = nb_nodes - height;
336 last = nb_nodes - first;
337 first = nb_nodes - n;
340 /* I do not like valgrind to complain about uninitialized data */
341 if(width < BUFFER_SIZE) {
345 for(n = first; n < last; n++) {
346 if(fancy_size_display) {
347 fancy_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size);
349 raw_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size);
351 if(width >= 1 && width + 1 < BUFFER_SIZE && line[width]) {
353 line[width + 1] = '\0';
358 if(height >= 0 && nb_nodes > height && show_top && !forced_height) {
365 /**********************************************************************/
367 void usage(FILE *out) {
368 fprintf(out, "Usage: dus [OPTION]... [FILE]...\n");
369 fprintf(out, "Version %s (%s)\n", VERSION_NUMBER, UNAME);
370 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");
372 /* 01234567890123456789012345678901234567890123456789012345678901234567890123456789*/
373 fprintf(out, " -d, --ignore-dots ignore files and directories starting with a '.'\n");
374 fprintf(out, " -f, --fancy display size with float values and K, M and G\n");
375 fprintf(out, " units.\n");
376 fprintf(out, " -r, --reverse-order reverse the sorting order.\n");
377 fprintf(out, " -t, --show-top show the top of the list.\n");
378 fprintf(out, " -c <cols>, --nb-columns <cols>\n");
379 fprintf(out, " specificy the number of columns to display. The\n");
380 fprintf(out, " value -1 corresponds to no constraint. By default\n");
381 fprintf(out, " the command uses the tty width, or no constraint\n");
382 fprintf(out, " if the stdout is not a tty.\n");
383 fprintf(out, " -l <lines>, --nb-lines <lines>\n");
384 fprintf(out, " same as -c for number of lines.\n");
385 fprintf(out, " -h, --help show this help.\n");
386 fprintf(out, " -m <size>, --size-min <size>\n");
387 fprintf(out, " set the listed entries minimum size.\n");
389 fprintf(out, "Report bugs and comments to <francois@fleuret.org>.\n");
392 /**********************************************************************/
394 static struct option long_options[] = {
395 { "ignore-dots", no_argument, 0, 'd' },
396 { "reverse-order", no_argument, 0, 'r' },
397 { "show-top", no_argument, 0, 't' },
398 { "help", no_argument, 0, 'h' },
399 { "fancy", no_argument, 0, 'f' },
400 { "nb-columns", 1, 0, 'c' },
401 { "nb-lines", 1, 0, 'l' },
402 { "size-min", 1, 0, 'm' },
406 int main(int argc, char **argv) {
408 struct entry_node *root;
413 setlocale (LC_ALL, "");
415 while ((c = getopt_long(argc, argv, "dfrtl:c:m:hd",
416 long_options, NULL)) != -1) {
424 fancy_size_display = 1;
436 forced_height = atoi(optarg);
440 forced_width = atoi(optarg);
444 size_min = atoss(optarg);
460 while (optind < argc) {
461 l = strlen(argv[optind]);
462 if(l > 0 && argv[optind][l - 1] == '/') {
463 argv[optind][l - 1] = '\0';
464 root = push_dir_content(argv[optind++], root);
466 root = push_entry(argv[optind++], root);
470 root = push_dir_content(".", root);
473 if(isatty(STDOUT_FILENO) &&
474 !ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) {
475 print_sorted(root, win.ws_col, win.ws_row - 2);
477 print_sorted(root, -1, -1);
480 destroy_entry_list(root);