2 Copyright (C) Andrew Tridgell 1996
3 Copyright (C) Paul Mackerras 1996
4 Copyright (C) 2001, 2002 by Martin Pool <mbp@samba.org>
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.
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.
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.
22 * Generate and receive file lists
24 * @sa http://lists.samba.org/pipermail/rsync/2000-June/002351.html
30 extern struct stats stats;
33 extern int do_progress;
36 extern int always_checksum;
38 extern int ignore_errors;
39 extern int numeric_ids;
41 extern int cvs_exclude;
44 extern char curr_dir[MAXPATHLEN];
45 extern char *files_from;
46 extern int filesfrom_fd;
48 extern int one_file_system;
49 extern int make_backups;
50 extern int preserve_links;
51 extern int preserve_hard_links;
52 extern int preserve_perms;
53 extern int preserve_devices;
54 extern int preserve_uid;
55 extern int preserve_gid;
56 extern int preserve_times;
57 extern int relative_paths;
58 extern int implied_dirs;
59 extern int copy_links;
60 extern int copy_unsafe_links;
61 extern int protocol_version;
62 extern int sanitize_paths;
64 extern int read_batch;
65 extern int write_batch;
67 extern struct exclude_struct **exclude_list;
68 extern struct exclude_struct **server_exclude_list;
69 extern struct exclude_struct **local_exclude_list;
73 static char empty_sum[MD4_SUM_LENGTH];
74 static unsigned int min_file_struct_len;
76 static void clean_flist(struct file_list *flist, int strip_root, int no_dups);
77 static void output_flist(struct file_list *flist);
84 /* Figure out how big the file_struct is without trailing padding */
85 min_file_struct_len = ((char*)&f.flags - (char*)&f) + sizeof f.flags;
89 static int show_filelist_p(void)
91 return verbose && (recurse || files_from) && !am_server;
94 static void start_filelist_progress(char *kind)
96 rprintf(FINFO, "%s ... ", kind);
97 if ((verbose > 1) || do_progress)
103 static void emit_filelist_progress(const struct file_list *flist)
105 rprintf(FINFO, " %d files...\r", flist->count);
109 static void maybe_emit_filelist_progress(const struct file_list *flist)
111 if (do_progress && show_filelist_p() && ((flist->count % 100) == 0))
112 emit_filelist_progress(flist);
116 static void finish_filelist_progress(const struct file_list *flist)
119 /* This overwrites the progress line */
120 rprintf(FINFO, "%d file%sto consider\n",
121 flist->count, flist->count == 1 ? " " : "s ");
123 rprintf(FINFO, "done\n");
126 void show_flist_stats(void)
132 static void list_file_entry(struct file_struct *f)
137 /* this can happen if duplicate names were removed */
140 permstring(perms, f->mode);
143 if (preserve_links && S_ISLNK(f->mode)) {
144 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
146 (double) f->length, timestring(f->modtime),
147 f_name(f), f->u.link);
150 rprintf(FINFO, "%s %11.0f %s %s\n",
152 (double) f->length, timestring(f->modtime),
158 * Stat either a symlink or its referent, depending on the settings of
159 * copy_links, copy_unsafe_links, etc.
161 * @retval -1 on error
163 * @retval 0 for success
165 * @post If @p path is a symlink, then @p linkbuf (of size @c
166 * MAXPATHLEN) contains the symlink target.
168 * @post @p buffer contains information about the link or the
169 * referrent as appropriate, if they exist.
171 int readlink_stat(const char *path, STRUCT_STAT *buffer, char *linkbuf)
175 return do_stat(path, buffer);
176 if (do_lstat(path, buffer) == -1)
178 if (S_ISLNK(buffer->st_mode)) {
179 int l = readlink((char *) path, linkbuf, MAXPATHLEN - 1);
183 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
185 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
188 return do_stat(path, buffer);
193 return do_stat(path, buffer);
197 int link_stat(const char *path, STRUCT_STAT * buffer)
201 return do_stat(path, buffer);
202 return do_lstat(path, buffer);
204 return do_stat(path, buffer);
209 * This function is used to check if a file should be included/excluded
210 * from the list of files based on its name and type etc. The value of
211 * exclude_level is set to either SERVER_EXCLUDES or ALL_EXCLUDES.
213 static int check_exclude_file(char *fname, int is_dir, int exclude_level)
215 #if 0 /* This currently never happens, so avoid a useless compare. */
216 if (exclude_level == NO_EXCLUDES)
220 /* never exclude '.', even if somebody does --exclude '*' */
221 if (fname[0] == '.' && !fname[1])
223 /* Handle the -R version of the '.' dir. */
224 if (fname[0] == '/') {
225 int len = strlen(fname);
226 if (fname[len-1] == '.' && fname[len-2] == '/')
230 if (server_exclude_list
231 && check_exclude(server_exclude_list, fname, is_dir))
233 if (exclude_level != ALL_EXCLUDES)
235 if (exclude_list && check_exclude(exclude_list, fname, is_dir))
237 if (local_exclude_list
238 && check_exclude(local_exclude_list, fname, is_dir))
243 /* used by the one_file_system code */
244 static dev_t filesystem_dev;
246 static void set_filesystem(char *fname)
249 if (link_stat(fname, &st) != 0)
251 filesystem_dev = st.st_dev;
255 static int to_wire_mode(mode_t mode)
258 if (S_ISLNK(mode) && (_S_IFLNK != 0120000))
259 return (mode & ~(_S_IFMT)) | 0120000;
264 static mode_t from_wire_mode(int mode)
266 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000))
267 return (mode & ~(_S_IFMT)) | _S_IFLNK;
268 return (mode_t) mode;
272 static void send_directory(int f, struct file_list *flist, char *dir);
274 static char *flist_dir;
275 static int flist_dir_len;
279 * Make sure @p flist is big enough to hold at least @p flist->count
282 void flist_expand(struct file_list *flist)
286 if (flist->count < flist->malloced)
289 if (flist->malloced < FLIST_START)
290 flist->malloced = FLIST_START;
291 else if (flist->malloced >= FLIST_LINEAR)
292 flist->malloced += FLIST_LINEAR;
294 flist->malloced *= 2;
297 * In case count jumped or we are starting the list
298 * with a known size just set it.
300 if (flist->malloced < flist->count)
301 flist->malloced = flist->count;
304 new_ptr = realloc_array(flist->files,
305 struct file_struct *, flist->malloced);
307 new_ptr = new_array(struct file_struct *, flist->malloced);
311 rprintf(FINFO, "[%s] expand file_list to %.0f bytes, did%s move\n",
313 (double) sizeof flist->files[0] * flist->malloced,
314 (new_ptr == flist->files) ? " not" : "");
317 flist->files = (struct file_struct **) new_ptr;
320 out_of_memory("flist_expand");
323 void send_file_entry(struct file_struct *file, int f, unsigned short base_flags)
325 unsigned short flags;
326 static time_t modtime;
328 static DEV64_T rdev, rdev_high;
332 static char lastname[MAXPATHLEN];
333 char *fname, fbuf[MAXPATHLEN];
341 modtime = 0, mode = 0;
342 rdev = 0, rdev_high = 0, dev = 0;
348 io_write_phase = "send_file_entry";
350 fname = f_name_to(file, fbuf);
354 if (file->mode == mode)
355 flags |= XMIT_SAME_MODE;
358 if (preserve_devices) {
359 if (protocol_version < 28) {
360 if (IS_DEVICE(mode)) {
361 if (file->u.rdev == rdev) {
362 /* Set both flags to simplify the test
363 * when writing the data. */
364 flags |= XMIT_SAME_RDEV_pre28
365 | XMIT_SAME_HIGH_RDEV;
370 } else if (IS_DEVICE(mode)) {
371 if ((file->u.rdev & ~0xFF) == rdev_high)
372 flags |= XMIT_SAME_HIGH_RDEV;
375 rdev_high = rdev & ~0xFF;
379 if (file->uid == uid)
380 flags |= XMIT_SAME_UID;
383 if (file->gid == gid)
384 flags |= XMIT_SAME_GID;
387 if (file->modtime == modtime)
388 flags |= XMIT_SAME_TIME;
390 modtime = file->modtime;
392 #if SUPPORT_HARD_LINKS
393 if (file->link_u.idev) {
394 if (file->F_DEV == dev) {
395 if (protocol_version >= 28)
396 flags |= XMIT_SAME_DEV;
399 flags |= XMIT_HAS_IDEV_DATA;
404 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
406 l2 = strlen(fname+l1);
409 flags |= XMIT_SAME_NAME;
411 flags |= XMIT_LONG_NAME;
413 /* We must make sure we don't send a zero flag byte or the
414 * other end will terminate the flist transfer. Note that
415 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
416 * it's harmless way to add a bit to the first flag byte. */
417 if (protocol_version >= 28) {
418 if (!flags && !S_ISDIR(mode))
419 flags |= XMIT_TOP_DIR;
420 if ((flags & 0xFF00) || !flags) {
421 flags |= XMIT_EXTENDED_FLAGS;
422 write_byte(f, flags);
423 write_byte(f, flags >> 8);
425 write_byte(f, flags);
427 if (!(flags & 0xFF) && !S_ISDIR(mode))
428 flags |= XMIT_TOP_DIR;
430 flags |= XMIT_LONG_NAME;
431 write_byte(f, flags);
433 if (flags & XMIT_SAME_NAME)
435 if (flags & XMIT_LONG_NAME)
439 write_buf(f, fname + l1, l2);
441 write_longint(f, file->length);
442 if (!(flags & XMIT_SAME_TIME))
443 write_int(f, modtime);
444 if (!(flags & XMIT_SAME_MODE))
445 write_int(f, to_wire_mode(mode));
446 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
451 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
456 if (preserve_devices && IS_DEVICE(mode)) {
457 /* If XMIT_SAME_HIGH_RDEV is off, XMIT_SAME_RDEV_pre28 is
459 if (!(flags & XMIT_SAME_HIGH_RDEV))
461 else if (protocol_version >= 28)
466 if (preserve_links && S_ISLNK(mode)) {
467 int len = strlen(file->u.link);
469 write_buf(f, file->u.link, len);
473 #if SUPPORT_HARD_LINKS
474 if (flags & XMIT_HAS_IDEV_DATA) {
475 if (protocol_version < 26) {
476 /* 32-bit dev_t and ino_t */
478 write_int(f, file->F_INODE);
480 /* 64-bit dev_t and ino_t */
481 if (!(flags & XMIT_SAME_DEV))
482 write_longint(f, dev);
483 write_longint(f, file->F_INODE);
488 if (always_checksum) {
492 else if (protocol_version < 28) {
493 /* Prior to 28, we sent a useless set of nulls. */
498 write_buf(f, sum, protocol_version < 21? 2
503 strlcpy(lastname, fname, MAXPATHLEN);
505 io_write_phase = "unknown";
510 void receive_file_entry(struct file_struct **fptr, unsigned short flags, int f)
512 static time_t modtime;
514 static DEV64_T rdev, rdev_high;
518 static char lastname[MAXPATHLEN], *lastdir;
519 static int lastdir_len = -1;
520 char thisname[MAXPATHLEN];
521 unsigned int l1 = 0, l2 = 0;
522 int alloc_len, basename_len, dirname_len, linkname_len, sum_len;
523 int file_struct_len, idev_len;
525 char *basename, *dirname, *bp;
526 struct file_struct *file;
529 modtime = 0, mode = 0;
530 rdev = 0, rdev_high = 0, dev = 0;
536 if (flags & XMIT_SAME_NAME)
539 if (flags & XMIT_LONG_NAME)
544 if (l2 >= MAXPATHLEN - l1) {
546 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
547 flags, l1, l2, lastname);
548 overflow("receive_file_entry");
551 strlcpy(thisname, lastname, l1 + 1);
552 read_sbuf(f, &thisname[l1], l2);
553 thisname[l1 + l2] = 0;
555 strlcpy(lastname, thisname, MAXPATHLEN);
557 clean_fname(thisname);
560 sanitize_path(thisname, NULL);
562 if ((basename = strrchr(thisname, '/')) != NULL) {
563 dirname_len = ++basename - thisname; /* counts future '\0' */
564 if (lastdir_len == dirname_len - 1
565 && strncmp(thisname, lastdir, lastdir_len) == 0) {
567 dirname_len = 0; /* indicates no copy is needed */
575 basename_len = strlen(basename) + 1; /* count the '\0' */
577 file_length = read_longint(f);
578 if (!(flags & XMIT_SAME_TIME))
579 modtime = (time_t)read_int(f);
580 if (!(flags & XMIT_SAME_MODE))
581 mode = from_wire_mode(read_int(f));
583 if (preserve_uid && !(flags & XMIT_SAME_UID))
584 uid = (uid_t)read_int(f);
585 if (preserve_gid && !(flags & XMIT_SAME_GID))
586 gid = (gid_t)read_int(f);
588 if (preserve_devices) {
589 if (protocol_version < 28) {
590 if (IS_DEVICE(mode)) {
591 if (!(flags & XMIT_SAME_RDEV_pre28))
592 rdev = (DEV64_T)read_int(f);
595 } else if (IS_DEVICE(mode)) {
596 if (!(flags & XMIT_SAME_HIGH_RDEV)) {
597 rdev = (DEV64_T)read_int(f);
598 rdev_high = rdev & ~0xFF;
600 rdev = rdev_high | (DEV64_T)read_byte(f);
605 if (preserve_links && S_ISLNK(mode)) {
606 linkname_len = read_int(f) + 1; /* count the '\0' */
607 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
608 rprintf(FERROR, "overflow: linkname_len=%d\n",
610 overflow("receive_file_entry");
617 #if SUPPORT_HARD_LINKS
618 if (preserve_hard_links && protocol_version < 28 && S_ISREG(mode))
619 flags |= XMIT_HAS_IDEV_DATA;
620 if (flags & XMIT_HAS_IDEV_DATA)
621 idev_len = sizeof (struct idev);
626 sum_len = always_checksum && S_ISREG(mode) ? MD4_SUM_LENGTH : 0;
627 file_struct_len = idev_len? sizeof file[0] : min_file_struct_len;
629 alloc_len = file_struct_len + dirname_len + basename_len
630 + linkname_len + sum_len + idev_len;
631 if (!(bp = new_array(char, alloc_len)))
632 out_of_memory("receive_file_entry");
633 file = *fptr = (struct file_struct *)bp;
634 memset(bp, 0, min_file_struct_len);
635 bp += file_struct_len;
637 file->flags = flags & XMIT_TOP_DIR ? FLAG_TOP_DIR : 0;
638 file->modtime = modtime;
639 file->length = file_length;
644 #if SUPPORT_HARD_LINKS
646 file->link_u.idev = (struct idev *)bp;
652 file->dirname = lastdir = bp;
653 lastdir_len = dirname_len - 1;
654 memcpy(bp, dirname, dirname_len - 1);
658 file->dirname = dirname;
661 memcpy(bp, basename, basename_len);
664 if (preserve_devices && IS_DEVICE(mode))
670 read_sbuf(f, bp, linkname_len - 1);
672 sanitize_path(bp, lastdir);
677 #if SUPPORT_HARD_LINKS
679 if (protocol_version < 26) {
681 file->F_INODE = read_int(f);
683 if (!(flags & XMIT_SAME_DEV))
684 dev = read_longint(f);
685 file->F_INODE = read_longint(f);
691 if (always_checksum) {
694 file->u.sum = sum = bp;
696 } else if (protocol_version < 28) {
697 /* Prior to 28, we get a useless set of nulls. */
702 read_buf(f, sum, protocol_version < 21? 2
707 if (!preserve_perms) {
708 extern int orig_umask;
709 /* set an appropriate set of permissions based on original
710 * permissions and umask. This emulates what GNU cp does */
711 file->mode &= ~orig_umask;
717 * Create a file_struct for a named file by reading its stat()
718 * information and performing extensive checks against global
721 * @return the new file, or NULL if there was an error or this file
722 * should be excluded.
724 * @todo There is a small optimization opportunity here to avoid
725 * stat()ing the file in some circumstances, which has a certain cost.
726 * We are called immediately after doing readdir(), and so we may
727 * already know the d_type of the file. We could for example avoid
728 * statting directories if we're not recursing, but this is not a very
729 * important case. Some systems may not have d_type.
731 struct file_struct *make_file(char *fname, int exclude_level)
733 static char *lastdir;
734 static int lastdir_len = -1;
735 struct file_struct *file;
737 char sum[SUM_LENGTH];
738 char thisname[MAXPATHLEN];
739 char linkname[MAXPATHLEN];
740 int alloc_len, basename_len, dirname_len, linkname_len, sum_len;
741 int file_struct_len, idev_len;
742 char *basename, *dirname, *bp;
743 unsigned short flags = 0;
745 if (strlcpy(thisname, fname, sizeof thisname)
746 >= sizeof thisname - flist_dir_len) {
747 rprintf(FINFO, "skipping overly long name: %s\n", fname);
750 clean_fname(thisname);
752 sanitize_path(thisname, NULL);
754 memset(sum, 0, SUM_LENGTH);
756 if (readlink_stat(thisname, &st, linkname) != 0) {
757 int save_errno = errno;
758 if (errno == ENOENT && exclude_level != NO_EXCLUDES) {
759 /* either symlink pointing nowhere or file that
760 * was removed during rsync run; see if excluded
761 * before reporting an error */
762 if (check_exclude_file(thisname, 0, exclude_level)) {
763 /* file is excluded anyway, ignore silently */
767 io_error |= IOERR_GENERAL;
768 rprintf(FERROR, "readlink %s failed: %s\n",
769 full_fname(thisname), strerror(save_errno));
773 /* backup.c calls us with exclude_level set to NO_EXCLUDES. */
774 if (exclude_level == NO_EXCLUDES)
777 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
778 rprintf(FINFO, "skipping directory %s\n", thisname);
782 /* We only care about directories because we need to avoid recursing
783 * into a mount-point directory, not to avoid copying a symlinked
784 * file if -L (or similar) was specified. */
785 if (one_file_system && st.st_dev != filesystem_dev
786 && S_ISDIR(st.st_mode))
787 flags |= FLAG_MOUNT_POINT;
789 if (check_exclude_file(thisname, S_ISDIR(st.st_mode) != 0, exclude_level))
792 if (lp_ignore_nonreadable(module_id) && access(thisname, R_OK) != 0)
798 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
799 who_am_i(), thisname, exclude_level);
802 if ((basename = strrchr(thisname, '/')) != NULL) {
803 dirname_len = ++basename - thisname; /* counts future '\0' */
804 if (lastdir_len == dirname_len - 1
805 && strncmp(thisname, lastdir, lastdir_len) == 0) {
807 dirname_len = 0; /* indicates no copy is needed */
815 basename_len = strlen(basename) + 1; /* count the '\0' */
818 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
823 #if SUPPORT_HARD_LINKS
824 if (preserve_hard_links) {
825 if (protocol_version < 28) {
826 if (S_ISREG(st.st_mode))
827 idev_len = sizeof (struct idev);
831 if (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
832 idev_len = sizeof (struct idev);
840 sum_len = always_checksum && S_ISREG(st.st_mode) ? MD4_SUM_LENGTH : 0;
841 file_struct_len = idev_len? sizeof file[0] : min_file_struct_len;
843 alloc_len = file_struct_len + dirname_len + basename_len
844 + linkname_len + sum_len + idev_len;
845 if (!(bp = new_array(char, alloc_len)))
846 out_of_memory("receive_file_entry");
847 file = (struct file_struct *)bp;
848 memset(bp, 0, min_file_struct_len);
849 bp += file_struct_len;
852 file->modtime = st.st_mtime;
853 file->length = st.st_size;
854 file->mode = st.st_mode;
855 file->uid = st.st_uid;
856 file->gid = st.st_gid;
858 #if SUPPORT_HARD_LINKS
860 file->link_u.idev = (struct idev *)bp;
862 file->F_DEV = st.st_dev;
863 file->F_INODE = st.st_ino;
868 file->dirname = lastdir = bp;
869 lastdir_len = dirname_len - 1;
870 memcpy(bp, dirname, dirname_len - 1);
874 file->dirname = dirname;
877 memcpy(bp, basename, basename_len);
880 #ifdef HAVE_STRUCT_STAT_ST_RDEV
881 if (preserve_devices && IS_DEVICE(st.st_mode))
882 file->u.rdev = st.st_rdev;
888 memcpy(bp, linkname, linkname_len);
895 file_checksum(thisname, bp, st.st_size);
899 file->basedir = flist_dir;
901 if (!S_ISDIR(st.st_mode))
902 stats.total_size += st.st_size;
908 void send_file_name(int f, struct file_list *flist, char *fname,
909 int recursive, unsigned short base_flags)
911 struct file_struct *file;
912 char fbuf[MAXPATHLEN];
913 extern int delete_excluded;
915 /* f is set to -1 when calculating deletion file list */
916 file = make_file(fname,
917 f == -1 && delete_excluded? SERVER_EXCLUDES
923 maybe_emit_filelist_progress(flist);
928 file->flags |= FLAG_TOP_DIR;
930 if (file->basename[0]) {
931 flist->files[flist->count++] = file;
932 send_file_entry(file, f, base_flags);
935 if (recursive && S_ISDIR(file->mode)
936 && !(file->flags & FLAG_MOUNT_POINT)) {
937 struct exclude_struct **last_exclude_list = local_exclude_list;
938 send_directory(f, flist, f_name_to(file, fbuf));
939 local_exclude_list = last_exclude_list;
945 static void send_directory(int f, struct file_list *flist, char *dir)
949 char fname[MAXPATHLEN];
955 io_error |= IOERR_GENERAL;
956 rprintf(FERROR, "opendir %s failed: %s\n",
957 full_fname(dir), strerror(errno));
961 offset = strlcpy(fname, dir, MAXPATHLEN);
963 if (offset >= MAXPATHLEN || p[-1] != '/') {
964 if (offset >= MAXPATHLEN - 1) {
965 io_error |= IOERR_GENERAL;
966 rprintf(FERROR, "skipping long-named directory: %s\n",
975 local_exclude_list = NULL;
978 if (strlcpy(p, ".cvsignore", MAXPATHLEN - offset)
979 < MAXPATHLEN - offset)
980 add_exclude_file(&local_exclude_list,fname,MISSING_OK,ADD_EXCLUDE);
982 io_error |= IOERR_GENERAL;
984 "cannot cvs-exclude in long-named directory %s\n",
989 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
990 char *dname = d_name(di);
991 if (dname[0] == '.' && (dname[1] == '\0'
992 || (dname[1] == '.' && dname[2] == '\0')))
994 if (strlcpy(p, dname, MAXPATHLEN - offset) < MAXPATHLEN - offset)
995 send_file_name(f, flist, fname, recurse, 0);
997 io_error |= IOERR_GENERAL;
999 "cannot send long-named file %s\n",
1004 io_error |= IOERR_GENERAL;
1005 rprintf(FERROR, "readdir(%s): (%d) %s\n",
1006 dir, errno, strerror(errno));
1009 if (local_exclude_list)
1010 free_exclude_list(&local_exclude_list); /* Zeros pointer too */
1017 * The delete_files() function in receiver.c sets f to -1 so that we just
1018 * construct the file list in memory without sending it over the wire. It
1019 * also has the side-effect of ignoring user-excludes if delete_excluded
1020 * is set (so that the delete list includes user-excluded files).
1022 struct file_list *send_file_list(int f, int argc, char *argv[])
1026 char *p, *dir, olddir[sizeof curr_dir];
1027 char lastpath[MAXPATHLEN] = "";
1028 struct file_list *flist;
1032 if (show_filelist_p() && f != -1)
1033 start_filelist_progress("building file list");
1035 start_write = stats.total_written;
1037 flist = flist_new();
1040 io_start_buffering_out(f);
1041 if (filesfrom_fd >= 0) {
1042 if (argv[0] && !push_dir(argv[0])) {
1043 rprintf(FERROR, "push_dir %s failed: %s\n",
1044 full_fname(argv[0]), strerror(errno));
1045 exit_cleanup(RERR_FILESELECT);
1052 char fname2[MAXPATHLEN];
1053 char *fname = fname2;
1056 if (read_filesfrom_line(filesfrom_fd, fname) == 0)
1058 sanitize_path(fname, NULL);
1062 strlcpy(fname, *argv++, MAXPATHLEN);
1064 sanitize_path(fname, NULL);
1068 if (fname[l - 1] == '/') {
1069 if (l == 2 && fname[0] == '.') {
1070 /* Turn "./" into just "." rather than "./." */
1072 } else if (l < MAXPATHLEN) {
1078 if (link_stat(fname, &st) != 0) {
1080 io_error |= IOERR_GENERAL;
1081 rprintf(FERROR, "link_stat %s failed: %s\n",
1082 full_fname(fname), strerror(errno));
1087 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
1088 rprintf(FINFO, "skipping directory %s\n", fname);
1095 if (!relative_paths) {
1096 p = strrchr(fname, '/');
1105 } else if (f != -1 && implied_dirs && (p=strrchr(fname,'/')) && p != fname) {
1106 /* this ensures we send the intermediate directories,
1107 thus getting their permissions right */
1108 char *lp = lastpath, *fn = fname, *slash = fname;
1110 /* Skip any initial directories in our path that we
1111 * have in common with lastpath. */
1112 while (*fn && *lp == *fn) {
1118 if (fn != p || (*lp && *lp != '/')) {
1119 int copy_links_saved = copy_links;
1120 int recurse_saved = recurse;
1121 copy_links = copy_unsafe_links;
1122 /* set recurse to 1 to prevent make_file
1123 * from ignoring directory, but still
1124 * turn off the recursive parameter to
1127 while ((slash = strchr(slash+1, '/')) != 0) {
1129 send_file_name(f, flist, fname, 0, 0);
1132 copy_links = copy_links_saved;
1133 recurse = recurse_saved;
1135 strlcpy(lastpath, fname, sizeof lastpath);
1144 static char *lastdir;
1145 static int lastdir_len;
1147 strcpy(olddir, curr_dir); /* can't overflow */
1149 if (!push_dir(dir)) {
1150 io_error |= IOERR_GENERAL;
1151 rprintf(FERROR, "push_dir %s failed: %s\n",
1152 full_fname(dir), strerror(errno));
1156 if (lastdir && strcmp(lastdir, dir) == 0) {
1157 flist_dir = lastdir;
1158 flist_dir_len = lastdir_len;
1160 flist_dir = lastdir = strdup(dir);
1161 flist_dir_len = lastdir_len = strlen(dir);
1165 if (one_file_system)
1166 set_filesystem(fname);
1168 send_file_name(f, flist, fname, recurse, XMIT_TOP_DIR);
1173 if (!pop_dir(olddir)) {
1174 rprintf(FERROR, "pop_dir %s failed: %s\n",
1175 full_fname(dir), strerror(errno));
1176 exit_cleanup(RERR_FILESELECT);
1182 send_file_entry(NULL, f, 0);
1184 if (show_filelist_p())
1185 finish_filelist_progress(flist);
1188 clean_flist(flist, 0, 0);
1191 /* Now send the uid/gid list. This was introduced in
1192 * protocol version 15 */
1195 /* send the io_error flag */
1196 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1199 stats.flist_size = stats.total_written - start_write;
1200 stats.num_files = flist->count;
1202 write_batch_flist_info(flist->count, flist->files);
1206 output_flist(flist);
1209 rprintf(FINFO, "send_file_list done\n");
1215 struct file_list *recv_file_list(int f)
1217 struct file_list *flist;
1218 unsigned short flags;
1220 extern int list_only;
1222 if (show_filelist_p())
1223 start_filelist_progress("receiving file list");
1225 start_read = stats.total_read;
1227 flist = new(struct file_list);
1232 flist->malloced = 1000;
1233 flist->files = new_array(struct file_struct *, flist->malloced);
1238 while ((flags = read_byte(f)) != 0) {
1239 int i = flist->count;
1241 flist_expand(flist);
1243 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1244 flags |= read_byte(f) << 8;
1245 receive_file_entry(&flist->files[i], flags, f);
1247 if (S_ISREG(flist->files[i]->mode))
1248 stats.total_size += flist->files[i]->length;
1252 maybe_emit_filelist_progress(flist);
1255 rprintf(FINFO, "recv_file_name(%s)\n",
1256 f_name(flist->files[i]));
1259 receive_file_entry(NULL, 0, 0); /* Signal that we're done. */
1262 rprintf(FINFO, "received %d names\n", flist->count);
1264 if (show_filelist_p())
1265 finish_filelist_progress(flist);
1267 clean_flist(flist, relative_paths, 1);
1270 /* Now send the uid/gid list. This was introduced in
1271 * protocol version 15 */
1272 recv_uid_list(f, flist);
1275 /* Recv the io_error flag */
1276 if (lp_ignore_errors(module_id) || ignore_errors)
1279 io_error |= read_int(f);
1284 output_flist(flist);
1288 for (i = 0; i < flist->count; i++)
1289 list_file_entry(flist->files[i]);
1293 rprintf(FINFO, "recv_file_list done\n");
1295 stats.flist_size = stats.total_read - start_read;
1296 stats.num_files = flist->count;
1301 out_of_memory("recv_file_list");
1302 return NULL; /* not reached */
1306 int file_compare(struct file_struct **file1, struct file_struct **file2)
1308 struct file_struct *f1 = *file1;
1309 struct file_struct *f2 = *file2;
1311 if (!f1->basename && !f2->basename)
1317 if (f1->dirname == f2->dirname)
1318 return u_strcmp(f1->basename, f2->basename);
1319 return f_name_cmp(f1, f2);
1323 int flist_find(struct file_list *flist, struct file_struct *f)
1325 int low = 0, high = flist->count - 1;
1327 while (high >= 0 && !flist->files[high]->basename) high--;
1332 while (low != high) {
1333 int mid = (low + high) / 2;
1334 int ret = file_compare(&flist->files[flist_up(flist, mid)],&f);
1336 return flist_up(flist, mid);
1343 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1344 return flist_up(flist, low);
1350 * Free up any resources a file_struct has allocated, and optionally free
1353 void free_file(struct file_struct *file, int free_the_struct)
1355 if (free_the_struct)
1358 memset(file, 0, min_file_struct_len);
1363 * allocate a new file list
1365 struct file_list *flist_new(void)
1367 struct file_list *flist;
1369 flist = new(struct file_list);
1371 out_of_memory("send_file_list");
1374 flist->malloced = 0;
1375 flist->files = NULL;
1381 * free up all elements in a flist
1383 void flist_free(struct file_list *flist)
1386 for (i = 1; i < flist->count; i++)
1387 free_file(flist->files[i], FREE_STRUCT);
1394 * This routine ensures we don't have any duplicate names in our file list.
1395 * duplicate names can cause corruption because of the pipelining
1397 static void clean_flist(struct file_list *flist, int strip_root, int no_dups)
1401 if (!flist || flist->count == 0)
1404 qsort(flist->files, flist->count,
1405 sizeof flist->files[0], (int (*)()) file_compare);
1407 for (i = no_dups? 0 : flist->count; i < flist->count; i++) {
1408 if (flist->files[i]->basename) {
1413 while (++i < flist->count) {
1414 if (!flist->files[i]->basename)
1416 if (f_name_cmp(flist->files[i], flist->files[prev_i]) == 0) {
1417 if (verbose > 1 && !am_server) {
1419 "removing duplicate name %s from file list %d\n",
1420 f_name(flist->files[i]), i);
1422 /* Make sure that if we unduplicate '.', that we don't
1423 * lose track of a user-specified starting point (or
1424 * else deletions will mysteriously fail with -R). */
1425 if (flist->files[i]->flags & FLAG_TOP_DIR)
1426 flist->files[prev_i]->flags |= FLAG_TOP_DIR;
1427 free_file(flist->files[i], CLEAR_STRUCT);
1433 /* we need to strip off the root directory in the case
1434 of relative paths, but this must be done _after_
1435 the sorting phase */
1436 for (i = 0; i < flist->count; i++) {
1437 if (flist->files[i]->dirname &&
1438 flist->files[i]->dirname[0] == '/') {
1439 memmove(&flist->files[i]->dirname[0],
1440 &flist->files[i]->dirname[1],
1441 strlen(flist->files[i]->dirname));
1444 if (flist->files[i]->dirname &&
1445 !flist->files[i]->dirname[0]) {
1446 flist->files[i]->dirname = NULL;
1452 static void output_flist(struct file_list *flist)
1454 char uidbuf[16], gidbuf[16];
1455 struct file_struct *file;
1458 for (i = 0; i < flist->count; i++) {
1459 file = flist->files[i];
1460 if (am_root && preserve_uid)
1461 sprintf(uidbuf, " uid=%ld", (long)file->uid);
1464 if (preserve_gid && file->gid != GID_NONE)
1465 sprintf(gidbuf, " gid=%ld", (long)file->gid);
1468 rprintf(FINFO, "[%s] i=%d %s %s %s mode=0%o len=%.0f%s%s\n",
1469 who_am_i(), i, NS(file->basedir), NS(file->dirname),
1470 NS(file->basename), (int) file->mode,
1471 (double) file->length, uidbuf, gidbuf);
1476 enum fnc_state { fnc_DIR, fnc_SLASH, fnc_BASE };
1478 /* Compare the names of two file_struct entities, just like strcmp()
1479 * would do if it were operating on the joined strings. We assume
1480 * that there are no 0-length strings.
1482 int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
1485 const uchar *c1, *c2;
1486 enum fnc_state state1, state2;
1488 if (!f1 || !f1->basename) {
1489 if (!f2 || !f2->basename)
1493 if (!f2 || !f2->basename)
1496 if (!(c1 = (uchar*)f1->dirname)) {
1498 c1 = (uchar*)f1->basename;
1501 if (!(c2 = (uchar*)f2->dirname)) {
1503 c2 = (uchar*)f2->basename;
1508 if ((dif = (int)*c1 - (int)*c2) != 0)
1518 c1 = (uchar*)f1->basename;
1532 c2 = (uchar*)f2->basename;
1546 /* Return a copy of the full filename of a flist entry, using the indicated
1547 * buffer. No size-checking is done because we checked the size when creating
1548 * the file_struct entry.
1550 char *f_name_to(struct file_struct *f, char *fbuf)
1552 if (!f || !f->basename)
1556 int len = strlen(f->dirname);
1557 memcpy(fbuf, f->dirname, len);
1559 strcpy(fbuf + len + 1, f->basename);
1561 strcpy(fbuf, f->basename);
1566 /* Like f_name_to(), but we rotate through 5 static buffers of our own.
1568 char *f_name(struct file_struct *f)
1570 static char names[5][MAXPATHLEN];
1571 static unsigned int n;
1573 n = (n + 1) % (sizeof names / sizeof names[0]);
1575 return f_name_to(f, names[n]);