void exec_command(int nb, struct file_node **nodes) {
char **args;
- int max_group_size = 0, group_size, m, n, status;
+ int max_group_size = 0, group_size = 0, m, n, status;
pid_t pid;
for(n = 0; n < nb; n++) {
- if(n == 0 || nodes[n]->group_id != nodes[n-1]->group_id) {
+ if(nodes[n]->group_id != nodes[n-1]->group_id) {
group_size = 0;
}
group_size++;
struct progress_state progress_state;
int not_in, found;
int nb_groups, nb_nodes;
- int list1_length, previous_progress;
+ int list1_length;
char *buffer1 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
char *buffer2 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
}
nb_groups = 0;
- previous_progress = -1;
nb_nodes = 0;
progress_state.bar_width = -1;