| 1 | /* -*- c-file-style: "linux" -*- |
| 2 | |
| 3 | Copyright (C) 1996-2000 by Andrew Tridgell |
| 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 protocol_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; |
| 36 | extern char *compare_dest; |
| 37 | extern int make_backups; |
| 38 | extern int do_progress; |
| 39 | extern char *backup_dir; |
| 40 | extern char *backup_suffix; |
| 41 | extern int backup_suffix_len; |
| 42 | extern int cleanup_got_literal; |
| 43 | |
| 44 | static struct delete_list { |
| 45 | DEV64_T dev; |
| 46 | INO64_T inode; |
| 47 | } *delete_list; |
| 48 | static int dlist_len, dlist_alloc_len; |
| 49 | |
| 50 | /* yuck! This function wouldn't have been necessary if I had the sorting |
| 51 | * algorithm right. Unfortunately fixing the sorting algorithm would introduce |
| 52 | * a backward incompatibility as file list indexes are sent over the link. |
| 53 | */ |
| 54 | static int delete_already_done(struct file_list *flist,int j) |
| 55 | { |
| 56 | int i; |
| 57 | STRUCT_STAT st; |
| 58 | |
| 59 | if (link_stat(f_name(flist->files[j]), &st)) return 1; |
| 60 | |
| 61 | for (i = 0; i < dlist_len; i++) { |
| 62 | if (st.st_ino == delete_list[i].inode && |
| 63 | (DEV64_T)st.st_dev == delete_list[i].dev) |
| 64 | return 1; |
| 65 | } |
| 66 | |
| 67 | return 0; |
| 68 | } |
| 69 | |
| 70 | static void add_delete_entry(struct file_struct *file) |
| 71 | { |
| 72 | if (dlist_len == dlist_alloc_len) { |
| 73 | dlist_alloc_len += 1024; |
| 74 | delete_list = realloc_array(delete_list, struct delete_list, |
| 75 | dlist_alloc_len); |
| 76 | if (!delete_list) out_of_memory("add_delete_entry"); |
| 77 | } |
| 78 | |
| 79 | delete_list[dlist_len].dev = file->dev; |
| 80 | delete_list[dlist_len].inode = file->inode; |
| 81 | dlist_len++; |
| 82 | |
| 83 | if (verbose > 3) |
| 84 | rprintf(FINFO,"added %s to delete list\n", f_name(file)); |
| 85 | } |
| 86 | |
| 87 | static void delete_one(char *fn, int is_dir) |
| 88 | { |
| 89 | if (!is_dir) { |
| 90 | if (robust_unlink(fn) != 0) { |
| 91 | rprintf(FERROR, "delete_one: unlink %s failed: %s\n", |
| 92 | full_fname(fn), strerror(errno)); |
| 93 | } else if (verbose) { |
| 94 | rprintf(FINFO, "deleting %s\n", fn); |
| 95 | } |
| 96 | } else { |
| 97 | if (do_rmdir(fn) != 0) { |
| 98 | if (errno != ENOTEMPTY && errno != EEXIST) { |
| 99 | rprintf(FERROR, "delete_one: rmdir %s failed: %s\n", |
| 100 | full_fname(fn), strerror(errno)); |
| 101 | } |
| 102 | } else if (verbose) { |
| 103 | rprintf(FINFO, "deleting directory %s\n", fn); |
| 104 | } |
| 105 | } |
| 106 | } |
| 107 | |
| 108 | |
| 109 | static int is_backup_file(char *fn) |
| 110 | { |
| 111 | int k = strlen(fn) - backup_suffix_len; |
| 112 | return k > 0 && strcmp(fn+k, backup_suffix) == 0; |
| 113 | } |
| 114 | |
| 115 | |
| 116 | /* this deletes any files on the receiving side that are not present |
| 117 | * on the sending side. For version 1.6.4 I have changed the behaviour |
| 118 | * to match more closely what most people seem to expect of this option */ |
| 119 | void delete_files(struct file_list *flist) |
| 120 | { |
| 121 | struct file_list *local_file_list; |
| 122 | int i, j; |
| 123 | char *name, fbuf[MAXPATHLEN]; |
| 124 | extern int module_id; |
| 125 | extern int ignore_errors; |
| 126 | extern int max_delete; |
| 127 | static int deletion_count; |
| 128 | |
| 129 | if (cvs_exclude) |
| 130 | add_cvs_excludes(); |
| 131 | |
| 132 | if (io_error && !(lp_ignore_errors(module_id) || ignore_errors)) { |
| 133 | rprintf(FINFO,"IO error encountered - skipping file deletion\n"); |
| 134 | return; |
| 135 | } |
| 136 | |
| 137 | for (j = 0;j < flist->count; j++) { |
| 138 | if (!S_ISDIR(flist->files[j]->mode) || |
| 139 | !(flist->files[j]->flags & FLAG_DELETE)) continue; |
| 140 | |
| 141 | if (protocol_version < 19 && |
| 142 | delete_already_done(flist, j)) continue; |
| 143 | |
| 144 | name = f_name_to(flist->files[j], fbuf, sizeof fbuf); |
| 145 | |
| 146 | if (!(local_file_list = send_file_list(-1,1,&name))) |
| 147 | continue; |
| 148 | |
| 149 | if (verbose > 1) |
| 150 | rprintf(FINFO,"deleting in %s\n", name); |
| 151 | |
| 152 | for (i = local_file_list->count-1; i >= 0; i--) { |
| 153 | if (max_delete && deletion_count > max_delete) break; |
| 154 | if (!local_file_list->files[i]->basename) continue; |
| 155 | if (protocol_version < 19 && |
| 156 | S_ISDIR(local_file_list->files[i]->mode)) |
| 157 | add_delete_entry(local_file_list->files[i]); |
| 158 | if (-1 == flist_find(flist,local_file_list->files[i])) { |
| 159 | char *f = f_name(local_file_list->files[i]); |
| 160 | if (make_backups && (backup_dir || !is_backup_file(f))) { |
| 161 | (void) make_backup(f); |
| 162 | if (verbose) |
| 163 | rprintf(FINFO, "deleting %s\n", f); |
| 164 | } else { |
| 165 | int mode = local_file_list->files[i]->mode; |
| 166 | delete_one(f, S_ISDIR(mode) != 0); |
| 167 | } |
| 168 | deletion_count++; |
| 169 | } |
| 170 | } |
| 171 | flist_free(local_file_list); |
| 172 | } |
| 173 | } |
| 174 | |
| 175 | |
| 176 | /* |
| 177 | * get_tmpname() - create a tmp filename for a given filename |
| 178 | * |
| 179 | * If a tmpdir is defined, use that as the directory to |
| 180 | * put it in. Otherwise, the tmp filename is in the same |
| 181 | * directory as the given name. Note that there may be no |
| 182 | * directory at all in the given name! |
| 183 | * |
| 184 | * The tmp filename is basically the given filename with a |
| 185 | * dot prepended, and .XXXXXX appended (for mkstemp() to |
| 186 | * put its unique gunk in). Take care to not exceed |
| 187 | * either the MAXPATHLEN or NAME_MAX, esp. the last, as |
| 188 | * the basename basically becomes 8 chars longer. In that |
| 189 | * case, the original name is shortened sufficiently to |
| 190 | * make it all fit. |
| 191 | * |
| 192 | * Of course, there's no real reason for the tmp name to |
| 193 | * look like the original, except to satisfy us humans. |
| 194 | * As long as it's unique, rsync will work. |
| 195 | */ |
| 196 | |
| 197 | static int get_tmpname(char *fnametmp, char *fname) |
| 198 | { |
| 199 | char *f; |
| 200 | int length = 0; |
| 201 | int maxname; |
| 202 | |
| 203 | if (tmpdir) { |
| 204 | strlcpy(fnametmp, tmpdir, MAXPATHLEN - 2); |
| 205 | length = strlen(fnametmp); |
| 206 | fnametmp[length++] = '/'; |
| 207 | fnametmp[length] = '\0'; /* always NULL terminated */ |
| 208 | } |
| 209 | |
| 210 | if ((f = strrchr(fname, '/')) != NULL) { |
| 211 | ++f; |
| 212 | if (!tmpdir) { |
| 213 | length = f - fname; |
| 214 | /* copy up to and including the slash */ |
| 215 | strlcpy(fnametmp, fname, length + 1); |
| 216 | } |
| 217 | } else |
| 218 | f = fname; |
| 219 | fnametmp[length++] = '.'; |
| 220 | fnametmp[length] = '\0'; /* always NULL terminated */ |
| 221 | |
| 222 | maxname = MIN(MAXPATHLEN - 7 - length, NAME_MAX - 8); |
| 223 | |
| 224 | if (maxname < 1) { |
| 225 | rprintf(FERROR, "temporary filename too long: %s\n", fname); |
| 226 | fnametmp[0] = '\0'; |
| 227 | return 0; |
| 228 | } |
| 229 | |
| 230 | strlcpy(fnametmp + length, f, maxname); |
| 231 | strcat(fnametmp + length, ".XXXXXX"); |
| 232 | |
| 233 | return 1; |
| 234 | } |
| 235 | |
| 236 | |
| 237 | static int receive_data(int f_in,struct map_struct *mapbuf,int fd,char *fname, |
| 238 | OFF_T total_size) |
| 239 | { |
| 240 | int i; |
| 241 | struct sum_struct sum; |
| 242 | unsigned int len; |
| 243 | OFF_T offset = 0; |
| 244 | OFF_T offset2; |
| 245 | char *data; |
| 246 | static char file_sum1[MD4_SUM_LENGTH]; |
| 247 | static char file_sum2[MD4_SUM_LENGTH]; |
| 248 | char *map=NULL; |
| 249 | |
| 250 | read_sum_head(f_in, &sum); |
| 251 | |
| 252 | sum_init(); |
| 253 | |
| 254 | for (i=recv_token(f_in,&data); i != 0; i=recv_token(f_in,&data)) { |
| 255 | if (do_progress) |
| 256 | show_progress(offset, total_size); |
| 257 | |
| 258 | if (i > 0) { |
| 259 | if (verbose > 3) { |
| 260 | rprintf(FINFO,"data recv %d at %.0f\n", |
| 261 | i,(double)offset); |
| 262 | } |
| 263 | |
| 264 | stats.literal_data += i; |
| 265 | cleanup_got_literal = 1; |
| 266 | |
| 267 | sum_update(data,i); |
| 268 | |
| 269 | if (fd != -1 && write_file(fd,data,i) != i) { |
| 270 | rprintf(FERROR, "write failed on %s: %s\n", |
| 271 | full_fname(fname), strerror(errno)); |
| 272 | exit_cleanup(RERR_FILEIO); |
| 273 | } |
| 274 | offset += i; |
| 275 | continue; |
| 276 | } |
| 277 | |
| 278 | i = -(i+1); |
| 279 | offset2 = i*(OFF_T)sum.blength; |
| 280 | len = sum.blength; |
| 281 | if (i == (int) sum.count-1 && sum.remainder != 0) |
| 282 | len = sum.remainder; |
| 283 | |
| 284 | stats.matched_data += len; |
| 285 | |
| 286 | if (verbose > 3) |
| 287 | rprintf(FINFO,"chunk[%d] of size %d at %.0f offset=%.0f\n", |
| 288 | i,len,(double)offset2,(double)offset); |
| 289 | |
| 290 | if (mapbuf) { |
| 291 | map = map_ptr(mapbuf,offset2,len); |
| 292 | |
| 293 | see_token(map, len); |
| 294 | sum_update(map,len); |
| 295 | } |
| 296 | |
| 297 | if (fd != -1 && write_file(fd,map,len) != (int) len) { |
| 298 | rprintf(FERROR, "write failed on %s: %s\n", |
| 299 | full_fname(fname), strerror(errno)); |
| 300 | exit_cleanup(RERR_FILEIO); |
| 301 | } |
| 302 | offset += len; |
| 303 | } |
| 304 | |
| 305 | flush_write_file(fd); |
| 306 | |
| 307 | if (do_progress) |
| 308 | end_progress(total_size); |
| 309 | |
| 310 | if (fd != -1 && offset > 0 && sparse_end(fd) != 0) { |
| 311 | rprintf(FERROR, "write failed on %s: %s\n", |
| 312 | full_fname(fname), strerror(errno)); |
| 313 | exit_cleanup(RERR_FILEIO); |
| 314 | } |
| 315 | |
| 316 | sum_end(file_sum1); |
| 317 | |
| 318 | read_buf(f_in,file_sum2,MD4_SUM_LENGTH); |
| 319 | if (verbose > 2) { |
| 320 | rprintf(FINFO,"got file_sum\n"); |
| 321 | } |
| 322 | if (fd != -1 && memcmp(file_sum1,file_sum2,MD4_SUM_LENGTH) != 0) { |
| 323 | return 0; |
| 324 | } |
| 325 | return 1; |
| 326 | } |
| 327 | |
| 328 | |
| 329 | /** |
| 330 | * main routine for receiver process. |
| 331 | * |
| 332 | * Receiver process runs on the same host as the generator process. */ |
| 333 | int recv_files(int f_in,struct file_list *flist,char *local_name,int f_gen) |
| 334 | { |
| 335 | int fd1,fd2; |
| 336 | STRUCT_STAT st; |
| 337 | char *fname, fbuf[MAXPATHLEN]; |
| 338 | char template[MAXPATHLEN]; |
| 339 | char fnametmp[MAXPATHLEN]; |
| 340 | char *fnamecmp; |
| 341 | char fnamecmpbuf[MAXPATHLEN]; |
| 342 | struct map_struct *mapbuf; |
| 343 | int i; |
| 344 | struct file_struct *file; |
| 345 | int phase=0; |
| 346 | int recv_ok; |
| 347 | extern struct stats stats; |
| 348 | extern int preserve_perms; |
| 349 | extern int delete_after; |
| 350 | extern int orig_umask; |
| 351 | struct stats initial_stats; |
| 352 | |
| 353 | if (verbose > 2) { |
| 354 | rprintf(FINFO,"recv_files(%d) starting\n",flist->count); |
| 355 | } |
| 356 | |
| 357 | while (1) { |
| 358 | cleanup_disable(); |
| 359 | |
| 360 | i = read_int(f_in); |
| 361 | if (i == -1) { |
| 362 | if (phase==0) { |
| 363 | phase++; |
| 364 | csum_length = SUM_LENGTH; |
| 365 | if (verbose > 2) |
| 366 | rprintf(FINFO,"recv_files phase=%d\n",phase); |
| 367 | write_int(f_gen,-1); |
| 368 | continue; |
| 369 | } |
| 370 | break; |
| 371 | } |
| 372 | |
| 373 | if (i < 0 || i >= flist->count) { |
| 374 | rprintf(FERROR,"Invalid file index %d in recv_files (count=%d)\n", |
| 375 | i, flist->count); |
| 376 | exit_cleanup(RERR_PROTOCOL); |
| 377 | } |
| 378 | |
| 379 | file = flist->files[i]; |
| 380 | |
| 381 | stats.num_transferred_files++; |
| 382 | stats.total_transferred_size += file->length; |
| 383 | cleanup_got_literal = 0; |
| 384 | |
| 385 | if (local_name) |
| 386 | fname = local_name; |
| 387 | else |
| 388 | fname = f_name_to(file, fbuf, sizeof fbuf); |
| 389 | |
| 390 | if (dry_run) { |
| 391 | if (!am_server && verbose) { /* log transfer */ |
| 392 | rprintf(FINFO, "%s\n", fname); |
| 393 | } |
| 394 | continue; |
| 395 | } |
| 396 | |
| 397 | initial_stats = stats; |
| 398 | |
| 399 | if (verbose > 2) |
| 400 | rprintf(FINFO,"recv_files(%s)\n",fname); |
| 401 | |
| 402 | fnamecmp = fname; |
| 403 | |
| 404 | /* open the file */ |
| 405 | fd1 = do_open(fnamecmp, O_RDONLY, 0); |
| 406 | |
| 407 | if ((fd1 == -1) && (compare_dest != NULL)) { |
| 408 | /* try the file at compare_dest instead */ |
| 409 | snprintf(fnamecmpbuf,MAXPATHLEN,"%s/%s", |
| 410 | compare_dest,fname); |
| 411 | fnamecmp = fnamecmpbuf; |
| 412 | fd1 = do_open(fnamecmp, O_RDONLY, 0); |
| 413 | } |
| 414 | |
| 415 | if (fd1 != -1 && do_fstat(fd1,&st) != 0) { |
| 416 | rprintf(FERROR, "fstat %s failed: %s\n", |
| 417 | full_fname(fnamecmp), strerror(errno)); |
| 418 | receive_data(f_in,NULL,-1,NULL,file->length); |
| 419 | close(fd1); |
| 420 | continue; |
| 421 | } |
| 422 | |
| 423 | if (fd1 != -1 && S_ISDIR(st.st_mode) && fnamecmp == fname) { |
| 424 | /* this special handling for directories |
| 425 | * wouldn't be necessary if robust_rename() |
| 426 | * and the underlying robust_unlink could cope |
| 427 | * with directories |
| 428 | */ |
| 429 | rprintf(FERROR,"recv_files: %s is a directory\n", |
| 430 | full_fname(fnamecmp)); |
| 431 | receive_data(f_in, NULL, -1, NULL, file->length); |
| 432 | close(fd1); |
| 433 | continue; |
| 434 | } |
| 435 | |
| 436 | if (fd1 != -1 && !S_ISREG(st.st_mode)) { |
| 437 | close(fd1); |
| 438 | fd1 = -1; |
| 439 | mapbuf = NULL; |
| 440 | } |
| 441 | |
| 442 | if (fd1 != -1 && !preserve_perms) { |
| 443 | /* if the file exists already and we aren't preserving |
| 444 | * permissions then act as though the remote end sent |
| 445 | * us the file permissions we already have */ |
| 446 | file->mode = st.st_mode; |
| 447 | } |
| 448 | |
| 449 | if (fd1 != -1 && st.st_size > 0) { |
| 450 | mapbuf = map_file(fd1,st.st_size); |
| 451 | if (verbose > 2) |
| 452 | rprintf(FINFO,"recv mapped %s of size %.0f\n",fnamecmp,(double)st.st_size); |
| 453 | } else |
| 454 | mapbuf = NULL; |
| 455 | |
| 456 | if (!get_tmpname(fnametmp,fname)) { |
| 457 | if (mapbuf) unmap_file(mapbuf); |
| 458 | if (fd1 != -1) close(fd1); |
| 459 | continue; |
| 460 | } |
| 461 | |
| 462 | strlcpy(template, fnametmp, sizeof(template)); |
| 463 | |
| 464 | /* we initially set the perms without the |
| 465 | * setuid/setgid bits to ensure that there is no race |
| 466 | * condition. They are then correctly updated after |
| 467 | * the lchown. Thanks to snabb@epipe.fi for pointing |
| 468 | * this out. We also set it initially without group |
| 469 | * access because of a similar race condition. */ |
| 470 | fd2 = do_mkstemp(fnametmp, file->mode & INITACCESSPERMS); |
| 471 | |
| 472 | /* in most cases parent directories will already exist |
| 473 | * because their information should have been previously |
| 474 | * transferred, but that may not be the case with -R */ |
| 475 | if (fd2 == -1 && relative_paths && errno == ENOENT && |
| 476 | create_directory_path(fnametmp, orig_umask) == 0) { |
| 477 | strlcpy(fnametmp, template, sizeof(fnametmp)); |
| 478 | fd2 = do_mkstemp(fnametmp, file->mode & INITACCESSPERMS); |
| 479 | } |
| 480 | if (fd2 == -1) { |
| 481 | rprintf(FERROR, "mkstemp %s failed: %s\n", |
| 482 | full_fname(fnametmp), strerror(errno)); |
| 483 | receive_data(f_in,mapbuf,-1,NULL,file->length); |
| 484 | if (mapbuf) unmap_file(mapbuf); |
| 485 | if (fd1 != -1) close(fd1); |
| 486 | continue; |
| 487 | } |
| 488 | |
| 489 | cleanup_set(fnametmp, fname, file, mapbuf, fd1, fd2); |
| 490 | |
| 491 | if (!am_server && verbose) { /* log transfer */ |
| 492 | rprintf(FINFO, "%s\n", fname); |
| 493 | } |
| 494 | |
| 495 | /* recv file data */ |
| 496 | recv_ok = receive_data(f_in,mapbuf,fd2,fname,file->length); |
| 497 | |
| 498 | log_recv(file, &initial_stats); |
| 499 | |
| 500 | if (mapbuf) unmap_file(mapbuf); |
| 501 | if (fd1 != -1) { |
| 502 | close(fd1); |
| 503 | } |
| 504 | close(fd2); |
| 505 | |
| 506 | if (verbose > 2) |
| 507 | rprintf(FINFO,"renaming %s to %s\n",fnametmp,fname); |
| 508 | |
| 509 | finish_transfer(fname, fnametmp, file); |
| 510 | |
| 511 | cleanup_disable(); |
| 512 | |
| 513 | if (!recv_ok) { |
| 514 | if (csum_length == SUM_LENGTH) { |
| 515 | rprintf(FERROR,"ERROR: file corruption in %s. File changed during transfer?\n", |
| 516 | full_fname(fname)); |
| 517 | } else { |
| 518 | if (verbose > 1) |
| 519 | rprintf(FINFO,"redoing %s(%d)\n",fname,i); |
| 520 | write_int(f_gen,i); |
| 521 | } |
| 522 | } |
| 523 | } |
| 524 | |
| 525 | if (delete_after) { |
| 526 | if (recurse && delete_mode && !local_name && flist->count>0) { |
| 527 | delete_files(flist); |
| 528 | } |
| 529 | } |
| 530 | |
| 531 | if (preserve_hard_links) |
| 532 | do_hard_links(); |
| 533 | |
| 534 | /* now we need to fix any directory permissions that were |
| 535 | * modified during the transfer */ |
| 536 | for (i = 0; i < flist->count; i++) { |
| 537 | file = flist->files[i]; |
| 538 | if (!file->basename || !S_ISDIR(file->mode)) continue; |
| 539 | recv_generator(local_name? local_name |
| 540 | : f_name_to(file,fbuf,sizeof fbuf), flist, i, -1); |
| 541 | } |
| 542 | |
| 543 | if (verbose > 2) |
| 544 | rprintf(FINFO,"recv_files finished\n"); |
| 545 | |
| 546 | return 0; |
| 547 | } |