X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=dus.git;a=blobdiff_plain;f=dus.c;h=ac1a7d38203959a12993d7e0d5952a2d9e4f627f;hp=04147a1e1c10ae12630100da9bb67dd250ca7332;hb=HEAD;hpb=d25ae1d10c252e21bd61a0ec7d6b4c677878a8e3 diff --git a/dus.c b/dus.c index 04147a1..ac1a7d3 100644 --- a/dus.c +++ b/dus.c @@ -3,7 +3,7 @@ * dus is a simple utility to display the files and directories * according to their total disk occupancy. * - * Copyright (c) 2010 Francois Fleuret + * Copyright (c) 2010, 2011 Francois Fleuret * Written by Francois Fleuret * * This file is part of dus. @@ -22,10 +22,13 @@ * */ -#define _BSD_SOURCE +#define VERSION_NUMBER "1.3" + +#define _DEFAULT_SOURCE #include #include +#include #include #include #include @@ -59,6 +62,14 @@ 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 */ + +int dont_exit_on_protected_files = 0; /* Should we go on when we meet + files or directories which + are protected ? */ + /********************************************************************/ /* malloc with error checking. */ @@ -66,7 +77,9 @@ int show_top = 0; /* 1 means to show the top of the sorted list void *safe_malloc(size_t n) { void *p = malloc(n); if (!p && n != 0) { - fprintf(stderr, "Can not allocate memory: %s\n", strerror(errno)); + fprintf(stderr, + "dus: Can not allocate memory: %s\n", + strerror(errno)); exit(EXIT_FAILURE); } return p; @@ -78,83 +91,145 @@ 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); + (ignore_dotfiles && name[0] == '.' && name[1] != '/'); } -size_sum_t file_or_dir_size(const char *name) { +size_sum_t entry_size(const char *name, int *isdir) { DIR *dir; struct dirent *dir_e; struct stat dummy; size_sum_t result; - char subname[BUFFER_SIZE]; + char subname[PATH_MAX]; result = 0; + if(isdir) { *isdir = 0; } if(lstat(name, &dummy) != 0) { - fprintf(stderr, "Can not stat %s: %s\n", name, strerror(errno)); - exit(EXIT_FAILURE); + fprintf(stderr, + "dus: Can not stat %s: %s\n", + name, strerror(errno)); + if(!(errno == EACCES && dont_exit_on_protected_files)) { + exit(EXIT_FAILURE); + } else { + return 0; + } } if(S_ISLNK(dummy.st_mode)) { return 0; } - dir = opendir(name); - - if(dir) { - while((dir_e = readdir(dir))) { - if(!ignore_entry(dir_e->d_name)) { - snprintf(subname, BUFFER_SIZE, "%s/%s", name, dir_e->d_name); - result += file_or_dir_size(subname); + if(S_ISDIR(dummy.st_mode)) { + if(isdir) { *isdir = 1; } + dir = opendir(name); + if(dir) { + while((dir_e = readdir(dir))) { + if(!ignore_entry(dir_e->d_name)) { + snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name); + result += entry_size(subname, 0); + } + } + closedir(dir); + } else { + fprintf(stderr, + "dus: Can not open directory %s: %s\n", + name, strerror(errno)); + if(!(errno == EACCES && dont_exit_on_protected_files)) { + exit(EXIT_FAILURE); } } - closedir(dir); - } else { - if(S_ISREG(dummy.st_mode)) { - result += dummy.st_size; - } + } else if(S_ISREG(dummy.st_mode)) { + result += dummy.st_size; } return result; } +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 == 'B' || *c == 'b') { + total += partial_total; + partial_total = 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, + "dus: Syntax error in size specification `%s'\n", + string); + exit(EXIT_FAILURE); + } + } + + total += partial_total; + + return total; +} + /**********************************************************************/ -struct file_with_size { - char *filename; +struct entry_node { + struct entry_node *next; + char *name; size_sum_t size; - struct file_with_size *next; }; -struct file_with_size *create(char *name, struct file_with_size *current) { - struct file_with_size *result; - result = safe_malloc(sizeof(struct file_with_size)); - result->filename = strdup(name); - result->size = file_or_dir_size(name); - result->next = current; +struct entry_node *push_entry(char *name, struct entry_node *head) { + char tmp_name[PATH_MAX]; + struct entry_node *result; + int isdir; + result = safe_malloc(sizeof(struct entry_node)); + result->size = entry_size(name, &isdir); + if(isdir) { + snprintf(tmp_name, PATH_MAX, "%s/", name); + result->name = strdup(tmp_name); + } else { + result->name = strdup(name); + } + result->next = head; return result; } -void destroy(struct file_with_size *node) { - struct file_with_size *next; +struct entry_node *push_dir_content(char *name, struct entry_node *head) { + char subname[PATH_MAX]; + DIR *dir; + struct dirent *dir_e; + dir = opendir(name); + if(dir) { + while((dir_e = readdir(dir))) { + if(!ignore_entry(dir_e->d_name)) { + snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name); + head = push_entry(subname, head); + } + } + closedir(dir); + } else { + fprintf(stderr, + "dus: Can not open directory %s: %s\n", + name, strerror(errno)); + exit (EXIT_FAILURE); + } + return head; +} + +void destroy_entry_list(struct entry_node *node) { + struct entry_node *next; while(node) { next = node->next; - free(node->filename); + free(node->name); free(node); node = next; } @@ -163,10 +238,10 @@ void destroy(struct file_with_size *node) { /**********************************************************************/ int compare_files(const void *x1, const void *x2) { - const struct file_with_size **f1, **f2; + const struct entry_node **f1, **f2; - f1 = (const struct file_with_size **) x1; - f2 = (const struct file_with_size **) x2; + f1 = (const struct entry_node **) x1; + f2 = (const struct entry_node **) x2; if(reverse_sorting) { if((*f1)->size < (*f2)->size) { @@ -187,18 +262,20 @@ int compare_files(const void *x1, const void *x2) { } } -void raw_print(char *buffer, char *filename, size_sum_t size) { +void raw_print(char *buffer, size_t buffer_size, + char *filename, size_sum_t size) { char *a, *b, *c, u; b = buffer; - if(size) { - while(size) { - *(b++) = size%10 + '0'; - size /= 10; + do { + if(b >= buffer + buffer_size) { + fprintf(stderr, + "dus: Buffer overflow in raw_print (hu?!).\n"); + exit(EXIT_FAILURE); } - } else { - *(b++) = '0'; - } + *(b++) = size%10 + '0'; + size /= 10; + } while(size); a = buffer; c = b; @@ -210,80 +287,107 @@ void raw_print(char *buffer, char *filename, size_sum_t size) { *(b++) = ' '; - sprintf(b, " %s\n", filename); + snprintf(b, buffer_size - (b - buffer), "%s\n", filename); } -void fancy_print(char *buffer, char *filename, size_sum_t size) { +void fancy_print(char *buffer, size_t buffer_size, + char *filename, size_sum_t size) { if(size < 1024) { - sprintf(buffer, - "% 7d %s\n", - ((int) size), - filename); + snprintf(buffer, + buffer_size, + "% 8d %s\n", + ((int) size), + filename); } else if(size < 1024 * 1024) { - sprintf(buffer, - "% 6.1fK %s\n", - ((double) (size))/(1024.0), - filename); + snprintf(buffer, + buffer_size, + "% 7.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); + snprintf(buffer, + buffer_size, + "% 7.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); + snprintf(buffer, + buffer_size, + "% 7.1fG %s\n", + ((double) (size))/(1024.0 * 1024.0 * 1024.0), + filename); } } -void print_sorted(struct file_with_size *root, int width, int height) { +void print_sorted(struct entry_node *root, int width, int height) { char line[BUFFER_SIZE]; - struct file_with_size *node; - struct file_with_size **nodes; - int nb, n, first, last; + struct entry_node *node; + struct entry_node **nodes; + int nb_nodes, n, first, last; - nb = 0; + nb_nodes = 0; for(node = root; node; node = node->next) { - nb++; + if(size_min < 0 || node->size >= size_min) { + nb_nodes++; + } } - nodes = safe_malloc(nb * sizeof(struct file_with_size *)); + nodes = safe_malloc(nb_nodes * sizeof(struct entry_node *)); n = 0; for(node = root; node; node = node->next) { - nodes[n++] = node; + if(size_min < 0 || node->size >= size_min) { + nodes[n++] = node; + } } - qsort(nodes, nb, sizeof(struct file_with_size *), compare_files); + qsort(nodes, nb_nodes, sizeof(struct entry_node *), compare_files); first = 0; - last = nb; + last = nb_nodes; if(forced_height) { height = forced_height; } - if(height > 0 && height < nb) { - first = nb - height; + if(forced_width) { + width = forced_width; + } + + 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 - first; - first = nb - n; + last = nb_nodes - first; + first = nb_nodes - n; + } + + /* I do not like valgrind to complain about uninitialized data */ + if(width < BUFFER_SIZE) { + line[width] = '\0'; } for(n = first; n < last; n++) { if(fancy_size_display) { - fancy_print(line, nodes[n]->filename, nodes[n]->size); + fancy_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size); } else { - raw_print(line, nodes[n]->filename, nodes[n]->size); + raw_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size); } - if(width >= 0 && width < BUFFER_SIZE) { - line[width] = '\0'; + if(width >= 1 && width + 1 < BUFFER_SIZE && line[width]) { + line[width] = '\n'; + line[width + 1] = '\0'; } - printf(line); + printf("%s", line); + } + + if(height >= 0 && nb_nodes > height && show_top && !forced_height) { + printf("...\n"); } free(nodes); @@ -291,25 +395,77 @@ void print_sorted(struct file_with_size *root, int width, int height) { /**********************************************************************/ +void usage(FILE *out) { + fprintf(out, "Usage: dus [OPTION]... [FILE]...\n"); + fprintf(out, "Version %s (%s)\n", VERSION_NUMBER, UNAME); + 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"); + fprintf(out, "\n"); + /* 01234567890123456789012345678901234567890123456789012345678901234567890123456789*/ + fprintf(out, " -h, --help show this help.\n"); + fprintf(out, " -v, --version prints the version number and exit\n"); + fprintf(out, " -d, --ignore-dots ignore files and directories starting with a '.'\n"); + fprintf(out, " -i, --ignore-protected do not exit when visiting files and directories\n"); + fprintf(out, " for which we do not have permission\n"); + fprintf(out, " -f, --fancy display size with float values and K, M and G\n"); + fprintf(out, " units.\n"); + fprintf(out, " -r, --reverse-order reverse the sorting order.\n"); + fprintf(out, " -t, --show-top show the top of the list.\n"); + fprintf(out, " -c , --nb-columns \n"); + fprintf(out, " specificy the number of columns to display. The\n"); + fprintf(out, " value -1 corresponds to no constraint. By default\n"); + fprintf(out, " the command uses the tty width, or no constraint\n"); + fprintf(out, " if the stdout is not a tty.\n"); + fprintf(out, " -l , --nb-lines \n"); + fprintf(out, " same as -c for number of lines.\n"); + fprintf(out, " -m , --size-min \n"); + fprintf(out, " set the listed entries minimum size. The size\n"); + fprintf(out, " can be specified using the G, M, K, and B units.\n"); + fprintf(out, "\n"); + fprintf(out, "Report bugs and comments to .\n"); +} + +/**********************************************************************/ + +static struct option long_options[] = { + { "version", no_argument, 0, 'v' }, + { "ignore-dots", no_argument, 0, 'd' }, + { "ignore-protected", no_argument, 0, 'i' }, + { "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 c; - struct file_with_size *root; + int c, l; + struct entry_node *root; + struct winsize win; root = 0; setlocale (LC_ALL, ""); - while (1) { - c = getopt(argc, argv, "dfrtl:c:hdu"); - if (c == -1) - break; - + while ((c = getopt_long(argc, argv, "ivdfrtl:c:m:hd", + long_options, NULL)) != -1) { switch (c) { + case 'v': + printf("dus version %s (%s)\n", VERSION_NUMBER, UNAME); + exit(EXIT_SUCCESS); + break; + case 'd': ignore_dotfiles = 1; break; + case 'i': + dont_exit_on_protected_files = 1; + break; + case 'f': fancy_size_display = 1; break; @@ -330,64 +486,44 @@ int main(int argc, char **argv) { forced_width = atoi(optarg); break; + case 'm': + size_min = atoss(optarg); + break; + case 'h': - printf("Usage: dus [OPTION]... [FILE]...\n"); - printf("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"); - printf("\n"); - printf(" -d ignore files and directories starting with a '.'\n"); - printf(" -f display size with float values and K, M and G units.\n"); - printf(" -r reverse the sorting order.\n"); - printf(" -t show the top of the list.\n"); - printf(" -c specificy the number of columns to display. The value -1\n"); - printf(" corresponds to no constraint. By default the command\n"); - printf(" uses the tty width, or no constraint if the stdout is\n"); - printf(" not a tty.\n"); - printf(" -l same as -c for number of lines.\n"); - printf(" -h show this help.\n"); - printf("\n"); - printf("Report bugs and comments to \n"); + usage(stdout); exit(EXIT_SUCCESS); break; default: + usage(stderr); 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); - } + l = strlen(argv[optind]); + if(l > 0 && argv[optind][l - 1] == '/') { + argv[optind][l - 1] = '\0'; + root = push_dir_content(argv[optind++], root); + } else { + root = push_entry(argv[optind++], root); } - closedir(dir); - } else { - fprintf(stderr, "Can not open ./: %s\n", strerror(errno)); - exit (EXIT_FAILURE); } + } else { + root = push_dir_content(".", root); } - if(isatty(STDOUT_FILENO)) { - struct winsize win; - if(ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) { - fprintf(stderr, "Can not get the tty size: %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); } - destroy(root); + destroy_entry_list(root); exit(EXIT_SUCCESS); }