Commit | Line | Data |
---|---|---|
1e4f48d6 | 1 | /* |
c627d613 AT |
2 | Copyright (C) Andrew Tridgell 1996 |
3 | Copyright (C) Paul Mackerras 1996 | |
1e4f48d6 | 4 | |
c627d613 AT |
5 | This program is free software; you can redistribute it and/or modify |
6 | it under the terms of the GNU General Public License as published by | |
7 | the Free Software Foundation; either version 2 of the License, or | |
8 | (at your option) any later version. | |
1e4f48d6 | 9 | |
c627d613 AT |
10 | This program is distributed in the hope that it will be useful, |
11 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | GNU General Public License for more details. | |
1e4f48d6 | 14 | |
c627d613 AT |
15 | You should have received a copy of the GNU General Public License |
16 | along with this program; if not, write to the Free Software | |
17 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
18 | */ | |
19 | ||
20 | #include "rsync.h" | |
21 | ||
22 | extern int verbose; | |
23 | extern int am_server; | |
16417f8b | 24 | extern int do_progress; |
c627d613 AT |
25 | |
26 | typedef unsigned short tag; | |
27 | ||
28 | #define TABLESIZE (1<<16) | |
100e5241 | 29 | #define NULL_TAG (-1) |
c627d613 AT |
30 | |
31 | static int false_alarms; | |
32 | static int tag_hits; | |
33 | static int matches; | |
a800434a | 34 | static int64 data_transfer; |
c627d613 | 35 | |
3a6a366f AT |
36 | static int total_false_alarms; |
37 | static int total_tag_hits; | |
38 | static int total_matches; | |
c627d613 | 39 | |
a800434a | 40 | extern struct stats stats; |
c627d613 AT |
41 | |
42 | struct target { | |
1e4f48d6 WD |
43 | tag t; |
44 | int i; | |
c627d613 AT |
45 | }; |
46 | ||
3a6a366f | 47 | static struct target *targets; |
c627d613 | 48 | |
100e5241 | 49 | static int *tag_table; |
c627d613 AT |
50 | |
51 | #define gettag2(s1,s2) (((s1) + (s2)) & 0xFFFF) | |
52 | #define gettag(sum) gettag2((sum)&0xFFFF,(sum)>>16) | |
53 | ||
54 | static int compare_targets(struct target *t1,struct target *t2) | |
55 | { | |
1e4f48d6 | 56 | return (int)t1->t - (int)t2->t; |
c627d613 AT |
57 | } |
58 | ||
59 | ||
60 | static void build_hash_table(struct sum_struct *s) | |
61 | { | |
1e4f48d6 | 62 | int i; |
c627d613 | 63 | |
1e4f48d6 WD |
64 | if (!tag_table) |
65 | tag_table = (int *)malloc(sizeof(tag_table[0])*TABLESIZE); | |
c627d613 | 66 | |
1e4f48d6 WD |
67 | targets = (struct target *)malloc(sizeof(targets[0])*s->count); |
68 | if (!tag_table || !targets) | |
69 | out_of_memory("build_hash_table"); | |
c627d613 | 70 | |
1e4f48d6 WD |
71 | for (i = 0; i < (int)s->count; i++) { |
72 | targets[i].i = i; | |
73 | targets[i].t = gettag(s->sums[i].sum1); | |
74 | } | |
c627d613 | 75 | |
1e4f48d6 | 76 | qsort(targets,s->count,sizeof(targets[0]),(int (*)())compare_targets); |
c627d613 | 77 | |
1e4f48d6 WD |
78 | for (i = 0; i < TABLESIZE; i++) |
79 | tag_table[i] = NULL_TAG; | |
c627d613 | 80 | |
1e4f48d6 WD |
81 | for (i = s->count-1; i >= 0; i--) |
82 | tag_table[targets[i].t] = i; | |
c627d613 AT |
83 | } |
84 | ||
85 | ||
bcacc18b | 86 | static OFF_T last_match; |
c627d613 AT |
87 | |
88 | ||
f5f95a38 MP |
89 | /** |
90 | * Transmit a literal and/or match token. | |
91 | * | |
92 | * This delightfully-named function is called either when we find a | |
93 | * match and need to transmit all the unmatched data leading up to it, | |
94 | * or when we get bored of accumulating literal data and just need to | |
95 | * transmit it. As a result of this second case, it is called even if | |
96 | * we have not matched at all! | |
97 | * | |
98 | * @param i If >0, the number of a matched token. If 0, indicates we | |
99 | * have only literal data. | |
100 | **/ | |
c6e7fcb4 | 101 | static void matched(int f,struct sum_struct *s,struct map_struct *buf, |
bcacc18b | 102 | OFF_T offset,int i) |
c627d613 | 103 | { |
bcacc18b | 104 | OFF_T n = offset - last_match; |
1309d90d | 105 | OFF_T j; |
9e31c482 | 106 | |
0d0e2e93 | 107 | if (verbose > 2 && i >= 0) |
5f808dfb AT |
108 | rprintf(FINFO,"match at %.0f last_match=%.0f j=%d len=%d n=%.0f\n", |
109 | (double)offset,(double)last_match,i,s->sums[i].len,(double)n); | |
c627d613 | 110 | |
45f133b9 | 111 | send_token(f,i,buf,last_match,n,i<0?0:s->sums[i].len); |
e7ebc36c | 112 | data_transfer += n; |
70d794dc | 113 | |
a800434a AT |
114 | if (i >= 0) { |
115 | stats.matched_data += s->sums[i].len; | |
e7ebc36c | 116 | n += s->sums[i].len; |
a800434a | 117 | } |
1e4f48d6 WD |
118 | |
119 | for (j = 0; j < n; j += CHUNK_SIZE) { | |
e7ebc36c AT |
120 | int n1 = MIN(CHUNK_SIZE,n-j); |
121 | sum_update(map_ptr(buf,last_match+j,n1),n1); | |
122 | } | |
9e31c482 | 123 | |
9e31c482 | 124 | |
0d0e2e93 | 125 | if (i >= 0) |
e7ebc36c | 126 | last_match = offset + s->sums[i].len; |
0d0e2e93 AT |
127 | else |
128 | last_match = offset; | |
eb86d661 | 129 | |
16417f8b | 130 | if (buf && do_progress) { |
4440b8aa | 131 | show_progress(last_match, buf->file_size); |
eb86d661 | 132 | |
5e12ce11 AT |
133 | if (i == -1) end_progress(buf->file_size); |
134 | } | |
9e31c482 AT |
135 | } |
136 | ||
137 | ||
c6e7fcb4 | 138 | static void hash_search(int f,struct sum_struct *s, |
bcacc18b | 139 | struct map_struct *buf,OFF_T len) |
c627d613 | 140 | { |
5f808dfb | 141 | OFF_T offset, end; |
923fa978 | 142 | int j,k, last_i; |
e7ebc36c | 143 | char sum2[SUM_LENGTH]; |
1e4f48d6 | 144 | uint32 s1, s2, sum; |
debb4505 | 145 | schar *map; |
e7ebc36c | 146 | |
923fa978 AT |
147 | /* last_i is used to encourage adjacent matches, allowing the RLL coding of the |
148 | output to work more efficiently */ | |
149 | last_i = -1; | |
150 | ||
e7ebc36c | 151 | if (verbose > 2) |
e35080ce | 152 | rprintf(FINFO,"hash search b=%ld len=%.0f\n", |
fc0257c9 | 153 | (long) s->blength, (double)len); |
e7ebc36c | 154 | |
c95dcb39 | 155 | k = MIN(len, (OFF_T)s->blength); |
1e4f48d6 | 156 | |
debb4505 | 157 | map = (schar *)map_ptr(buf,0,k); |
1e4f48d6 | 158 | |
e7ebc36c AT |
159 | sum = get_checksum1((char *)map, k); |
160 | s1 = sum & 0xFFFF; | |
161 | s2 = sum >> 16; | |
162 | if (verbose > 3) | |
9486289c | 163 | rprintf(FINFO, "sum=%.8x k=%d\n", sum, k); |
1e4f48d6 | 164 | |
e7ebc36c | 165 | offset = 0; |
1e4f48d6 | 166 | |
e7ebc36c | 167 | end = len + 1 - s->sums[s->count-1].len; |
1e4f48d6 | 168 | |
e7ebc36c | 169 | if (verbose > 3) |
fc0257c9 S |
170 | rprintf(FINFO, "hash search s->blength=%ld len=%.0f count=%ld\n", |
171 | (long) s->blength, (double) len, (long) s->count); | |
1e4f48d6 | 172 | |
e7ebc36c AT |
173 | do { |
174 | tag t = gettag2(s1,s2); | |
175 | int done_csum2 = 0; | |
1e4f48d6 | 176 | |
e7ebc36c AT |
177 | j = tag_table[t]; |
178 | if (verbose > 4) | |
5f808dfb | 179 | rprintf(FINFO,"offset=%.0f sum=%08x\n",(double)offset,sum); |
1e4f48d6 | 180 | |
e7ebc36c AT |
181 | if (j == NULL_TAG) { |
182 | goto null_tag; | |
183 | } | |
184 | ||
185 | sum = (s1 & 0xffff) | (s2 << 16); | |
186 | tag_hits++; | |
a261989c | 187 | for (; j < (int) s->count && targets[j].t == t; j++) { |
536541d5 | 188 | int l, i = targets[j].i; |
1e4f48d6 | 189 | |
536541d5 | 190 | if (sum != s->sums[i].sum1) continue; |
1e4f48d6 | 191 | |
536541d5 | 192 | /* also make sure the two blocks are the same length */ |
c95dcb39 | 193 | l = MIN((OFF_T)s->blength, len-offset); |
1e4f48d6 | 194 | if (l != s->sums[i].len) continue; |
536541d5 | 195 | |
e7ebc36c | 196 | if (verbose > 3) |
5f808dfb AT |
197 | rprintf(FINFO,"potential match at %.0f target=%d %d sum=%08x\n", |
198 | (double)offset,j,i,sum); | |
1e4f48d6 | 199 | |
e7ebc36c | 200 | if (!done_csum2) { |
debb4505 | 201 | map = (schar *)map_ptr(buf,offset,l); |
e7ebc36c AT |
202 | get_checksum2((char *)map,l,sum2); |
203 | done_csum2 = 1; | |
204 | } | |
1e4f48d6 | 205 | |
fc0257c9 | 206 | if (memcmp(sum2,s->sums[i].sum2,s->s2length) != 0) { |
e7ebc36c AT |
207 | false_alarms++; |
208 | continue; | |
209 | } | |
923fa978 AT |
210 | |
211 | /* we've found a match, but now check to see | |
1e4f48d6 | 212 | * if last_i can hint at a better match */ |
a261989c | 213 | for (j++; j < (int) s->count && targets[j].t == t; j++) { |
34d3eed4 | 214 | int i2 = targets[j].i; |
923fa978 AT |
215 | if (i2 == last_i + 1) { |
216 | if (sum != s->sums[i2].sum1) break; | |
fc0257c9 | 217 | if (memcmp(sum2,s->sums[i2].sum2,s->s2length) != 0) break; |
1e4f48d6 WD |
218 | /* we've found an adjacent match - the RLL coder |
219 | * will be happy */ | |
923fa978 AT |
220 | i = i2; |
221 | break; | |
222 | } | |
223 | } | |
224 | ||
225 | last_i = i; | |
1e4f48d6 | 226 | |
e7ebc36c AT |
227 | matched(f,s,buf,offset,i); |
228 | offset += s->sums[i].len - 1; | |
c95dcb39 | 229 | k = MIN((OFF_T)s->blength, len-offset); |
debb4505 | 230 | map = (schar *)map_ptr(buf,offset,k); |
e7ebc36c AT |
231 | sum = get_checksum1((char *)map, k); |
232 | s1 = sum & 0xFFFF; | |
233 | s2 = sum >> 16; | |
234 | matches++; | |
235 | break; | |
236 | } | |
1e4f48d6 | 237 | |
e7ebc36c AT |
238 | null_tag: |
239 | /* Trim off the first byte from the checksum */ | |
debb4505 | 240 | map = (schar *)map_ptr(buf,offset,k+1); |
e7ebc36c AT |
241 | s1 -= map[0] + CHAR_OFFSET; |
242 | s2 -= k * (map[0]+CHAR_OFFSET); | |
1e4f48d6 | 243 | |
e7ebc36c AT |
244 | /* Add on the next byte (if there is one) to the checksum */ |
245 | if (k < (len-offset)) { | |
246 | s1 += (map[k]+CHAR_OFFSET); | |
247 | s2 += s1; | |
248 | } else { | |
249 | --k; | |
250 | } | |
45f133b9 | 251 | |
5914bf15 PM |
252 | /* By matching early we avoid re-reading the |
253 | data 3 times in the case where a token | |
254 | match comes a long way after last | |
255 | match. The 3 reads are caused by the | |
256 | running match, the checksum update and the | |
257 | literal send. */ | |
1e4f48d6 WD |
258 | if (offset > last_match |
259 | && offset-last_match >= CHUNK_SIZE+s->blength | |
260 | && end-offset > CHUNK_SIZE) { | |
fc0257c9 | 261 | matched(f,s,buf,offset - s->blength, -2); |
45f133b9 | 262 | } |
e7ebc36c | 263 | } while (++offset < end); |
1e4f48d6 | 264 | |
e7ebc36c AT |
265 | matched(f,s,buf,len,-1); |
266 | map_ptr(buf,len-1,1); | |
c627d613 AT |
267 | } |
268 | ||
269 | ||
f5f95a38 MP |
270 | /** |
271 | * Scan through a origin file, looking for sections that match | |
272 | * checksums from the generator, and transmit either literal or token | |
273 | * data. | |
274 | * | |
538ba24f MP |
275 | * Also calculates the MD4 checksum of the whole file, using the md |
276 | * accumulator. This is transmitted with the file as protection | |
277 | * against corruption on the wire. | |
278 | * | |
f5f95a38 MP |
279 | * @param s Checksums received from the generator. If <tt>s->count == |
280 | * 0</tt>, then there are actually no checksums for this file. | |
281 | * | |
282 | * @param len Length of the file to send. | |
283 | **/ | |
284 | void match_sums(int f, struct sum_struct *s, struct map_struct *buf, OFF_T len) | |
c627d613 | 285 | { |
e7ebc36c | 286 | char file_sum[MD4_SUM_LENGTH]; |
6902ed17 | 287 | extern int write_batch; /* dw */ |
e7ebc36c AT |
288 | |
289 | last_match = 0; | |
290 | false_alarms = 0; | |
291 | tag_hits = 0; | |
1e4f48d6 WD |
292 | matches = 0; |
293 | data_transfer = 0; | |
e7ebc36c AT |
294 | |
295 | sum_init(); | |
296 | ||
297 | if (len > 0 && s->count>0) { | |
298 | build_hash_table(s); | |
1e4f48d6 WD |
299 | |
300 | if (verbose > 2) | |
9486289c | 301 | rprintf(FINFO,"built hash table\n"); |
1e4f48d6 | 302 | |
e7ebc36c | 303 | hash_search(f,s,buf,len); |
1e4f48d6 WD |
304 | |
305 | if (verbose > 2) | |
9486289c | 306 | rprintf(FINFO,"done hash search\n"); |
e7ebc36c | 307 | } else { |
eb86d661 AT |
308 | OFF_T j; |
309 | /* by doing this in pieces we avoid too many seeks */ | |
1e4f48d6 | 310 | for (j = 0; j < len-CHUNK_SIZE; j += CHUNK_SIZE) { |
eb86d661 AT |
311 | int n1 = MIN(CHUNK_SIZE,(len-CHUNK_SIZE)-j); |
312 | matched(f,s,buf,j+n1,-2); | |
313 | } | |
e7ebc36c AT |
314 | matched(f,s,buf,len,-1); |
315 | } | |
9e31c482 | 316 | |
e7ebc36c | 317 | sum_end(file_sum); |
c627d613 | 318 | |
bc63ae3f S |
319 | if (verbose > 2) |
320 | rprintf(FINFO,"sending file_sum\n"); | |
321 | write_buf(f,file_sum,MD4_SUM_LENGTH); | |
322 | if (write_batch) /* dw */ | |
323 | write_batch_delta_file(file_sum, MD4_SUM_LENGTH); | |
c627d613 | 324 | |
e7ebc36c AT |
325 | if (targets) { |
326 | free(targets); | |
327 | targets=NULL; | |
328 | } | |
1e4f48d6 | 329 | |
e7ebc36c | 330 | if (verbose > 2) |
9486289c | 331 | rprintf(FINFO, "false_alarms=%d tag_hits=%d matches=%d\n", |
e7ebc36c | 332 | false_alarms, tag_hits, matches); |
1e4f48d6 | 333 | |
e7ebc36c AT |
334 | total_tag_hits += tag_hits; |
335 | total_false_alarms += false_alarms; | |
336 | total_matches += matches; | |
a800434a | 337 | stats.literal_data += data_transfer; |
c627d613 AT |
338 | } |
339 | ||
340 | void match_report(void) | |
341 | { | |
e7ebc36c AT |
342 | if (verbose <= 1) |
343 | return; | |
c627d613 | 344 | |
9486289c | 345 | rprintf(FINFO, |
a800434a | 346 | "total: matches=%d tag_hits=%d false_alarms=%d data=%.0f\n", |
e7ebc36c | 347 | total_matches,total_tag_hits, |
a800434a AT |
348 | total_false_alarms, |
349 | (double)stats.literal_data); | |
c627d613 | 350 | } |