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 | 93 | static void matched(int f,struct sum_struct *s,struct map_struct *buf, |
d9bea2dd | 94 | int offset,int i) |
c627d613 AT |
95 | { |
96 | int n = offset - last_match; | |
9e31c482 AT |
97 | int j; |
98 | ||
c627d613 AT |
99 | if (verbose > 2) |
100 | if (i != -1) | |
dc5ddbcc | 101 | fprintf(FERROR,"match at %d last_match=%d j=%d len=%d n=%d\n", |
c627d613 AT |
102 | (int)offset,(int)last_match,i,(int)s->sums[i].len,n); |
103 | ||
9e31c482 | 104 | send_token(f,i,buf,last_match,n,i==-1?0:s->sums[i].len); |
70d794dc AT |
105 | data_transfer += n; |
106 | ||
9e31c482 AT |
107 | if (n > 0) |
108 | write_flush(f); | |
109 | ||
70d794dc | 110 | if (i != -1) |
9e31c482 | 111 | n += s->sums[i].len; |
70d794dc | 112 | |
9e31c482 AT |
113 | for (j=0;j<n;j+=CHUNK_SIZE) { |
114 | int n1 = MIN(CHUNK_SIZE,n-j); | |
115 | sum_update(map_ptr(buf,last_match+j,n1),n1); | |
116 | } | |
117 | ||
118 | ||
c627d613 AT |
119 | if (i != -1) |
120 | last_match = offset + s->sums[i].len; | |
9e31c482 AT |
121 | |
122 | } | |
123 | ||
124 | ||
c6e7fcb4 AT |
125 | static void hash_search(int f,struct sum_struct *s, |
126 | struct map_struct *buf,off_t len) | |
c627d613 AT |
127 | { |
128 | int offset,j,k; | |
129 | int end; | |
130 | char sum2[SUM_LENGTH]; | |
d9bea2dd | 131 | uint32 s1, s2, sum; |
0aeee8c1 | 132 | signed char *map; |
c627d613 AT |
133 | |
134 | if (verbose > 2) | |
dc5ddbcc | 135 | fprintf(FERROR,"hash search b=%d len=%d\n",s->n,(int)len); |
c627d613 AT |
136 | |
137 | k = MIN(len, s->n); | |
d9bea2dd | 138 | |
0aeee8c1 | 139 | map = (signed char *)map_ptr(buf,0,k); |
d9bea2dd | 140 | |
0aeee8c1 | 141 | sum = get_checksum1((char *)map, k); |
c627d613 AT |
142 | s1 = sum & 0xFFFF; |
143 | s2 = sum >> 16; | |
144 | if (verbose > 3) | |
dc5ddbcc | 145 | fprintf(FERROR, "sum=%.8x k=%d\n", sum, k); |
c627d613 AT |
146 | |
147 | offset = 0; | |
148 | ||
149 | end = len + 1 - s->sums[s->count-1].len; | |
150 | ||
151 | if (verbose > 3) | |
dc5ddbcc | 152 | fprintf(FERROR,"hash search s->n=%d len=%d count=%d\n", |
c627d613 AT |
153 | s->n,(int)len,s->count); |
154 | ||
155 | do { | |
156 | tag t = gettag2(s1,s2); | |
157 | j = tag_table[t]; | |
158 | if (verbose > 4) | |
dc5ddbcc | 159 | fprintf(FERROR,"offset=%d sum=%08x\n", |
c627d613 AT |
160 | offset,sum); |
161 | ||
162 | if (j != NULL_TAG) { | |
163 | int done_csum2 = 0; | |
164 | ||
165 | sum = (s1 & 0xffff) | (s2 << 16); | |
166 | tag_hits++; | |
167 | do { | |
168 | int i = targets[j].i; | |
169 | ||
170 | if (sum == s->sums[i].sum1) { | |
171 | if (verbose > 3) | |
dc5ddbcc | 172 | fprintf(FERROR,"potential match at %d target=%d %d sum=%08x\n", |
c627d613 AT |
173 | offset,j,i,sum); |
174 | ||
175 | if (!done_csum2) { | |
d9bea2dd | 176 | int l = MIN(s->n,len-offset); |
0aeee8c1 AT |
177 | map = (signed char *)map_ptr(buf,offset,l); |
178 | get_checksum2((char *)map,l,sum2); | |
c627d613 AT |
179 | done_csum2 = 1; |
180 | } | |
43a481dc | 181 | if (memcmp(sum2,s->sums[i].sum2,csum_length) == 0) { |
58da1efa | 182 | matched(f,s,buf,offset,i); |
c627d613 AT |
183 | offset += s->sums[i].len - 1; |
184 | k = MIN((len-offset), s->n); | |
0aeee8c1 AT |
185 | map = (signed char *)map_ptr(buf,offset,k); |
186 | sum = get_checksum1((char *)map, k); | |
c627d613 AT |
187 | s1 = sum & 0xFFFF; |
188 | s2 = sum >> 16; | |
189 | ++matches; | |
190 | break; | |
191 | } else { | |
192 | false_alarms++; | |
193 | } | |
194 | } | |
195 | j++; | |
196 | } while (j<s->count && targets[j].t == t); | |
197 | } | |
198 | ||
199 | /* Trim off the first byte from the checksum */ | |
0aeee8c1 | 200 | map = (signed char *)map_ptr(buf,offset,k+1); |
94a3ac55 | 201 | s1 -= map[0] + CHAR_OFFSET; |
1b01b295 | 202 | s2 -= k * (map[0]+CHAR_OFFSET); |
c627d613 AT |
203 | |
204 | /* Add on the next byte (if there is one) to the checksum */ | |
205 | if (k < (len-offset)) { | |
1b01b295 | 206 | s1 += (map[k]+CHAR_OFFSET); |
c627d613 AT |
207 | s2 += s1; |
208 | } else { | |
209 | --k; | |
210 | } | |
211 | ||
c627d613 AT |
212 | } while (++offset < end); |
213 | ||
58da1efa | 214 | matched(f,s,buf,len,-1); |
fe4d86e4 | 215 | map_ptr(buf,len-1,1); |
c627d613 AT |
216 | } |
217 | ||
218 | ||
c6e7fcb4 | 219 | void match_sums(int f,struct sum_struct *s,struct map_struct *buf,off_t len) |
c627d613 | 220 | { |
ebb0a6f6 | 221 | char file_sum[MD4_SUM_LENGTH]; |
9e31c482 | 222 | |
c627d613 AT |
223 | last_match = 0; |
224 | false_alarms = 0; | |
225 | tag_hits = 0; | |
226 | matches=0; | |
227 | data_transfer=0; | |
228 | ||
9e31c482 AT |
229 | sum_init(); |
230 | ||
c627d613 AT |
231 | if (len > 0 && s->count>0) { |
232 | build_hash_table(s); | |
233 | ||
234 | if (verbose > 2) | |
dc5ddbcc | 235 | fprintf(FERROR,"built hash table\n"); |
c627d613 AT |
236 | |
237 | hash_search(f,s,buf,len); | |
238 | ||
239 | if (verbose > 2) | |
dc5ddbcc | 240 | fprintf(FERROR,"done hash search\n"); |
c627d613 | 241 | } else { |
58da1efa | 242 | matched(f,s,buf,len,-1); |
c627d613 AT |
243 | } |
244 | ||
9e31c482 AT |
245 | sum_end(file_sum); |
246 | ||
247 | if (remote_version >= 14) { | |
248 | if (verbose > 2) | |
249 | fprintf(FERROR,"sending file_sum\n"); | |
ebb0a6f6 | 250 | write_buf(f,file_sum,MD4_SUM_LENGTH); |
9e31c482 AT |
251 | } |
252 | ||
c627d613 AT |
253 | if (targets) { |
254 | free(targets); | |
255 | targets=NULL; | |
256 | } | |
257 | ||
258 | if (verbose > 2) | |
dc5ddbcc | 259 | fprintf(FERROR, "false_alarms=%d tag_hits=%d matches=%d\n", |
c627d613 AT |
260 | false_alarms, tag_hits, matches); |
261 | ||
262 | total_tag_hits += tag_hits; | |
263 | total_false_alarms += false_alarms; | |
264 | total_matches += matches; | |
265 | total_data_transfer += data_transfer; | |
266 | } | |
267 | ||
268 | void match_report(void) | |
269 | { | |
270 | if (verbose <= 1) | |
271 | return; | |
272 | ||
dc5ddbcc | 273 | fprintf(FINFO, |
c627d613 AT |
274 | "total: matches=%d tag_hits=%d false_alarms=%d data=%d\n", |
275 | total_matches,total_tag_hits, | |
276 | total_false_alarms,total_data_transfer); | |
277 | } |