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 | ||
34ccb63e AT |
22 | int csum_length=SUM_LENGTH; |
23 | ||
24 | #define CSUM_CHUNK 64 | |
25 | ||
aae43eb3 | 26 | int checksum_seed = 0; |
c627d613 AT |
27 | |
28 | /* | |
29 | a simple 32 bit checksum that can be upadted from either end | |
30 | (inspired by Mark Adler's Adler-32 checksum) | |
31 | */ | |
32 | uint32 get_checksum1(char *buf,int len) | |
33 | { | |
34 | int i; | |
35 | uint32 s1, s2; | |
36 | ||
37 | s1 = s2 = 0; | |
34ccb63e AT |
38 | for (i = 0; i < (len-4); i+=4) { |
39 | s2 += 4*(s1 + buf[i]) + 3*buf[i+1] + 2*buf[i+2] + buf[i+3]; | |
40 | s1 += (buf[i+0] + buf[i+1] + buf[i+2] + buf[i+3]); | |
41 | } | |
42 | for (; i < len; i++) { | |
43 | s1 += buf[i]; s2 += s1; | |
c627d613 AT |
44 | } |
45 | return (s1 & 0xffff) + (s2 << 16); | |
46 | } | |
47 | ||
48 | ||
34ccb63e AT |
49 | static void sum_put(MDstruct *md,char *sum) |
50 | { | |
51 | SIVAL(sum,0,md->buffer[0]); | |
52 | if (csum_length <= 4) return; | |
53 | SIVAL(sum,4,md->buffer[1]); | |
54 | if (csum_length <= 8) return; | |
55 | SIVAL(sum,8,md->buffer[2]); | |
56 | if (csum_length <= 12) return; | |
57 | SIVAL(sum,12,md->buffer[3]); | |
58 | } | |
59 | ||
60 | ||
c627d613 AT |
61 | void get_checksum2(char *buf,int len,char *sum) |
62 | { | |
c627d613 AT |
63 | int i; |
64 | MDstruct MD; | |
aae43eb3 AT |
65 | static char *buf1 = NULL; |
66 | static int len1 = 0; | |
67 | ||
68 | if (len > len1) { | |
69 | if (buf1) free(buf1); | |
57e877a1 | 70 | buf1 = (char *)malloc(len+4); |
aae43eb3 AT |
71 | len1 = len; |
72 | if (!buf1) out_of_memory("get_checksum2"); | |
73 | } | |
c627d613 AT |
74 | |
75 | MDbegin(&MD); | |
34ccb63e | 76 | |
aae43eb3 AT |
77 | bcopy(buf,buf1,len); |
78 | if (checksum_seed) { | |
57e877a1 AT |
79 | SIVAL(buf1,len,checksum_seed); |
80 | len += 4; | |
c627d613 | 81 | } |
34ccb63e | 82 | |
aae43eb3 AT |
83 | for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) { |
84 | MDupdate(&MD, buf1+i, CSUM_CHUNK*8); | |
85 | } | |
9e31c482 AT |
86 | if (len - i > 0) |
87 | MDupdate(&MD, buf1+i, (len-i)*8); | |
34ccb63e AT |
88 | |
89 | sum_put(&MD,sum); | |
c627d613 AT |
90 | } |
91 | ||
34ccb63e | 92 | |
c627d613 AT |
93 | void file_checksum(char *fname,char *sum,off_t size) |
94 | { | |
34ccb63e AT |
95 | int i; |
96 | MDstruct MD; | |
c6e7fcb4 | 97 | struct map_struct *buf; |
c627d613 | 98 | int fd; |
34ccb63e | 99 | int len = size; |
aae43eb3 | 100 | char tmpchunk[CSUM_CHUNK]; |
34ccb63e | 101 | |
43a481dc | 102 | bzero(sum,csum_length); |
c627d613 AT |
103 | |
104 | fd = open(fname,O_RDONLY); | |
105 | if (fd == -1) return; | |
106 | ||
107 | buf = map_file(fd,size); | |
34ccb63e AT |
108 | |
109 | MDbegin(&MD); | |
110 | ||
111 | for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) { | |
112 | bcopy(map_ptr(buf,i,CSUM_CHUNK),tmpchunk,CSUM_CHUNK); | |
113 | MDupdate(&MD, tmpchunk, CSUM_CHUNK*8); | |
c627d613 AT |
114 | } |
115 | ||
9e31c482 AT |
116 | if (len - i > 0) { |
117 | bcopy(map_ptr(buf,i,len-i),tmpchunk,len-i); | |
118 | MDupdate(&MD, tmpchunk, (len-i)*8); | |
119 | } | |
34ccb63e AT |
120 | |
121 | sum_put(&MD,sum); | |
122 | ||
c627d613 | 123 | close(fd); |
c6e7fcb4 | 124 | unmap_file(buf); |
c627d613 | 125 | } |
34ccb63e AT |
126 | |
127 | ||
128 | void checksum_init(void) | |
129 | { | |
34ccb63e AT |
130 | } |
131 | ||
132 | ||
9e31c482 AT |
133 | |
134 | static MDstruct sumMD; | |
135 | static int sumresidue; | |
136 | static char sumrbuf[CSUM_CHUNK]; | |
137 | ||
138 | void sum_init(void) | |
139 | { | |
140 | MDbegin(&sumMD); | |
141 | sumresidue=0; | |
142 | } | |
143 | ||
144 | void sum_update(char *p,int len) | |
145 | { | |
146 | int i; | |
147 | if (sumresidue) { | |
148 | i = MIN(CSUM_CHUNK-sumresidue,len); | |
149 | bcopy(p,sumrbuf+sumresidue,i); | |
150 | MDupdate(&sumMD, sumrbuf, (i+sumresidue)*8); | |
151 | len -= i; | |
152 | p += i; | |
153 | } | |
154 | ||
155 | for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) { | |
156 | bcopy(p+i,sumrbuf,CSUM_CHUNK); | |
157 | MDupdate(&sumMD, sumrbuf, CSUM_CHUNK*8); | |
158 | } | |
159 | ||
160 | if (len - i > 0) { | |
161 | sumresidue = len-i; | |
162 | bcopy(p+i,sumrbuf,sumresidue); | |
163 | } else { | |
164 | sumresidue = 0; | |
165 | } | |
166 | } | |
167 | ||
168 | void sum_end(char *sum) | |
169 | { | |
170 | if (sumresidue) | |
171 | MDupdate(&sumMD, sumrbuf, sumresidue*8); | |
172 | ||
173 | SIVAL(sum,0,sumMD.buffer[0]); | |
174 | SIVAL(sum,4,sumMD.buffer[1]); | |
175 | SIVAL(sum,8,sumMD.buffer[2]); | |
176 | SIVAL(sum,12,sumMD.buffer[3]); | |
177 | } | |
178 | ||
179 | ||
34ccb63e AT |
180 | #ifdef CHECKSUM_MAIN |
181 | int main(int argc,char *argv[]) | |
182 | { | |
183 | char sum[SUM_LENGTH]; | |
184 | int i,j; | |
185 | ||
186 | checksum_init(); | |
187 | ||
188 | for (i=1;i<argc;i++) { | |
189 | struct stat st; | |
190 | if (stat(argv[i],&st) == 0) { | |
191 | file_checksum(argv[i],sum,st.st_size); | |
192 | for (j=0;j<SUM_LENGTH;j++) | |
193 | printf("%02X",(unsigned char)sum[j]); | |
194 | printf(" %s\n",argv[i]); | |
195 | } | |
196 | } | |
197 | } | |
198 | #endif |