2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
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.
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.
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.
22 int csum_length=2; /* initial value */
26 int checksum_seed = 0;
27 extern int remote_version;
30 a simple 32 bit checksum that can be upadted from either end
31 (inspired by Mark Adler's Adler-32 checksum)
33 uint32 get_checksum1(char *buf,int len)
39 for (i = 0; i < (len-4); i+=4) {
40 s2 += 4*(s1 + buf[i]) + 3*buf[i+1] + 2*buf[i+2] + buf[i+3] +
42 s1 += (buf[i+0] + buf[i+1] + buf[i+2] + buf[i+3] + 4*CHAR_OFFSET);
44 for (; i < len; i++) {
45 s1 += (buf[i]+CHAR_OFFSET); s2 += s1;
47 return (s1 & 0xffff) + (s2 << 16);
51 static void sum_put(MDstruct *md,char *sum)
53 SIVAL(sum,0,md->buffer[0]);
54 if (csum_length <= 4) return;
55 SIVAL(sum,4,md->buffer[1]);
56 if (csum_length <= 8) return;
57 SIVAL(sum,8,md->buffer[2]);
58 if (csum_length <= 12) return;
59 SIVAL(sum,12,md->buffer[3]);
63 void get_checksum2(char *buf,int len,char *sum)
67 static char *buf1 = NULL;
72 buf1 = (char *)malloc(len+4);
74 if (!buf1) out_of_memory("get_checksum2");
81 SIVAL(buf1,len,checksum_seed);
85 for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
86 MDupdate(&MD, buf1+i, CSUM_CHUNK*8);
89 MDupdate(&MD, buf1+i, (len-i)*8);
95 void file_checksum(char *fname,char *sum,off_t size)
99 struct map_struct *buf;
102 char tmpchunk[CSUM_CHUNK];
104 bzero(sum,csum_length);
106 fd = open(fname,O_RDONLY);
107 if (fd == -1) return;
109 buf = map_file(fd,size);
113 for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
114 bcopy(map_ptr(buf,i,CSUM_CHUNK),tmpchunk,CSUM_CHUNK);
115 MDupdate(&MD, tmpchunk, CSUM_CHUNK*8);
119 bcopy(map_ptr(buf,i,len-i),tmpchunk,len-i);
120 MDupdate(&MD, tmpchunk, (len-i)*8);
130 void checksum_init(void)
132 if (remote_version >= 14)
133 csum_length = 2; /* adaptive */
135 csum_length = SUM_LENGTH;
140 static MDstruct sumMD;
141 static int sumresidue;
142 static char sumrbuf[CSUM_CHUNK];
149 SIVAL(s,0,checksum_seed);
153 void sum_update(char *p,int len)
156 if (len + sumresidue < CSUM_CHUNK) {
157 bcopy(p,sumrbuf+sumresidue,len);
163 i = MIN(CSUM_CHUNK-sumresidue,len);
164 bcopy(p,sumrbuf+sumresidue,i);
165 MDupdate(&sumMD, sumrbuf, (i+sumresidue)*8);
170 for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
171 bcopy(p+i,sumrbuf,CSUM_CHUNK);
172 MDupdate(&sumMD, sumrbuf, CSUM_CHUNK*8);
177 bcopy(p+i,sumrbuf,sumresidue);
183 void sum_end(char *sum)
186 MDupdate(&sumMD, sumrbuf, sumresidue*8);
188 SIVAL(sum,0,sumMD.buffer[0]);
189 SIVAL(sum,4,sumMD.buffer[1]);
190 SIVAL(sum,8,sumMD.buffer[2]);
191 SIVAL(sum,12,sumMD.buffer[3]);