binand · October 17, 2016 03:02 · Oct 17, 2016
diff --git a/largest.c b/largest.c
@@ -0,0 +1,89 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <ftw.h>
+
+struct currentry {
+    char **path;
+    int cnt;
+    size_t size;
+};
+
+struct currentry ce;
+
+int record_largest(const char *, const struct stat *, int);
+
+int main(int ac, char **av) {
+
+    int i = 0;
+
+    if (ac < 1) {
+
+        fprintf(stderr, "Usage: largest <directory>\n");
+        exit(1);
+    }
+
+    ce.cnt = 0;
+    ce.size = 0;
+    ce.path = NULL;
+
+    ftw(av[1], record_largest, 100);
+
+    if (ce.cnt == 0) {
+
+        printf("No files found?\n");
+        exit(1);
+    }
+
+    printf("\nLargest file size: %lu\n\n", ce.size);
+    for (i = 0; i < ce.cnt; i++) {
+
+        printf("\tFile[%d]: %s\n", i + 1, ce.path[i]);
+    }
+
+    putchar('\n');
+
+    exit(0);
+}
+
+int record_largest(const char *fpath, const struct stat *sb, int typeflag) {
+
+    int i;
+
+    if (typeflag != FTW_F) {
+        return 0;
+    }
+
+    if (ce.path == NULL) {
+
+        ce.size = sb->st_size;
+        ce.cnt = 1;
+        ce.path = malloc(sizeof *(ce.path));
+        ce.path[0] = malloc(strlen(fpath) + 1);
+        strcpy(ce.path[0], fpath);
+        return 0;
+    }
+
+    if (sb->st_size > ce.size) {
+
+        for (i = 0; i < ce.cnt; i++) {
+            free(ce.path[i]);
+        }
+
+        free(ce.path);
+
+        ce.size = sb->st_size;
+        ce.cnt = 1;
+        ce.path = malloc(sizeof *(ce.path));
+        ce.path[0] = malloc(strlen(fpath) + 1);
+        strcpy(ce.path[0], fpath);
+
+    } else if (sb->st_size == ce.size) {
+
+        ce.path[ce.cnt] = malloc(strlen(fpath) + 1);
+        strcpy(ce.path[ce.cnt], fpath);
+        ce.cnt++;
+    }
+
+    return 0;
+}