/**********************************************************************/
-int same_content(struct file_with_size *f1, struct file_with_size *f2) {
+int same_content(struct file_with_size *f1, struct file_with_size *f2,
+ char *buffer1, char *buffer2) {
int fd1, fd2, s1, s2;
- char buffer1[READ_BUFFER_SIZE], buffer2[READ_BUFFER_SIZE];
fd1 = open(f1->filename, O_RDONLY);
fd2 = open(f2->filename, O_RDONLY);
}
}
-int same_files(struct file_with_size *f1, struct file_with_size *f2) {
+int same_files(struct file_with_size *f1, struct file_with_size *f2,
+ char *buffer1, char *buffer2) {
if(ignore_same_inode && f1->inode == f2->inode) {
return 0;
}
- return f1->size == f2->size && same_content(f1, f2);
+ return f1->size == f2->size && same_content(f1, f2, buffer1, buffer2);
}
/**********************************************************************/
int not_in, found;
int k, pp, l1, n;
+ char *buffer1 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
+ char *buffer2 = safe_malloc(sizeof(char) * READ_BUFFER_SIZE);
+
not_in = 0;
if(show_progress) {
found = 0;
for(node2 = list2; !found && node2; node2 = node2->next) {
- if(same_files(node1, node2)) {
+ if(same_files(node1, node2, buffer1, buffer2)) {
found = 1;
}
}
for(node2 = list2; node2; node2 = node2->next) {
if(node1->group_id < 0 || node2->group_id < 0) {
- if(same_files(node1, node2)) {
+ if(same_files(node1, node2, buffer1, buffer2)) {
if(node1->group_id < 0) {
if(node2->group_id >= 0) {
node1->group_id = node2->group_id;
print_result(list1, 0);
file_list_delete(list1);
}
+
+ free(buffer1);
+ free(buffer2);
}
void print_help(FILE *out) {