+struct file_node *scan_directory(struct file_node *tail, const char *name) {
+ struct file_node *result;
+ int length;
+
+ if(show_progress) {
+ fprintf(stderr, "Scanning '%s' ... ", name);
+ }
+
+ result = scan_directory_rec(tail, name);
+ length = file_list_length(result);
+
+ if(show_progress) {
+ fprintf(stderr, "done (%d file%s).\n",
+ length, (length > 1 ? "s" : ""));
+ }
+
+
+ return result;
+}
+
+void write_one_entry_to_file(FILE *out, struct file_node *node) {
+ char tmp[PATH_MAX + 1];
+ if(show_realpaths) {
+ if(realpath(node->name, tmp)) {
+ if(show_groups) {
+ fprintf(out, "%d %s\n", node->group_id, tmp);
+ } else {
+ fprintf(out, "%s\n", tmp);
+ }
+ } else {
+ fprintf(stderr,
+ "finddup: Can not get the realpath of \"%s\": %s\n",
+ node->name,
+ strerror(errno));
+ exit(EXIT_FAILURE);
+ }
+ } else {
+ if(show_groups) {
+ fprintf(out, "%d %s\n", node->group_id, node->name);
+ } else {
+ fprintf(out, "%s\n", node->name);
+ }
+ }
+}
+
+int compare_nodes(const void *x1, const void *x2) {
+ const struct file_node **f1, **f2;
+
+ f1 = (const struct file_node **) x1;
+ f2 = (const struct file_node **) x2;
+
+ if((*f1)->group_id < (*f2)->group_id) {
+ return -1;
+ } else if((*f1)->group_id > (*f2)->group_id) {
+ return 1;
+ } else {
+ if(sort_by_time) {
+ if((*f1)->mtime < (*f2)->mtime) {
+ return -1;
+ } else if((*f1)->mtime > (*f2)->mtime) {
+ return 1;
+ } else {
+ return 0;
+ }
+ } else {
+ if((*f1)->dir_id < (*f2)->dir_id) {
+ return -1;
+ } else if((*f1)->dir_id > (*f2)->dir_id) {
+ return 1;
+ } else {
+ return 0;
+ }
+ }
+ }
+}
+
+void exec_command(int nb, struct file_node **nodes) {
+ char **args;
+ int max_group_size = 0, group_size, m, n, status;
+ pid_t pid;
+
+ for(n = 0; n < nb; n++) {
+ if(n == 0 || nodes[n]->group_id != nodes[n-1]->group_id) {
+ group_size = 0;
+ }
+ group_size++;
+ if(group_size > max_group_size) {
+ max_group_size = group_size;
+ }
+ }
+
+ args = safe_malloc((max_group_size + 2) * sizeof(char *));
+ args[0] = command_to_exec;
+
+ n = 0;
+ while(n < nb) {
+ m = n;
+ if(trim_first) { m++; }
+ while(n < nb && nodes[n]->group_id == nodes[m]->group_id) {
+ if(n >= m) {
+ args[n - m + 1] = nodes[n]->name;
+ }
+ n++;
+ }
+ args[n - m + 1] = 0;
+ pid = fork();
+ if(pid < 0) {
+ } else if(pid == 0) {
+ if(execvp(command_to_exec, args) < 0) {
+ perror("execvp");
+ exit(EXIT_FAILURE);
+ }
+ } else {
+ while(wait(&status) != pid);
+ if(status > 0) {
+ exit(EXIT_FAILURE);
+ }
+ }
+ }
+
+ free(args);
+}
+
+void write_groups_in_files(int nb, struct file_node **nodes) {
+ FILE *file = 0;
+ int current_group = -1, n, first_of_group;
+ char filename[PATH_MAX + 1];
+
+ for(n = 0; n < nb; n++) {
+ first_of_group = (n == 0);
+ if(nodes[n]->group_id != current_group) {
+ if(file) { fclose(file); }
+ sprintf(filename, "%s%06d", result_file_prefix, nodes[n]->group_id);
+ file = fopen(filename, "w");
+ current_group = nodes[n]->group_id;
+ printf("Writing %s.\n" , filename);
+ first_of_group = 1;
+ }
+
+ if(!trim_first || !first_of_group) {
+ write_one_entry_to_file(file, nodes[n]);
+ }
+ }
+
+ if(file) { fclose(file); }
+}
+
+void print_result(struct file_node *list1, struct file_node *list2) {
+ struct file_node *node1, *node2;
+ struct file_node **nodes;
+ int nb, n, first_of_group;
+
+ nb = 0;
+ for(node1 = list1; node1; node1 = node1->next) {
+ if(node1->group_id >= 0) { nb++; }
+ }
+
+ if(list2) {
+ for(node2 = list2; node2; node2 = node2->next) {
+ if(node2->group_id >= 0) { nb++; }
+ }
+ }
+
+ nodes = safe_malloc(nb * sizeof(struct file_node *));
+
+ n = 0;
+ for(node1 = list1; node1; node1 = node1->next) {
+ if(node1->group_id >= 0) {
+ nodes[n++] = node1;
+ }
+ }
+
+ if(list2) {
+ for(node2 = list2; node2; node2 = node2->next) {
+ if(node2->group_id >= 0) {
+ nodes[n++] = node2;
+ }
+ }
+ }
+
+ qsort(nodes, nb, sizeof(struct file_node *), compare_nodes);
+
+ if(command_to_exec) {
+ exec_command(nb, nodes);
+ } else if(result_file_prefix) {
+ write_groups_in_files(nb, nodes);
+ } else {
+ for(n = 0; n < nb; n++) {
+ first_of_group = (n == 0);
+ if(n > 0 && nodes[n]->group_id != nodes[n-1]->group_id) {
+ if(!show_groups) {
+ printf("\n");
+ }
+ first_of_group = 1;
+ }
+ if(!trim_first || !first_of_group) {
+ write_one_entry_to_file(stdout, nodes[n]);
+ }
+ }
+ }
+
+ free(nodes);
+}
+
+struct progress_state {
+ int bar_width;
+ int nb_values, value;
+ int last_position;
+};
+
+void print_progress(struct progress_state *state) {
+ int position, k, normalizer;
+ struct winsize win;
+ char buffer[PROGRESS_BUFFER_SIZE];
+ char *s;
+
+ normalizer = (state->nb_values > 1 ? state->nb_values - 1 : 1);
+
+ if(show_progress) {
+ /* We use the previous bar_width to compute the position, so that
+ we avoid doing too many ioctls */
+ position = (state->bar_width * state->value) / normalizer;
+ if(state->bar_width <= 0 || position != state->last_position) {
+ if(!ioctl (STDERR_FILENO, TIOCGWINSZ, (char *) &win)) {
+ /* Something weird is going on if the previous test is wrong */
+ if(win.ws_col >= PROGRESS_BUFFER_SIZE - 3) {
+ state->bar_width = PROGRESS_BUFFER_SIZE - 10;
+ } else {
+ state->bar_width = win.ws_col - 7;
+ }
+ position = (state->bar_width * state->value) / normalizer;
+ state->last_position = position;
+ s = buffer;
+ for(k = 0; k < position; k++) {
+ *(s++) = '+';
+ }
+ for(; k < state->bar_width; k++) {
+ *(s++) = '-';
+ }
+
+ /* We need four % because of the fprintf that follows */
+ sprintf(s, " [%3d%%]\r",
+ (100 * state->value) / normalizer);
+
+ fprintf(stderr, "%s", buffer);
+ }
+ }
+ }
+}
+