Displaying 5 results from an estimated 5 matches for "gettag2".
Did you mean:
gettag
2006 Feb 25
1
Dynamic hash table size (with static has load)
Hi list, and Wayne in particular,
It was almost a year since we had the discussion (with
http://lists.samba.org/archive/rsync/2005-March/011875.html as it's
conclusion) regarding chances for hash collisions and large files. As
now we have someone asking about synching 5TB files, I decided to
actually submit a patch.
Attached is a patch that uses a non-predetermined hash table size, so
that
2003 Oct 05
2
Possible security hole
Maybe security related mails should be sent elsewhere? I didn't notice
any so here it goes:
sender.c:receive_sums()
s->count = read_int(f);
..
s->sums = (struct sum_buf *)malloc(sizeof(s->sums[0])*s->count);
if (!s->sums) out_of_memory("receive_sums");
for (i=0; i < (int) s->count;i++) {
s->sums[i].sum1 = read_int(f);
2003 Mar 30
1
[RFC][patch] dynamic rolling block and sum sizes II
...; 3)
- rprintf(FINFO, "hash search s->n=%ld len=%.0f count=%ld\n",
- (long) s->n, (double) len, (long) s->count);
+ rprintf(FINFO, "hash search s->blength=%ld len=%.0f count=%ld\n",
+ (long) s->blength, (double) len, (long) s->count);
do {
tag t = gettag2(s1,s2);
@@ -196,7 +194,7 @@
if (sum != s->sums[i].sum1) continue;
/* also make sure the two blocks are the same length */
- l = MIN(s->n,len-offset);
+ l = MIN(s->blength,len-offset);
if (l != s->sums[i].len) continue;
if (verbose > 3)
@@ -209,7 +207,7 @...
2003 Mar 23
1
[RFC] dynamic checksum size
...; 3)
- rprintf(FINFO, "hash search s->n=%ld len=%.0f count=%ld\n",
- (long) s->n, (double) len, (long) s->count);
+ rprintf(FINFO, "hash search s->blength=%ld len=%.0f count=%ld\n",
+ (long) s->blength, (double) len, (long) s->count);
do {
tag t = gettag2(s1,s2);
@@ -196,7 +194,7 @@
if (sum != s->sums[i].sum1) continue;
/* also make sure the two blocks are the same length */
- l = MIN(s->n,len-offset);
+ l = MIN(s->blength,len-offset);
if (l != s->sums[i].len) continue;
if (verbose > 3)
@@ -209,7 +207,7 @...
2002 Aug 05
5
[patch] read-devices
...rch s->n=%d len=%.0f count=%d\n",
- s->n,(double)len,s->count);
+ rprintf(FINFO,"hash search s->n=%d count=%d\n",
+ s->n,s->count);
- do {
+ while (k >= s->sums[s->count-1].len) { /* look for a matching chunk as long as it might exist */
tag t = gettag2(s1,s2);
int done_csum2 = 0;
-
+ if (verbose>4) rprintf(FINFO, "#ET#>hash_search: iteration, offset=%.0f\n", (double)offset);
+
j = tag_table[t];
if (verbose > 4)
rprintf(FINFO,"offset=%.0f sum=%08x\n",(double)offset,sum);
@@ -175,23 +172,26 @@...