Commit | Line | Data |
---|---|---|
c627d613 AT |
1 | /* |
2 | Copyright (C) Andrew Tridgell 1996 | |
3 | Copyright (C) Paul Mackerras 1996 | |
4 | ||
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. | |
9 | ||
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. | |
14 | ||
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 | ||
43a481dc AT |
22 | extern int csum_length; |
23 | ||
c627d613 AT |
24 | extern int verbose; |
25 | extern int am_server; | |
26 | ||
9e31c482 AT |
27 | extern int remote_version; |
28 | ||
c627d613 AT |
29 | typedef unsigned short tag; |
30 | ||
31 | #define TABLESIZE (1<<16) | |
32 | #define NULL_TAG ((tag)-1) | |
33 | ||
34 | static int false_alarms; | |
35 | static int tag_hits; | |
36 | static int matches; | |
37 | static int data_transfer; | |
38 | ||
39 | static int total_false_alarms=0; | |
40 | static int total_tag_hits=0; | |
41 | static int total_matches=0; | |
42 | static int total_data_transfer=0; | |
43 | ||
44 | ||
45 | struct target { | |
46 | tag t; | |
47 | int i; | |
48 | }; | |
49 | ||
50 | static struct target *targets=NULL; | |
51 | ||
52 | static tag *tag_table = NULL; | |
53 | ||
54 | #define gettag2(s1,s2) (((s1) + (s2)) & 0xFFFF) | |
55 | #define gettag(sum) gettag2((sum)&0xFFFF,(sum)>>16) | |
56 | ||
57 | static int compare_targets(struct target *t1,struct target *t2) | |
58 | { | |
59 | return(t1->t - t2->t); | |
60 | } | |
61 | ||
62 | ||
63 | static void build_hash_table(struct sum_struct *s) | |
64 | { | |
65 | int i; | |
66 | ||
67 | if (!tag_table) | |
68 | tag_table = (tag *)malloc(sizeof(tag)*TABLESIZE); | |
69 | ||
70 | targets = (struct target *)malloc(sizeof(targets[0])*s->count); | |
71 | if (!tag_table || !targets) | |
72 | out_of_memory("build_hash_table"); | |
73 | ||
74 | for (i=0;i<s->count;i++) { | |
75 | targets[i].i = i; | |
76 | targets[i].t = gettag(s->sums[i].sum1); | |
77 | } | |
78 | ||
79 | qsort(targets,s->count,sizeof(targets[0]),(int (*)())compare_targets); | |
80 | ||
81 | for (i=0;i<TABLESIZE;i++) | |
82 | tag_table[i] = NULL_TAG; | |
83 | ||
84 | for (i=s->count-1;i>=0;i--) { | |
85 | tag_table[targets[i].t] = i; | |
86 | } | |
87 | } | |
88 | ||
89 | ||
c627d613 AT |
90 | static off_t last_match; |
91 | ||
92 | ||
c6e7fcb4 AT |
93 | static void matched(int f,struct sum_struct *s,struct map_struct *buf, |
94 | off_t len, | |
d9bea2dd | 95 | int offset,int i) |
c627d613 AT |
96 | { |
97 | int n = offset - last_match; | |
9e31c482 AT |
98 | int j; |
99 | ||
c627d613 AT |
100 | if (verbose > 2) |
101 | if (i != -1) | |
dc5ddbcc | 102 | fprintf(FERROR,"match at %d last_match=%d j=%d len=%d n=%d\n", |
c627d613 AT |
103 | (int)offset,(int)last_match,i,(int)s->sums[i].len,n); |
104 | ||
9e31c482 | 105 | send_token(f,i,buf,last_match,n,i==-1?0:s->sums[i].len); |
70d794dc AT |
106 | data_transfer += n; |
107 | ||
9e31c482 AT |
108 | if (n > 0) |
109 | write_flush(f); | |
110 | ||
70d794dc | 111 | if (i != -1) |
9e31c482 | 112 | n += s->sums[i].len; |
70d794dc | 113 | |
9e31c482 AT |
114 | for (j=0;j<n;j+=CHUNK_SIZE) { |
115 | int n1 = MIN(CHUNK_SIZE,n-j); | |
116 | sum_update(map_ptr(buf,last_match+j,n1),n1); | |
117 | } | |
118 | ||
119 | ||
c627d613 AT |
120 | if (i != -1) |
121 | last_match = offset + s->sums[i].len; | |
9e31c482 AT |
122 | |
123 | } | |
124 | ||
125 | ||
126 | static inline char *window_ptr(struct map_struct *buf,int off,int len) | |
127 | { | |
128 | static char *p=NULL; | |
129 | static int p_len = 0; | |
130 | static int p_off = 0; | |
131 | ||
132 | if (off == 0) { | |
133 | p_off = 0; | |
134 | p_len = CHUNK_SIZE; | |
135 | p = map_ptr(buf,p_off,p_len); | |
136 | } | |
137 | ||
138 | while (off+len > p_off+p_len) { | |
139 | p_off += CHUNK_SIZE; | |
140 | p_len = CHUNK_SIZE; | |
141 | p = map_ptr(buf,p_off,p_len); | |
142 | } | |
143 | ||
144 | return(p + (off-p_off)); | |
c627d613 AT |
145 | } |
146 | ||
147 | ||
c6e7fcb4 AT |
148 | static void hash_search(int f,struct sum_struct *s, |
149 | struct map_struct *buf,off_t len) | |
c627d613 AT |
150 | { |
151 | int offset,j,k; | |
152 | int end; | |
153 | char sum2[SUM_LENGTH]; | |
d9bea2dd AT |
154 | uint32 s1, s2, sum; |
155 | char *map; | |
c627d613 AT |
156 | |
157 | if (verbose > 2) | |
dc5ddbcc | 158 | fprintf(FERROR,"hash search b=%d len=%d\n",s->n,(int)len); |
c627d613 AT |
159 | |
160 | k = MIN(len, s->n); | |
d9bea2dd | 161 | |
9e31c482 | 162 | map = window_ptr(buf,0,k); |
d9bea2dd AT |
163 | |
164 | sum = get_checksum1(map, k); | |
c627d613 AT |
165 | s1 = sum & 0xFFFF; |
166 | s2 = sum >> 16; | |
167 | if (verbose > 3) | |
dc5ddbcc | 168 | fprintf(FERROR, "sum=%.8x k=%d\n", sum, k); |
c627d613 AT |
169 | |
170 | offset = 0; | |
171 | ||
172 | end = len + 1 - s->sums[s->count-1].len; | |
173 | ||
174 | if (verbose > 3) | |
dc5ddbcc | 175 | fprintf(FERROR,"hash search s->n=%d len=%d count=%d\n", |
c627d613 AT |
176 | s->n,(int)len,s->count); |
177 | ||
178 | do { | |
179 | tag t = gettag2(s1,s2); | |
180 | j = tag_table[t]; | |
181 | if (verbose > 4) | |
dc5ddbcc | 182 | fprintf(FERROR,"offset=%d sum=%08x\n", |
c627d613 AT |
183 | offset,sum); |
184 | ||
185 | if (j != NULL_TAG) { | |
186 | int done_csum2 = 0; | |
187 | ||
188 | sum = (s1 & 0xffff) | (s2 << 16); | |
189 | tag_hits++; | |
190 | do { | |
191 | int i = targets[j].i; | |
192 | ||
193 | if (sum == s->sums[i].sum1) { | |
194 | if (verbose > 3) | |
dc5ddbcc | 195 | fprintf(FERROR,"potential match at %d target=%d %d sum=%08x\n", |
c627d613 AT |
196 | offset,j,i,sum); |
197 | ||
198 | if (!done_csum2) { | |
d9bea2dd | 199 | int l = MIN(s->n,len-offset); |
9e31c482 | 200 | map = window_ptr(buf,offset,l); |
d9bea2dd | 201 | get_checksum2(map,l,sum2); |
c627d613 AT |
202 | done_csum2 = 1; |
203 | } | |
43a481dc | 204 | if (memcmp(sum2,s->sums[i].sum2,csum_length) == 0) { |
c627d613 AT |
205 | matched(f,s,buf,len,offset,i); |
206 | offset += s->sums[i].len - 1; | |
207 | k = MIN((len-offset), s->n); | |
9e31c482 | 208 | map = window_ptr(buf,offset,k); |
d9bea2dd | 209 | sum = get_checksum1(map, k); |
c627d613 AT |
210 | s1 = sum & 0xFFFF; |
211 | s2 = sum >> 16; | |
212 | ++matches; | |
213 | break; | |
214 | } else { | |
215 | false_alarms++; | |
216 | } | |
217 | } | |
218 | j++; | |
219 | } while (j<s->count && targets[j].t == t); | |
220 | } | |
221 | ||
222 | /* Trim off the first byte from the checksum */ | |
9e31c482 | 223 | map = window_ptr(buf,offset,k+1); |
d9bea2dd AT |
224 | s1 -= map[0]; |
225 | s2 -= k * map[0]; | |
c627d613 AT |
226 | |
227 | /* Add on the next byte (if there is one) to the checksum */ | |
228 | if (k < (len-offset)) { | |
d9bea2dd | 229 | s1 += map[k]; |
c627d613 AT |
230 | s2 += s1; |
231 | } else { | |
232 | --k; | |
233 | } | |
234 | ||
c627d613 AT |
235 | } while (++offset < end); |
236 | ||
237 | matched(f,s,buf,len,len,-1); | |
9e31c482 | 238 | window_ptr(buf,len-1,1); |
c627d613 AT |
239 | } |
240 | ||
241 | ||
c6e7fcb4 | 242 | void match_sums(int f,struct sum_struct *s,struct map_struct *buf,off_t len) |
c627d613 | 243 | { |
9e31c482 AT |
244 | char file_sum[SUM_LENGTH]; |
245 | ||
c627d613 AT |
246 | last_match = 0; |
247 | false_alarms = 0; | |
248 | tag_hits = 0; | |
249 | matches=0; | |
250 | data_transfer=0; | |
251 | ||
9e31c482 AT |
252 | sum_init(); |
253 | ||
c627d613 AT |
254 | if (len > 0 && s->count>0) { |
255 | build_hash_table(s); | |
256 | ||
257 | if (verbose > 2) | |
dc5ddbcc | 258 | fprintf(FERROR,"built hash table\n"); |
c627d613 AT |
259 | |
260 | hash_search(f,s,buf,len); | |
261 | ||
262 | if (verbose > 2) | |
dc5ddbcc | 263 | fprintf(FERROR,"done hash search\n"); |
c627d613 AT |
264 | } else { |
265 | matched(f,s,buf,len,len,-1); | |
266 | } | |
267 | ||
9e31c482 AT |
268 | sum_end(file_sum); |
269 | ||
270 | if (remote_version >= 14) { | |
271 | if (verbose > 2) | |
272 | fprintf(FERROR,"sending file_sum\n"); | |
273 | write_buf(f,file_sum,SUM_LENGTH); | |
274 | } | |
275 | ||
c627d613 AT |
276 | if (targets) { |
277 | free(targets); | |
278 | targets=NULL; | |
279 | } | |
280 | ||
281 | if (verbose > 2) | |
dc5ddbcc | 282 | fprintf(FERROR, "false_alarms=%d tag_hits=%d matches=%d\n", |
c627d613 AT |
283 | false_alarms, tag_hits, matches); |
284 | ||
285 | total_tag_hits += tag_hits; | |
286 | total_false_alarms += false_alarms; | |
287 | total_matches += matches; | |
288 | total_data_transfer += data_transfer; | |
289 | } | |
290 | ||
291 | void match_report(void) | |
292 | { | |
293 | if (verbose <= 1) | |
294 | return; | |
295 | ||
dc5ddbcc | 296 | fprintf(FINFO, |
c627d613 AT |
297 | "total: matches=%d tag_hits=%d false_alarms=%d data=%d\n", |
298 | total_matches,total_tag_hits, | |
299 | total_false_alarms,total_data_transfer); | |
300 | } |