Switching to GPL 3.
[rsync/rsync.git] / checksum.c
... / ...
CommitLineData
1/*
2 * Routines to support checksumming of bytes.
3 *
4 * Copyright (C) 1996 Andrew Tridgell
5 * Copyright (C) 1996 Paul Mackerras
6 * Copyright (C) 2004-2007 Wayne Davison
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 3 as
10 * published by the Free Software Foundation.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with this program; if not, visit the http://fsf.org website.
19 */
20
21#include "rsync.h"
22
23extern int checksum_seed;
24extern int protocol_version;
25
26int csum_length = SHORT_SUM_LENGTH; /* initial value */
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 */
32uint32 get_checksum1(char *buf1, int32 len)
33{
34 int32 i;
35 uint32 s1, s2;
36 schar *buf = (schar *)buf1;
37
38 s1 = s2 = 0;
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] +
41 10*CHAR_OFFSET;
42 s1 += (buf[i+0] + buf[i+1] + buf[i+2] + buf[i+3] + 4*CHAR_OFFSET);
43 }
44 for (; i < len; i++) {
45 s1 += (buf[i]+CHAR_OFFSET); s2 += s1;
46 }
47 return (s1 & 0xffff) + (s2 << 16);
48}
49
50
51void get_checksum2(char *buf, int32 len, char *sum)
52{
53 md_context m;
54
55 if (protocol_version >= 30) {
56 uchar seedbuf[4];
57 md5_begin(&m);
58 md5_update(&m, (uchar *)buf, len);
59 if (checksum_seed) {
60 SIVAL(seedbuf, 0, checksum_seed);
61 md5_update(&m, seedbuf, 4);
62 }
63 md5_result(&m, (uchar *)sum);
64 } else {
65 int32 i;
66 static char *buf1;
67 static int32 len1;
68
69 mdfour_begin(&m);
70
71 if (len > len1) {
72 if (buf1)
73 free(buf1);
74 buf1 = new_array(char, len+4);
75 len1 = len;
76 if (!buf1)
77 out_of_memory("get_checksum2");
78 }
79
80 memcpy(buf1, buf, len);
81 if (checksum_seed) {
82 SIVAL(buf1,len,checksum_seed);
83 len += 4;
84 }
85
86 for (i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK)
87 mdfour_update(&m, (uchar *)(buf1+i), CSUM_CHUNK);
88
89 /*
90 * Prior to version 27 an incorrect MD4 checksum was computed
91 * by failing to call mdfour_tail() for block sizes that
92 * are multiples of 64. This is fixed by calling mdfour_update()
93 * even when there are no more bytes.
94 */
95 if (len - i > 0 || protocol_version >= 27)
96 mdfour_update(&m, (uchar *)(buf1+i), len-i);
97
98 mdfour_result(&m, (uchar *)sum);
99 }
100}
101
102void file_checksum(char *fname, char *sum, OFF_T size)
103{
104 struct map_struct *buf;
105 OFF_T i, len = size;
106 md_context m;
107 int32 remainder;
108 int fd;
109
110 memset(sum, 0, MAX_DIGEST_LEN);
111
112 fd = do_open(fname, O_RDONLY, 0);
113 if (fd == -1)
114 return;
115
116 buf = map_file(fd, size, MAX_MAP_SIZE, CSUM_CHUNK);
117
118 if (protocol_version >= 30) {
119 md5_begin(&m);
120
121 for (i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
122 md5_update(&m, (uchar *)map_ptr(buf, i, CSUM_CHUNK),
123 CSUM_CHUNK);
124 }
125
126 remainder = (int32)(len - i);
127 if (remainder > 0)
128 md5_update(&m, (uchar *)map_ptr(buf, i, remainder), remainder);
129
130 md5_result(&m, (uchar *)sum);
131 } else {
132 mdfour_begin(&m);
133
134 for (i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
135 mdfour_update(&m, (uchar *)map_ptr(buf, i, CSUM_CHUNK),
136 CSUM_CHUNK);
137 }
138
139 /* Prior to version 27 an incorrect MD4 checksum was computed
140 * by failing to call mdfour_tail() for block sizes that
141 * are multiples of 64. This is fixed by calling mdfour_update()
142 * even when there are no more bytes. */
143 remainder = (int32)(len - i);
144 if (remainder > 0 || protocol_version >= 27)
145 mdfour_update(&m, (uchar *)map_ptr(buf, i, remainder), remainder);
146
147 mdfour_result(&m, (uchar *)sum);
148 }
149
150 close(fd);
151 unmap_file(buf);
152}
153
154static int32 sumresidue;
155static md_context md;
156
157void sum_init(int seed)
158{
159 char s[4];
160
161 if (protocol_version >= 30)
162 md5_begin(&md);
163 else {
164 mdfour_begin(&md);
165 sumresidue = 0;
166 }
167 SIVAL(s, 0, seed);
168 sum_update(s, 4);
169}
170
171/**
172 * Feed data into an MD4 accumulator, md. The results may be
173 * retrieved using sum_end(). md is used for different purposes at
174 * different points during execution.
175 *
176 * @todo Perhaps get rid of md and just pass in the address each time.
177 * Very slightly clearer and slower.
178 **/
179void sum_update(const char *p, int32 len)
180{
181 if (protocol_version >= 30) {
182 md5_update(&md, (uchar *)p, len);
183 return;
184 }
185
186 if (len + sumresidue < CSUM_CHUNK) {
187 memcpy(md.buffer + sumresidue, p, len);
188 sumresidue += len;
189 return;
190 }
191
192 if (sumresidue) {
193 int32 i = CSUM_CHUNK - sumresidue;
194 memcpy(md.buffer + sumresidue, p, i);
195 mdfour_update(&md, (uchar *)md.buffer, CSUM_CHUNK);
196 len -= i;
197 p += i;
198 }
199
200 while (len >= CSUM_CHUNK) {
201 mdfour_update(&md, (uchar *)p, CSUM_CHUNK);
202 len -= CSUM_CHUNK;
203 p += CSUM_CHUNK;
204 }
205
206 sumresidue = len;
207 if (sumresidue)
208 memcpy(md.buffer, p, sumresidue);
209}
210
211int sum_end(char *sum)
212{
213 if (protocol_version >= 30) {
214 md5_result(&md, (uchar *)sum);
215 return MD5_DIGEST_LEN;
216 }
217
218 if (sumresidue || protocol_version >= 27)
219 mdfour_update(&md, (uchar *)md.buffer, sumresidue);
220
221 mdfour_result(&md, (uchar *)sum);
222
223 return MD4_DIGEST_LEN;
224}