+ qsort(nodes, nb, sizeof(struct file_node *), compare_nodes);
+
+ for(n = 0; n < nb; n++) {
+ if(!show_groups && n > 0 && nodes[n]->group_id != nodes[n-1]->group_id) {
+ printf("\n");
+ }
+ print_file(nodes[n]);
+ }
+
+ free(nodes);
+}
+
+void print_progress(int max, int n, int *pp) {
+ int p, k;
+ int width;
+ if(show_progress && tty_width > 0) {
+ width = tty_width - 7;
+ p = (width * n) / (max - 1);
+ if(p > *pp) {
+ for(k = 0; k < p; k++) {
+ fprintf(stderr, "+");
+ }
+ for(; k < width; k++) {
+ fprintf(stderr, "-");
+ }
+ *pp = p;
+ p = (100 * n) / (max - 1);
+ fprintf(stderr, " [%3d%%]\r", p);
+ }
+ }
+}
+
+void start(const char *dirname1, const char *dirname2) {
+ struct file_node *list1, *list2;
+ struct file_node *node1, *node2;
+ int not_in, found;
+ int nb_groups, nb_nodes;
+ int list1_length, previous_progress;
+ struct winsize win;
+
+ char *buffer1 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
+ char *buffer2 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
+
+ not_in = 0;
+
+ if(show_progress) {
+ if(isatty(STDOUT_FILENO) &&
+ !ioctl (STDOUT_FILENO, TIOCGWINSZ, (char *) &win)) {
+ tty_width = win.ws_col;
+ }
+ fprintf(stderr, "Scanning %s ... ", dirname1);
+ }