Return new RERR_VANISHED code, as appropriate.
[rsync/rsync.git] / sender.c
CommitLineData
e6e3f12f 1/*
2f03f956
AT
2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
e6e3f12f 4
2f03f956
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.
e6e3f12f 9
2f03f956
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.
e6e3f12f 14
2f03f956
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
22extern int verbose;
2f03f956
AT
23extern int csum_length;
24extern struct stats stats;
25extern int io_error;
26extern int dry_run;
27extern int am_server;
28
29
0f9c48b1
MP
30/**
31 * @file
32 *
33 * The sender gets checksums from the generator, calculates deltas,
34 * and transmits them to the receiver. The sender process runs on the
35 * machine holding the source files.
36 **/
37
38
fc0257c9
S
39void read_sum_head(int f, struct sum_struct *sum)
40{
d04e9c51 41 extern int protocol_version;
fc0257c9
S
42
43 sum->count = read_int(f);
44 sum->blength = read_int(f);
dfad66a8 45 if (protocol_version < 27) {
fc0257c9 46 sum->s2length = csum_length;
dfad66a8 47 } else {
e6e3f12f 48 sum->s2length = read_int(f);
dfad66a8
S
49 if (sum->s2length > MD4_SUM_LENGTH) {
50 rprintf(FERROR, "Invalid checksum length %d\n",
51 sum->s2length);
52 exit_cleanup(RERR_PROTOCOL);
53 }
54 }
e6e3f12f 55 sum->remainder = read_int(f);
fc0257c9
S
56}
57
ce8149b6
MP
58/**
59 * Receive the checksums for a buffer
60 **/
2f03f956
AT
61static struct sum_struct *receive_sums(int f)
62{
63 struct sum_struct *s;
64 int i;
65 OFF_T offset = 0;
66
58cadc86 67 s = new(struct sum_struct);
2f03f956
AT
68 if (!s) out_of_memory("receive_sums");
69
fc0257c9
S
70 read_sum_head(f, s);
71
2f03f956
AT
72 s->sums = NULL;
73
74 if (verbose > 3)
e6e3f12f 75 rprintf(FINFO, "count=%ld n=%ld rem=%ld\n",
fc0257c9
S
76 (long) s->count, (long) s->blength,
77 (long) s->remainder);
2f03f956 78
e6e3f12f 79 if (s->count == 0)
2f03f956
AT
80 return(s);
81
58cadc86 82 s->sums = new_array(struct sum_buf, s->count);
2f03f956
AT
83 if (!s->sums) out_of_memory("receive_sums");
84
e6e3f12f 85 for (i = 0; i < (int) s->count; i++) {
2f03f956 86 s->sums[i].sum1 = read_int(f);
e6e3f12f 87 read_buf(f, s->sums[i].sum2, s->s2length);
2f03f956
AT
88
89 s->sums[i].offset = offset;
90 s->sums[i].i = i;
91
a261989c 92 if (i == (int) s->count-1 && s->remainder != 0) {
2f03f956
AT
93 s->sums[i].len = s->remainder;
94 } else {
fc0257c9 95 s->sums[i].len = s->blength;
2f03f956
AT
96 }
97 offset += s->sums[i].len;
98
99 if (verbose > 3)
e6e3f12f
S
100 rprintf(FINFO, "chunk[%d] len=%d offset=%.0f sum1=%08x\n",
101 i, s->sums[i].len, (double)s->sums[i].offset, s->sums[i].sum1);
2f03f956
AT
102 }
103
104 s->flength = offset;
105
106 return s;
107}
108
109
110
e6e3f12f
S
111void send_files(struct file_list *flist, int f_out, int f_in)
112{
c1659c79 113 int fd = -1;
2f03f956 114 struct sum_struct *s;
c1659c79 115 struct map_struct *buf = NULL;
2f03f956 116 STRUCT_STAT st;
e6e3f12f 117 char fname[MAXPATHLEN];
2f03f956
AT
118 int i;
119 struct file_struct *file;
120 int phase = 0;
e6e3f12f 121 extern struct stats stats;
1b7c47cb 122 struct stats initial_stats;
6902ed17 123 extern int write_batch; /* dw */
6902ed17
MP
124 extern int read_batch; /* dw */
125 int checksums_match; /* dw */
126 int buff_len; /* dw */
127 char buff[CHUNK_SIZE]; /* dw */
128 int j; /* dw */
129 int done; /* dw */
2f03f956
AT
130
131 if (verbose > 2)
e6e3f12f 132 rprintf(FINFO, "send_files starting\n");
2f03f956 133
2f03f956 134 while (1) {
e6e3f12f 135 int offset = 0;
2f03f956
AT
136
137 i = read_int(f_in);
138 if (i == -1) {
e6e3f12f 139 if (phase == 0) {
2f03f956
AT
140 phase++;
141 csum_length = SUM_LENGTH;
e6e3f12f 142 write_int(f_out, -1);
2f03f956 143 if (verbose > 2)
e6e3f12f 144 rprintf(FINFO, "send_files phase=%d\n", phase);
2f03f956
AT
145 continue;
146 }
147 break;
148 }
149
150 if (i < 0 || i >= flist->count) {
e6e3f12f 151 rprintf(FERROR, "Invalid file index %d (count=%d)\n",
2f03f956 152 i, flist->count);
65417579 153 exit_cleanup(RERR_PROTOCOL);
2f03f956
AT
154 }
155
156 file = flist->files[i];
157
158 stats.num_transferred_files++;
159 stats.total_transferred_size += file->length;
160
161 fname[0] = 0;
162 if (file->basedir) {
e6e3f12f 163 strlcpy(fname, file->basedir, MAXPATHLEN);
2f03f956
AT
164 if (strlen(fname) == MAXPATHLEN-1) {
165 io_error = 1;
166 rprintf(FERROR, "send_files failed on long-named directory %s\n",
ea42541f 167 full_fname(fname));
2f03f956
AT
168 return;
169 }
e6e3f12f 170 strlcat(fname, "/", MAXPATHLEN);
2f03f956
AT
171 offset = strlen(file->basedir)+1;
172 }
e6e3f12f
S
173 strlcat(fname, f_name(file), MAXPATHLEN);
174
175 if (verbose > 2)
176 rprintf(FINFO, "send_files(%d, %s)\n", i, fname);
177
178 if (dry_run) {
42d4edc0
S
179 if (!am_server && verbose) { /* log transfer */
180 rprintf(FINFO, "%s\n", fname+offset);
11a5a3c7 181 }
e6e3f12f 182 write_int(f_out, i);
2f03f956
AT
183 continue;
184 }
185
1b7c47cb
AT
186 initial_stats = stats;
187
2f03f956
AT
188 s = receive_sums(f_in);
189 if (!s) {
190 io_error = 1;
e6e3f12f 191 rprintf(FERROR, "receive_sums failed\n");
2f03f956
AT
192 return;
193 }
76f79ba7
MP
194
195 if (write_batch)
e6e3f12f
S
196 write_batch_csum_info(&i, flist->count, s);
197
6902ed17 198 if (!read_batch) {
c1659c79
MP
199 fd = do_open(fname, O_RDONLY, 0);
200 if (fd == -1) {
201 io_error = 1;
e6e3f12f 202 rprintf(FERROR, "send_files failed to open %s: %s\n",
ea42541f 203 full_fname(fname), strerror(errno));
c1659c79
MP
204 free_sums(s);
205 continue;
206 }
e6e3f12f 207
c1659c79 208 /* map the local file */
e6e3f12f 209 if (do_fstat(fd, &st) != 0) {
c1659c79 210 io_error = 1;
ea42541f 211 rprintf(FERROR, "fstat failed: %s\n", strerror(errno));
c1659c79
MP
212 free_sums(s);
213 close(fd);
214 return;
215 }
e6e3f12f 216
c1659c79 217 if (st.st_size > 0) {
e6e3f12f 218 buf = map_file(fd, st.st_size);
c1659c79
MP
219 } else {
220 buf = NULL;
221 }
e6e3f12f 222
c1659c79 223 if (verbose > 2)
e6e3f12f
S
224 rprintf(FINFO, "send_files mapped %s of size %.0f\n",
225 fname, (double)st.st_size);
226
227 write_int(f_out, i);
11a5a3c7 228
c1659c79 229 if (write_batch)
e6e3f12f 230 write_batch_delta_file((char *)&i, sizeof(i));
6902ed17 231
fc0257c9 232 write_sum_head(f_out, s);
6902ed17 233 }
e6e3f12f
S
234
235 if (verbose > 2 && !read_batch)
236 rprintf(FINFO, "calling match_sums %s\n", fname);
237
42d4edc0
S
238 if (!am_server && verbose) { /* log transfer */
239 rprintf(FINFO, "%s\n", fname+offset);
11a5a3c7 240 }
83fff1aa
AT
241
242 set_compression(fname);
1b7c47cb 243
e6e3f12f
S
244 if (read_batch) { /* dw */
245 /* read checksums originally computed on sender side */
246 read_batch_csum_info(i, s, &checksums_match);
247 if (checksums_match) {
248 read_batch_delta_file( (char *) &j, sizeof(int) );
249 if (j != i) { /* if flist index entries don't match*/
250 rprintf(FINFO, "index mismatch in send_files\n");
251 rprintf(FINFO, "read index = %d flist ndx = %d\n", j, i);
252 close_batch_delta_file();
253 close_batch_csums_file();
254 exit_cleanup(1);
255 } else {
256 write_int(f_out, j);
257 write_sum_head(f_out, s);
258 done = 0;
259 while (!done) {
260 read_batch_delta_file( (char *) &buff_len, sizeof(int) );
261 write_int(f_out, buff_len);
262 if (buff_len == 0) {
263 done = 1;
264 } else {
265 if (buff_len > 0) {
266 read_batch_delta_file(buff, buff_len);
267 write_buf(f_out, buff, buff_len);
268 }
269 }
270 } /* end while */
271 read_batch_delta_file( buff, MD4_SUM_LENGTH);
272 write_buf(f_out, buff, MD4_SUM_LENGTH);
273
274 } /* j=i */
275 } else { /* not checksum match */
276 rprintf (FINFO, "readbatch & checksums don't match\n");
277 rprintf (FINFO, "filename=%s is being skipped\n", fname);
278 continue;
279 }
280 } else {
281 match_sums(f_out, s, buf, st.st_size);
282 log_send(file, &initial_stats);
283 }
6902ed17
MP
284
285 if (!read_batch) { /* dw */
6a7cc46c
S
286 if (buf) {
287 j = unmap_file(buf);
288 if (j) {
289 io_error = 1;
290 rprintf(FERROR,
291 "read errors mapping %s: (%d) %s\n",
292 full_fname(fname),
293 j,
294 strerror(j));
295 }
296 }
e6e3f12f 297 close(fd);
6902ed17 298 }
e6e3f12f 299
2f03f956 300 free_sums(s);
e6e3f12f 301
2f03f956 302 if (verbose > 2)
e6e3f12f 303 rprintf(FINFO, "sender finished %s\n", fname);
2f03f956
AT
304 }
305
306 if (verbose > 2)
e6e3f12f 307 rprintf(FINFO, "send files finished\n");
2f03f956
AT
308
309 match_report();
310
e6e3f12f 311 write_int(f_out, -1);
6902ed17 312 if (write_batch || read_batch) { /* dw */
e6e3f12f
S
313 close_batch_csums_file();
314 close_batch_delta_file();
6902ed17
MP
315 }
316
2f03f956
AT
317}
318
319
320
321
322