/*
- * dus is a simple utility designed to display the list of files and
- * directories with disk occupancy, sorted according to it.
+ * dus is a simple utility to display the files and directories
+ * according to their total disk occupancy.
*
- * Copyright (c) 2009 Francois Fleuret
+ * Copyright (c) 2010 Francois Fleuret
* Written by Francois Fleuret <francois@fleuret.org>
*
* This file is part of dus.
#include <unistd.h>
#include <errno.h>
#include <string.h>
+#include <sys/ioctl.h>
+#include <locale.h>
+#include <getopt.h>
-size_t file_or_dir_size(char *name) {
+#define BUFFER_SIZE 4096
+
+typedef int64_t size_sum_t;
+
+/* Yeah, global variables! */
+
+int ignore_dotfiles = 0; /* 1 means ignore files and directories
+ starting with a dot */
+
+int forced_height = 0; /* -1 means no height limit, strictly positive
+ means limit, 0 means not active */
+
+int fancy_size_display = 0; /* 1 means to use floating values with K, M and G
+ as units */
+
+/********************************************************************/
+
+int ignore_entry(const char *name) {
+ return
+ strcmp(name, ".") == 0 ||
+ strcmp(name, "..") == 0 ||
+ (ignore_dotfiles && name[0] == '.');
+}
+
+void print_size_sum(size_sum_t s) {
+ char tmp[100];
+ char *a = tmp + sizeof(tmp)/sizeof(char);
+ *(--a) = '\0';
+ if(s) {
+ while(s) {
+ *(--a) = s%10 + '0';
+ s /= 10;
+ }
+ } else {
+ *(--a) = '0';
+ }
+ printf(a);
+}
+
+size_sum_t file_or_dir_size(const char *name) {
DIR *dir;
struct dirent *dir_e;
struct stat dummy;
- size_t result;
- char subname[1024];
+ size_sum_t result;
+ char subname[BUFFER_SIZE];
result = 0;
if(lstat(name, &dummy) != 0) {
- printf("Can not stat %s (%s).\n", name, strerror(errno));
- exit (1);
+ printf("Can not stat %s: %s\n", name, strerror(errno));
+ exit(EXIT_FAILURE);
}
if(S_ISLNK(dummy.st_mode)) {
if(dir) {
while((dir_e = readdir(dir))) {
- if(strcmp(dir_e->d_name, ".") &&
- strcmp(dir_e->d_name, "..")) {
- sprintf(subname, "%s/%s", name, dir_e->d_name);
+ if(!ignore_entry(dir_e->d_name)) {
+ snprintf(subname, BUFFER_SIZE, "%s/%s", name, dir_e->d_name);
result += file_or_dir_size(subname);
}
}
struct file_with_size {
char *filename;
- size_t size;
+ size_sum_t size;
struct file_with_size *next;
};
/**********************************************************************/
-void print_sorted(struct file_with_size *root) {
+int compare_files(const void *x1, const void *x2) {
+ const struct file_with_size **f1, **f2;
+
+ f1 = (const struct file_with_size **) x1;
+ f2 = (const struct file_with_size **) x2;
+
+ if((*f1)->size < (*f2)->size) {
+ return -1;
+ } else if((*f1)->size > (*f2)->size) {
+ return 1;
+ } else {
+ return 0;
+ }
+}
+
+void print_sorted(struct file_with_size *root, int height) {
struct file_with_size *node;
struct file_with_size **nodes;
- int nb, n;
+ int nb, n, first;
nb = 0;
for(node = root; node; node = node->next) {
nodes[n++] = node;
}
- for(n = 0; n < nb; n++) {
- printf("%u %s\n", nodes[n]->size, nodes[n]->filename);
+ qsort(nodes, nb, sizeof(struct file_with_size *), compare_files);
+
+ first = 0;
+
+ if(forced_height) {
+ height = forced_height;
+ }
+
+ if(height > 0 && height < nb) {
+ first = nb - height;
+ }
+
+ if(fancy_size_display) {
+ for(n = first; n < nb; n++) {
+ if(nodes[n]->size < 1024) {
+ printf("% 7d %s\n",
+ ((int) nodes[n]->size),
+ nodes[n]->filename);
+ } else if(nodes[n]->size < 1024 * 1024) {
+ printf("% 6.1fK %s\n",
+ ((double) (nodes[n]->size))/(1024.0),
+ nodes[n]->filename);
+ } else if(nodes[n]->size < 1024 * 1024 * 1024) {
+ printf("% 6.1fM %s\n",
+ ((double) (nodes[n]->size))/(1024.0 * 1024),
+ nodes[n]->filename);
+ } else {
+ printf("% 6.1fG %s\n",
+ ((double) (nodes[n]->size))/(1024.0 * 1024.0 * 1024.0),
+ nodes[n]->filename);
+ }
+ }
+ } else {
+ for(n = first; n < nb; n++) {
+ print_size_sum(nodes[n]->size);
+ printf(" %s\n", nodes[n]->filename);
+ }
}
free(nodes);
/**********************************************************************/
int main(int argc, char **argv) {
- int k;
+ char c;
struct file_with_size *root;
root = 0;
- for(k = 1; k < argc; k++) {
- root = create(argv[k], root);
+
+ setlocale (LC_ALL, "");
+
+ while (1) {
+ c = getopt(argc, argv, "dfl:hdu");
+ if (c == -1)
+ break;
+
+ switch (c) {
+
+ case 'd':
+ ignore_dotfiles = 1;
+ break;
+
+ case 'f':
+ fancy_size_display = 1;
+ break;
+
+ case 'l':
+ forced_height = atoi(optarg);
+ break;
+
+ case 'h':
+ printf("Usage: dus [OPTION]... [FILE]...\n");
+ printf("List files and directories sorted according to their size or content \n");
+ printf("size.\n");
+ printf("\n");
+ printf(" -d do not take into account files starting with a '.'\n");
+ printf(" -f display size with float values and K, M and G units.\n");
+ printf(" -l <lines> specificy the number of lines to display. The value -1\n");
+ printf(" corresponds to all the lines. By default the command\n");
+ printf(" shows one line less than the number of lines of the TTY,\n");
+ printf(" or all the lines if standard output is not a tty\n");
+ printf(" -h show this help.\n");
+ printf("\n");
+ printf("Report bugs and comments to <francois@fleuret.org>\n");
+ exit(EXIT_SUCCESS);
+
+ break;
+
+ default:
+ exit(EXIT_FAILURE);
+ }
+ }
+
+ if (optind < argc) {
+ while (optind < argc) {
+ root = create(argv[optind++], root);
+ }
+ } else {
+ DIR *dir;
+ struct dirent *dir_e;
+ dir = opendir(".");
+ if(dir) {
+ while((dir_e = readdir(dir))) {
+ if(!ignore_entry(dir_e->d_name)) {
+ root = create(dir_e->d_name, root);
+ }
+ }
+ closedir(dir);
+ }
}
- print_sorted(root);
+ if(isatty(STDOUT_FILENO)) {
+ struct winsize win;
+ if(ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) {
+ printf("Can not get the tty size: %s\n", strerror(errno));
+ exit (EXIT_FAILURE);
+ }
+ print_sorted(root, win.ws_row - 2);
+ } else {
+ print_sorted(root, -1);
+ }
destroy(root);
- exit(0);
+ exit(EXIT_SUCCESS);
}