2 * Generate and receive file lists.
4 * Copyright (C) 1996 Andrew Tridgell
5 * Copyright (C) 1996 Paul Mackerras
6 * Copyright (C) 2001, 2002 Martin Pool <mbp@samba.org>
7 * Copyright (C) 2002, 2003, 2004, 2005, 2006 Wayne Davison
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.
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.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, write to the Free Software Foundation, Inc.,
21 * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.
32 extern int do_progress;
33 extern int always_checksum;
35 extern int ignore_errors;
36 extern int numeric_ids;
39 extern int filesfrom_fd;
40 extern int one_file_system;
41 extern int copy_dirlinks;
42 extern int keep_dirlinks;
43 extern int preserve_links;
44 extern int preserve_hard_links;
45 extern int preserve_devices;
46 extern int preserve_specials;
47 extern int preserve_uid;
48 extern int preserve_gid;
49 extern int relative_paths;
50 extern int implied_dirs;
51 extern int prune_empty_dirs;
52 extern int copy_links;
53 extern int copy_unsafe_links;
54 extern int protocol_version;
55 extern int sanitize_paths;
56 extern struct stats stats;
57 extern struct file_list *the_file_list;
59 extern char curr_dir[MAXPATHLEN];
61 extern struct chmod_mode_struct *chmod_modes;
63 extern struct filter_list_struct filter_list;
64 extern struct filter_list_struct server_filter_list;
68 dev_t filesystem_dev; /* used to implement -x */
69 unsigned int file_struct_len;
71 static char empty_sum[MD4_SUM_LENGTH];
72 static int flist_count_offset;
74 static void clean_flist(struct file_list *flist, int strip_root, int no_dups);
75 static void output_flist(struct file_list *flist);
81 /* Figure out how big the file_struct is without trailing padding */
82 file_struct_len = offsetof(struct file_struct, flags) + sizeof f.flags;
83 checksum_len = protocol_version < 21 ? 2 : MD4_SUM_LENGTH;
86 static int show_filelist_p(void)
88 return verbose && xfer_dirs && !am_server;
91 static void start_filelist_progress(char *kind)
93 rprintf(FCLIENT, "%s ... ", kind);
94 if (verbose > 1 || do_progress)
95 rprintf(FCLIENT, "\n");
99 static void emit_filelist_progress(int count)
101 rprintf(FCLIENT, " %d files...\r", count);
104 static void maybe_emit_filelist_progress(int count)
106 if (do_progress && show_filelist_p() && (count % 100) == 0)
107 emit_filelist_progress(count);
110 static void finish_filelist_progress(const struct file_list *flist)
113 /* This overwrites the progress line */
114 rprintf(FINFO, "%d file%sto consider\n",
115 flist->count, flist->count == 1 ? " " : "s ");
117 rprintf(FINFO, "done\n");
120 void show_flist_stats(void)
125 static void list_file_entry(struct file_struct *f)
127 char permbuf[PERMSTRING_SIZE];
130 /* this can happen if duplicate names were removed */
134 permstring(permbuf, f->mode);
137 if (preserve_links && S_ISLNK(f->mode)) {
138 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
140 (double)f->length, timestring(f->modtime),
141 f_name(f, NULL), f->u.link);
145 rprintf(FINFO, "%s %11.0f %s %s\n",
147 (double)f->length, timestring(f->modtime),
152 /* Stat either a symlink or its referent, depending on the settings of
153 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
155 * If path is the name of a symlink, then the linkbuf buffer (which must hold
156 * MAXPATHLEN chars) will be set to the symlink's target string.
158 * The stat structure pointed to by stp will contain information about the
159 * link or the referent as appropriate, if they exist. */
160 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
163 if (link_stat(path, stp, copy_dirlinks) < 0)
165 if (S_ISLNK(stp->st_mode)) {
166 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
169 linkbuf[llen] = '\0';
170 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
172 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
175 return do_stat(path, stp);
180 return do_stat(path, stp);
184 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
188 return do_stat(path, stp);
189 if (do_lstat(path, stp) < 0)
191 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
193 if (do_stat(path, &st) == 0 && S_ISDIR(st.st_mode))
198 return do_stat(path, stp);
202 /* This function is used to check if a file should be included/excluded
203 * from the list of files based on its name and type etc. The value of
204 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
205 static int is_excluded(char *fname, int is_dir, int filter_level)
207 #if 0 /* This currently never happens, so avoid a useless compare. */
208 if (filter_level == NO_FILTERS)
212 /* never exclude '.', even if somebody does --exclude '*' */
213 if (fname[0] == '.' && !fname[1])
215 /* Handle the -R version of the '.' dir. */
216 if (fname[0] == '/') {
217 int len = strlen(fname);
218 if (fname[len-1] == '.' && fname[len-2] == '/')
222 if (server_filter_list.head
223 && check_filter(&server_filter_list, fname, is_dir) < 0)
225 if (filter_level != ALL_FILTERS)
228 && check_filter(&filter_list, fname, is_dir) < 0)
233 static int to_wire_mode(mode_t mode)
236 #if _S_IFLNK != 0120000
238 return (mode & ~(_S_IFMT)) | 0120000;
244 static mode_t from_wire_mode(int mode)
246 #if _S_IFLNK != 0120000
247 if ((mode & (_S_IFMT)) == 0120000)
248 return (mode & ~(_S_IFMT)) | _S_IFLNK;
253 static void send_directory(int f, struct file_list *flist,
254 char *fbuf, int len);
256 static char *flist_dir;
257 static int flist_dir_len;
261 * Make sure @p flist is big enough to hold at least @p flist->count
264 void flist_expand(struct file_list *flist)
266 struct file_struct **new_ptr;
268 if (flist->count < flist->malloced)
271 if (flist->malloced < FLIST_START)
272 flist->malloced = FLIST_START;
273 else if (flist->malloced >= FLIST_LINEAR)
274 flist->malloced += FLIST_LINEAR;
276 flist->malloced *= 2;
279 * In case count jumped or we are starting the list
280 * with a known size just set it.
282 if (flist->malloced < flist->count)
283 flist->malloced = flist->count;
285 new_ptr = realloc_array(flist->files, struct file_struct *,
288 if (verbose >= 2 && flist->malloced != FLIST_START) {
289 rprintf(FCLIENT, "[%s] expand file_list to %.0f bytes, did%s move\n",
291 (double)sizeof flist->files[0] * flist->malloced,
292 (new_ptr == flist->files) ? " not" : "");
295 flist->files = new_ptr;
298 out_of_memory("flist_expand");
301 static void send_file_entry(struct file_struct *file, int f)
303 unsigned short flags;
304 static time_t modtime;
308 static uint32 rdev_major;
311 static char lastname[MAXPATHLEN];
312 char fname[MAXPATHLEN];
320 modtime = 0, mode = 0;
321 dev = 0, rdev = MAKEDEV(0, 0);
330 flags = file->flags & XMIT_TOP_DIR;
332 if (file->mode == mode)
333 flags |= XMIT_SAME_MODE;
336 if ((preserve_devices && IS_DEVICE(mode))
337 || (preserve_specials && IS_SPECIAL(mode))) {
338 if (protocol_version < 28) {
339 if (file->u.rdev == rdev)
340 flags |= XMIT_SAME_RDEV_pre28;
345 if ((uint32)major(rdev) == rdev_major)
346 flags |= XMIT_SAME_RDEV_MAJOR;
348 rdev_major = major(rdev);
349 if ((uint32)minor(rdev) <= 0xFFu)
350 flags |= XMIT_RDEV_MINOR_IS_SMALL;
352 } else if (protocol_version < 28)
353 rdev = MAKEDEV(0, 0);
354 if (file->uid == uid)
355 flags |= XMIT_SAME_UID;
358 if (file->gid == gid)
359 flags |= XMIT_SAME_GID;
362 if (file->modtime == modtime)
363 flags |= XMIT_SAME_TIME;
365 modtime = file->modtime;
367 #ifdef SUPPORT_HARD_LINKS
368 if (file->link_u.idev) {
369 if (file->F_DEV == dev) {
370 if (protocol_version >= 28)
371 flags |= XMIT_SAME_DEV;
374 flags |= XMIT_HAS_IDEV_DATA;
379 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
381 l2 = strlen(fname+l1);
384 flags |= XMIT_SAME_NAME;
386 flags |= XMIT_LONG_NAME;
388 /* We must make sure we don't send a zero flag byte or the
389 * other end will terminate the flist transfer. Note that
390 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
391 * it's harmless way to add a bit to the first flag byte. */
392 if (protocol_version >= 28) {
393 if (!flags && !S_ISDIR(mode))
394 flags |= XMIT_TOP_DIR;
395 if ((flags & 0xFF00) || !flags) {
396 flags |= XMIT_EXTENDED_FLAGS;
397 write_byte(f, flags);
398 write_byte(f, flags >> 8);
400 write_byte(f, flags);
403 flags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
404 write_byte(f, flags);
406 if (flags & XMIT_SAME_NAME)
408 if (flags & XMIT_LONG_NAME)
412 write_buf(f, fname + l1, l2);
414 write_longint(f, file->length);
415 if (!(flags & XMIT_SAME_TIME))
416 write_int(f, modtime);
417 if (!(flags & XMIT_SAME_MODE))
418 write_int(f, to_wire_mode(mode));
419 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
424 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
429 if ((preserve_devices && IS_DEVICE(mode))
430 || (preserve_specials && IS_SPECIAL(mode))) {
431 if (protocol_version < 28) {
432 if (!(flags & XMIT_SAME_RDEV_pre28))
433 write_int(f, (int)rdev);
435 if (!(flags & XMIT_SAME_RDEV_MAJOR))
436 write_int(f, major(rdev));
437 if (flags & XMIT_RDEV_MINOR_IS_SMALL)
438 write_byte(f, minor(rdev));
440 write_int(f, minor(rdev));
445 if (preserve_links && S_ISLNK(mode)) {
446 int len = strlen(file->u.link);
448 write_buf(f, file->u.link, len);
452 #ifdef SUPPORT_HARD_LINKS
453 if (file->link_u.idev) {
454 if (protocol_version < 26) {
455 /* 32-bit dev_t and ino_t */
457 write_int(f, file->F_INODE);
459 /* 64-bit dev_t and ino_t */
460 if (!(flags & XMIT_SAME_DEV))
461 write_longint(f, dev);
462 write_longint(f, file->F_INODE);
467 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
472 /* Prior to 28, we sent a useless set of nulls. */
475 write_buf(f, sum, checksum_len);
478 strlcpy(lastname, fname, MAXPATHLEN);
481 static struct file_struct *receive_file_entry(struct file_list *flist,
482 unsigned short flags, int f)
484 static time_t modtime;
488 static uint32 rdev_major;
491 static char lastname[MAXPATHLEN], *lastdir;
492 static int lastdir_depth, lastdir_len = -1;
493 static unsigned int del_hier_name_len = 0;
494 static int in_del_hier = 0;
495 char thisname[MAXPATHLEN];
496 unsigned int l1 = 0, l2 = 0;
497 int alloc_len, basename_len, dirname_len, linkname_len, sum_len;
499 char *basename, *dirname, *bp;
500 struct file_struct *file;
503 modtime = 0, mode = 0;
504 dev = 0, rdev = MAKEDEV(0, 0);
513 if (flags & XMIT_SAME_NAME)
516 if (flags & XMIT_LONG_NAME)
521 if (l2 >= MAXPATHLEN - l1) {
523 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
524 flags, l1, l2, lastname);
525 overflow_exit("receive_file_entry");
528 strlcpy(thisname, lastname, l1 + 1);
529 read_sbuf(f, &thisname[l1], l2);
530 thisname[l1 + l2] = 0;
532 strlcpy(lastname, thisname, MAXPATHLEN);
534 clean_fname(thisname, 0);
537 sanitize_path(thisname, thisname, "", 0, NULL);
539 if ((basename = strrchr(thisname, '/')) != NULL) {
540 dirname_len = ++basename - thisname; /* counts future '\0' */
541 if (lastdir_len == dirname_len - 1
542 && strncmp(thisname, lastdir, lastdir_len) == 0) {
544 dirname_len = 0; /* indicates no copy is needed */
552 basename_len = strlen(basename) + 1; /* count the '\0' */
554 file_length = read_longint(f);
555 if (!(flags & XMIT_SAME_TIME))
556 modtime = (time_t)read_int(f);
557 if (!(flags & XMIT_SAME_MODE))
558 mode = from_wire_mode(read_int(f));
560 if (chmod_modes && !S_ISLNK(mode))
561 mode = tweak_mode(mode, chmod_modes);
563 if (preserve_uid && !(flags & XMIT_SAME_UID))
564 uid = (uid_t)read_int(f);
565 if (preserve_gid && !(flags & XMIT_SAME_GID))
566 gid = (gid_t)read_int(f);
568 if ((preserve_devices && IS_DEVICE(mode))
569 || (preserve_specials && IS_SPECIAL(mode))) {
570 if (protocol_version < 28) {
571 if (!(flags & XMIT_SAME_RDEV_pre28))
572 rdev = (dev_t)read_int(f);
575 if (!(flags & XMIT_SAME_RDEV_MAJOR))
576 rdev_major = read_int(f);
577 if (flags & XMIT_RDEV_MINOR_IS_SMALL)
578 rdev_minor = read_byte(f);
580 rdev_minor = read_int(f);
581 rdev = MAKEDEV(rdev_major, rdev_minor);
583 } else if (protocol_version < 28)
584 rdev = MAKEDEV(0, 0);
587 if (preserve_links && S_ISLNK(mode)) {
588 linkname_len = read_int(f) + 1; /* count the '\0' */
589 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
590 rprintf(FERROR, "overflow: linkname_len=%d\n",
592 overflow_exit("receive_file_entry");
599 sum_len = always_checksum && S_ISREG(mode) ? MD4_SUM_LENGTH : 0;
601 alloc_len = file_struct_len + dirname_len + basename_len
602 + linkname_len + sum_len;
603 bp = pool_alloc(flist->file_pool, alloc_len, "receive_file_entry");
605 file = (struct file_struct *)bp;
606 memset(bp, 0, file_struct_len);
607 bp += file_struct_len;
609 file->modtime = modtime;
610 file->length = file_length;
616 file->dirname = lastdir = bp;
617 lastdir_len = dirname_len - 1;
618 memcpy(bp, dirname, dirname_len - 1);
621 lastdir_depth = count_dir_elements(lastdir);
622 file->dir.depth = lastdir_depth + 1;
623 } else if (dirname) {
624 file->dirname = dirname; /* we're reusing lastname */
625 file->dir.depth = lastdir_depth + 1;
630 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
632 if (flags & XMIT_TOP_DIR) {
633 in_del_hier = recurse;
634 del_hier_name_len = file->dir.depth == 0 ? 0 : l1 + l2;
635 if (relative_paths && del_hier_name_len > 2
636 && lastname[del_hier_name_len-1] == '.'
637 && lastname[del_hier_name_len-2] == '/')
638 del_hier_name_len -= 2;
639 file->flags |= FLAG_TOP_DIR | FLAG_DEL_HERE;
640 } else if (in_del_hier) {
641 if (!relative_paths || !del_hier_name_len
642 || (l1 >= del_hier_name_len
643 && lastname[del_hier_name_len] == '/'))
644 file->flags |= FLAG_DEL_HERE;
651 memcpy(bp, basename, basename_len);
654 if ((preserve_devices && IS_DEVICE(mode))
655 || (preserve_specials && IS_SPECIAL(mode)))
661 read_sbuf(f, bp, linkname_len - 1);
663 sanitize_path(bp, bp, "", lastdir_depth, NULL);
668 #ifdef SUPPORT_HARD_LINKS
669 if (preserve_hard_links && protocol_version < 28 && S_ISREG(mode))
670 flags |= XMIT_HAS_IDEV_DATA;
671 if (flags & XMIT_HAS_IDEV_DATA) {
673 if (protocol_version < 26) {
677 if (!(flags & XMIT_SAME_DEV))
678 dev = read_longint(f);
679 inode = read_longint(f);
681 if (flist->hlink_pool) {
682 file->link_u.idev = pool_talloc(flist->hlink_pool,
683 struct idev, 1, "inode_table");
684 file->F_INODE = inode;
690 if (always_checksum && (sum_len || protocol_version < 28)) {
693 file->u.sum = sum = bp;
696 /* Prior to 28, we get a useless set of nulls. */
699 read_buf(f, sum, checksum_len);
706 * Create a file_struct for a named file by reading its stat()
707 * information and performing extensive checks against global
710 * @return the new file, or NULL if there was an error or this file
711 * should be excluded.
713 * @todo There is a small optimization opportunity here to avoid
714 * stat()ing the file in some circumstances, which has a certain cost.
715 * We are called immediately after doing readdir(), and so we may
716 * already know the d_type of the file. We could for example avoid
717 * statting directories if we're not recursing, but this is not a very
718 * important case. Some systems may not have d_type.
720 struct file_struct *make_file(char *fname, struct file_list *flist,
721 STRUCT_STAT *stp, unsigned short flags,
724 static char *lastdir;
725 static int lastdir_len = -1;
726 struct file_struct *file;
728 char sum[SUM_LENGTH];
729 char thisname[MAXPATHLEN];
730 char linkname[MAXPATHLEN];
731 int alloc_len, basename_len, dirname_len, linkname_len, sum_len;
732 char *basename, *dirname, *bp;
734 if (!flist || !flist->count) /* Ignore lastdir when invalid. */
737 if (strlcpy(thisname, fname, sizeof thisname)
738 >= sizeof thisname - flist_dir_len) {
739 rprintf(FINFO, "skipping overly long name: %s\n", fname);
742 clean_fname(thisname, 0);
744 sanitize_path(thisname, thisname, "", 0, NULL);
746 memset(sum, 0, SUM_LENGTH);
748 if (stp && S_ISDIR(stp->st_mode)) {
749 st = *stp; /* Needed for "symlink/." with --relative. */
750 *linkname = '\0'; /* make IBM code checker happy */
751 } else if (readlink_stat(thisname, &st, linkname) != 0) {
752 int save_errno = errno;
753 /* See if file is excluded before reporting an error. */
754 if (filter_level != NO_FILTERS
755 && is_excluded(thisname, 0, filter_level))
757 if (save_errno == ENOENT) {
759 /* Avoid "vanished" error if symlink points nowhere. */
760 if (copy_links && do_lstat(thisname, &st) == 0
761 && S_ISLNK(st.st_mode)) {
762 io_error |= IOERR_GENERAL;
763 rprintf(FERROR, "symlink has no referent: %s\n",
764 full_fname(thisname));
768 enum logcode c = am_daemon && protocol_version < 28
770 io_error |= IOERR_VANISHED;
771 rprintf(c, "file has vanished: %s\n",
772 full_fname(thisname));
775 io_error |= IOERR_GENERAL;
776 rsyserr(FERROR, save_errno, "readlink %s failed",
777 full_fname(thisname));
782 /* backup.c calls us with filter_level set to NO_FILTERS. */
783 if (filter_level == NO_FILTERS)
786 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
787 rprintf(FINFO, "skipping directory %s\n", thisname);
791 /* We only care about directories because we need to avoid recursing
792 * into a mount-point directory, not to avoid copying a symlinked
793 * file if -L (or similar) was specified. */
794 if (one_file_system && st.st_dev != filesystem_dev
795 && S_ISDIR(st.st_mode)) {
796 if (one_file_system > 1) {
798 rprintf(FINFO, "skipping mount-point dir %s\n",
803 flags |= FLAG_MOUNT_POINT;
806 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level))
809 if (lp_ignore_nonreadable(module_id)) {
811 if (!S_ISLNK(st.st_mode))
813 if (access(thisname, R_OK) != 0)
820 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
821 who_am_i(), thisname, filter_level);
824 if ((basename = strrchr(thisname, '/')) != NULL) {
825 dirname_len = ++basename - thisname; /* counts future '\0' */
826 if (lastdir_len == dirname_len - 1
827 && strncmp(thisname, lastdir, lastdir_len) == 0) {
829 dirname_len = 0; /* indicates no copy is needed */
837 basename_len = strlen(basename) + 1; /* count the '\0' */
840 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
845 sum_len = always_checksum && am_sender && S_ISREG(st.st_mode)
846 ? MD4_SUM_LENGTH : 0;
848 alloc_len = file_struct_len + dirname_len + basename_len
849 + linkname_len + sum_len;
851 bp = pool_alloc(flist->file_pool, alloc_len, "make_file");
853 if (!(bp = new_array(char, alloc_len)))
854 out_of_memory("make_file");
857 file = (struct file_struct *)bp;
858 memset(bp, 0, file_struct_len);
859 bp += file_struct_len;
862 file->modtime = st.st_mtime;
863 file->length = st.st_size;
864 file->mode = st.st_mode;
865 file->uid = st.st_uid;
866 file->gid = st.st_gid;
868 #ifdef SUPPORT_HARD_LINKS
869 if (flist && flist->hlink_pool) {
870 if (protocol_version < 28) {
871 if (S_ISREG(st.st_mode))
872 file->link_u.idev = pool_talloc(
873 flist->hlink_pool, struct idev, 1,
876 if (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
877 file->link_u.idev = pool_talloc(
878 flist->hlink_pool, struct idev, 1,
882 if (file->link_u.idev) {
883 file->F_DEV = st.st_dev;
884 file->F_INODE = st.st_ino;
889 file->dirname = lastdir = bp;
890 lastdir_len = dirname_len - 1;
891 memcpy(bp, dirname, dirname_len - 1);
895 file->dirname = dirname;
898 memcpy(bp, basename, basename_len);
901 #ifdef HAVE_STRUCT_STAT_ST_RDEV
902 if ((preserve_devices && IS_DEVICE(st.st_mode))
903 || (preserve_specials && IS_SPECIAL(st.st_mode)))
904 file->u.rdev = st.st_rdev;
910 memcpy(bp, linkname, linkname_len);
917 file_checksum(thisname, bp, st.st_size);
921 file->dir.root = flist_dir;
923 /* This code is only used by the receiver when it is building
924 * a list of files for a delete pass. */
925 if (keep_dirlinks && linkname_len && flist) {
927 int save_mode = file->mode;
928 file->mode = S_IFDIR; /* Find a directory with our name. */
929 if (flist_find(the_file_list, file) >= 0
930 && do_stat(thisname, &st2) == 0 && S_ISDIR(st2.st_mode)) {
931 file->modtime = st2.st_mtime;
932 file->length = st2.st_size;
933 file->mode = st2.st_mode;
934 file->uid = st2.st_uid;
935 file->gid = st2.st_gid;
938 file->mode = save_mode;
941 if (S_ISREG(st.st_mode) || S_ISLNK(st.st_mode))
942 stats.total_size += st.st_size;
947 static struct file_struct *send_file_name(int f, struct file_list *flist,
948 char *fname, STRUCT_STAT *stp,
949 unsigned short flags)
951 struct file_struct *file;
953 file = make_file(fname, flist, stp, flags,
954 f == -2 ? SERVER_FILTERS : ALL_FILTERS);
958 if (chmod_modes && !S_ISLNK(file->mode))
959 file->mode = tweak_mode(file->mode, chmod_modes);
961 maybe_emit_filelist_progress(flist->count + flist_count_offset);
965 if (file->basename[0]) {
966 flist->files[flist->count++] = file;
967 send_file_entry(file, f);
972 static void send_if_directory(int f, struct file_list *flist,
973 struct file_struct *file,
974 char *fbuf, unsigned int ol)
976 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
978 if (S_ISDIR(file->mode)
979 && !(file->flags & FLAG_MOUNT_POINT) && f_name(file, fbuf)) {
981 unsigned int len = strlen(fbuf);
982 if (len > 1 && fbuf[len-1] == '/')
984 if (len >= MAXPATHLEN - 1) {
985 io_error |= IOERR_GENERAL;
986 rprintf(FERROR, "skipping long-named directory: %s\n",
990 save_filters = push_local_filters(fbuf, len);
991 send_directory(f, flist, fbuf, len);
992 pop_local_filters(save_filters);
999 /* This function is normally called by the sender, but the receiving side also
1000 * calls it from get_dirlist() with f set to -1 so that we just construct the
1001 * file list in memory without sending it over the wire. Also, get_dirlist()
1002 * might call this with f set to -2, which also indicates that local filter
1003 * rules should be ignored. */
1004 static void send_directory(int f, struct file_list *flist,
1005 char *fbuf, int len)
1011 int start = flist->count;
1013 if (!(d = opendir(fbuf))) {
1014 io_error |= IOERR_GENERAL;
1015 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1020 if (len != 1 || *fbuf != '/')
1023 remainder = MAXPATHLEN - (p - fbuf);
1025 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1026 char *dname = d_name(di);
1027 if (dname[0] == '.' && (dname[1] == '\0'
1028 || (dname[1] == '.' && dname[2] == '\0')))
1030 if (strlcpy(p, dname, remainder) >= remainder) {
1031 io_error |= IOERR_GENERAL;
1033 "cannot send long-named file %s\n",
1038 send_file_name(f, flist, fbuf, NULL, 0);
1044 io_error |= IOERR_GENERAL;
1045 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1051 int i, end = flist->count - 1;
1052 for (i = start; i <= end; i++)
1053 send_if_directory(f, flist, flist->files[i], fbuf, len);
1057 struct file_list *send_file_list(int f, int argc, char *argv[])
1061 char *p, *dir, olddir[sizeof curr_dir];
1062 char lastpath[MAXPATHLEN] = "";
1063 struct file_list *flist;
1064 struct timeval start_tv, end_tv;
1068 rprintf(FLOG, "building file list\n");
1069 if (show_filelist_p())
1070 start_filelist_progress("building file list");
1072 start_write = stats.total_written;
1073 gettimeofday(&start_tv, NULL);
1075 flist = flist_new(WITH_HLINK, "send_file_list");
1077 io_start_buffering_out();
1078 if (filesfrom_fd >= 0) {
1079 if (argv[0] && !push_dir(argv[0], 0)) {
1080 rsyserr(FERROR, errno, "push_dir %s failed",
1081 full_fname(argv[0]));
1082 exit_cleanup(RERR_FILESELECT);
1088 char fbuf[MAXPATHLEN];
1093 if (read_filesfrom_line(filesfrom_fd, fbuf) == 0)
1095 sanitize_path(fbuf, fbuf, "", 0, NULL);
1099 strlcpy(fbuf, *argv++, MAXPATHLEN);
1101 sanitize_path(fbuf, fbuf, "", 0, NULL);
1105 if (relative_paths) {
1106 /* We clean up fbuf below. */
1108 } else if (!len || fbuf[len - 1] == '/') {
1109 if (len == 2 && fbuf[0] == '.') {
1110 /* Turn "./" into just "." rather than "./." */
1113 if (len + 1 >= MAXPATHLEN)
1114 overflow_exit("send_file_list");
1119 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1120 && (len == 2 || fbuf[len-3] == '/')) {
1121 if (len + 2 >= MAXPATHLEN)
1122 overflow_exit("send_file_list");
1128 is_dot_dir = fbuf[len-1] == '.'
1129 && (len == 1 || fbuf[len-2] == '/');
1132 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1133 io_error |= IOERR_GENERAL;
1134 rsyserr(FERROR, errno, "link_stat %s failed",
1139 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1140 rprintf(FINFO, "skipping directory %s\n", fbuf);
1147 if (!relative_paths) {
1148 p = strrchr(fbuf, '/');
1155 len -= p - fbuf + 1;
1160 if ((p = strstr(fbuf, "/./")) != NULL) {
1166 len -= p - fbuf + 3;
1170 /* Get rid of trailing "/" and "/.". */
1172 if (fn[len - 1] == '/') {
1174 if (!--len && !dir) {
1179 else if (len >= 2 && fn[len - 1] == '.'
1180 && fn[len - 2] == '/') {
1182 if (!(len -= 2) && !dir) {
1189 if (len == 1 && fn[0] == '/')
1192 /* Reject a ".." dir in the active part of the path. */
1193 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1194 if ((p[2] == '/' || p[2] == '\0')
1195 && (p == fn || p[-1] == '/')) {
1197 "found \"..\" dir in relative path: %s\n",
1199 exit_cleanup(RERR_SYNTAX);
1210 static char *lastdir;
1211 static int lastdir_len;
1213 strlcpy(olddir, curr_dir, sizeof olddir);
1215 if (!push_dir(dir, 0)) {
1216 io_error |= IOERR_GENERAL;
1217 rsyserr(FERROR, errno, "push_dir %s failed",
1222 if (lastdir && strcmp(lastdir, dir) == 0) {
1223 flist_dir = lastdir;
1224 flist_dir_len = lastdir_len;
1226 flist_dir = lastdir = strdup(dir);
1227 flist_dir_len = lastdir_len = strlen(dir);
1232 memmove(fbuf, fn, len + 1);
1234 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1235 /* Send the implied directories at the start of the
1236 * source spec, so we get their permissions right. */
1237 char *lp = lastpath, *slash = fbuf;
1239 /* Skip any initial directories in our path that we
1240 * have in common with lastpath. */
1241 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1246 if (fn != p || (*lp && *lp != '/')) {
1247 int save_copy_links = copy_links;
1248 int save_xfer_dirs = xfer_dirs;
1249 copy_links |= copy_unsafe_links;
1251 while ((slash = strchr(slash+1, '/')) != 0) {
1253 send_file_name(f, flist, fbuf, NULL, 0);
1256 copy_links = save_copy_links;
1257 xfer_dirs = save_xfer_dirs;
1259 strlcpy(lastpath, fbuf, sizeof lastpath);
1264 if (one_file_system)
1265 filesystem_dev = st.st_dev;
1267 if (recurse || (xfer_dirs && is_dot_dir)) {
1268 struct file_struct *file;
1269 file = send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR);
1271 send_if_directory(f, flist, file, fbuf, len);
1273 send_file_name(f, flist, fbuf, &st, 0);
1278 if (!pop_dir(olddir)) {
1279 rsyserr(FERROR, errno, "pop_dir %s failed",
1280 full_fname(olddir));
1281 exit_cleanup(RERR_FILESELECT);
1286 gettimeofday(&end_tv, NULL);
1287 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1288 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1289 if (stats.flist_buildtime == 0)
1290 stats.flist_buildtime = 1;
1293 send_file_entry(NULL, f);
1295 if (show_filelist_p())
1296 finish_filelist_progress(flist);
1298 gettimeofday(&end_tv, NULL);
1299 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1300 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1302 if (flist->hlink_pool) {
1303 pool_destroy(flist->hlink_pool);
1304 flist->hlink_pool = NULL;
1307 /* Sort the list without removing any duplicates. This allows the
1308 * receiving side to ask for any name they like, which gives us the
1309 * flexibility to change the way we unduplicate names in the future
1310 * without causing a compatibility problem with older versions. */
1311 clean_flist(flist, 0, 0);
1315 /* send the io_error flag */
1316 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1319 stats.flist_size = stats.total_written - start_write;
1320 stats.num_files = flist->count;
1323 output_flist(flist);
1326 rprintf(FINFO, "send_file_list done\n");
1331 struct file_list *recv_file_list(int f)
1333 struct file_list *flist;
1334 unsigned short flags;
1337 rprintf(FLOG, "receiving file list\n");
1338 if (show_filelist_p())
1339 start_filelist_progress("receiving file list");
1341 start_read = stats.total_read;
1343 flist = flist_new(WITH_HLINK, "recv_file_list");
1346 flist->malloced = 1000;
1347 flist->files = new_array(struct file_struct *, flist->malloced);
1351 while ((flags = read_byte(f)) != 0) {
1352 struct file_struct *file;
1354 flist_expand(flist);
1356 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1357 flags |= read_byte(f) << 8;
1358 file = receive_file_entry(flist, flags, f);
1360 if (S_ISREG(file->mode) || S_ISLNK(file->mode))
1361 stats.total_size += file->length;
1363 flist->files[flist->count++] = file;
1365 maybe_emit_filelist_progress(flist->count);
1368 rprintf(FINFO, "recv_file_name(%s)\n",
1369 f_name(file, NULL));
1372 receive_file_entry(NULL, 0, 0); /* Signal that we're done. */
1375 rprintf(FINFO, "received %d names\n", flist->count);
1377 if (show_filelist_p())
1378 finish_filelist_progress(flist);
1380 clean_flist(flist, relative_paths, 1);
1383 recv_uid_list(f, flist);
1385 /* Recv the io_error flag */
1386 if (lp_ignore_errors(module_id) || ignore_errors)
1389 io_error |= read_int(f);
1393 output_flist(flist);
1397 for (i = 0; i < flist->count; i++)
1398 list_file_entry(flist->files[i]);
1402 rprintf(FINFO, "recv_file_list done\n");
1404 stats.flist_size = stats.total_read - start_read;
1405 stats.num_files = flist->count;
1410 out_of_memory("recv_file_list");
1411 return NULL; /* not reached */
1414 static int file_compare(struct file_struct **file1, struct file_struct **file2)
1416 return f_name_cmp(*file1, *file2);
1419 /* Search for an identically-named item in the file list. Note that the
1420 * items must agree in their directory-ness, or no match is returned. */
1421 int flist_find(struct file_list *flist, struct file_struct *f)
1423 int low = flist->low, high = flist->high;
1424 int diff, mid, mid_up;
1426 while (low <= high) {
1427 mid = (low + high) / 2;
1428 if (flist->files[mid]->basename)
1431 /* Scan for the next non-empty entry using the cached
1432 * distance values. If the value isn't fully up-to-
1433 * date, update it. */
1434 mid_up = mid + flist->files[mid]->dir.depth;
1435 if (!flist->files[mid_up]->basename) {
1437 mid_up += flist->files[mid_up]->dir.depth;
1438 } while (!flist->files[mid_up]->basename);
1439 flist->files[mid]->dir.depth = mid_up - mid;
1441 if (mid_up > high) {
1442 /* If there's nothing left above us, set high to
1443 * a non-empty entry below us and continue. */
1444 high = mid - flist->files[mid]->length;
1445 if (!flist->files[high]->basename) {
1447 high -= flist->files[high]->length;
1448 } while (!flist->files[high]->basename);
1449 flist->files[mid]->length = mid - high;
1454 diff = f_name_cmp(flist->files[mid_up], f);
1456 if (protocol_version < 29
1457 && S_ISDIR(flist->files[mid_up]->mode)
1458 != S_ISDIR(f->mode))
1471 * Free up any resources a file_struct has allocated
1472 * and clear the file.
1474 void clear_file(struct file_struct *file, struct file_list *flist)
1476 if (flist->hlink_pool && file->link_u.idev)
1477 pool_free(flist->hlink_pool, 0, file->link_u.idev);
1478 memset(file, 0, file_struct_len);
1479 /* In an empty entry, dir.depth is an offset to the next non-empty
1480 * entry. Likewise for length in the opposite direction. We assume
1481 * that we're alone for now since flist_find() will adjust the counts
1482 * it runs into that aren't up-to-date. */
1483 file->length = file->dir.depth = 1;
1487 * allocate a new file list
1489 struct file_list *flist_new(int with_hlink, char *msg)
1491 struct file_list *flist;
1493 flist = new(struct file_list);
1497 memset(flist, 0, sizeof (struct file_list));
1499 if (!(flist->file_pool = pool_create(FILE_EXTENT, 0,
1500 out_of_memory, POOL_INTERN)))
1503 #ifdef SUPPORT_HARD_LINKS
1504 if (with_hlink && preserve_hard_links) {
1505 if (!(flist->hlink_pool = pool_create(HLINK_EXTENT,
1506 sizeof (struct idev), out_of_memory, POOL_INTERN)))
1515 * free up all elements in a flist
1517 void flist_free(struct file_list *flist)
1519 pool_destroy(flist->file_pool);
1520 pool_destroy(flist->hlink_pool);
1526 * This routine ensures we don't have any duplicate names in our file list.
1527 * duplicate names can cause corruption because of the pipelining
1529 static void clean_flist(struct file_list *flist, int strip_root, int no_dups)
1531 char fbuf[MAXPATHLEN];
1536 if (flist->count == 0) {
1541 qsort(flist->files, flist->count,
1542 sizeof flist->files[0], (int (*)())file_compare);
1544 for (i = no_dups? 0 : flist->count; i < flist->count; i++) {
1545 if (flist->files[i]->basename) {
1550 flist->low = prev_i;
1551 while (++i < flist->count) {
1553 struct file_struct *file = flist->files[i];
1555 if (!file->basename)
1557 if (f_name_cmp(file, flist->files[prev_i]) == 0)
1559 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
1560 int save_mode = file->mode;
1561 /* Make sure that this directory doesn't duplicate a
1562 * non-directory earlier in the list. */
1563 flist->high = prev_i;
1564 file->mode = S_IFREG;
1565 j = flist_find(flist, file);
1566 file->mode = save_mode;
1570 struct file_struct *fp = flist->files[j];
1572 /* If one is a dir and the other is not, we want to
1573 * keep the dir because it might have contents in the
1575 if (S_ISDIR(file->mode) != S_ISDIR(fp->mode)) {
1576 if (S_ISDIR(file->mode))
1582 if (verbose > 1 && !am_server) {
1584 "removing duplicate name %s from file list (%d)\n",
1585 f_name(file, fbuf), drop);
1587 /* Make sure we don't lose track of a user-specified
1589 flist->files[keep]->flags |= flist->files[drop]->flags
1590 & (FLAG_TOP_DIR|FLAG_DEL_HERE);
1592 clear_file(flist->files[drop], flist);
1595 if (flist->low == drop) {
1597 j < i && !flist->files[j]->basename;
1606 flist->high = no_dups ? prev_i : flist->count - 1;
1609 /* We need to strip off the leading slashes for relative
1610 * paths, but this must be done _after_ the sorting phase. */
1611 for (i = flist->low; i <= flist->high; i++) {
1612 struct file_struct *file = flist->files[i];
1616 while (*file->dirname == '/')
1618 if (!*file->dirname)
1619 file->dirname = NULL;
1623 if (prune_empty_dirs && no_dups) {
1624 int j, prev_depth = 0;
1626 prev_i = 0; /* It's OK that this isn't really true. */
1628 for (i = flist->low; i <= flist->high; i++) {
1629 struct file_struct *fp, *file = flist->files[i];
1631 /* This temporarily abuses the dir.depth value for a
1632 * directory that is in a chain that might get pruned.
1633 * We restore the old value if it gets a reprieve. */
1634 if (S_ISDIR(file->mode) && file->dir.depth) {
1635 /* Dump empty dirs when coming back down. */
1636 for (j = prev_depth; j >= file->dir.depth; j--) {
1637 fp = flist->files[prev_i];
1638 if (fp->dir.depth >= 0)
1640 prev_i = -fp->dir.depth-1;
1641 clear_file(fp, flist);
1643 prev_depth = file->dir.depth;
1644 if (is_excluded(f_name(file, fbuf), 1,
1646 /* Keep dirs through this dir. */
1647 for (j = prev_depth-1; ; j--) {
1648 fp = flist->files[prev_i];
1649 if (fp->dir.depth >= 0)
1651 prev_i = -fp->dir.depth-1;
1655 file->dir.depth = -prev_i-1;
1658 /* Keep dirs through this non-dir. */
1659 for (j = prev_depth; ; j--) {
1660 fp = flist->files[prev_i];
1661 if (fp->dir.depth >= 0)
1663 prev_i = -fp->dir.depth-1;
1668 /* Dump empty all remaining empty dirs. */
1670 struct file_struct *fp = flist->files[prev_i];
1671 if (fp->dir.depth >= 0)
1673 prev_i = -fp->dir.depth-1;
1674 clear_file(fp, flist);
1677 for (i = flist->low; i <= flist->high; i++) {
1678 if (flist->files[i]->basename)
1682 for (i = flist->high; i >= flist->low; i--) {
1683 if (flist->files[i]->basename)
1690 static void output_flist(struct file_list *flist)
1692 char uidbuf[16], gidbuf[16], depthbuf[16];
1693 struct file_struct *file;
1694 const char *who = who_am_i();
1697 for (i = 0; i < flist->count; i++) {
1698 file = flist->files[i];
1699 if ((am_root || am_sender) && preserve_uid)
1700 sprintf(uidbuf, " uid=%ld", (long)file->uid);
1703 if (preserve_gid && file->gid != GID_NONE)
1704 sprintf(gidbuf, " gid=%ld", (long)file->gid);
1708 sprintf(depthbuf, "%d", file->dir.depth);
1709 rprintf(FINFO, "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
1710 who, i, am_sender ? NS(file->dir.root) : depthbuf,
1711 file->dirname ? file->dirname : "",
1712 file->dirname ? "/" : "", NS(file->basename),
1713 S_ISDIR(file->mode) ? "/" : "", (int)file->mode,
1714 (double)file->length, uidbuf, gidbuf, file->flags);
1718 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
1719 enum fnc_type { t_PATH, t_ITEM };
1721 /* Compare the names of two file_struct entities, similar to how strcmp()
1722 * would do if it were operating on the joined strings.
1724 * Some differences beginning with protocol_version 29: (1) directory names
1725 * are compared with an assumed trailing slash so that they compare in a
1726 * way that would cause them to sort immediately prior to any content they
1727 * may have; (2) a directory of any name compares after a non-directory of
1728 * any name at the same depth; (3) a directory with name "." compares prior
1729 * to anything else. These changes mean that a directory and a non-dir
1730 * with the same name will not compare as equal (protocol_version >= 29).
1732 * The dirname component can be an empty string, but the basename component
1733 * cannot (and never is in the current codebase). The basename component
1734 * may be NULL (for a removed item), in which case it is considered to be
1735 * after any existing item. */
1736 int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
1739 const uchar *c1, *c2;
1740 enum fnc_state state1, state2;
1741 enum fnc_type type1, type2;
1742 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
1744 if (!f1 || !f1->basename) {
1745 if (!f2 || !f2->basename)
1749 if (!f2 || !f2->basename)
1752 c1 = (uchar*)f1->dirname;
1753 c2 = (uchar*)f2->dirname;
1757 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
1758 c1 = (uchar*)f1->basename;
1759 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
1761 state1 = s_TRAILING;
1770 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
1771 c2 = (uchar*)f2->basename;
1772 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
1774 state2 = s_TRAILING;
1784 return type1 == t_PATH ? 1 : -1;
1794 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
1795 c1 = (uchar*)f1->basename;
1796 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
1798 state1 = s_TRAILING;
1804 state1 = s_TRAILING;
1805 if (type1 == t_PATH) {
1814 if (*c2 && type1 != type2)
1815 return type1 == t_PATH ? 1 : -1;
1824 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
1825 c2 = (uchar*)f2->basename;
1826 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
1828 state2 = s_TRAILING;
1834 state2 = s_TRAILING;
1835 if (type2 == t_PATH) {
1847 return type1 == t_PATH ? 1 : -1;
1849 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
1854 /* Return a copy of the full filename of a flist entry, using the indicated
1855 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
1856 * done because we checked the size when creating the file_struct entry.
1858 char *f_name(struct file_struct *f, char *fbuf)
1860 if (!f || !f->basename)
1864 static char names[5][MAXPATHLEN];
1865 static unsigned int n;
1867 n = (n + 1) % (sizeof names / sizeof names[0]);
1873 int len = strlen(f->dirname);
1874 memcpy(fbuf, f->dirname, len);
1876 strcpy(fbuf + len + 1, f->basename);
1878 strcpy(fbuf, f->basename);
1883 /* Do a non-recursive scan of the named directory, possibly ignoring all
1884 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
1885 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
1886 * buffer (the functions we call will append names onto the end, but the old
1887 * dir value will be restored on exit). */
1888 struct file_list *get_dirlist(char *dirname, int dlen,
1889 int ignore_filter_rules)
1891 struct file_list *dirlist;
1892 char dirbuf[MAXPATHLEN];
1893 int save_recurse = recurse;
1894 int save_xfer_dirs = xfer_dirs;
1897 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
1898 if (dlen >= MAXPATHLEN)
1903 dirlist = flist_new(WITHOUT_HLINK, "get_dirlist");
1907 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen);
1908 xfer_dirs = save_xfer_dirs;
1909 recurse = save_recurse;
1911 flist_count_offset += dirlist->count;
1913 clean_flist(dirlist, 0, 0);
1916 output_flist(dirlist);