| 1 | /* -*- c-file-style: "linux" -*- |
| 2 | |
| 3 | rsync -- fast file replication program |
| 4 | |
| 5 | Copyright (C) 1996-2000 by Andrew Tridgell |
| 6 | Copyright (C) Paul Mackerras 1996 |
| 7 | Copyright (C) 2002 by Martin Pool <mbp@samba.org> |
| 8 | |
| 9 | This program is free software; you can redistribute it and/or modify |
| 10 | it under the terms of the GNU General Public License as published by |
| 11 | the Free Software Foundation; either version 2 of the License, or |
| 12 | (at your option) any later version. |
| 13 | |
| 14 | This program is distributed in the hope that it will be useful, |
| 15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 17 | GNU General Public License for more details. |
| 18 | |
| 19 | You should have received a copy of the GNU General Public License |
| 20 | along with this program; if not, write to the Free Software |
| 21 | Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
| 22 | */ |
| 23 | |
| 24 | #include "rsync.h" |
| 25 | |
| 26 | extern int verbose; |
| 27 | extern int dry_run; |
| 28 | extern int log_format_has_i; |
| 29 | extern int log_format_has_o_or_i; |
| 30 | extern int daemon_log_format_has_i; |
| 31 | extern int am_root; |
| 32 | extern int am_server; |
| 33 | extern int am_daemon; |
| 34 | extern int recurse; |
| 35 | extern int relative_paths; |
| 36 | extern int keep_dirlinks; |
| 37 | extern int preserve_links; |
| 38 | extern int preserve_devices; |
| 39 | extern int preserve_hard_links; |
| 40 | extern int preserve_perms; |
| 41 | extern int preserve_uid; |
| 42 | extern int preserve_gid; |
| 43 | extern int preserve_times; |
| 44 | extern int omit_dir_times; |
| 45 | extern int delete_before; |
| 46 | extern int delete_during; |
| 47 | extern int delete_after; |
| 48 | extern int module_id; |
| 49 | extern int ignore_errors; |
| 50 | extern int remove_sent_files; |
| 51 | extern int update_only; |
| 52 | extern int opt_ignore_existing; |
| 53 | extern int inplace; |
| 54 | extern int make_backups; |
| 55 | extern int csum_length; |
| 56 | extern int ignore_times; |
| 57 | extern int size_only; |
| 58 | extern OFF_T max_size; |
| 59 | extern int io_timeout; |
| 60 | extern int io_error; |
| 61 | extern int ignore_timeout; |
| 62 | extern int protocol_version; |
| 63 | extern int fuzzy_basis; |
| 64 | extern int always_checksum; |
| 65 | extern char *partial_dir; |
| 66 | extern char *basis_dir[]; |
| 67 | extern int compare_dest; |
| 68 | extern int link_dest; |
| 69 | extern int whole_file; |
| 70 | extern int local_server; |
| 71 | extern int list_only; |
| 72 | extern int read_batch; |
| 73 | extern int only_existing; |
| 74 | extern int orig_umask; |
| 75 | extern int safe_symlinks; |
| 76 | extern long block_size; /* "long" because popt can't set an int32. */ |
| 77 | extern int max_delete; |
| 78 | extern int force_delete; |
| 79 | extern int one_file_system; |
| 80 | extern struct stats stats; |
| 81 | extern dev_t filesystem_dev; |
| 82 | extern char *backup_dir; |
| 83 | extern char *backup_suffix; |
| 84 | extern int backup_suffix_len; |
| 85 | |
| 86 | extern struct filter_list_struct server_filter_list; |
| 87 | |
| 88 | static int deletion_count = 0; /* used to implement --max-delete */ |
| 89 | |
| 90 | |
| 91 | static int is_backup_file(char *fn) |
| 92 | { |
| 93 | int k = strlen(fn) - backup_suffix_len; |
| 94 | return k > 0 && strcmp(fn+k, backup_suffix) == 0; |
| 95 | } |
| 96 | |
| 97 | |
| 98 | /* Delete a file or directory. If DEL_FORCE_RECURSE is set in the flags, or if |
| 99 | * force_delete is set, this will delete recursively as long as DEL_NO_RECURSE |
| 100 | * is not set in the flags. */ |
| 101 | static int delete_item(char *fname, int mode, int flags) |
| 102 | { |
| 103 | struct file_list *dirlist; |
| 104 | char buf[MAXPATHLEN]; |
| 105 | int j, dlen, zap_dir, ok; |
| 106 | void *save_filters; |
| 107 | |
| 108 | if (max_delete && deletion_count >= max_delete) |
| 109 | return -1; |
| 110 | |
| 111 | if (!S_ISDIR(mode)) { |
| 112 | if (make_backups && (backup_dir || !is_backup_file(fname))) |
| 113 | ok = make_backup(fname); |
| 114 | else |
| 115 | ok = robust_unlink(fname) == 0; |
| 116 | if (ok) { |
| 117 | if (!(flags & DEL_TERSE)) |
| 118 | log_delete(fname, mode); |
| 119 | deletion_count++; |
| 120 | return 0; |
| 121 | } |
| 122 | if (errno == ENOENT) |
| 123 | return 0; |
| 124 | rsyserr(FERROR, errno, "delete_file: unlink %s failed", |
| 125 | full_fname(fname)); |
| 126 | return -1; |
| 127 | } |
| 128 | |
| 129 | zap_dir = (flags & DEL_FORCE_RECURSE || (force_delete && recurse)) |
| 130 | && !(flags & DEL_NO_RECURSE); |
| 131 | if (dry_run && zap_dir) { |
| 132 | ok = 0; |
| 133 | errno = ENOTEMPTY; |
| 134 | } else if (make_backups && !backup_dir && !is_backup_file(fname) |
| 135 | && !(flags & DEL_FORCE_RECURSE)) |
| 136 | ok = make_backup(fname); |
| 137 | else |
| 138 | ok = do_rmdir(fname) == 0; |
| 139 | if (ok) { |
| 140 | if (!(flags & DEL_TERSE)) |
| 141 | log_delete(fname, mode); |
| 142 | deletion_count++; |
| 143 | return 0; |
| 144 | } |
| 145 | if (errno == ENOENT) |
| 146 | return 0; |
| 147 | if (!zap_dir || (errno != ENOTEMPTY && errno != EEXIST)) { |
| 148 | rsyserr(FERROR, errno, "delete_file: rmdir %s failed", |
| 149 | full_fname(fname)); |
| 150 | return -1; |
| 151 | } |
| 152 | flags |= DEL_FORCE_RECURSE; |
| 153 | |
| 154 | dlen = strlcpy(buf, fname, MAXPATHLEN); |
| 155 | save_filters = push_local_filters(buf, dlen); |
| 156 | |
| 157 | dirlist = get_dirlist(buf, dlen, 0); |
| 158 | for (j = dirlist->count; j--; ) { |
| 159 | struct file_struct *fp = dirlist->files[j]; |
| 160 | |
| 161 | if (fp->flags & FLAG_MOUNT_POINT) |
| 162 | continue; |
| 163 | |
| 164 | f_name_to(fp, buf); |
| 165 | if (delete_item(buf, fp->mode, flags & ~DEL_TERSE) != 0) { |
| 166 | flist_free(dirlist); |
| 167 | return -1; |
| 168 | } |
| 169 | } |
| 170 | flist_free(dirlist); |
| 171 | |
| 172 | pop_local_filters(save_filters); |
| 173 | |
| 174 | if (max_delete && deletion_count >= max_delete) |
| 175 | return -1; |
| 176 | |
| 177 | if (do_rmdir(fname) == 0) { |
| 178 | if (!(flags & DEL_TERSE)) |
| 179 | log_delete(fname, mode); |
| 180 | deletion_count++; |
| 181 | } else if (errno != ENOTEMPTY && errno != ENOENT) { |
| 182 | rsyserr(FERROR, errno, "delete_file: rmdir %s failed", |
| 183 | full_fname(fname)); |
| 184 | return -1; |
| 185 | } |
| 186 | |
| 187 | return 0; |
| 188 | } |
| 189 | |
| 190 | |
| 191 | /* This function is used to implement per-directory deletion, and is used by |
| 192 | * all the --delete-WHEN options. Note that the fbuf pointer must point to a |
| 193 | * MAXPATHLEN buffer with the name of the directory in it (the functions we |
| 194 | * call will append names onto the end, but the old dir value will be restored |
| 195 | * on exit). */ |
| 196 | static void delete_in_dir(struct file_list *flist, char *fbuf, |
| 197 | struct file_struct *file, int allowed_lull) |
| 198 | { |
| 199 | static int min_depth = MAXPATHLEN, cur_depth = -1; |
| 200 | static void *filt_array[MAXPATHLEN/2+1]; |
| 201 | struct file_list *dirlist; |
| 202 | char delbuf[MAXPATHLEN]; |
| 203 | STRUCT_STAT st; |
| 204 | int dlen, i; |
| 205 | |
| 206 | if (!flist) { |
| 207 | while (cur_depth >= min_depth) |
| 208 | pop_local_filters(filt_array[cur_depth--]); |
| 209 | min_depth = MAXPATHLEN; |
| 210 | cur_depth = -1; |
| 211 | return; |
| 212 | } |
| 213 | |
| 214 | if (verbose > 2) |
| 215 | rprintf(FINFO, "delete_in_dir(%s)\n", safe_fname(fbuf)); |
| 216 | |
| 217 | if (allowed_lull) |
| 218 | maybe_send_keepalive(allowed_lull, flist->count); |
| 219 | |
| 220 | if (file->dir.depth >= MAXPATHLEN/2+1) |
| 221 | return; /* Impossible... */ |
| 222 | |
| 223 | if (max_delete && deletion_count >= max_delete) |
| 224 | return; |
| 225 | |
| 226 | if (io_error && !(lp_ignore_errors(module_id) || ignore_errors)) { |
| 227 | rprintf(FINFO, |
| 228 | "IO error encountered -- skipping file deletion\n"); |
| 229 | max_delete = -1; /* avoid duplicating the above warning */ |
| 230 | return; |
| 231 | } |
| 232 | |
| 233 | while (cur_depth >= file->dir.depth && cur_depth >= min_depth) |
| 234 | pop_local_filters(filt_array[cur_depth--]); |
| 235 | cur_depth = file->dir.depth; |
| 236 | if (min_depth > cur_depth) |
| 237 | min_depth = cur_depth; |
| 238 | dlen = strlen(fbuf); |
| 239 | filt_array[cur_depth] = push_local_filters(fbuf, dlen); |
| 240 | |
| 241 | if (link_stat(fbuf, &st, keep_dirlinks) < 0) |
| 242 | return; |
| 243 | |
| 244 | if (one_file_system && file->flags & FLAG_TOP_DIR) |
| 245 | filesystem_dev = st.st_dev; |
| 246 | |
| 247 | dirlist = get_dirlist(fbuf, dlen, 0); |
| 248 | |
| 249 | /* If an item in dirlist is not found in flist, delete it |
| 250 | * from the filesystem. */ |
| 251 | for (i = dirlist->count; i--; ) { |
| 252 | if (!dirlist->files[i]->basename) |
| 253 | continue; |
| 254 | if (flist_find(flist, dirlist->files[i]) < 0) { |
| 255 | int mode = dirlist->files[i]->mode; |
| 256 | f_name_to(dirlist->files[i], delbuf); |
| 257 | if (delete_item(delbuf, mode, DEL_FORCE_RECURSE) < 0) |
| 258 | break; |
| 259 | } |
| 260 | } |
| 261 | |
| 262 | flist_free(dirlist); |
| 263 | } |
| 264 | |
| 265 | /* This deletes any files on the receiving side that are not present on the |
| 266 | * sending side. This is used by --delete-before and --delete-after. */ |
| 267 | static void do_delete_pass(struct file_list *flist, int allowed_lull) |
| 268 | { |
| 269 | char fbuf[MAXPATHLEN]; |
| 270 | int j; |
| 271 | |
| 272 | for (j = 0; j < flist->count; j++) { |
| 273 | struct file_struct *file = flist->files[j]; |
| 274 | |
| 275 | if (!(file->flags & FLAG_DEL_HERE)) |
| 276 | continue; |
| 277 | |
| 278 | f_name_to(file, fbuf); |
| 279 | if (verbose > 1 && file->flags & FLAG_TOP_DIR) |
| 280 | rprintf(FINFO, "deleting in %s\n", safe_fname(fbuf)); |
| 281 | |
| 282 | delete_in_dir(flist, fbuf, file, allowed_lull); |
| 283 | } |
| 284 | } |
| 285 | |
| 286 | static int unchanged_attrs(struct file_struct *file, STRUCT_STAT *st) |
| 287 | { |
| 288 | if (preserve_perms |
| 289 | && (st->st_mode & CHMOD_BITS) != (file->mode & CHMOD_BITS)) |
| 290 | return 0; |
| 291 | |
| 292 | if (am_root && preserve_uid && st->st_uid != file->uid) |
| 293 | return 0; |
| 294 | |
| 295 | if (preserve_gid && file->gid != GID_NONE && st->st_gid != file->gid) |
| 296 | return 0; |
| 297 | |
| 298 | return 1; |
| 299 | } |
| 300 | |
| 301 | |
| 302 | #define SID_UPDATING ITEM_UPDATING |
| 303 | #define SID_REPORT_CHECKSUM ITEM_REPORT_CHECKSUM |
| 304 | #define SID_USING_ALT_BASIS ITEM_USING_ALT_BASIS |
| 305 | /* This flag doesn't get sent, so it must be outside 0xffff. */ |
| 306 | #define SID_NO_DEST_AND_NO_UPDATE (1<<16) |
| 307 | |
| 308 | static void itemize(struct file_struct *file, int statret, STRUCT_STAT *st, |
| 309 | int32 sflags, int f_out, int ndx) |
| 310 | { |
| 311 | int iflags = sflags & 0xffff; |
| 312 | |
| 313 | if (statret >= 0) { |
| 314 | if (S_ISREG(file->mode) && file->length != st->st_size) |
| 315 | iflags |= ITEM_REPORT_SIZE; |
| 316 | if (!(sflags & SID_NO_DEST_AND_NO_UPDATE)) { |
| 317 | int keep_time = !preserve_times ? 0 |
| 318 | : S_ISDIR(file->mode) ? !omit_dir_times |
| 319 | : !S_ISLNK(file->mode); |
| 320 | |
| 321 | if ((iflags & ITEM_UPDATING && !keep_time) |
| 322 | || (keep_time && file->modtime != st->st_mtime)) |
| 323 | iflags |= ITEM_REPORT_TIME; |
| 324 | if (preserve_perms && file->mode != st->st_mode) |
| 325 | iflags |= ITEM_REPORT_PERMS; |
| 326 | if (preserve_uid && am_root && file->uid != st->st_uid) |
| 327 | iflags |= ITEM_REPORT_OWNER; |
| 328 | if (preserve_gid && file->gid != GID_NONE |
| 329 | && st->st_gid != file->gid) |
| 330 | iflags |= ITEM_REPORT_GROUP; |
| 331 | } |
| 332 | } else |
| 333 | iflags |= ITEM_IS_NEW | ITEM_UPDATING; |
| 334 | |
| 335 | if ((iflags || verbose > 1) && !read_batch) { |
| 336 | if (protocol_version >= 29) { |
| 337 | if (ndx >= 0) |
| 338 | write_int(f_out, ndx); |
| 339 | write_shortint(f_out, iflags); |
| 340 | } else if (ndx >= 0) |
| 341 | log_recv(file, &stats, iflags); |
| 342 | } |
| 343 | } |
| 344 | |
| 345 | |
| 346 | /* Perform our quick-check heuristic for determining if a file is unchanged. */ |
| 347 | static int unchanged_file(char *fn, struct file_struct *file, STRUCT_STAT *st) |
| 348 | { |
| 349 | if (st->st_size != file->length) |
| 350 | return 0; |
| 351 | |
| 352 | /* if always checksum is set then we use the checksum instead |
| 353 | of the file time to determine whether to sync */ |
| 354 | if (always_checksum && S_ISREG(st->st_mode)) { |
| 355 | char sum[MD4_SUM_LENGTH]; |
| 356 | file_checksum(fn, sum, st->st_size); |
| 357 | return memcmp(sum, file->u.sum, protocol_version < 21 ? 2 |
| 358 | : MD4_SUM_LENGTH) == 0; |
| 359 | } |
| 360 | |
| 361 | if (size_only) |
| 362 | return 1; |
| 363 | |
| 364 | if (ignore_times) |
| 365 | return 0; |
| 366 | |
| 367 | return cmp_modtime(st->st_mtime, file->modtime) == 0; |
| 368 | } |
| 369 | |
| 370 | |
| 371 | /* |
| 372 | * set (initialize) the size entries in the per-file sum_struct |
| 373 | * calculating dynamic block and checksum sizes. |
| 374 | * |
| 375 | * This is only called from generate_and_send_sums() but is a separate |
| 376 | * function to encapsulate the logic. |
| 377 | * |
| 378 | * The block size is a rounded square root of file length. |
| 379 | * |
| 380 | * The checksum size is determined according to: |
| 381 | * blocksum_bits = BLOCKSUM_EXP + 2*log2(file_len) - log2(block_len) |
| 382 | * provided by Donovan Baarda which gives a probability of rsync |
| 383 | * algorithm corrupting data and falling back using the whole md4 |
| 384 | * checksums. |
| 385 | * |
| 386 | * This might be made one of several selectable heuristics. |
| 387 | */ |
| 388 | static void sum_sizes_sqroot(struct sum_struct *sum, int64 len) |
| 389 | { |
| 390 | int32 blength; |
| 391 | int s2length; |
| 392 | |
| 393 | if (block_size) |
| 394 | blength = block_size; |
| 395 | else if (len <= BLOCK_SIZE * BLOCK_SIZE) |
| 396 | blength = BLOCK_SIZE; |
| 397 | else { |
| 398 | int32 c; |
| 399 | int64 l; |
| 400 | int cnt; |
| 401 | for (c = 1, l = len, cnt = 0; l >>= 2; c <<= 1, cnt++) {} |
| 402 | if (cnt >= 31 || c >= MAX_BLOCK_SIZE) |
| 403 | blength = MAX_BLOCK_SIZE; |
| 404 | else { |
| 405 | blength = 0; |
| 406 | do { |
| 407 | blength |= c; |
| 408 | if (len < (int64)blength * blength) |
| 409 | blength &= ~c; |
| 410 | c >>= 1; |
| 411 | } while (c >= 8); /* round to multiple of 8 */ |
| 412 | blength = MAX(blength, BLOCK_SIZE); |
| 413 | } |
| 414 | } |
| 415 | |
| 416 | if (protocol_version < 27) { |
| 417 | s2length = csum_length; |
| 418 | } else if (csum_length == SUM_LENGTH) { |
| 419 | s2length = SUM_LENGTH; |
| 420 | } else { |
| 421 | int32 c; |
| 422 | int64 l; |
| 423 | int b = BLOCKSUM_BIAS; |
| 424 | for (l = len; l >>= 1; b += 2) {} |
| 425 | for (c = blength; c >>= 1 && b; b--) {} |
| 426 | /* add a bit, subtract rollsum, round up. */ |
| 427 | s2length = (b + 1 - 32 + 7) / 8; /* --optimize in compiler-- */ |
| 428 | s2length = MAX(s2length, csum_length); |
| 429 | s2length = MIN(s2length, SUM_LENGTH); |
| 430 | } |
| 431 | |
| 432 | sum->flength = len; |
| 433 | sum->blength = blength; |
| 434 | sum->s2length = s2length; |
| 435 | sum->count = (len + (blength - 1)) / blength; |
| 436 | sum->remainder = (len % blength); |
| 437 | |
| 438 | if (sum->count && verbose > 2) { |
| 439 | rprintf(FINFO, |
| 440 | "count=%.0f rem=%ld blength=%ld s2length=%d flength=%.0f\n", |
| 441 | (double)sum->count, (long)sum->remainder, (long)sum->blength, |
| 442 | sum->s2length, (double)sum->flength); |
| 443 | } |
| 444 | } |
| 445 | |
| 446 | |
| 447 | /* |
| 448 | * Generate and send a stream of signatures/checksums that describe a buffer |
| 449 | * |
| 450 | * Generate approximately one checksum every block_len bytes. |
| 451 | */ |
| 452 | static void generate_and_send_sums(int fd, OFF_T len, int f_out, int f_copy) |
| 453 | { |
| 454 | int32 i; |
| 455 | struct map_struct *mapbuf; |
| 456 | struct sum_struct sum; |
| 457 | OFF_T offset = 0; |
| 458 | |
| 459 | sum_sizes_sqroot(&sum, len); |
| 460 | |
| 461 | if (len > 0) |
| 462 | mapbuf = map_file(fd, len, MAX_MAP_SIZE, sum.blength); |
| 463 | else |
| 464 | mapbuf = NULL; |
| 465 | |
| 466 | write_sum_head(f_out, &sum); |
| 467 | |
| 468 | for (i = 0; i < sum.count; i++) { |
| 469 | int32 n1 = (int32)MIN(len, (OFF_T)sum.blength); |
| 470 | char *map = map_ptr(mapbuf, offset, n1); |
| 471 | uint32 sum1 = get_checksum1(map, n1); |
| 472 | char sum2[SUM_LENGTH]; |
| 473 | |
| 474 | if (f_copy >= 0) |
| 475 | full_write(f_copy, map, n1); |
| 476 | |
| 477 | get_checksum2(map, n1, sum2); |
| 478 | |
| 479 | if (verbose > 3) { |
| 480 | rprintf(FINFO, |
| 481 | "chunk[%.0f] offset=%.0f len=%ld sum1=%08lx\n", |
| 482 | (double)i, (double)offset, (long)n1, |
| 483 | (unsigned long)sum1); |
| 484 | } |
| 485 | write_int(f_out, sum1); |
| 486 | write_buf(f_out, sum2, sum.s2length); |
| 487 | len -= n1; |
| 488 | offset += n1; |
| 489 | } |
| 490 | |
| 491 | if (mapbuf) |
| 492 | unmap_file(mapbuf); |
| 493 | } |
| 494 | |
| 495 | |
| 496 | /* Try to find a filename in the same dir as "fname" with a similar name. */ |
| 497 | static int find_fuzzy(struct file_struct *file, struct file_list *dirlist) |
| 498 | { |
| 499 | int fname_len, fname_suf_len; |
| 500 | const char *fname_suf, *fname = file->basename; |
| 501 | uint32 lowest_dist = 0x7FFFFFFF; |
| 502 | int j, lowest_j = -1; |
| 503 | |
| 504 | fname_len = strlen(fname); |
| 505 | fname_suf = find_filename_suffix(fname, fname_len, &fname_suf_len); |
| 506 | |
| 507 | for (j = 0; j < dirlist->count; j++) { |
| 508 | struct file_struct *fp = dirlist->files[j]; |
| 509 | const char *suf, *name; |
| 510 | int len, suf_len; |
| 511 | uint32 dist; |
| 512 | |
| 513 | if (!S_ISREG(fp->mode) || !fp->length |
| 514 | || fp->flags & FLAG_NO_FUZZY) |
| 515 | continue; |
| 516 | |
| 517 | name = fp->basename; |
| 518 | |
| 519 | if (fp->length == file->length |
| 520 | && fp->modtime == file->modtime) { |
| 521 | if (verbose > 4) { |
| 522 | rprintf(FINFO, |
| 523 | "fuzzy size/modtime match for %s\n", |
| 524 | name); |
| 525 | } |
| 526 | return j; |
| 527 | } |
| 528 | |
| 529 | len = strlen(name); |
| 530 | suf = find_filename_suffix(name, len, &suf_len); |
| 531 | |
| 532 | dist = fuzzy_distance(name, len, fname, fname_len); |
| 533 | /* Add some extra weight to how well the suffixes match. */ |
| 534 | dist += fuzzy_distance(suf, suf_len, fname_suf, fname_suf_len) |
| 535 | * 10; |
| 536 | if (verbose > 4) { |
| 537 | rprintf(FINFO, "fuzzy distance for %s = %d.%05d\n", |
| 538 | name, (int)(dist>>16), (int)(dist&0xFFFF)); |
| 539 | } |
| 540 | if (dist <= lowest_dist) { |
| 541 | lowest_dist = dist; |
| 542 | lowest_j = j; |
| 543 | } |
| 544 | } |
| 545 | |
| 546 | return lowest_j; |
| 547 | } |
| 548 | |
| 549 | |
| 550 | /* Acts on flist->file's ndx'th item, whose name is fname. If a directory, |
| 551 | * make sure it exists, and has the right permissions/timestamp info. For |
| 552 | * all other non-regular files (symlinks, etc.) we create them here. For |
| 553 | * regular files that have changed, we try to find a basis file and then |
| 554 | * start sending checksums. |
| 555 | * |
| 556 | * Note that f_out is set to -1 when doing final directory-permission and |
| 557 | * modification-time repair. */ |
| 558 | static void recv_generator(char *fname, struct file_list *flist, |
| 559 | struct file_struct *file, int ndx, |
| 560 | int itemizing, int maybe_PERMS_REPORT, |
| 561 | enum logcode code, int allowed_lull, |
| 562 | int f_out, int f_out_name) |
| 563 | { |
| 564 | static int missing_below = -1, excluded_below = -1; |
| 565 | static char *fuzzy_dirname = NULL; |
| 566 | static struct file_list *fuzzy_dirlist = NULL; |
| 567 | struct file_struct *fuzzy_file = NULL; |
| 568 | int fd = -1, f_copy = -1; |
| 569 | STRUCT_STAT st, partial_st; |
| 570 | struct file_struct *back_file = NULL; |
| 571 | int statret, stat_errno; |
| 572 | char *fnamecmp, *partialptr, *backupptr = NULL; |
| 573 | char fnamecmpbuf[MAXPATHLEN]; |
| 574 | uchar fnamecmp_type; |
| 575 | |
| 576 | if (list_only) |
| 577 | return; |
| 578 | |
| 579 | if (!fname) { |
| 580 | if (fuzzy_dirlist) { |
| 581 | flist_free(fuzzy_dirlist); |
| 582 | fuzzy_dirlist = NULL; |
| 583 | fuzzy_dirname = NULL; |
| 584 | } |
| 585 | if (missing_below >= 0) { |
| 586 | dry_run--; |
| 587 | missing_below = -1; |
| 588 | } |
| 589 | return; |
| 590 | } |
| 591 | |
| 592 | if (verbose > 2) { |
| 593 | rprintf(FINFO, "recv_generator(%s,%d)\n", |
| 594 | safe_fname(fname), ndx); |
| 595 | } |
| 596 | |
| 597 | if (server_filter_list.head) { |
| 598 | if (excluded_below >= 0) { |
| 599 | if (file->dir.depth > excluded_below) |
| 600 | goto skipping; |
| 601 | excluded_below = -1; |
| 602 | } |
| 603 | if (check_filter(&server_filter_list, fname, |
| 604 | S_ISDIR(file->mode)) < 0) { |
| 605 | if (S_ISDIR(file->mode)) |
| 606 | excluded_below = file->dir.depth; |
| 607 | skipping: |
| 608 | if (verbose) { |
| 609 | rprintf(FINFO, |
| 610 | "skipping server-excluded file \"%s\"\n", |
| 611 | safe_fname(fname)); |
| 612 | } |
| 613 | return; |
| 614 | } |
| 615 | } |
| 616 | |
| 617 | if (missing_below >= 0 && file->dir.depth <= missing_below) { |
| 618 | dry_run--; |
| 619 | missing_below = -1; |
| 620 | } |
| 621 | if (dry_run > 1) { |
| 622 | statret = -1; |
| 623 | stat_errno = ENOENT; |
| 624 | } else { |
| 625 | if (fuzzy_basis && S_ISREG(file->mode)) { |
| 626 | char *dn = file->dirname ? file->dirname : "."; |
| 627 | /* Yes, identical dirnames are guaranteed to have |
| 628 | * identical pointers at this point. */ |
| 629 | if (fuzzy_dirname != dn) { |
| 630 | if (fuzzy_dirlist) |
| 631 | flist_free(fuzzy_dirlist); |
| 632 | fuzzy_dirname = dn; |
| 633 | fuzzy_dirlist = get_dirlist(fuzzy_dirname, -1, |
| 634 | 1); |
| 635 | } |
| 636 | } |
| 637 | |
| 638 | statret = link_stat(fname, &st, |
| 639 | keep_dirlinks && S_ISDIR(file->mode)); |
| 640 | stat_errno = errno; |
| 641 | } |
| 642 | |
| 643 | if (only_existing && statret == -1 && stat_errno == ENOENT) { |
| 644 | /* we only want to update existing files */ |
| 645 | if (verbose > 1) { |
| 646 | rprintf(FINFO, "not creating new file \"%s\"\n", |
| 647 | safe_fname(fname)); |
| 648 | } |
| 649 | return; |
| 650 | } |
| 651 | |
| 652 | if (statret == 0 && !preserve_perms |
| 653 | && S_ISDIR(st.st_mode) == S_ISDIR(file->mode)) { |
| 654 | /* if the file exists already and we aren't perserving |
| 655 | * permissions then act as though the remote end sent |
| 656 | * us the file permissions we already have */ |
| 657 | file->mode = (file->mode & ~CHMOD_BITS) |
| 658 | | (st.st_mode & CHMOD_BITS); |
| 659 | } |
| 660 | |
| 661 | if (S_ISDIR(file->mode)) { |
| 662 | /* The file to be received is a directory, so we need |
| 663 | * to prepare appropriately. If there is already a |
| 664 | * file of that name and it is *not* a directory, then |
| 665 | * we need to delete it. If it doesn't exist, then |
| 666 | * (perhaps recursively) create it. */ |
| 667 | if (statret == 0 && !S_ISDIR(st.st_mode)) { |
| 668 | delete_item(fname, st.st_mode, DEL_TERSE); |
| 669 | statret = -1; |
| 670 | } |
| 671 | if (dry_run && statret != 0 && missing_below < 0) { |
| 672 | missing_below = file->dir.depth; |
| 673 | dry_run++; |
| 674 | } |
| 675 | if (itemizing && f_out != -1) |
| 676 | itemize(file, statret, &st, 0, f_out, ndx); |
| 677 | if (statret != 0 && do_mkdir(fname,file->mode) != 0 && errno != EEXIST) { |
| 678 | if (!relative_paths || errno != ENOENT |
| 679 | || create_directory_path(fname, orig_umask) < 0 |
| 680 | || do_mkdir(fname, file->mode) < 0) { |
| 681 | rsyserr(FERROR, errno, |
| 682 | "recv_generator: mkdir %s failed", |
| 683 | full_fname(fname)); |
| 684 | } |
| 685 | } |
| 686 | if (set_perms(fname, file, statret ? NULL : &st, 0) |
| 687 | && verbose && code && f_out != -1) |
| 688 | rprintf(code, "%s/\n", safe_fname(fname)); |
| 689 | if (delete_during && f_out != -1 && csum_length != SUM_LENGTH |
| 690 | && (file->flags & FLAG_DEL_HERE)) |
| 691 | delete_in_dir(flist, fname, file, allowed_lull); |
| 692 | return; |
| 693 | } |
| 694 | |
| 695 | if (max_size && file->length > max_size) { |
| 696 | if (verbose > 1) { |
| 697 | rprintf(FINFO, "%s is over max-size\n", |
| 698 | safe_fname(fname)); |
| 699 | } |
| 700 | return; |
| 701 | } |
| 702 | |
| 703 | if (preserve_links && S_ISLNK(file->mode)) { |
| 704 | #ifdef SUPPORT_LINKS |
| 705 | if (safe_symlinks && unsafe_symlink(file->u.link, fname)) { |
| 706 | if (verbose) { |
| 707 | rprintf(FINFO, |
| 708 | "ignoring unsafe symlink %s -> \"%s\"\n", |
| 709 | full_fname(fname), |
| 710 | safe_fname(file->u.link)); |
| 711 | } |
| 712 | return; |
| 713 | } |
| 714 | if (statret == 0) { |
| 715 | char lnk[MAXPATHLEN]; |
| 716 | int len; |
| 717 | |
| 718 | if (!S_ISDIR(st.st_mode) |
| 719 | && (len = readlink(fname, lnk, MAXPATHLEN-1)) > 0) { |
| 720 | lnk[len] = 0; |
| 721 | /* A link already pointing to the |
| 722 | * right place -- no further action |
| 723 | * required. */ |
| 724 | if (strcmp(lnk, file->u.link) == 0) { |
| 725 | if (itemizing) { |
| 726 | itemize(file, 0, &st, 0, |
| 727 | f_out, ndx); |
| 728 | } |
| 729 | set_perms(fname, file, &st, |
| 730 | maybe_PERMS_REPORT); |
| 731 | return; |
| 732 | } |
| 733 | } |
| 734 | /* Not the right symlink (or not a symlink), so |
| 735 | * delete it. */ |
| 736 | if (S_ISLNK(st.st_mode)) |
| 737 | delete_item(fname, st.st_mode, DEL_TERSE); |
| 738 | else { |
| 739 | delete_item(fname, st.st_mode, DEL_TERSE); |
| 740 | statret = -1; |
| 741 | } |
| 742 | } |
| 743 | if (do_symlink(file->u.link,fname) != 0) { |
| 744 | rsyserr(FERROR, errno, "symlink %s -> \"%s\" failed", |
| 745 | full_fname(fname), safe_fname(file->u.link)); |
| 746 | } else { |
| 747 | set_perms(fname,file,NULL,0); |
| 748 | if (itemizing) { |
| 749 | itemize(file, statret, &st, SID_UPDATING, |
| 750 | f_out, ndx); |
| 751 | } |
| 752 | if (code && verbose) { |
| 753 | rprintf(code, "%s -> %s\n", safe_fname(fname), |
| 754 | safe_fname(file->u.link)); |
| 755 | } |
| 756 | if (remove_sent_files && !dry_run) { |
| 757 | char numbuf[4]; |
| 758 | SIVAL(numbuf, 0, ndx); |
| 759 | send_msg(MSG_SUCCESS, numbuf, 4); |
| 760 | } |
| 761 | } |
| 762 | #endif |
| 763 | return; |
| 764 | } |
| 765 | |
| 766 | if (am_root && preserve_devices && IS_DEVICE(file->mode)) { |
| 767 | if (statret != 0 || |
| 768 | st.st_mode != file->mode || |
| 769 | st.st_rdev != file->u.rdev) { |
| 770 | delete_item(fname, st.st_mode, DEL_TERSE); |
| 771 | if (!IS_DEVICE(st.st_mode)) |
| 772 | statret = -1; |
| 773 | if (verbose > 2) { |
| 774 | rprintf(FINFO,"mknod(%s,0%o,0x%x)\n", |
| 775 | safe_fname(fname), |
| 776 | (int)file->mode, (int)file->u.rdev); |
| 777 | } |
| 778 | if (do_mknod(fname,file->mode,file->u.rdev) != 0) { |
| 779 | rsyserr(FERROR, errno, "mknod %s failed", |
| 780 | full_fname(fname)); |
| 781 | } else { |
| 782 | set_perms(fname,file,NULL,0); |
| 783 | if (itemizing) { |
| 784 | itemize(file, statret, &st, SID_UPDATING, |
| 785 | f_out, ndx); |
| 786 | } |
| 787 | if (code && verbose) { |
| 788 | rprintf(code, "%s\n", |
| 789 | safe_fname(fname)); |
| 790 | } |
| 791 | } |
| 792 | } else { |
| 793 | if (itemizing) { |
| 794 | itemize(file, statret, &st, 0, |
| 795 | f_out, ndx); |
| 796 | } |
| 797 | set_perms(fname, file, &st, maybe_PERMS_REPORT); |
| 798 | } |
| 799 | return; |
| 800 | } |
| 801 | |
| 802 | if (preserve_hard_links && hard_link_check(file, HL_CHECK_MASTER)) |
| 803 | return; |
| 804 | |
| 805 | if (!S_ISREG(file->mode)) { |
| 806 | rprintf(FINFO, "skipping non-regular file \"%s\"\n", |
| 807 | safe_fname(fname)); |
| 808 | return; |
| 809 | } |
| 810 | |
| 811 | fnamecmp = fname; |
| 812 | fnamecmp_type = FNAMECMP_FNAME; |
| 813 | |
| 814 | if (statret != 0 && basis_dir[0] != NULL) { |
| 815 | int fallback_match = -1; |
| 816 | int match_level = 0; |
| 817 | int i = 0; |
| 818 | do { |
| 819 | pathjoin(fnamecmpbuf, sizeof fnamecmpbuf, |
| 820 | basis_dir[i], fname); |
| 821 | if (link_stat(fnamecmpbuf, &st, 0) == 0 |
| 822 | && S_ISREG(st.st_mode)) { |
| 823 | statret = 0; |
| 824 | if (link_dest) { |
| 825 | if (!match_level) { |
| 826 | fallback_match = i; |
| 827 | match_level = 1; |
| 828 | } else if (match_level == 2 |
| 829 | && !unchanged_attrs(file, &st)) |
| 830 | continue; |
| 831 | if (!unchanged_file(fnamecmpbuf, file, &st)) |
| 832 | continue; |
| 833 | fallback_match = i; |
| 834 | match_level = 2; |
| 835 | if (!unchanged_attrs(file, &st)) |
| 836 | continue; |
| 837 | } |
| 838 | match_level = 3; |
| 839 | break; |
| 840 | } |
| 841 | } while (basis_dir[++i] != NULL); |
| 842 | if (statret == 0) { |
| 843 | if (match_level < 3) { |
| 844 | i = fallback_match; |
| 845 | pathjoin(fnamecmpbuf, sizeof fnamecmpbuf, |
| 846 | basis_dir[i], fname); |
| 847 | } |
| 848 | #ifdef HAVE_LINK |
| 849 | if (link_dest && match_level == 3 && !dry_run) { |
| 850 | if (do_link(fnamecmpbuf, fname) < 0) { |
| 851 | if (verbose) { |
| 852 | rsyserr(FINFO, errno, |
| 853 | "link %s => %s", |
| 854 | full_fname(fnamecmpbuf), |
| 855 | safe_fname(fname)); |
| 856 | } |
| 857 | fnamecmp = fnamecmpbuf; |
| 858 | fnamecmp_type = i; |
| 859 | } |
| 860 | } else |
| 861 | #endif |
| 862 | { |
| 863 | fnamecmp = fnamecmpbuf; |
| 864 | fnamecmp_type = i; |
| 865 | } |
| 866 | } |
| 867 | } |
| 868 | |
| 869 | if (statret == 0 && !S_ISREG(st.st_mode)) { |
| 870 | if (delete_item(fname, st.st_mode, DEL_TERSE) != 0) |
| 871 | return; |
| 872 | statret = -1; |
| 873 | stat_errno = ENOENT; |
| 874 | } |
| 875 | |
| 876 | if (partial_dir && (partialptr = partial_dir_fname(fname)) != NULL |
| 877 | && link_stat(partialptr, &partial_st, 0) == 0 |
| 878 | && S_ISREG(partial_st.st_mode)) { |
| 879 | if (statret != 0) |
| 880 | goto prepare_to_open; |
| 881 | } else |
| 882 | partialptr = NULL; |
| 883 | |
| 884 | if (statret != 0 && fuzzy_basis && dry_run <= 1) { |
| 885 | int j = find_fuzzy(file, fuzzy_dirlist); |
| 886 | if (j >= 0) { |
| 887 | fuzzy_file = fuzzy_dirlist->files[j]; |
| 888 | f_name_to(fuzzy_file, fnamecmpbuf); |
| 889 | if (verbose > 2) { |
| 890 | rprintf(FINFO, "fuzzy basis selected for %s: %s\n", |
| 891 | safe_fname(fname), safe_fname(fnamecmpbuf)); |
| 892 | } |
| 893 | st.st_mode = fuzzy_file->mode; |
| 894 | st.st_size = fuzzy_file->length; |
| 895 | st.st_mtime = fuzzy_file->modtime; |
| 896 | statret = 0; |
| 897 | fnamecmp = fnamecmpbuf; |
| 898 | fnamecmp_type = FNAMECMP_FUZZY; |
| 899 | } |
| 900 | } |
| 901 | |
| 902 | if (statret != 0) { |
| 903 | if (preserve_hard_links && hard_link_check(file, HL_SKIP)) |
| 904 | return; |
| 905 | if (stat_errno == ENOENT) |
| 906 | goto notify_others; |
| 907 | if (verbose > 1) { |
| 908 | rsyserr(FERROR, stat_errno, |
| 909 | "recv_generator: failed to stat %s", |
| 910 | full_fname(fname)); |
| 911 | } |
| 912 | return; |
| 913 | } |
| 914 | |
| 915 | if (opt_ignore_existing && fnamecmp_type == FNAMECMP_FNAME) { |
| 916 | if (verbose > 1) |
| 917 | rprintf(FINFO, "%s exists\n", safe_fname(fname)); |
| 918 | return; |
| 919 | } |
| 920 | |
| 921 | if (update_only && fnamecmp_type == FNAMECMP_FNAME |
| 922 | && cmp_modtime(st.st_mtime, file->modtime) > 0) { |
| 923 | if (verbose > 1) |
| 924 | rprintf(FINFO, "%s is newer\n", safe_fname(fname)); |
| 925 | return; |
| 926 | } |
| 927 | |
| 928 | if (!compare_dest && fnamecmp_type <= FNAMECMP_BASIS_DIR_HIGH) |
| 929 | ; |
| 930 | else if (fnamecmp_type == FNAMECMP_FUZZY) |
| 931 | ; |
| 932 | else if (unchanged_file(fnamecmp, file, &st)) { |
| 933 | if (itemizing) { |
| 934 | itemize(file, statret, &st, |
| 935 | fnamecmp_type == FNAMECMP_FNAME |
| 936 | ? 0 : SID_NO_DEST_AND_NO_UPDATE, |
| 937 | f_out, ndx); |
| 938 | } |
| 939 | if (fnamecmp_type == FNAMECMP_FNAME) |
| 940 | set_perms(fname, file, &st, maybe_PERMS_REPORT); |
| 941 | return; |
| 942 | } |
| 943 | |
| 944 | prepare_to_open: |
| 945 | if (partialptr) { |
| 946 | st = partial_st; |
| 947 | fnamecmp = partialptr; |
| 948 | fnamecmp_type = FNAMECMP_PARTIAL_DIR; |
| 949 | statret = 0; |
| 950 | } |
| 951 | |
| 952 | if (dry_run || read_batch) |
| 953 | goto notify_others; |
| 954 | if (whole_file > 0) { |
| 955 | if (statret == 0) |
| 956 | statret = 1; |
| 957 | goto notify_others; |
| 958 | } |
| 959 | |
| 960 | if (fuzzy_basis) { |
| 961 | int j = flist_find(fuzzy_dirlist, file); |
| 962 | if (j >= 0) /* don't use changing file as future fuzzy basis */ |
| 963 | fuzzy_dirlist->files[j]->flags |= FLAG_NO_FUZZY; |
| 964 | } |
| 965 | |
| 966 | /* open the file */ |
| 967 | fd = do_open(fnamecmp, O_RDONLY, 0); |
| 968 | |
| 969 | if (fd == -1) { |
| 970 | rsyserr(FERROR, errno, "failed to open %s, continuing", |
| 971 | full_fname(fnamecmp)); |
| 972 | pretend_missing: |
| 973 | /* pretend the file didn't exist */ |
| 974 | if (preserve_hard_links && hard_link_check(file, HL_SKIP)) |
| 975 | return; |
| 976 | statret = -1; |
| 977 | goto notify_others; |
| 978 | } |
| 979 | |
| 980 | if (inplace && make_backups) { |
| 981 | if (!(backupptr = get_backup_name(fname))) { |
| 982 | close(fd); |
| 983 | return; |
| 984 | } |
| 985 | if (!(back_file = make_file(fname, NULL, NO_FILTERS))) { |
| 986 | close(fd); |
| 987 | goto pretend_missing; |
| 988 | } |
| 989 | if (robust_unlink(backupptr) && errno != ENOENT) { |
| 990 | rsyserr(FERROR, errno, "unlink %s", |
| 991 | full_fname(backupptr)); |
| 992 | free(back_file); |
| 993 | close(fd); |
| 994 | return; |
| 995 | } |
| 996 | if ((f_copy = do_open(backupptr, |
| 997 | O_WRONLY | O_CREAT | O_TRUNC | O_EXCL, 0600)) < 0) { |
| 998 | rsyserr(FERROR, errno, "open %s", |
| 999 | full_fname(backupptr)); |
| 1000 | free(back_file); |
| 1001 | close(fd); |
| 1002 | return; |
| 1003 | } |
| 1004 | fnamecmp_type = FNAMECMP_BACKUP; |
| 1005 | } |
| 1006 | |
| 1007 | if (verbose > 3) { |
| 1008 | rprintf(FINFO, "gen mapped %s of size %.0f\n", |
| 1009 | safe_fname(fnamecmp), (double)st.st_size); |
| 1010 | } |
| 1011 | |
| 1012 | if (verbose > 2) |
| 1013 | rprintf(FINFO, "generating and sending sums for %d\n", ndx); |
| 1014 | |
| 1015 | notify_others: |
| 1016 | write_int(f_out, ndx); |
| 1017 | if (itemizing) { |
| 1018 | int iflags = SID_UPDATING; |
| 1019 | if (always_checksum) |
| 1020 | iflags |= SID_REPORT_CHECKSUM; |
| 1021 | if (fnamecmp_type != FNAMECMP_FNAME) |
| 1022 | iflags |= SID_USING_ALT_BASIS; |
| 1023 | itemize(file, statret, &st, iflags, f_out, -1); |
| 1024 | } |
| 1025 | if (f_out_name >= 0) { |
| 1026 | write_byte(f_out_name, fnamecmp_type); |
| 1027 | if (fnamecmp_type == FNAMECMP_FUZZY) { |
| 1028 | uchar lenbuf[3], *lb = lenbuf; |
| 1029 | int len = strlen(fuzzy_file->basename); |
| 1030 | if (len > 0x7F) { |
| 1031 | #if MAXPATHLEN > 0x7FFF |
| 1032 | *lb++ = len / 0x10000 + 0x80; |
| 1033 | *lb++ = len / 0x100; |
| 1034 | #else |
| 1035 | *lb++ = len / 0x100 + 0x80; |
| 1036 | #endif |
| 1037 | } |
| 1038 | *lb = len; |
| 1039 | write_buf(f_out_name, (char*)lenbuf, lb - lenbuf + 1); |
| 1040 | write_buf(f_out_name, fuzzy_file->basename, len); |
| 1041 | } |
| 1042 | } |
| 1043 | |
| 1044 | if (dry_run || read_batch) |
| 1045 | return; |
| 1046 | |
| 1047 | if (statret == 0) { |
| 1048 | generate_and_send_sums(fd, st.st_size, f_out, f_copy); |
| 1049 | |
| 1050 | if (f_copy >= 0) { |
| 1051 | close(f_copy); |
| 1052 | set_perms(backupptr, back_file, NULL, 0); |
| 1053 | if (verbose > 1) { |
| 1054 | rprintf(FINFO, "backed up %s to %s\n", |
| 1055 | safe_fname(fname), safe_fname(backupptr)); |
| 1056 | } |
| 1057 | free(back_file); |
| 1058 | } |
| 1059 | |
| 1060 | close(fd); |
| 1061 | } else |
| 1062 | write_sum_head(f_out, NULL); |
| 1063 | } |
| 1064 | |
| 1065 | |
| 1066 | void generate_files(int f_out, struct file_list *flist, char *local_name, |
| 1067 | int f_out_name) |
| 1068 | { |
| 1069 | int i; |
| 1070 | int phase = 0; |
| 1071 | char fbuf[MAXPATHLEN]; |
| 1072 | int itemizing, maybe_PERMS_REPORT; |
| 1073 | enum logcode code; |
| 1074 | int need_retouch_dir_times = preserve_times && !omit_dir_times; |
| 1075 | int need_retouch_dir_perms = 0; |
| 1076 | int save_only_existing = only_existing; |
| 1077 | int save_opt_ignore_existing = opt_ignore_existing; |
| 1078 | int allowed_lull = read_batch ? 0 : (io_timeout + 1) / 2; |
| 1079 | int lull_mod = allowed_lull * 5; |
| 1080 | |
| 1081 | if (protocol_version >= 29) { |
| 1082 | itemizing = 1; |
| 1083 | maybe_PERMS_REPORT = log_format_has_i ? 0 : PERMS_REPORT; |
| 1084 | code = daemon_log_format_has_i ? 0 : FLOG; |
| 1085 | } else if (am_daemon) { |
| 1086 | itemizing = daemon_log_format_has_i && !dry_run; |
| 1087 | maybe_PERMS_REPORT = PERMS_REPORT; |
| 1088 | code = itemizing || dry_run ? FCLIENT : FINFO; |
| 1089 | } else if (!am_server) { |
| 1090 | itemizing = log_format_has_i; |
| 1091 | maybe_PERMS_REPORT = log_format_has_i ? 0 : PERMS_REPORT; |
| 1092 | code = itemizing ? 0 : FINFO; |
| 1093 | } else { |
| 1094 | itemizing = 0; |
| 1095 | maybe_PERMS_REPORT = PERMS_REPORT; |
| 1096 | code = FINFO; |
| 1097 | } |
| 1098 | |
| 1099 | if (verbose > 2) { |
| 1100 | rprintf(FINFO, "generator starting pid=%ld count=%d\n", |
| 1101 | (long)getpid(), flist->count); |
| 1102 | } |
| 1103 | |
| 1104 | if (delete_before && !local_name && flist->count > 0) |
| 1105 | do_delete_pass(flist, allowed_lull); |
| 1106 | |
| 1107 | if (verbose >= 2) { |
| 1108 | rprintf(FINFO, "delta-transmission %s\n", |
| 1109 | whole_file > 0 |
| 1110 | ? "disabled for local transfer or --whole-file" |
| 1111 | : "enabled"); |
| 1112 | } |
| 1113 | |
| 1114 | if (protocol_version < 29) |
| 1115 | ignore_timeout = 1; |
| 1116 | |
| 1117 | for (i = 0; i < flist->count; i++) { |
| 1118 | struct file_struct *file = flist->files[i]; |
| 1119 | struct file_struct copy; |
| 1120 | |
| 1121 | if (!file->basename) |
| 1122 | continue; |
| 1123 | |
| 1124 | /* We need to ensure that any dirs we create have writeable |
| 1125 | * permissions during the time we are putting files within |
| 1126 | * them. This is then fixed after the transfer is done. */ |
| 1127 | if (!am_root && S_ISDIR(file->mode) && !(file->mode & S_IWUSR)) { |
| 1128 | copy = *file; |
| 1129 | copy.mode |= S_IWUSR; /* user write */ |
| 1130 | file = © |
| 1131 | need_retouch_dir_perms = 1; |
| 1132 | } |
| 1133 | |
| 1134 | recv_generator(local_name ? local_name : f_name_to(file, fbuf), |
| 1135 | flist, file, i, itemizing, maybe_PERMS_REPORT, |
| 1136 | code, allowed_lull, f_out, f_out_name); |
| 1137 | |
| 1138 | if (allowed_lull && !(i % lull_mod)) |
| 1139 | maybe_send_keepalive(allowed_lull, flist->count); |
| 1140 | } |
| 1141 | recv_generator(NULL, NULL, NULL, 0, 0, 0, code, 0, -1, -1); |
| 1142 | if (delete_during) |
| 1143 | delete_in_dir(NULL, NULL, NULL, 0); |
| 1144 | |
| 1145 | phase++; |
| 1146 | csum_length = SUM_LENGTH; |
| 1147 | only_existing = max_size = opt_ignore_existing = 0; |
| 1148 | update_only = always_checksum = size_only = 0; |
| 1149 | ignore_times = 1; |
| 1150 | make_backups = 0; /* avoid a duplicate backup for inplace processing */ |
| 1151 | |
| 1152 | /* We expect to just sit around now, so don't exit on a timeout. |
| 1153 | * If we really get a timeout then the other process should exit. */ |
| 1154 | ignore_timeout = 1; |
| 1155 | |
| 1156 | if (verbose > 2) |
| 1157 | rprintf(FINFO,"generate_files phase=%d\n",phase); |
| 1158 | |
| 1159 | write_int(f_out, -1); |
| 1160 | |
| 1161 | /* files can cycle through the system more than once |
| 1162 | * to catch initial checksum errors */ |
| 1163 | while ((i = get_redo_num()) != -1) { |
| 1164 | struct file_struct *file = flist->files[i]; |
| 1165 | recv_generator(local_name ? local_name : f_name_to(file, fbuf), |
| 1166 | flist, file, i, itemizing, maybe_PERMS_REPORT, |
| 1167 | code, allowed_lull, f_out, f_out_name); |
| 1168 | } |
| 1169 | |
| 1170 | phase++; |
| 1171 | only_existing = save_only_existing; |
| 1172 | opt_ignore_existing = save_opt_ignore_existing; |
| 1173 | |
| 1174 | if (verbose > 2) |
| 1175 | rprintf(FINFO,"generate_files phase=%d\n",phase); |
| 1176 | |
| 1177 | write_int(f_out, -1); |
| 1178 | |
| 1179 | /* Read post-redo-phase MSG_DONE and any prior messages. */ |
| 1180 | get_redo_num(); |
| 1181 | |
| 1182 | if (preserve_hard_links) |
| 1183 | do_hard_links(allowed_lull, flist->count); |
| 1184 | |
| 1185 | if (delete_after && !local_name && flist->count > 0) |
| 1186 | do_delete_pass(flist, allowed_lull); |
| 1187 | |
| 1188 | if ((need_retouch_dir_perms || need_retouch_dir_times) |
| 1189 | && !list_only && !local_name && !dry_run) { |
| 1190 | int j = 0; |
| 1191 | /* Now we need to fix any directory permissions that were |
| 1192 | * modified during the transfer and/or re-set any tweaked |
| 1193 | * modified-time values. */ |
| 1194 | for (i = 0; i < flist->count; i++) { |
| 1195 | struct file_struct *file = flist->files[i]; |
| 1196 | if (!file->basename || !S_ISDIR(file->mode)) |
| 1197 | continue; |
| 1198 | if (!need_retouch_dir_times && file->mode & S_IWUSR) |
| 1199 | continue; |
| 1200 | recv_generator(local_name ? local_name : f_name(file), |
| 1201 | flist, file, i, itemizing, |
| 1202 | maybe_PERMS_REPORT, code, allowed_lull, |
| 1203 | -1, -1); |
| 1204 | if (allowed_lull && !(j++ % lull_mod)) |
| 1205 | maybe_send_keepalive(allowed_lull, flist->count); |
| 1206 | } |
| 1207 | } |
| 1208 | recv_generator(NULL, NULL, NULL, 0, 0, 0, code, 0, -1, -1); |
| 1209 | |
| 1210 | if (verbose > 2) |
| 1211 | rprintf(FINFO,"generate_files finished\n"); |
| 1212 | } |