If there is no lchown(), don't try to set the user & group of a symlink.
[rsync/rsync.git] / checksum.c
CommitLineData
0d7638ea 1/*
c627d613
AT
2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
0d7638ea 4
c627d613
AT
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.
0d7638ea 9
c627d613
AT
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.
0d7638ea 14
c627d613
AT
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 22int csum_length=2; /* initial value */
34ccb63e
AT
23
24#define CSUM_CHUNK 64
25
8ee6eb71 26extern int checksum_seed;
d04e9c51 27extern int protocol_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 */
deb5bf1d 33uint32 get_checksum1(char *buf1, int32 len)
c627d613 34{
deb5bf1d 35 int32 i;
c627d613 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) {
0d7638ea 41 s2 += 4*(s1 + buf[i]) + 3*buf[i+1] + 2*buf[i+2] + buf[i+3] +
1b01b295 42 10*CHAR_OFFSET;
0d7638ea 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
deb5bf1d 52void get_checksum2(char *buf, int32 len, char *sum)
c627d613 53{
deb5bf1d 54 int32 i;
8de330a3 55 static char *buf1;
deb5bf1d 56 static int32 len1;
8de330a3
AT
57 struct mdfour m;
58
59 if (len > len1) {
deb5bf1d
WD
60 if (buf1)
61 free(buf1);
58cadc86 62 buf1 = new_array(char, len+4);
8de330a3 63 len1 = len;
deb5bf1d
WD
64 if (!buf1)
65 out_of_memory("get_checksum2");
8de330a3 66 }
0d7638ea 67
8de330a3 68 mdfour_begin(&m);
0d7638ea 69
8de330a3
AT
70 memcpy(buf1,buf,len);
71 if (checksum_seed) {
72 SIVAL(buf1,len,checksum_seed);
73 len += 4;
74 }
0d7638ea 75
8de330a3 76 for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
7ae359c3 77 mdfour_update(&m, (uchar *)(buf1+i), CSUM_CHUNK);
8de330a3 78 }
fc1ae658
S
79 /*
80 * Prior to version 27 an incorrect MD4 checksum was computed
81 * by failing to call mdfour_tail() for block sizes that
82 * are multiples of 64. This is fixed by calling mdfour_update()
83 * even when there are no more bytes.
84 */
d04e9c51 85 if (len - i > 0 || protocol_version >= 27) {
7ae359c3 86 mdfour_update(&m, (uchar *)(buf1+i), (len-i));
8de330a3 87 }
0d7638ea 88
7ae359c3 89 mdfour_result(&m, (uchar *)sum);
c627d613
AT
90}
91
34ccb63e 92
bcacc18b 93void file_checksum(char *fname,char *sum,OFF_T size)
c627d613 94{
8de330a3
AT
95 OFF_T i;
96 struct map_struct *buf;
97 int fd;
98 OFF_T len = size;
8de330a3 99 struct mdfour m;
0d7638ea 100
f855a7d0 101 memset(sum,0,MD4_SUM_LENGTH);
0d7638ea 102
8c9fd200 103 fd = do_open(fname, O_RDONLY, 0);
efa95a18
WD
104 if (fd == -1)
105 return;
0d7638ea 106
bd1a581b 107 buf = map_file(fd, size, MAX_MAP_SIZE, CSUM_CHUNK);
0d7638ea 108
8de330a3
AT
109 mdfour_begin(&m);
110
111 for(i = 0; i + CSUM_CHUNK <= len; i += CSUM_CHUNK) {
afd8bdb9
WD
112 mdfour_update(&m, (uchar *)map_ptr(buf, i, CSUM_CHUNK),
113 CSUM_CHUNK);
8de330a3
AT
114 }
115
afd8bdb9 116 /* Prior to version 27 an incorrect MD4 checksum was computed
fc1ae658
S
117 * by failing to call mdfour_tail() for block sizes that
118 * are multiples of 64. This is fixed by calling mdfour_update()
afd8bdb9
WD
119 * even when there are no more bytes. */
120 if (len - i > 0 || protocol_version >= 27)
121 mdfour_update(&m, (uchar *)map_ptr(buf, i, len-i), len-i);
8de330a3 122
7ae359c3 123 mdfour_result(&m, (uchar *)sum);
8de330a3
AT
124
125 close(fd);
126 unmap_file(buf);
c627d613 127}
34ccb63e
AT
128
129
deb5bf1d 130static int32 sumresidue;
9e31c482 131static char sumrbuf[CSUM_CHUNK];
8de330a3 132static struct mdfour md;
9e31c482 133
ba582f75 134void sum_init(int seed)
9e31c482 135{
8de330a3
AT
136 char s[4];
137 mdfour_begin(&md);
ba582f75
WD
138 sumresidue = 0;
139 SIVAL(s, 0, seed);
140 sum_update(s, 4);
9e31c482
AT
141}
142
d37d8d7b
MP
143/**
144 * Feed data into an MD4 accumulator, md. The results may be
145 * retrieved using sum_end(). md is used for different purposes at
146 * different points during execution.
147 *
148 * @todo Perhaps get rid of md and just pass in the address each time.
149 * Very slightly clearer and slower.
150 **/
deb5bf1d 151void sum_update(char *p, int32 len)
9e31c482 152{
8de330a3 153 if (len + sumresidue < CSUM_CHUNK) {
deb5bf1d 154 memcpy(sumrbuf + sumresidue, p, len);
8de330a3
AT
155 sumresidue += len;
156 return;
157 }
158
159 if (sumresidue) {
deb5bf1d
WD
160 int32 i = CSUM_CHUNK - sumresidue;
161 memcpy(sumrbuf + sumresidue, p, i);
162 mdfour_update(&md, (uchar *)sumrbuf, CSUM_CHUNK);
8de330a3
AT
163 len -= i;
164 p += i;
165 }
166
deb5bf1d
WD
167 while (len >= CSUM_CHUNK) {
168 mdfour_update(&md, (uchar *)p, CSUM_CHUNK);
169 len -= CSUM_CHUNK;
170 p += CSUM_CHUNK;
8de330a3
AT
171 }
172
deb5bf1d
WD
173 sumresidue = len;
174 if (sumresidue)
175 memcpy(sumrbuf, p, sumresidue);
9e31c482
AT
176}
177
178void sum_end(char *sum)
179{
deb5bf1d 180 if (sumresidue || protocol_version >= 27)
7ae359c3 181 mdfour_update(&md, (uchar *)sumrbuf, sumresidue);
9e31c482 182
7ae359c3 183 mdfour_result(&md, (uchar *)sum);
9e31c482 184}