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 | ||
ebb0a6f6 | 22 | int csum_length=2; /* initial value */ |
34ccb63e AT |
23 | |
24 | #define CSUM_CHUNK 64 | |
25 | ||
aae43eb3 | 26 | int checksum_seed = 0; |
b98c7b81 | 27 | extern int remote_version; |
c627d613 AT |
28 | |
29 | /* | |
30 | a simple 32 bit checksum that can be upadted from either end | |
31 | (inspired by Mark Adler's Adler-32 checksum) | |
32 | */ | |
0aeee8c1 | 33 | uint32 get_checksum1(char *buf1,int len) |
c627d613 AT |
34 | { |
35 | int i; | |
36 | uint32 s1, s2; | |
debb4505 | 37 | schar *buf = (schar *)buf1; |
c627d613 AT |
38 | |
39 | s1 = s2 = 0; | |
34ccb63e | 40 | for (i = 0; i < (len-4); i+=4) { |
1b01b295 AT |
41 | s2 += 4*(s1 + buf[i]) + 3*buf[i+1] + 2*buf[i+2] + buf[i+3] + |
42 | 10*CHAR_OFFSET; | |
43 | s1 += (buf[i+0] + buf[i+1] + buf[i+2] + buf[i+3] + 4*CHAR_OFFSET); | |
34ccb63e AT |
44 | } |
45 | for (; i < len; i++) { | |
1b01b295 | 46 | s1 += (buf[i]+CHAR_OFFSET); s2 += s1; |
c627d613 AT |
47 | } |
48 | return (s1 & 0xffff) + (s2 << 16); | |
49 | } | |
50 | ||
51 | ||
52 | void get_checksum2(char *buf,int len,char *sum) | |
53 | { | |
8de330a3 AT |
54 | int i; |
55 | static char *buf1; | |
56 | static int len1; | |
57 | struct mdfour m; | |
58 | ||
59 | if (len > len1) { | |
60 | if (buf1) free(buf1); | |
61 | buf1 = (char *)malloc(len+4); | |
62 | len1 = len; | |
63 | if (!buf1) out_of_memory("get_checksum2"); | |
64 | } | |
65 | ||
66 | mdfour_begin(&m); | |
67 | ||
68 | memcpy(buf1,buf,len); | |
69 | if (checksum_seed) { | |
70 | SIVAL(buf1,len,checksum_seed); | |
71 | len += 4; | |
72 | } | |
73 | ||
74 | for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) { | |
7ae359c3 | 75 | mdfour_update(&m, (uchar *)(buf1+i), CSUM_CHUNK); |
8de330a3 AT |
76 | } |
77 | if (len - i > 0) { | |
7ae359c3 | 78 | mdfour_update(&m, (uchar *)(buf1+i), (len-i)); |
8de330a3 AT |
79 | } |
80 | ||
7ae359c3 | 81 | mdfour_result(&m, (uchar *)sum); |
c627d613 AT |
82 | } |
83 | ||
34ccb63e | 84 | |
bcacc18b | 85 | void file_checksum(char *fname,char *sum,OFF_T size) |
c627d613 | 86 | { |
8de330a3 AT |
87 | OFF_T i; |
88 | struct map_struct *buf; | |
89 | int fd; | |
90 | OFF_T len = size; | |
91 | char tmpchunk[CSUM_CHUNK]; | |
92 | struct mdfour m; | |
93 | ||
f855a7d0 | 94 | memset(sum,0,MD4_SUM_LENGTH); |
8de330a3 | 95 | |
8c9fd200 | 96 | fd = do_open(fname, O_RDONLY, 0); |
8de330a3 AT |
97 | if (fd == -1) return; |
98 | ||
99 | buf = map_file(fd,size); | |
100 | ||
101 | mdfour_begin(&m); | |
102 | ||
103 | for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) { | |
104 | memcpy(tmpchunk, map_ptr(buf,i,CSUM_CHUNK), CSUM_CHUNK); | |
7ae359c3 | 105 | mdfour_update(&m, (uchar *)tmpchunk, CSUM_CHUNK); |
8de330a3 AT |
106 | } |
107 | ||
108 | if (len - i > 0) { | |
109 | memcpy(tmpchunk, map_ptr(buf,i,len-i), len-i); | |
7ae359c3 | 110 | mdfour_update(&m, (uchar *)tmpchunk, (len-i)); |
8de330a3 AT |
111 | } |
112 | ||
7ae359c3 | 113 | mdfour_result(&m, (uchar *)sum); |
8de330a3 AT |
114 | |
115 | close(fd); | |
116 | unmap_file(buf); | |
c627d613 | 117 | } |
34ccb63e AT |
118 | |
119 | ||
9e31c482 AT |
120 | static int sumresidue; |
121 | static char sumrbuf[CSUM_CHUNK]; | |
8de330a3 | 122 | static struct mdfour md; |
9e31c482 AT |
123 | |
124 | void sum_init(void) | |
125 | { | |
8de330a3 AT |
126 | char s[4]; |
127 | mdfour_begin(&md); | |
128 | sumresidue=0; | |
129 | SIVAL(s,0,checksum_seed); | |
130 | sum_update(s,4); | |
9e31c482 AT |
131 | } |
132 | ||
d37d8d7b MP |
133 | /** |
134 | * Feed data into an MD4 accumulator, md. The results may be | |
135 | * retrieved using sum_end(). md is used for different purposes at | |
136 | * different points during execution. | |
137 | * | |
138 | * @todo Perhaps get rid of md and just pass in the address each time. | |
139 | * Very slightly clearer and slower. | |
140 | **/ | |
141 | void sum_update(char *p, int len) | |
9e31c482 | 142 | { |
8de330a3 AT |
143 | int i; |
144 | if (len + sumresidue < CSUM_CHUNK) { | |
145 | memcpy(sumrbuf+sumresidue, p, len); | |
146 | sumresidue += len; | |
147 | return; | |
148 | } | |
149 | ||
150 | if (sumresidue) { | |
151 | i = MIN(CSUM_CHUNK-sumresidue,len); | |
152 | memcpy(sumrbuf+sumresidue,p,i); | |
7ae359c3 | 153 | mdfour_update(&md, (uchar *)sumrbuf, (i+sumresidue)); |
8de330a3 AT |
154 | len -= i; |
155 | p += i; | |
156 | } | |
157 | ||
158 | for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) { | |
159 | memcpy(sumrbuf,p+i,CSUM_CHUNK); | |
7ae359c3 | 160 | mdfour_update(&md, (uchar *)sumrbuf, CSUM_CHUNK); |
8de330a3 AT |
161 | } |
162 | ||
163 | if (len - i > 0) { | |
164 | sumresidue = len-i; | |
165 | memcpy(sumrbuf,p+i,sumresidue); | |
166 | } else { | |
167 | sumresidue = 0; | |
168 | } | |
9e31c482 AT |
169 | } |
170 | ||
171 | void sum_end(char *sum) | |
172 | { | |
8de330a3 | 173 | if (sumresidue) { |
7ae359c3 | 174 | mdfour_update(&md, (uchar *)sumrbuf, sumresidue); |
8de330a3 | 175 | } |
9e31c482 | 176 | |
7ae359c3 | 177 | mdfour_result(&md, (uchar *)sum); |
9e31c482 | 178 | } |