static void matched(int f,struct sum_struct *s,struct map_struct *buf,
- off_t len,
int offset,int i)
{
int n = offset - last_match;
done_csum2 = 1;
}
if (memcmp(sum2,s->sums[i].sum2,csum_length) == 0) {
- matched(f,s,buf,len,offset,i);
+ matched(f,s,buf,offset,i);
offset += s->sums[i].len - 1;
k = MIN((len-offset), s->n);
map = (signed char *)map_ptr(buf,offset,k);
} while (++offset < end);
- matched(f,s,buf,len,len,-1);
+ matched(f,s,buf,len,-1);
map_ptr(buf,len-1,1);
}
if (verbose > 2)
fprintf(FERROR,"done hash search\n");
} else {
- matched(f,s,buf,len,len,-1);
+ matched(f,s,buf,len,-1);
}
sum_end(file_sum);
struct sum_struct *s;
int i;
off_t offset = 0;
- int block_len;
s = (struct sum_struct *)malloc(sizeof(*s));
if (!s) out_of_memory("receive_sums");
fprintf(FERROR,"count=%d n=%d rem=%d\n",
s->count,s->n,s->remainder);
- block_len = s->n;
-
if (s->count == 0)
return(s);