#include <unistd.h>
#include <errno.h>
#include <string.h>
+#include <sys/ioctl.h>
-size_t file_or_dir_size(char *name) {
+#define BUFFER_SIZE 1024
+
+typedef int64_t size_sum_t;
+
+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);
}
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;
}
}
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) {
+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) {
qsort(nodes, nb, sizeof(struct file_with_size *), compare_files);
+ /*
for(n = 0; n < nb; n++) {
- printf("%u %s\n", nodes[n]->size, nodes[n]->filename);
+ 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);
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);
+ }
}
- 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 (1);
+ }
+ print_sorted(root, win.ws_row - 2);
+ } else {
+ print_sorted(root, -1);
+ }
destroy(root);