X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?a=blobdiff_plain;ds=sidebyside;f=dus.c;h=620df1ede4de90e91cddedbe90d0e77851a37dd5;hb=6ea55a080b700e73fa9194972a6349233ea4384f;hp=4ad1fff1b03ffe3fa546812fc6a4cb9c42f336f0;hpb=d04ae65cca82b350617e81778e4e6d3b9f221b0f;p=dus.git
diff --git a/dus.c b/dus.c
index 4ad1fff..620df1e 100644
--- a/dus.c
+++ b/dus.c
@@ -1,54 +1,120 @@
-/*************************************************************************/
-/* START_IP_HEADER */
-/* */
-/* This program is free software: you can redistribute it and/or modify */
-/* it under the terms of the version 3 of the GNU General Public License */
-/* as published by the Free Software Foundation. */
-/* */
-/* This program is distributed in the hope that it will be useful, but */
-/* WITHOUT ANY WARRANTY; without even the implied warranty of */
-/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU */
-/* General Public License for more details. */
-/* */
-/* You should have received a copy of the GNU General Public License */
-/* along with this program. If not, see . */
-/* */
-/* Written by and Copyright (C) Francois Fleuret */
-/* Contact for comments & bug reports */
-/* */
-/* END_IP_HEADER */
-/*************************************************************************/
+/*
+ * dus is a simple utility to display the files and directories
+ * according to their total disk occupancy.
+ *
+ * Copyright (c) 2010 Francois Fleuret
+ * Written by Francois Fleuret
+ *
+ * This file is part of dus.
+ *
+ * dus is free software: you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 3 as
+ * published by the Free Software Foundation.
+ *
+ * dus is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
+ * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
+ * License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with dus. If not, see .
+ *
+ */
+
+#define VERSION_NUMBER "1.1"
#define _BSD_SOURCE
#include
#include
+#include
#include
#include
#include
#include
#include
#include
+#include
+#include
+#include
-struct file_with_size {
- char *filename;
- size_t size;
- struct file_with_size *next;
-};
+#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_width = 0; /* -1 means no width limit, strictly positive
+ means limit, 0 means not active */
+
+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 reverse_sorting = 0; /* 1 means to show the large ones first */
+
+int show_top = 0; /* 1 means to show the top of the sorted list
+ instead of the bottom */
+
+size_sum_t size_min = -1; /* -1 means no minimum size, otherwise lower
+ bound on the size to display a
+ file/dir */
+
+/********************************************************************/
+
+/* malloc with error checking. */
+
+void *safe_malloc(size_t n) {
+ void *p = malloc(n);
+ if (!p && n != 0) {
+ fprintf(stderr, "Can not allocate memory: %s\n", strerror(errno));
+ exit(EXIT_FAILURE);
+ }
+ return p;
+}
+
+/********************************************************************/
+
+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[128];
+ char *a = tmp + sizeof(tmp)/sizeof(char);
+ *(--a) = '\0';
+ if(s) {
+ while(s) {
+ *(--a) = s%10 + '0';
+ s /= 10;
+ }
+ } else {
+ *(--a) = '0';
+ }
+ printf("%s", a);
+}
-size_t file_or_dir_size(char *name) {
+size_sum_t entry_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[PATH_MAX];
result = 0;
if(lstat(name, &dummy) != 0) {
- printf("Can not stat %s (%s).\n", name, strerror(errno));
- exit (1);
+ fprintf(stderr, "Can not stat %s: %s\n", name, strerror(errno));
+ exit(EXIT_FAILURE);
}
if(S_ISLNK(dummy.st_mode)) {
@@ -59,10 +125,9 @@ size_t file_or_dir_size(char *name) {
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);
- result += file_or_dir_size(subname);
+ if(!ignore_entry(dir_e->d_name)) {
+ snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
+ result += entry_size(subname);
}
}
closedir(dir);
@@ -75,30 +140,325 @@ size_t file_or_dir_size(char *name) {
return result;
}
-struct file_with_size *create(char *name, struct file_with_size *current) {
- struct file_with_size *result;
- result = malloc(sizeof(struct file_with_size));
- result->filename = strdup(name);
- result->size = file_or_dir_size(name);
- result->next = current;
+size_sum_t atoss(const char *string) {
+ size_sum_t total, partial_total;
+ const char *c;
+ total = 0;
+ partial_total = 0;
+
+ for(c = string; *c; c++) {
+ if(*c >= '0' && *c <= '9') {
+ partial_total = 10 * partial_total + ((int) (*c - '0'));
+ } else if(*c == 'K' || *c == 'k') {
+ total += partial_total * 1024;
+ partial_total = 0;
+ } else if(*c == 'M' || *c == 'm') {
+ total += partial_total * 1024 * 1024;
+ partial_total = 0;
+ } else if(*c == 'G' || *c == 'g') {
+ total += partial_total * 1024 * 1024 * 1024;
+ partial_total = 0;
+ } else {
+ fprintf(stderr, "Syntax error in %s\n", string);
+ }
+ }
+ return total;
+}
+
+/**********************************************************************/
+
+struct entry_node {
+ struct entry_node *next;
+ char *name;
+ size_sum_t size;
+};
+
+struct entry_node *push_entry(char *name, struct entry_node *head) {
+ struct entry_node *result;
+ result = safe_malloc(sizeof(struct entry_node));
+ result->name = strdup(name);
+ result->size = entry_size(name);
+ result->next = head;
return result;
}
+void destroy_entry_list(struct entry_node *node) {
+ struct entry_node *next;
+ while(node) {
+ next = node->next;
+ free(node->name);
+ free(node);
+ node = next;
+ }
+}
+
+/**********************************************************************/
+
+int compare_files(const void *x1, const void *x2) {
+ const struct entry_node **f1, **f2;
+
+ f1 = (const struct entry_node **) x1;
+ f2 = (const struct entry_node **) x2;
+
+ if(reverse_sorting) {
+ if((*f1)->size < (*f2)->size) {
+ return 1;
+ } else if((*f1)->size > (*f2)->size) {
+ return -1;
+ } else {
+ return 0;
+ }
+ } else {
+ if((*f1)->size < (*f2)->size) {
+ return -1;
+ } else if((*f1)->size > (*f2)->size) {
+ return 1;
+ } else {
+ return 0;
+ }
+ }
+}
+
+void raw_print(char *buffer, char *filename, size_sum_t size) {
+ char *a, *b, *c, u;
+
+ b = buffer;
+ if(size) {
+ while(size) {
+ *(b++) = size%10 + '0';
+ size /= 10;
+ }
+ } else {
+ *(b++) = '0';
+ }
+
+ a = buffer;
+ c = b;
+ while(a < c) {
+ u = *a;
+ *(a++) = *(--c);
+ *c = u;
+ }
+
+ *(b++) = ' ';
+
+ sprintf(b, " %s\n", filename);
+}
+
+void fancy_print(char *buffer, char *filename, size_sum_t size) {
+ if(size < 1024) {
+ sprintf(buffer,
+ "% 7d -- %s\n",
+ ((int) size),
+ filename);
+ } else if(size < 1024 * 1024) {
+ sprintf(buffer,
+ "% 6.1fK -- %s\n",
+ ((double) (size))/(1024.0),
+ filename);
+ } else if(size < 1024 * 1024 * 1024) {
+ sprintf(buffer,
+ "% 6.1fM -- %s\n",
+ ((double) (size))/(1024.0 * 1024),
+ filename);
+ } else {
+ sprintf(buffer,
+ "% 6.1fG -- %s\n",
+ ((double) (size))/(1024.0 * 1024.0 * 1024.0),
+ filename);
+ }
+}
+
+void print_sorted(struct entry_node *root, int width, int height) {
+ char line[BUFFER_SIZE];
+ struct entry_node *node;
+ struct entry_node **nodes;
+ int nb_nodes, n, first, last;
+
+ nb_nodes = 0;
+ for(node = root; node; node = node->next) {
+ if(size_min < 0 || node->size >= size_min) {
+ nb_nodes++;
+ }
+ }
+
+ nodes = safe_malloc(nb_nodes * sizeof(struct entry_node *));
+
+ n = 0;
+ for(node = root; node; node = node->next) {
+ if(size_min < 0 || node->size >= size_min) {
+ nodes[n++] = node;
+ }
+ }
+
+ qsort(nodes, nb_nodes, sizeof(struct entry_node *), compare_files);
+
+ first = 0;
+ last = nb_nodes;
+
+ if(forced_height) {
+ height = forced_height;
+ }
+
+ if(height >= 0 && nb_nodes > height && !show_top && !forced_height) {
+ printf("...\n");
+ }
+
+ if(height > 0 && height < nb_nodes) {
+ first = nb_nodes - height;
+ }
+
+ if(show_top) {
+ n = last;
+ last = nb_nodes - first;
+ first = nb_nodes - n;
+ }
+
+ for(n = first; n < last; n++) {
+ if(fancy_size_display) {
+ fancy_print(line, nodes[n]->name, nodes[n]->size);
+ } else {
+ raw_print(line, nodes[n]->name, nodes[n]->size);
+ }
+ if(width >= 0 && width < BUFFER_SIZE) {
+ line[width] = '\0';
+ }
+ printf(line);
+ }
+
+ if(height >= 0 && nb_nodes > height && show_top && !forced_height) {
+ printf("...\n");
+ }
+
+ free(nodes);
+}
+
+/**********************************************************************/
+
+void usage(FILE *out) {
+ fprintf(out, "Usage: dus [OPTION]... [FILE]...\n");
+ fprintf(out, "Version %s (%s)\n", VERSION_NUMBER, UNAME);
+ fprintf(out, "List files and directories sorted according to their size or content size. Take the content of the current directory as argument if none is provided.\n");
+ fprintf(out, "\n");
+ fprintf(out, " -d, --ignore-dots\n");
+ fprintf(out, " ignore files and directories starting with a '.'\n");
+ fprintf(out, " -f, --fancy\n");
+ fprintf(out, " display size with float values and K, M and G units.\n");
+ fprintf(out, " -r, --reverse-order\n");
+ fprintf(out, " reverse the sorting order.\n");
+ fprintf(out, " -t, --show-top\n");
+ fprintf(out, " show the top of the list.\n");
+ fprintf(out, " -c , --nb-columns \n");
+ fprintf(out, " specificy the number of columns to display. The value -1\n");
+ fprintf(out, " corresponds to no constraint. By default the command\n");
+ fprintf(out, " uses the tty width, or no constraint if the stdout is\n");
+ fprintf(out, " not a tty.\n");
+ fprintf(out, " -l , --nb-lines \n");
+ fprintf(out, " same as -c for number of lines.\n");
+ fprintf(out, " -h, --help\n");
+ fprintf(out, " show this help.\n");
+ fprintf(out, " -m , --size-min \n");
+ fprintf(out, " set the listed entries minimum size.\n");
+ fprintf(out, "\n");
+ fprintf(out, "Report bugs and comments to \n");
+}
+
+/**********************************************************************/
+
+static struct option long_options[] = {
+ { "ignore-dots", no_argument, 0, 'd' },
+ { "reverse-order", no_argument, 0, 'r' },
+ { "show-top", no_argument, 0, 't' },
+ { "help", no_argument, 0, 'h' },
+ { "fancy", no_argument, 0, 'f' },
+ { "nb-columns", 1, 0, 'c' },
+ { "nb-lines", 1, 0, 'l' },
+ { "size-min", 1, 0, 'm' },
+ { 0, 0, 0, 0 }
+};
+
int main(int argc, char **argv) {
- int k;
- struct file_with_size *root;
+ int c;
+ struct entry_node *root;
+ struct winsize win;
root = 0;
- for(k = 1; k < argc; k++) {
- root = create(argv[k], root);
+
+ setlocale (LC_ALL, "");
+
+ while ((c = getopt_long(argc, argv, "dfrtl:c:m:hd",
+ long_options, NULL)) != -1) {
+ switch (c) {
+
+ case 'd':
+ ignore_dotfiles = 1;
+ break;
+
+ case 'f':
+ fancy_size_display = 1;
+ break;
+
+ case 'r':
+ reverse_sorting = 1;
+ break;
+
+ case 't':
+ show_top = 1;
+ break;
+
+ case 'l':
+ forced_height = atoi(optarg);
+ break;
+
+ case 'c':
+ forced_width = atoi(optarg);
+ break;
+
+ case 'm':
+ size_min = atoss(optarg);
+ break;
+
+ case 'h':
+ usage(stdout);
+ exit(EXIT_SUCCESS);
+
+ break;
+
+ default:
+ usage(stderr);
+ exit(EXIT_FAILURE);
+ }
}
- while(root) {
- printf("%u %s\n",
- root->size,
- root->filename);
- root = root->next;
+ if (optind < argc) {
+ while (optind < argc) {
+ root = push_entry(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 = push_entry(dir_e->d_name, root);
+ }
+ }
+ closedir(dir);
+ } else {
+ fprintf(stderr, "Can not open ./: %s\n", strerror(errno));
+ exit (EXIT_FAILURE);
+ }
+ }
+
+ if(isatty(STDOUT_FILENO) &&
+ !ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) {
+ print_sorted(root, win.ws_col, win.ws_row - 2);
+ } else {
+ print_sorted(root, -1, -1);
}
- exit(0);
+ destroy_entry_list(root);
+
+ exit(EXIT_SUCCESS);
}