X-Git-Url: https://mattmccutchen.net/rsync/rsync.git/blobdiff_plain/debb45054a3c4d4da3faac372e993b594e5a0df7..1e8ae5ede66ba337ba6abbb4afad2b3319c1db74:/match.c diff --git a/match.c b/match.c index 3689af4f..dc4dbd1c 100644 --- a/match.c +++ b/match.c @@ -29,18 +29,18 @@ extern int remote_version; typedef unsigned short tag; #define TABLESIZE (1<<16) -#define NULL_TAG ((tag)-1) +#define NULL_TAG (-1) static int false_alarms; static int tag_hits; static int matches; -static int data_transfer; +static int64 data_transfer; static int total_false_alarms; static int total_tag_hits; static int total_matches; -static int64 total_data_transfer; +extern struct stats stats; struct target { tag t; @@ -49,7 +49,7 @@ struct target { static struct target *targets; -static tag *tag_table; +static int *tag_table; #define gettag2(s1,s2) (((s1) + (s2)) & 0xFFFF) #define gettag(sum) gettag2((sum)&0xFFFF,(sum)>>16) @@ -65,7 +65,7 @@ static void build_hash_table(struct sum_struct *s) int i; if (!tag_table) - tag_table = (tag *)malloc(sizeof(tag)*TABLESIZE); + tag_table = (int *)malloc(sizeof(tag_table[0])*TABLESIZE); targets = (struct target *)malloc(sizeof(targets[0])*s->count); if (!tag_table || !targets) @@ -94,20 +94,19 @@ static void matched(int f,struct sum_struct *s,struct map_struct *buf, OFF_T offset,int i) { OFF_T n = offset - last_match; - int j; + OFF_T j; if (verbose > 2 && i >= 0) - fprintf(FINFO,"match at %d last_match=%d j=%d len=%d n=%d\n", + rprintf(FINFO,"match at %d last_match=%d j=%d len=%d n=%d\n", (int)offset,(int)last_match,i,(int)s->sums[i].len,(int)n); - send_token(f,i,buf,last_match,n,i==-1?0:s->sums[i].len); + send_token(f,i,buf,last_match,n,i<0?0:s->sums[i].len); data_transfer += n; - if (n > 0) - write_flush(f); - - if (i >= 0) + if (i >= 0) { + stats.matched_data += s->sums[i].len; n += s->sums[i].len; + } for (j=0;jsums[i].len; else last_match = offset; + + if (buf) + show_progress(last_match, buf->size); + + if (i == -1) end_progress(); } @@ -133,7 +137,7 @@ static void hash_search(int f,struct sum_struct *s, schar *map; if (verbose > 2) - fprintf(FINFO,"hash search b=%d len=%d\n",s->n,(int)len); + rprintf(FINFO,"hash search b=%d len=%d\n",s->n,(int)len); k = MIN(len, s->n); @@ -143,14 +147,14 @@ static void hash_search(int f,struct sum_struct *s, s1 = sum & 0xFFFF; s2 = sum >> 16; if (verbose > 3) - fprintf(FINFO, "sum=%.8x k=%d\n", sum, k); + rprintf(FINFO, "sum=%.8x k=%d\n", sum, k); offset = 0; end = len + 1 - s->sums[s->count-1].len; if (verbose > 3) - fprintf(FINFO,"hash search s->n=%d len=%d count=%d\n", + rprintf(FINFO,"hash search s->n=%d len=%d count=%d\n", s->n,(int)len,s->count); do { @@ -159,7 +163,7 @@ static void hash_search(int f,struct sum_struct *s, j = tag_table[t]; if (verbose > 4) - fprintf(FINFO,"offset=%d sum=%08x\n",(int)offset,sum); + rprintf(FINFO,"offset=%d sum=%08x\n",(int)offset,sum); if (j == NULL_TAG) { goto null_tag; @@ -173,7 +177,7 @@ static void hash_search(int f,struct sum_struct *s, if (sum != s->sums[i].sum1) continue; if (verbose > 3) - fprintf(FINFO,"potential match at %d target=%d %d sum=%08x\n", + rprintf(FINFO,"potential match at %d target=%d %d sum=%08x\n", (int)offset,j,i,sum); if (!done_csum2) { @@ -212,7 +216,17 @@ static void hash_search(int f,struct sum_struct *s, } else { --k; } - + + /* By matching early we avoid re-reading the + data 3 times in the case where a token + match comes a long way after last + match. The 3 reads are caused by the + running match, the checksum update and the + literal send. */ + if (offset-last_match >= CHUNK_SIZE+s->n && + (end-offset > CHUNK_SIZE)) { + matched(f,s,buf,offset - s->n, -2); + } } while (++offset < end); matched(f,s,buf,len,-1); @@ -236,13 +250,19 @@ void match_sums(int f,struct sum_struct *s,struct map_struct *buf,OFF_T len) build_hash_table(s); if (verbose > 2) - fprintf(FINFO,"built hash table\n"); + rprintf(FINFO,"built hash table\n"); hash_search(f,s,buf,len); if (verbose > 2) - fprintf(FINFO,"done hash search\n"); + rprintf(FINFO,"done hash search\n"); } else { + OFF_T j; + /* by doing this in pieces we avoid too many seeks */ + for (j=0;j<(len-CHUNK_SIZE);j+=CHUNK_SIZE) { + int n1 = MIN(CHUNK_SIZE,(len-CHUNK_SIZE)-j); + matched(f,s,buf,j+n1,-2); + } matched(f,s,buf,len,-1); } @@ -250,7 +270,7 @@ void match_sums(int f,struct sum_struct *s,struct map_struct *buf,OFF_T len) if (remote_version >= 14) { if (verbose > 2) - fprintf(FINFO,"sending file_sum\n"); + rprintf(FINFO,"sending file_sum\n"); write_buf(f,file_sum,MD4_SUM_LENGTH); } @@ -260,13 +280,13 @@ void match_sums(int f,struct sum_struct *s,struct map_struct *buf,OFF_T len) } if (verbose > 2) - fprintf(FINFO, "false_alarms=%d tag_hits=%d matches=%d\n", + rprintf(FINFO, "false_alarms=%d tag_hits=%d matches=%d\n", false_alarms, tag_hits, matches); total_tag_hits += tag_hits; total_false_alarms += false_alarms; total_matches += matches; - total_data_transfer += data_transfer; + stats.literal_data += data_transfer; } void match_report(void) @@ -274,8 +294,9 @@ void match_report(void) if (verbose <= 1) return; - fprintf(FINFO, - "total: matches=%d tag_hits=%d false_alarms=%d data=%ld\n", + rprintf(FINFO, + "total: matches=%d tag_hits=%d false_alarms=%d data=%.0f\n", total_matches,total_tag_hits, - total_false_alarms,(long)total_data_transfer); + total_false_alarms, + (double)stats.literal_data); }