int ignore_dotfiles = 0; /* 1 means ignore files and directories
starting with a dot */
-int forced_width = 0; /* -1 means no width limit, strictly positive
- means limit, 0 means not active */
-
-int forced_height = 0; /* -1 means no height limit, strictly positive
- means limit, 0 means not active */
-
-int fancy_size_display = 0; /* 1 means to use floating values with K, M and G
- as units */
-
-int reverse_sorting = 0; /* 1 means to show the large ones first */
+int show_realpaths = 0; /* 1 means ignore files and directories
+ starting with a dot */
-int show_top = 0; /* 1 means to show the top of the sorted list
- instead of the bottom */
+int show_progress = 1; /* 1 means show a progress bar when we are in a
+ tty */
/********************************************************************/
if(s1 == s2) {
if(s1 == 0) {
+ close(fd1);
+ close(fd2);
return 1;
} else {
if(strncmp(buffer1, buffer2, s1)) {
}
}
} else {
+ if(fd1 >= 0) { close(fd1); }
+ if(fd2 >= 0) { close(fd2); }
return 0;
}
}
struct dirent *dir_e;
struct stat dummy;
struct file_with_size *tmp;
- char subname[BUFFER_SIZE];
+ char subname[PATH_MAX];
if(lstat(name, &dummy) != 0) {
- fprintf(stderr, "Can not stat %s: %s\n", name, strerror(errno));
+ fprintf(stderr, "Can not stat \"%s\": %s\n", name, strerror(errno));
exit(EXIT_FAILURE);
}
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);
+ snprintf(subname, PATH_MAX, "%s/%s", name, dir_e->d_name);
tail = scan_directory(tail, subname);
}
}
void start(const char *dirname1, const char *dirname2) {
struct file_with_size *list1, *list2;
struct file_with_size *node1, *node2;
+ int not_in, found;
+
+ if(dirname2[0] == '^') {
+ not_in = 1;
+ dirname2++;
+ } else {
+ not_in = 0;
+ }
+
list1 = scan_directory(0, dirname1);
list2 = scan_directory(0, dirname2);
- for(node1 = list1; node1; node1 = node1->next) {
- for(node2 = list2; node2; node2 = node2->next) {
- if(node1->inode != node2->inode && same_files(node1, node2)) {
- printf("%s %s \n", node1->filename, node2->filename);
+ if(not_in) {
+ for(node1 = list1; node1; node1 = node1->next) {
+ found = 0;
+
+ for(node2 = list2; !found && node2; node2 = node2->next) {
+ if(node1->inode != node2->inode && same_files(node1, node2)) {
+ found = 1;
+ }
+ }
+
+ if(!found) {
+ if(show_realpaths) {
+ printf("%s\n", realpath(node1->filename, 0));
+ } else {
+ printf("%s\n", node1->filename);
+ }
+ }
+ }
+
+ } else {
+
+ for(node1 = list1; node1; node1 = node1->next) {
+ for(node2 = list2; node2; node2 = node2->next) {
+ if(node1->inode != node2->inode && same_files(node1, node2)) {
+ if(show_realpaths) {
+ printf("%s %s\n",
+ realpath(node1->filename, 0),
+ realpath(node2->filename, 0));
+ } else {
+ printf("%s %s\n", node1->filename, node2->filename);
+ }
+ }
}
}
}
setlocale (LC_ALL, "");
while (1) {
- c = getopt(argc, argv, "h");
+ c = getopt(argc, argv, "hr");
if (c == -1)
break;
break;
+ case 'r':
+ show_realpaths = 1;
+ break;
+
default:
exit(EXIT_FAILURE);
}
if(optind + 1 < argc) {
start(argv[optind], argv[optind + 1]);
+ } else if(optind < argc) {
+ start(argv[optind], argv[optind]);
} else {
- fprintf(stderr, "%s [OPTIONS] <dir1> <dir2>\n", argv[0]);
+ fprintf(stderr, "%s [OPTIONS] <dir1> [[^]<dir2>]\n", argv[0]);
exit(EXIT_FAILURE);
}