3 * finddup is a simple utility to find duplicated files, files common
4 * to several directories, or files present in one directory and not
7 * Copyright (c) 2010 Francois Fleuret
8 * Written by Francois Fleuret <francois@fleuret.org>
10 * This file is part of finddup.
12 * finddup is free software: you can redistribute it and/or modify it
13 * under the terms of the GNU General Public License version 3 as
14 * published by the Free Software Foundation.
16 * finddup is distributed in the hope that it will be useful, but WITHOUT
17 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
18 * or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
19 * License for more details.
21 * You should have received a copy of the GNU General Public License
22 * along with finddup. If not, see <http://www.gnu.org/licenses/>.
26 #define VERSION_NUMBER "0.9"
30 #include <sys/types.h>
32 #include <sys/param.h>
39 #include <sys/ioctl.h>
44 #include <openssl/md5.h>
47 /* 1M really helps compared to 64k */
48 #define READ_BUFFER_SIZE (1024 * 1024)
50 typedef int64_t size_sum_t;
52 /* Yeah, global variables! */
54 int ignore_dotfiles = 0; /* 1 means ignore files and directories
55 starting with a dot */
57 int ignore_empty_files = 0; /* 1 means ignore empty files */
59 int show_realpaths = 0; /* 1 means ignore files and directories
60 starting with a dot */
62 int show_progress = 0; /* 1 means show a progress bar when we are in a
65 int show_hits = 1; /* 1 means to show the files from dir2
66 corresponding to the ones from dir1 */
68 int show_groups = 1; /* 1 means to show the group IDs when printing
71 int ignore_same_inode = 0; /* 1 means that comparison between two file
72 with same inode will always be false */
74 int tty_width = -1; /* Positive value means what width to use to show
78 int use_md5 = 0; /* 1 means we keep an MD5 signature for each file */
81 /********************************************************************/
83 /* malloc with error checking. */
85 void *safe_malloc(size_t n) {
88 printf("Can not allocate memory: %s\n", strerror(errno));
94 /********************************************************************/
96 int ignore_entry(const char *name) {
98 strcmp(name, ".") == 0 ||
99 strcmp(name, "..") == 0 ||
100 (ignore_dotfiles && name[0] == '.' && name[1] != '/');
103 /**********************************************************************/
106 struct file_node *next;
110 int group_id; /* one per identical file content */
111 int dir_id; /* 1 for DIR1, and 2 for DIR2 */
114 unsigned char md5[MD5_DIGEST_LENGTH];
118 void file_list_delete(struct file_node *head) {
119 struct file_node *next;
128 int file_list_length(struct file_node *head) {
137 /**********************************************************************/
139 int same_content(struct file_node *f1, struct file_node *f2,
140 char *buffer1, char *buffer2) {
141 int fd1, fd2, s1, s2;
147 if(f1->md5_computed && f2->md5_computed) {
148 if(!memcmp(f1->md5, f2->md5, MD5_DIGEST_LENGTH)) {
152 if(!f1->md5_computed) {
155 if(!f2->md5_computed) {
162 fd1 = open(f1->name, O_RDONLY);
163 fd2 = open(f2->name, O_RDONLY);
165 if(fd1 >= 0 && fd2 >= 0) {
167 s1 = read(fd1, buffer1, READ_BUFFER_SIZE);
168 s2 = read(fd2, buffer2, READ_BUFFER_SIZE);
170 if(s1 < 0 || s2 < 0) {
182 if(!f1->md5_computed) {
183 MD5_Final(f1->md5, &c1);
184 f1->md5_computed = 1;
186 if(!f2->md5_computed) {
187 MD5_Final(f2->md5, &c2);
188 f2->md5_computed = 1;
194 if(memcmp(buffer1, buffer2, s1)) {
201 if(!f1->md5_computed) {
202 MD5_Update(&c1, buffer1, s1);
204 if(!f2->md5_computed) {
205 MD5_Update(&c2, buffer2, s2);
212 "Different read size without error on files of same size.\n");
220 "Can not open \"%s\" error: %s\n",
227 "Can not open \"%s\" error: %s\n",
236 int same_files(struct file_node *f1, struct file_node *f2,
237 char *buffer1, char *buffer2) {
238 if(ignore_same_inode && f1->inode == f2->inode) {
241 return f1->size == f2->size && same_content(f1, f2, buffer1, buffer2);
244 /**********************************************************************/
246 struct file_node *scan_directory(struct file_node *tail, const char *name) {
248 struct dirent *dir_e;
250 struct file_node *tmp;
251 char subname[PATH_MAX + 1];
253 if(lstat(name, &sb) != 0) {
254 fprintf(stderr, "Can not stat \"%s\": %s\n", name, strerror(errno));
258 if(S_ISLNK(sb.st_mode)) {
265 while((dir_e = readdir(dir))) {
266 if(!ignore_entry(dir_e->d_name)) {
267 snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
268 tail = scan_directory(tail, subname);
273 if(S_ISREG(sb.st_mode)) {
274 if(!ignore_entry(name)) {
275 if(!ignore_empty_files || sb.st_size > 0) {
276 tmp = safe_malloc(sizeof(struct file_node));
278 tmp->name = strdup(name);
279 tmp->size = sb.st_size;
280 tmp->inode = sb.st_ino;
284 tmp->md5_computed = 0;
295 void print_file(struct file_node *node) {
296 char tmp[PATH_MAX + 1];
298 if(realpath(node->name, tmp)) {
300 printf("%d %s\n", node->group_id, tmp);
305 printf("Can not get the realpath of \"%s\": %s\n",
312 printf("%d %s\n", node->group_id, node->name);
314 printf("%s\n", node->name);
319 int compare_nodes(const void *x1, const void *x2) {
320 const struct file_node **f1, **f2;
322 f1 = (const struct file_node **) x1;
323 f2 = (const struct file_node **) x2;
325 if((*f1)->group_id < (*f2)->group_id) {
327 } else if((*f1)->group_id > (*f2)->group_id) {
330 if((*f1)->dir_id < (*f2)->dir_id) {
332 } else if((*f1)->dir_id > (*f2)->dir_id) {
341 void print_result(struct file_node *list1, struct file_node *list2) {
342 struct file_node *node1, *node2;
343 struct file_node **nodes;
347 for(node1 = list1; node1; node1 = node1->next) {
348 if(node1->group_id >= 0) { nb++; }
352 for(node2 = list2; node2; node2 = node2->next) {
353 if(node2->group_id >= 0) { nb++; }
357 nodes = safe_malloc(nb * sizeof(struct file_node *));
360 for(node1 = list1; node1; node1 = node1->next) {
361 if(node1->group_id >= 0) {
367 for(node2 = list2; node2; node2 = node2->next) {
368 if(node2->group_id >= 0) {
374 qsort(nodes, nb, sizeof(struct file_node *), compare_nodes);
376 for(n = 0; n < nb; n++) {
377 if(!show_groups && n > 0 && nodes[n]->group_id != nodes[n-1]->group_id) {
380 print_file(nodes[n]);
386 void print_progress(int max, int n, int *pp) {
389 if(show_progress && tty_width > 0) {
390 width = tty_width - 7;
391 p = (width * n) / (max - 1);
393 for(k = 0; k < p; k++) {
394 fprintf(stderr, "+");
396 for(; k < width; k++) {
397 fprintf(stderr, "-");
400 p = (100 * n) / (max - 1);
401 fprintf(stderr, " [%3d%%]\r", p);
406 void start(const char *dirname1, const char *dirname2) {
407 struct file_node *list1, *list2;
408 struct file_node *node1, *node2;
410 int nb_groups, nb_nodes;
411 int list1_length, previous_progress;
414 char *buffer1 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
415 char *buffer2 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
420 if(isatty(STDOUT_FILENO) &&
421 !ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) {
422 tty_width = win.ws_col;
424 fprintf(stderr, "Scanning %s ... ", dirname1);
427 list1 = scan_directory(0, dirname1);
430 if(strncmp(dirname2, "not:", 4) == 0) {
432 /* groups are not computed in the not: mode */
435 } else if(strncmp(dirname2, "and:", 4) == 0) {
439 fprintf(stderr, "%s ... ", dirname2);
441 list2 = scan_directory(0, dirname2);
447 fprintf(stderr, "done.\n");
451 previous_progress = -1;
453 list1_length = file_list_length(list1);
456 for(node1 = list1; node1; node1 = node1->next) {
457 print_progress(list1_length, nb_nodes, &previous_progress);
462 for(node2 = list2; !found && node2; node2 = node2->next) {
463 if(same_files(node1, node2, buffer1, buffer2)) {
470 printf("%s\n", realpath(node1->name, 0));
472 printf("%s\n", node1->name);
478 for(node1 = list1; node1; node1 = node1->next) {
479 print_progress(list1_length, nb_nodes, &previous_progress);
482 for(node2 = list2; node2; node2 = node2->next) {
483 if(node1->group_id < 0 || node2->group_id < 0) {
484 if(same_files(node1, node2, buffer1, buffer2)) {
485 if(node1->group_id < 0) {
486 if(node2->group_id >= 0) {
487 node1->group_id = node2->group_id;
489 node1->group_id = nb_groups;
494 if(node2->group_id < 0) {
495 node2->group_id = node1->group_id;
505 fprintf(stderr, "\n");
509 print_result(list1, list2);
510 file_list_delete(list1);
511 file_list_delete(list2);
513 print_result(list1, 0);
514 file_list_delete(list1);
521 void print_help(FILE *out) {
522 fprintf(out, "Usage: finddup [OPTION]... DIR1 [[and:|not:]DIR2]\n");
523 fprintf(out, "Version %s (%s)\n", VERSION_NUMBER, UNAME);
524 fprintf(out, "Without DIR2, lists duplicated files found in DIR1. With DIR2, lists files common to both directories. With the not: prefix, lists files found in DIR1 which do not exist in DIR2. The and: prefix is the default and should be used only if you have a directory starting with 'not:'\n");
526 /* 01234567890123456789012345678901234567890123456789012345678901234567890123456789*/
527 fprintf(out, " -h, --help show this help\n");
528 fprintf(out, " -d, --ignore-dots ignore dot files and directories\n");
529 fprintf(out, " -0, --ignore-empty ignore empty files\n");
530 fprintf(out, " -c, --hide-matchings do not show which files in DIR2 corresponds to\n");
531 fprintf(out, " those in DIR1\n");
532 fprintf(out, " -g, --no-group-ids do not show the file groups\n");
533 fprintf(out, " -p, --show-progress show progress\n");
534 fprintf(out, " -r, --real-paths show the real file paths\n");
535 fprintf(out, " -i, --same-inodes-are-different\n");
536 fprintf(out, " consider files with same inode as different\n");
538 fprintf(out, " -m, --md5 use MD5 hashing\n");
541 fprintf(out, "Report bugs and comments to <francois@fleuret.org>.\n");
544 /**********************************************************************/
546 static struct option long_options[] = {
547 { "help", no_argument, 0, 'h' },
548 { "same-inodes-are-different", no_argument, 0, 'i' },
549 { "real-paths", no_argument, 0, 'r' },
550 { "hide-matchings", no_argument, 0, 'c' },
551 { "no-group-ids", no_argument, 0, 'g' },
552 { "ignore-dots", no_argument, 0, 'd' },
553 { "ignore-empty", no_argument, 0, '0' },
554 { "show-progress", no_argument, 0, 'p' },
555 { "md5", no_argument, 0, 'm' },
559 int main(int argc, char **argv) {
562 setlocale (LC_ALL, "");
564 while ((c = getopt_long(argc, argv, "hircgd0pm",
565 long_options, NULL)) != -1) {
579 ignore_empty_files = 1;
587 ignore_same_inode = 1;
607 "finddup has not be compiled with MD5 hashing.\n");
617 if(optind + 2 == argc) {
618 start(argv[optind], argv[optind + 1]);
619 } else if(optind + 1 == argc) {
620 ignore_same_inode = 1;
621 start(argv[optind], 0);