Commit | Line | Data |
---|---|---|
e327acec MP |
1 | /* -*- c-file-style: "linux" -*- |
2 | ||
3 | Copyright (C) 1996-2000 by Andrew Tridgell | |
2f03f956 AT |
4 | Copyright (C) Paul Mackerras 1996 |
5 | ||
6 | This program is free software; you can redistribute it and/or modify | |
7 | it under the terms of the GNU General Public License as published by | |
8 | the Free Software Foundation; either version 2 of the License, or | |
9 | (at your option) any later version. | |
10 | ||
11 | This program is distributed in the hope that it will be useful, | |
12 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
14 | GNU General Public License for more details. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
17 | along with this program; if not, write to the Free Software | |
18 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. | |
19 | */ | |
20 | ||
21 | #include "rsync.h" | |
22 | ||
23 | extern int verbose; | |
24 | extern int recurse; | |
25 | extern int delete_mode; | |
26 | extern int remote_version; | |
27 | extern int csum_length; | |
28 | extern struct stats stats; | |
29 | extern int dry_run; | |
30 | extern int am_server; | |
31 | extern int relative_paths; | |
32 | extern int preserve_hard_links; | |
33 | extern int cvs_exclude; | |
34 | extern int io_error; | |
35 | extern char *tmpdir; | |
375a4556 | 36 | extern char *compare_dest; |
53dd3135 DD |
37 | extern int make_backups; |
38 | extern char *backup_suffix; | |
2f03f956 | 39 | |
2f03f956 AT |
40 | static struct delete_list { |
41 | dev_t dev; | |
42 | INO_T inode; | |
43 | } *delete_list; | |
44 | static int dlist_len, dlist_alloc_len; | |
45 | ||
2f03f956 AT |
46 | /* yuck! This function wouldn't have been necessary if I had the sorting |
47 | algorithm right. Unfortunately fixing the sorting algorithm would introduce | |
48 | a backward incompatibility as file list indexes are sent over the link. | |
49 | */ | |
50 | static int delete_already_done(struct file_list *flist,int j) | |
51 | { | |
52 | int i; | |
53 | STRUCT_STAT st; | |
54 | ||
55 | if (link_stat(f_name(flist->files[j]), &st)) return 1; | |
56 | ||
57 | for (i=0;i<dlist_len;i++) { | |
58 | if (st.st_ino == delete_list[i].inode && | |
59 | st.st_dev == delete_list[i].dev) | |
60 | return 1; | |
61 | } | |
62 | ||
63 | return 0; | |
64 | } | |
65 | ||
66 | static void add_delete_entry(struct file_struct *file) | |
67 | { | |
68 | if (dlist_len == dlist_alloc_len) { | |
69 | dlist_alloc_len += 1024; | |
70 | delete_list = (struct delete_list *)Realloc(delete_list, sizeof(delete_list[0])*dlist_alloc_len); | |
71 | if (!delete_list) out_of_memory("add_delete_entry"); | |
72 | } | |
73 | ||
74 | delete_list[dlist_len].dev = file->dev; | |
75 | delete_list[dlist_len].inode = file->inode; | |
76 | dlist_len++; | |
77 | ||
78 | if (verbose > 3) | |
79 | rprintf(FINFO,"added %s to delete list\n", f_name(file)); | |
80 | } | |
81 | ||
82 | static void delete_one(struct file_struct *f) | |
83 | { | |
84 | if (!S_ISDIR(f->mode)) { | |
c7c11a0d | 85 | if (robust_unlink(f_name(f)) != 0) { |
4e40377a | 86 | rprintf(FERROR,"delete_one: unlink %s: %s\n",f_name(f),strerror(errno)); |
2f03f956 AT |
87 | } else if (verbose) { |
88 | rprintf(FINFO,"deleting %s\n",f_name(f)); | |
89 | } | |
90 | } else { | |
91 | if (do_rmdir(f_name(f)) != 0) { | |
92 | if (errno != ENOTEMPTY && errno != EEXIST) | |
4e40377a MP |
93 | rprintf(FERROR,"delete_one: rmdir %s: %s\n", |
94 | f_name(f), strerror(errno)); | |
2f03f956 AT |
95 | } else if (verbose) { |
96 | rprintf(FINFO,"deleting directory %s\n",f_name(f)); | |
97 | } | |
98 | } | |
99 | } | |
100 | ||
101 | ||
102 | ||
103 | ||
104 | /* this deletes any files on the receiving side that are not present | |
105 | on the sending side. For version 1.6.4 I have changed the behaviour | |
106 | to match more closely what most people seem to expect of this option */ | |
6957ae33 | 107 | void delete_files(struct file_list *flist) |
2f03f956 AT |
108 | { |
109 | struct file_list *local_file_list; | |
110 | int i, j; | |
111 | char *name; | |
cda2ae84 | 112 | extern int module_id; |
ef55c686 | 113 | extern int ignore_errors; |
0b73ca12 AT |
114 | extern int max_delete; |
115 | static int deletion_count; | |
2f03f956 AT |
116 | |
117 | if (cvs_exclude) | |
118 | add_cvs_excludes(); | |
119 | ||
ef55c686 | 120 | if (io_error && !(lp_ignore_errors(module_id) || ignore_errors)) { |
2f03f956 AT |
121 | rprintf(FINFO,"IO error encountered - skipping file deletion\n"); |
122 | return; | |
123 | } | |
124 | ||
125 | for (j=0;j<flist->count;j++) { | |
126 | if (!S_ISDIR(flist->files[j]->mode) || | |
127 | !(flist->files[j]->flags & FLAG_DELETE)) continue; | |
128 | ||
129 | if (remote_version < 19 && | |
130 | delete_already_done(flist, j)) continue; | |
131 | ||
132 | name = strdup(f_name(flist->files[j])); | |
133 | ||
134 | if (!(local_file_list = send_file_list(-1,1,&name))) { | |
135 | free(name); | |
136 | continue; | |
137 | } | |
138 | ||
139 | if (verbose > 1) | |
140 | rprintf(FINFO,"deleting in %s\n", name); | |
141 | ||
142 | for (i=local_file_list->count-1;i>=0;i--) { | |
0b73ca12 | 143 | if (max_delete && deletion_count > max_delete) break; |
2f03f956 AT |
144 | if (!local_file_list->files[i]->basename) continue; |
145 | if (remote_version < 19 && | |
146 | S_ISDIR(local_file_list->files[i]->mode)) | |
147 | add_delete_entry(local_file_list->files[i]); | |
148 | if (-1 == flist_find(flist,local_file_list->files[i])) { | |
53dd3135 DD |
149 | char *f = f_name(local_file_list->files[i]); |
150 | int k = strlen(f) - strlen(backup_suffix); | |
66203a98 | 151 | /* Hi Andrew, do we really need to play with backup_suffix here? */ |
53dd3135 DD |
152 | if (make_backups && ((k <= 0) || |
153 | (strcmp(f+k,backup_suffix) != 0))) { | |
154 | (void) make_backup(f); | |
155 | } else { | |
0b73ca12 | 156 | deletion_count++; |
53dd3135 DD |
157 | delete_one(local_file_list->files[i]); |
158 | } | |
159 | } | |
2f03f956 AT |
160 | } |
161 | flist_free(local_file_list); | |
162 | free(name); | |
163 | } | |
164 | } | |
165 | ||
166 | ||
167 | static int get_tmpname(char *fnametmp, char *fname) | |
168 | { | |
169 | char *f; | |
170 | ||
171 | /* open tmp file */ | |
172 | if (tmpdir) { | |
173 | f = strrchr(fname,'/'); | |
174 | if (f == NULL) | |
175 | f = fname; | |
176 | else | |
177 | f++; | |
178 | if (strlen(tmpdir)+strlen(f)+10 > MAXPATHLEN) { | |
179 | rprintf(FERROR,"filename too long\n"); | |
180 | return 0; | |
181 | } | |
8950ac03 | 182 | snprintf(fnametmp,MAXPATHLEN, "%s/.%s.XXXXXX",tmpdir,f); |
2f03f956 AT |
183 | return 1; |
184 | } | |
185 | ||
186 | f = strrchr(fname,'/'); | |
187 | ||
188 | if (strlen(fname)+9 > MAXPATHLEN) { | |
189 | rprintf(FERROR,"filename too long\n"); | |
190 | return 0; | |
191 | } | |
192 | ||
193 | if (f) { | |
194 | *f = 0; | |
8950ac03 | 195 | snprintf(fnametmp,MAXPATHLEN,"%s/.%s.XXXXXX", |
2f03f956 AT |
196 | fname,f+1); |
197 | *f = '/'; | |
198 | } else { | |
8950ac03 | 199 | snprintf(fnametmp,MAXPATHLEN,".%s.XXXXXX",fname); |
2f03f956 AT |
200 | } |
201 | ||
202 | return 1; | |
203 | } | |
204 | ||
205 | ||
206 | static int receive_data(int f_in,struct map_struct *buf,int fd,char *fname, | |
207 | OFF_T total_size) | |
208 | { | |
209 | int i,n,remainder,len,count; | |
210 | OFF_T offset = 0; | |
211 | OFF_T offset2; | |
212 | char *data; | |
213 | static char file_sum1[MD4_SUM_LENGTH]; | |
214 | static char file_sum2[MD4_SUM_LENGTH]; | |
215 | char *map=NULL; | |
216 | ||
217 | count = read_int(f_in); | |
218 | n = read_int(f_in); | |
219 | remainder = read_int(f_in); | |
220 | ||
221 | sum_init(); | |
222 | ||
223 | for (i=recv_token(f_in,&data); i != 0; i=recv_token(f_in,&data)) { | |
224 | ||
225 | show_progress(offset, total_size); | |
226 | ||
227 | if (i > 0) { | |
228 | extern int cleanup_got_literal; | |
229 | ||
230 | if (verbose > 3) { | |
5f808dfb AT |
231 | rprintf(FINFO,"data recv %d at %.0f\n", |
232 | i,(double)offset); | |
2f03f956 AT |
233 | } |
234 | ||
235 | stats.literal_data += i; | |
236 | cleanup_got_literal = 1; | |
237 | ||
238 | sum_update(data,i); | |
239 | ||
240 | if (fd != -1 && write_file(fd,data,i) != i) { | |
241 | rprintf(FERROR,"write failed on %s : %s\n",fname,strerror(errno)); | |
65417579 | 242 | exit_cleanup(RERR_FILEIO); |
2f03f956 AT |
243 | } |
244 | offset += i; | |
245 | continue; | |
246 | } | |
247 | ||
248 | i = -(i+1); | |
5f808dfb | 249 | offset2 = i*(OFF_T)n; |
2f03f956 AT |
250 | len = n; |
251 | if (i == count-1 && remainder != 0) | |
252 | len = remainder; | |
253 | ||
254 | stats.matched_data += len; | |
255 | ||
256 | if (verbose > 3) | |
5f808dfb AT |
257 | rprintf(FINFO,"chunk[%d] of size %d at %.0f offset=%.0f\n", |
258 | i,len,(double)offset2,(double)offset); | |
2f03f956 | 259 | |
c55f7021 AT |
260 | if (buf) { |
261 | map = map_ptr(buf,offset2,len); | |
2f03f956 | 262 | |
c55f7021 AT |
263 | see_token(map, len); |
264 | sum_update(map,len); | |
265 | } | |
2f03f956 AT |
266 | |
267 | if (fd != -1 && write_file(fd,map,len) != len) { | |
268 | rprintf(FERROR,"write failed on %s : %s\n", | |
269 | fname,strerror(errno)); | |
65417579 | 270 | exit_cleanup(RERR_FILEIO); |
2f03f956 AT |
271 | } |
272 | offset += len; | |
273 | } | |
274 | ||
166aa723 | 275 | end_progress(total_size); |
2f03f956 AT |
276 | |
277 | if (fd != -1 && offset > 0 && sparse_end(fd) != 0) { | |
278 | rprintf(FERROR,"write failed on %s : %s\n", | |
279 | fname,strerror(errno)); | |
65417579 | 280 | exit_cleanup(RERR_FILEIO); |
2f03f956 AT |
281 | } |
282 | ||
283 | sum_end(file_sum1); | |
284 | ||
285 | if (remote_version >= 14) { | |
286 | read_buf(f_in,file_sum2,MD4_SUM_LENGTH); | |
287 | if (verbose > 2) { | |
288 | rprintf(FINFO,"got file_sum\n"); | |
289 | } | |
290 | if (fd != -1 && | |
291 | memcmp(file_sum1,file_sum2,MD4_SUM_LENGTH) != 0) { | |
292 | return 0; | |
293 | } | |
294 | } | |
295 | return 1; | |
296 | } | |
297 | ||
298 | ||
66203a98 AT |
299 | /* main routine for receiver process. Receiver process runs on the |
300 | same host as the generator process. */ | |
2f03f956 AT |
301 | |
302 | int recv_files(int f_in,struct file_list *flist,char *local_name,int f_gen) | |
303 | { | |
304 | int fd1,fd2; | |
305 | STRUCT_STAT st; | |
306 | char *fname; | |
f62c17e3 | 307 | char template[MAXPATHLEN]; |
2f03f956 | 308 | char fnametmp[MAXPATHLEN]; |
375a4556 DD |
309 | char *fnamecmp; |
310 | char fnamecmpbuf[MAXPATHLEN]; | |
2f03f956 AT |
311 | struct map_struct *buf; |
312 | int i; | |
313 | struct file_struct *file; | |
314 | int phase=0; | |
315 | int recv_ok; | |
1b7c47cb | 316 | extern struct stats stats; |
4df9f368 | 317 | extern int preserve_perms; |
57df171b | 318 | extern int delete_after; |
1b7c47cb | 319 | struct stats initial_stats; |
11a5a3c7 | 320 | |
2f03f956 AT |
321 | if (verbose > 2) { |
322 | rprintf(FINFO,"recv_files(%d) starting\n",flist->count); | |
323 | } | |
324 | ||
2f03f956 AT |
325 | while (1) { |
326 | cleanup_disable(); | |
327 | ||
328 | i = read_int(f_in); | |
329 | if (i == -1) { | |
330 | if (phase==0 && remote_version >= 13) { | |
331 | phase++; | |
332 | csum_length = SUM_LENGTH; | |
333 | if (verbose > 2) | |
334 | rprintf(FINFO,"recv_files phase=%d\n",phase); | |
335 | write_int(f_gen,-1); | |
336 | continue; | |
337 | } | |
338 | break; | |
339 | } | |
340 | ||
341 | if (i < 0 || i >= flist->count) { | |
342 | rprintf(FERROR,"Invalid file index %d in recv_files (count=%d)\n", | |
343 | i, flist->count); | |
65417579 | 344 | exit_cleanup(RERR_PROTOCOL); |
2f03f956 AT |
345 | } |
346 | ||
347 | file = flist->files[i]; | |
348 | fname = f_name(file); | |
349 | ||
350 | stats.num_transferred_files++; | |
351 | stats.total_transferred_size += file->length; | |
352 | ||
353 | if (local_name) | |
354 | fname = local_name; | |
355 | ||
356 | if (dry_run) { | |
11a5a3c7 AT |
357 | if (!am_server) { |
358 | log_transfer(file, fname); | |
359 | } | |
2f03f956 AT |
360 | continue; |
361 | } | |
362 | ||
1b7c47cb AT |
363 | initial_stats = stats; |
364 | ||
2f03f956 AT |
365 | if (verbose > 2) |
366 | rprintf(FINFO,"recv_files(%s)\n",fname); | |
367 | ||
375a4556 DD |
368 | fnamecmp = fname; |
369 | ||
2f03f956 | 370 | /* open the file */ |
8c9fd200 | 371 | fd1 = do_open(fnamecmp, O_RDONLY, 0); |
375a4556 DD |
372 | |
373 | if ((fd1 == -1) && (compare_dest != NULL)) { | |
374 | /* try the file at compare_dest instead */ | |
8950ac03 | 375 | snprintf(fnamecmpbuf,MAXPATHLEN,"%s/%s", |
375a4556 DD |
376 | compare_dest,fname); |
377 | fnamecmp = fnamecmpbuf; | |
8c9fd200 | 378 | fd1 = do_open(fnamecmp, O_RDONLY, 0); |
375a4556 | 379 | } |
2f03f956 AT |
380 | |
381 | if (fd1 != -1 && do_fstat(fd1,&st) != 0) { | |
375a4556 | 382 | rprintf(FERROR,"fstat %s : %s\n",fnamecmp,strerror(errno)); |
2f03f956 AT |
383 | receive_data(f_in,NULL,-1,NULL,file->length); |
384 | close(fd1); | |
385 | continue; | |
386 | } | |
387 | ||
388 | if (fd1 != -1 && !S_ISREG(st.st_mode)) { | |
375a4556 | 389 | rprintf(FERROR,"%s : not a regular file (recv_files)\n",fnamecmp); |
2f03f956 AT |
390 | receive_data(f_in,NULL,-1,NULL,file->length); |
391 | close(fd1); | |
392 | continue; | |
393 | } | |
394 | ||
4df9f368 AT |
395 | if (fd1 != -1 && !preserve_perms) { |
396 | /* if the file exists already and we aren't perserving | |
397 | presmissions then act as though the remote end sent | |
398 | us the file permissions we already have */ | |
399 | file->mode = st.st_mode; | |
400 | } | |
401 | ||
2f03f956 AT |
402 | if (fd1 != -1 && st.st_size > 0) { |
403 | buf = map_file(fd1,st.st_size); | |
404 | if (verbose > 2) | |
5f808dfb | 405 | rprintf(FINFO,"recv mapped %s of size %.0f\n",fnamecmp,(double)st.st_size); |
2f03f956 AT |
406 | } else { |
407 | buf = NULL; | |
408 | } | |
409 | ||
410 | if (!get_tmpname(fnametmp,fname)) { | |
411 | if (buf) unmap_file(buf); | |
412 | if (fd1 != -1) close(fd1); | |
413 | continue; | |
414 | } | |
415 | ||
f62c17e3 | 416 | strlcpy(template, fnametmp, sizeof(template)); |
2f03f956 AT |
417 | |
418 | /* we initially set the perms without the | |
419 | setuid/setgid bits to ensure that there is no race | |
420 | condition. They are then correctly updated after | |
421 | the lchown. Thanks to snabb@epipe.fi for pointing | |
972a3619 DD |
422 | this out. We also set it initially without group |
423 | access because of a similar race condition. */ | |
f62c17e3 AT |
424 | fd2 = do_mkstemp(fnametmp, file->mode & INITACCESSPERMS); |
425 | if (fd2 == -1) { | |
426 | rprintf(FERROR,"mkstemp %s failed\n",fnametmp); | |
427 | receive_data(f_in,buf,-1,NULL,file->length); | |
428 | if (buf) unmap_file(buf); | |
429 | continue; | |
430 | } | |
2f03f956 | 431 | |
752eaba4 DD |
432 | /* in most cases parent directories will already exist |
433 | because their information should have been previously | |
434 | transferred, but that may not be the case with -R */ | |
435 | if (fd2 == -1 && relative_paths && errno == ENOENT && | |
2f03f956 | 436 | create_directory_path(fnametmp) == 0) { |
f62c17e3 AT |
437 | strlcpy(fnametmp, template, sizeof(fnametmp)); |
438 | fd2 = do_mkstemp(fnametmp, file->mode & INITACCESSPERMS); | |
2f03f956 AT |
439 | } |
440 | if (fd2 == -1) { | |
fd0abefa | 441 | rprintf(FERROR,"cannot create %s : %s\n",fnametmp,strerror(errno)); |
2f03f956 AT |
442 | receive_data(f_in,buf,-1,NULL,file->length); |
443 | if (buf) unmap_file(buf); | |
444 | if (fd1 != -1) close(fd1); | |
445 | continue; | |
446 | } | |
447 | ||
c6b81a98 | 448 | cleanup_set(fnametmp, fname, file, buf, fd1, fd2); |
2f03f956 | 449 | |
11a5a3c7 AT |
450 | if (!am_server) { |
451 | log_transfer(file, fname); | |
452 | } | |
453 | ||
2f03f956 AT |
454 | /* recv file data */ |
455 | recv_ok = receive_data(f_in,buf,fd2,fname,file->length); | |
1b7c47cb AT |
456 | |
457 | log_recv(file, &initial_stats); | |
2f03f956 AT |
458 | |
459 | if (buf) unmap_file(buf); | |
460 | if (fd1 != -1) { | |
461 | close(fd1); | |
462 | } | |
463 | close(fd2); | |
464 | ||
465 | if (verbose > 2) | |
466 | rprintf(FINFO,"renaming %s to %s\n",fnametmp,fname); | |
467 | ||
468 | finish_transfer(fname, fnametmp, file); | |
c6b81a98 | 469 | |
2f03f956 | 470 | cleanup_disable(); |
554e0a8d | 471 | |
2f03f956 AT |
472 | if (!recv_ok) { |
473 | if (csum_length == SUM_LENGTH) { | |
474 | rprintf(FERROR,"ERROR: file corruption in %s. File changed during transfer?\n", | |
475 | fname); | |
476 | } else { | |
477 | if (verbose > 1) | |
478 | rprintf(FINFO,"redoing %s(%d)\n",fname,i); | |
479 | write_int(f_gen,i); | |
480 | } | |
481 | } | |
482 | } | |
483 | ||
57df171b AT |
484 | if (delete_after) { |
485 | if (recurse && delete_mode && !local_name && flist->count>0) { | |
486 | delete_files(flist); | |
487 | } | |
488 | } | |
489 | ||
2f03f956 AT |
490 | if (preserve_hard_links) |
491 | do_hard_links(flist); | |
492 | ||
493 | /* now we need to fix any directory permissions that were | |
494 | modified during the transfer */ | |
495 | for (i = 0; i < flist->count; i++) { | |
496 | file = flist->files[i]; | |
497 | if (!file->basename || !S_ISDIR(file->mode)) continue; | |
e78733d9 | 498 | recv_generator(local_name?local_name:f_name(file),flist,i,-1); |
2f03f956 AT |
499 | } |
500 | ||
501 | if (verbose > 2) | |
502 | rprintf(FINFO,"recv_files finished\n"); | |
503 | ||
504 | return 0; | |
505 | } | |
506 |