mirror/rsync
1
0
Fork 0
mirror of https://github.com/RsyncProject/rsync.git synced 2026-01-25 23:38:03 -05:00
Code Issues Packages Projects Releases Wiki Activity

Use want_i instead of last_i+1.

Browse Source
This commit is contained in:
Wayne Davison
2004-07-07 08:38:40 +00:00
parent 25bd99451c
commit a04d77bcbc
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
match.c
View File

@@ -142,14 +142,14 @@ static void hash_search(int f,struct sum_struct *s,
{
OFF_T offset, end;
unsigned int k;
size_t last_i;
size_t want_i;
char sum2[SUM_LENGTH];
uint32 s1, s2, sum;
schar *map;
/* last_i is used to encourage adjacent matches, allowing the RLL coding of the
output to work more efficiently */
last_i = (size_t)-1;
/* want_i is used to encourage adjacent matches, allowing the RLL
* coding of the output to work more efficiently. */
want_i = 0;
if (verbose > 2) {
rprintf(FINFO,"hash search b=%u len=%.0f\n",
@@ -216,15 +216,15 @@ static void hash_search(int f,struct sum_struct *s,
}
/* we've found a match, but now check to see
* if last_i can hint at a better match */
if (i != last_i + 1 && last_i + 1 < s->count
&& sum == s->sums[last_i+1].sum1
&& memcmp(sum2, s->sums[last_i+1].sum2, s->s2length) == 0) {
* if want_i can hint at a better match. */
if (i != want_i && want_i < s->count
&& sum == s->sums[want_i].sum1
&& memcmp(sum2, s->sums[want_i].sum2, s->s2length) == 0) {
/* we've found an adjacent match - the RLL coder
* will be happy */
i = last_i + 1;
i = want_i;
}
last_i = i;
want_i = i + 1;
matched(f,s,buf,offset,i);
offset += s->sums[i].len - 1;