X-Git-Url: https://fleuret.org/cgi-bin/gitweb/gitweb.cgi?p=dus.git;a=blobdiff_plain;f=dus.c;h=5b19766514119eee7d28680e7ceae0c8f042eb4e;hp=4ad1fff1b03ffe3fa546812fc6a4cb9c42f336f0;hb=acb173574185b068ee9c46d244900c81fa31a947;hpb=d04ae65cca82b350617e81778e4e6d3b9f221b0f
diff --git a/dus.c b/dus.c
index 4ad1fff..5b19766 100644
--- a/dus.c
+++ b/dus.c
@@ -1,24 +1,26 @@
-/*************************************************************************/
-/* 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 _BSD_SOURCE
@@ -30,24 +32,23 @@
#include
#include
#include
+#include
-struct file_with_size {
- char *filename;
- size_t size;
- struct file_with_size *next;
-};
+#define BUFFER_SIZE 1024
+
+typedef int64_t size_sum_t;
-size_t file_or_dir_size(char *name) {
+size_sum_t file_or_dir_size(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));
+ printf("Can not stat %s: %s\n", name, strerror(errno));
exit (1);
}
@@ -61,13 +62,14 @@ size_t file_or_dir_size(char *name) {
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);
+ snprintf(subname, BUFFER_SIZE, "%s/%s", name, dir_e->d_name);
result += file_or_dir_size(subname);
}
}
closedir(dir);
} else {
if(S_ISREG(dummy.st_mode)) {
+ /* printf("%d %s\n", dummy.st_size, name); */
result += dummy.st_size;
}
}
@@ -75,6 +77,14 @@ size_t file_or_dir_size(char *name) {
return result;
}
+/**********************************************************************/
+
+struct file_with_size {
+ char *filename;
+ 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 = malloc(sizeof(struct file_with_size));
@@ -84,21 +94,127 @@ struct file_with_size *create(char *name, struct file_with_size *current) {
return result;
}
+void destroy(struct file_with_size *node) {
+ struct file_with_size *next;
+ while(node) {
+ next = node->next;
+ free(node->filename);
+ free(node);
+ node = next;
+ }
+}
+
+/**********************************************************************/
+
+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, first;
+
+ nb = 0;
+ for(node = root; node; node = node->next) {
+ nb++;
+ }
+
+ nodes = malloc(nb * sizeof(struct file_with_size *));
+
+ n = 0;
+ for(node = root; node; node = node->next) {
+ nodes[n++] = node;
+ }
+
+ qsort(nodes, nb, sizeof(struct file_with_size *), compare_files);
+
+ /*
+ for(n = 0; n < nb; n++) {
+ printf("%lld %s\n",
+ nodes[n]->size,
+ nodes[n]->filename);
+ }
+ */
+
+ first = 0;
+ if(height > 0 && height < nb) {
+ first = nb - height;
+ }
+ 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);
+ }
+ }
+
+ free(nodes);
+}
+
+/**********************************************************************/
+
int main(int argc, char **argv) {
int k;
struct file_with_size *root;
root = 0;
- for(k = 1; k < argc; k++) {
- root = create(argv[k], root);
+
+ if(argc > 1) {
+ for(k = 1; k < argc; k++) {
+ root = create(argv[k], root);
+ }
+ } else {
+ DIR *dir;
+ struct dirent *dir_e;
+ dir = opendir(".");
+ if(dir) {
+ while((dir_e = readdir(dir))) {
+ if(strcmp(dir_e->d_name, ".") &&
+ strcmp(dir_e->d_name, "..")) {
+ root = create(dir_e->d_name, root);
+ }
+ }
+ closedir(dir);
+ }
}
- while(root) {
- printf("%u %s\n",
- root->size,
- root->filename);
- root = root->next;
+ 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 (1);
+ }
+ print_sorted(root, win.ws_row - 2);
+ } else {
+ print_sorted(root, -1);
}
+ destroy(root);
+
exit(0);
}