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 * @todo Get rid of the string_area optimization. Efficiently
25 * allocating blocks is the responsibility of the system's malloc
26 * library, not of rsync.
28 * @sa http://lists.samba.org/pipermail/rsync/2000-June/002351.html
34 extern struct stats stats;
37 extern int do_progress;
39 extern int always_checksum;
41 extern int ignore_errors;
43 extern int cvs_exclude;
46 extern char curr_dir[MAXPATHLEN];
47 extern char *files_from;
48 extern int filesfrom_fd;
50 extern int one_file_system;
51 extern int make_backups;
52 extern int preserve_links;
53 extern int preserve_hard_links;
54 extern int preserve_perms;
55 extern int preserve_devices;
56 extern int preserve_uid;
57 extern int preserve_gid;
58 extern int preserve_times;
59 extern int relative_paths;
60 extern int implied_dirs;
61 extern int copy_links;
62 extern int copy_unsafe_links;
63 extern int protocol_version;
64 extern int sanitize_paths;
66 extern int read_batch;
67 extern int write_batch;
69 extern struct exclude_struct **exclude_list;
70 extern struct exclude_struct **server_exclude_list;
71 extern struct exclude_struct **local_exclude_list;
75 static struct file_struct null_file;
76 static char empty_sum[MD4_SUM_LENGTH];
78 static void clean_flist(struct file_list *flist, int strip_root, int no_dups);
81 static int show_filelist_p(void)
83 return verbose && (recurse || files_from) && !am_server;
86 static void start_filelist_progress(char *kind)
88 rprintf(FINFO, "%s ... ", kind);
89 if ((verbose > 1) || do_progress)
95 static void emit_filelist_progress(const struct file_list *flist)
97 rprintf(FINFO, " %d files...\r", flist->count);
101 static void maybe_emit_filelist_progress(const struct file_list *flist)
103 if (do_progress && show_filelist_p() && ((flist->count % 100) == 0))
104 emit_filelist_progress(flist);
108 static void finish_filelist_progress(const struct file_list *flist)
111 /* This overwrites the progress line */
112 rprintf(FINFO, "%d file%sto consider\n",
113 flist->count, flist->count == 1 ? " " : "s ");
115 rprintf(FINFO, "done\n");
118 void show_flist_stats(void)
124 static struct string_area *string_area_new(int size)
126 struct string_area *a;
130 a = new(struct string_area);
132 out_of_memory("string_area_new");
133 a->current = a->base = new_array(char, size);
135 out_of_memory("string_area_new buffer");
136 a->end = a->base + size;
142 static void string_area_free(struct string_area *a)
144 struct string_area *next;
146 for (; a; a = next) {
152 static char *string_area_malloc(struct string_area **ap, int size)
155 struct string_area *a;
157 /* does the request fit into the current space? */
159 if (a->current + size >= a->end) {
160 /* no; get space, move new string_area to front of the list */
161 a = string_area_new(size > ARENA_SIZE ? size : ARENA_SIZE);
166 /* have space; do the "allocation." */
172 static char *string_area_strdup(struct string_area **ap, const char *src)
174 char *dest = string_area_malloc(ap, strlen(src) + 1);
175 return strcpy(dest, src);
178 static void list_file_entry(struct file_struct *f)
183 /* this can happen if duplicate names were removed */
186 permstring(perms, f->mode);
188 if (preserve_links && S_ISLNK(f->mode)) {
189 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
191 (double) f->length, timestring(f->modtime),
192 f_name(f), f->u.link);
194 rprintf(FINFO, "%s %11.0f %s %s\n",
196 (double) f->length, timestring(f->modtime),
203 * Stat either a symlink or its referent, depending on the settings of
204 * copy_links, copy_unsafe_links, etc.
206 * @retval -1 on error
208 * @retval 0 for success
210 * @post If @p path is a symlink, then @p linkbuf (of size @c
211 * MAXPATHLEN) contains the symlink target.
213 * @post @p buffer contains information about the link or the
214 * referrent as appropriate, if they exist.
216 int readlink_stat(const char *path, STRUCT_STAT *buffer, char *linkbuf)
220 return do_stat(path, buffer);
221 if (do_lstat(path, buffer) == -1)
223 if (S_ISLNK(buffer->st_mode)) {
224 int l = readlink((char *) path, linkbuf, MAXPATHLEN - 1);
228 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
230 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
233 return do_stat(path, buffer);
238 return do_stat(path, buffer);
242 int link_stat(const char *path, STRUCT_STAT * buffer)
246 return do_stat(path, buffer);
247 return do_lstat(path, buffer);
249 return do_stat(path, buffer);
254 * This function is used to check if a file should be included/excluded
255 * from the list of files based on its name and type etc. The value of
256 * exclude_level is set to either SERVER_EXCLUDES or ALL_EXCLUDES.
258 static int check_exclude_file(char *fname, int is_dir, int exclude_level)
260 #if 0 /* This currently never happens, so avoid a useless compare. */
261 if (exclude_level == NO_EXCLUDES)
265 /* never exclude '.', even if somebody does --exclude '*' */
266 if (fname[0] == '.' && !fname[1])
268 /* Handle the -R version of the '.' dir. */
269 if (fname[0] == '/') {
270 int len = strlen(fname);
271 if (fname[len-1] == '.' && fname[len-2] == '/')
275 if (server_exclude_list
276 && check_exclude(server_exclude_list, fname, is_dir))
278 if (exclude_level != ALL_EXCLUDES)
280 if (exclude_list && check_exclude(exclude_list, fname, is_dir))
282 if (local_exclude_list
283 && check_exclude(local_exclude_list, fname, is_dir))
288 /* used by the one_file_system code */
289 static dev_t filesystem_dev;
291 static void set_filesystem(char *fname)
294 if (link_stat(fname, &st) != 0)
296 filesystem_dev = st.st_dev;
300 static int to_wire_mode(mode_t mode)
302 if (S_ISLNK(mode) && (_S_IFLNK != 0120000))
303 return (mode & ~(_S_IFMT)) | 0120000;
307 static mode_t from_wire_mode(int mode)
309 if ((mode & (_S_IFMT)) == 0120000 && (_S_IFLNK != 0120000))
310 return (mode & ~(_S_IFMT)) | _S_IFLNK;
311 return (mode_t) mode;
315 static void send_directory(int f, struct file_list *flist, char *dir);
317 static char *flist_dir;
318 static int flist_dir_len;
322 * Make sure @p flist is big enough to hold at least @p flist->count
325 static void flist_expand(struct file_list *flist)
327 if (flist->count >= flist->malloced) {
330 if (flist->malloced < 1000)
331 flist->malloced += 1000;
333 flist->malloced *= 2;
336 new_ptr = realloc_array(flist->files,
337 struct file_struct *,
340 new_ptr = new_array(struct file_struct *,
345 rprintf(FINFO, "expand file_list to %.0f bytes, did%s move\n",
346 (double)sizeof(flist->files[0])
348 (new_ptr == flist->files) ? " not" : "");
351 flist->files = (struct file_struct **) new_ptr;
354 out_of_memory("flist_expand");
358 void send_file_entry(struct file_struct *file, int f, unsigned short base_flags)
360 unsigned short flags;
361 static time_t modtime;
363 static DEV64_T rdev; /* just high bytes in p28 onward */
367 static char lastname[MAXPATHLEN];
368 char *fname, fbuf[MAXPATHLEN];
376 modtime = 0, mode = 0;
383 io_write_phase = "send_file_entry";
385 fname = f_name_to(file, fbuf);
389 if (file->mode == mode)
390 flags |= XMIT_SAME_MODE;
393 if (preserve_devices) {
394 if (protocol_version < 28) {
395 if (IS_DEVICE(mode)) {
396 if (file->u.rdev == rdev) {
397 /* Set both flags to simplify the test
398 * when writing the data. */
399 flags |= XMIT_SAME_RDEV_pre28
400 | XMIT_SAME_HIGH_RDEV;
405 } else if (IS_DEVICE(mode)) {
406 if ((file->u.rdev & ~0xFF) == rdev)
407 flags |= XMIT_SAME_HIGH_RDEV;
409 rdev = file->u.rdev & ~0xFF;
412 if (file->uid == uid)
413 flags |= XMIT_SAME_UID;
416 if (file->gid == gid)
417 flags |= XMIT_SAME_GID;
420 if (file->modtime == modtime)
421 flags |= XMIT_SAME_TIME;
423 modtime = file->modtime;
424 if (file->link_u.idev) {
425 if (file->F_DEV == dev) {
426 if (protocol_version >= 28)
427 flags |= XMIT_SAME_DEV;
430 flags |= XMIT_HAS_IDEV_DATA;
434 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
436 l2 = strlen(fname+l1);
439 flags |= XMIT_SAME_NAME;
441 flags |= XMIT_LONG_NAME;
443 /* We must make sure we don't send a zero flags byte or
444 * the other end will terminate the flist transfer. */
445 if (flags == 0 && !S_ISDIR(mode))
446 flags |= XMIT_TOP_DIR; /* NOTE: no meaning for non-dir */
447 if (protocol_version >= 28) {
448 if ((flags & 0xFF00) || flags == 0) {
449 flags |= XMIT_EXTENDED_FLAGS;
450 write_byte(f, flags);
451 write_byte(f, flags >> 8);
453 write_byte(f, flags);
456 flags |= XMIT_LONG_NAME;
457 write_byte(f, flags);
459 if (flags & XMIT_SAME_NAME)
461 if (flags & XMIT_LONG_NAME)
465 write_buf(f, fname + l1, l2);
467 write_longint(f, file->length);
468 if (!(flags & XMIT_SAME_TIME))
469 write_int(f, modtime);
470 if (!(flags & XMIT_SAME_MODE))
471 write_int(f, to_wire_mode(mode));
472 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
476 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
480 if (preserve_devices && IS_DEVICE(mode)) {
481 /* If XMIT_SAME_HIGH_RDEV is off, XMIT_SAME_RDEV_pre28 is
482 * also off. Also, avoid using "rdev" because it may be
484 if (!(flags & XMIT_SAME_HIGH_RDEV))
485 write_int(f, file->u.rdev);
486 else if (protocol_version >= 28)
487 write_byte(f, file->u.rdev);
491 if (preserve_links && S_ISLNK(mode)) {
492 write_int(f, strlen(file->u.link));
493 write_buf(f, file->u.link, strlen(file->u.link));
497 #if SUPPORT_HARD_LINKS
498 if (flags & XMIT_HAS_IDEV_DATA) {
499 if (protocol_version < 26) {
500 /* 32-bit dev_t and ino_t */
502 write_int(f, file->F_INODE);
504 /* 64-bit dev_t and ino_t */
505 if (!(flags & XMIT_SAME_DEV))
506 write_longint(f, dev);
507 write_longint(f, file->F_INODE);
512 if (always_checksum) {
516 else if (protocol_version < 28) {
517 /* Prior to 28, we sent a useless set of nulls. */
522 write_buf(f, sum, protocol_version < 21? 2
527 strlcpy(lastname, fname, MAXPATHLEN);
529 io_write_phase = "unknown";
534 void receive_file_entry(struct file_struct **fptr, unsigned short flags, int f)
536 static time_t modtime;
538 static DEV64_T rdev; /* just high bytes in p28 onward */
542 static char lastname[MAXPATHLEN];
543 char thisname[MAXPATHLEN];
544 unsigned int l1 = 0, l2 = 0;
546 struct file_struct *file;
549 modtime = 0, mode = 0;
556 if (flags & XMIT_SAME_NAME)
559 if (flags & XMIT_LONG_NAME)
564 file = new(struct file_struct);
566 out_of_memory("receive_file_entry");
567 memset((char *) file, 0, sizeof(*file));
570 if (l2 >= MAXPATHLEN - l1) {
572 "overflow: flags=0x%x l1=%d l2=%d lastname=%s\n",
573 flags, l1, l2, lastname);
574 overflow("receive_file_entry");
577 strlcpy(thisname, lastname, l1 + 1);
578 read_sbuf(f, &thisname[l1], l2);
579 thisname[l1 + l2] = 0;
581 strlcpy(lastname, thisname, MAXPATHLEN);
582 lastname[MAXPATHLEN - 1] = 0;
584 clean_fname(thisname);
586 if (sanitize_paths) {
587 sanitize_path(thisname, NULL);
590 if ((p = strrchr(thisname, '/'))) {
591 static char *lastdir;
593 if (lastdir && strcmp(thisname, lastdir) == 0)
594 file->dirname = lastdir;
596 file->dirname = strdup(thisname);
597 lastdir = file->dirname;
599 file->basename = strdup(p + 1);
601 file->dirname = NULL;
602 file->basename = strdup(thisname);
606 out_of_memory("receive_file_entry 1");
608 file->flags = flags & XMIT_TOP_DIR ? FLAG_TOP_DIR : 0;
609 file->length = read_longint(f);
610 if (!(flags & XMIT_SAME_TIME))
611 modtime = (time_t)read_int(f);
612 file->modtime = modtime;
613 if (!(flags & XMIT_SAME_MODE))
614 mode = from_wire_mode(read_int(f));
618 if (!(flags & XMIT_SAME_UID))
619 uid = (uid_t)read_int(f);
623 if (!(flags & XMIT_SAME_GID))
624 gid = (gid_t)read_int(f);
627 if (preserve_devices) {
628 if (protocol_version < 28) {
629 if (IS_DEVICE(mode)) {
630 if (!(flags & XMIT_SAME_RDEV_pre28))
631 rdev = (DEV64_T)read_int(f);
635 } else if (IS_DEVICE(mode)) {
636 if (!(flags & XMIT_SAME_HIGH_RDEV)) {
637 file->u.rdev = (DEV64_T)read_int(f);
638 rdev = file->u.rdev & ~0xFF;
640 file->u.rdev = rdev | (DEV64_T)read_byte(f);
644 if (preserve_links && S_ISLNK(mode)) {
647 rprintf(FERROR, "overflow: l=%d\n", l);
648 overflow("receive_file_entry");
650 if (!(file->u.link = new_array(char, l + 1)))
651 out_of_memory("receive_file_entry 2");
652 read_sbuf(f, file->u.link, l);
654 sanitize_path(file->u.link, file->dirname);
656 #if SUPPORT_HARD_LINKS
657 if (preserve_hard_links && protocol_version < 28 && S_ISREG(mode))
658 flags |= XMIT_HAS_IDEV_DATA;
659 if (flags & XMIT_HAS_IDEV_DATA) {
660 if (!(file->link_u.idev = new(struct idev)))
661 out_of_memory("file inode data");
662 if (protocol_version < 26) {
664 file->F_INODE = read_int(f);
666 if (!(flags & XMIT_SAME_DEV))
667 dev = read_longint(f);
668 file->F_INODE = read_longint(f);
674 if (always_checksum) {
677 sum = file->u.sum = new_array(char, MD4_SUM_LENGTH);
679 out_of_memory("md4 sum");
680 } else if (protocol_version < 28) {
681 /* Prior to 28, we get a useless set of nulls. */
686 read_buf(f, sum, protocol_version < 21? 2
691 if (!preserve_perms) {
692 extern int orig_umask;
693 /* set an appropriate set of permissions based on original
694 * permissions and umask. This emulates what GNU cp does */
695 file->mode &= ~orig_umask;
700 /* determine if a file in a different filesystem should be skipped
701 when one_file_system is set. We bascally only want to include
702 the mount points - but they can be hard to find! */
703 static int skip_filesystem(char *fname, STRUCT_STAT * st)
706 char *p = strrchr(fname, '/');
708 /* skip all but directories */
709 if (!S_ISDIR(st->st_mode))
712 /* if its not a subdirectory then allow */
717 if (link_stat(fname, &st2)) {
723 return (st2.st_dev != filesystem_dev);
726 #define STRDUP(ap, p) (ap ? string_area_strdup(ap, p) : strdup(p))
727 /* IRIX cc cares that the operands to the ternary have the same type. */
728 #define MALLOC(ap, i) (ap ? (void*) string_area_malloc(ap, i) : malloc(i))
731 * Create a file_struct for a named file by reading its stat()
732 * information and performing extensive checks against global
735 * @return the new file, or NULL if there was an error or this file
736 * should be excluded.
738 * @todo There is a small optimization opportunity here to avoid
739 * stat()ing the file in some circumstances, which has a certain cost.
740 * We are called immediately after doing readdir(), and so we may
741 * already know the d_type of the file. We could for example avoid
742 * statting directories if we're not recursing, but this is not a very
743 * important case. Some systems may not have d_type.
745 struct file_struct *make_file(char *fname, struct string_area **ap,
748 struct file_struct *file;
750 char sum[SUM_LENGTH];
752 char cleaned_name[MAXPATHLEN];
753 char linkbuf[MAXPATHLEN];
755 if (strlcpy(cleaned_name, fname, sizeof cleaned_name)
756 >= sizeof cleaned_name - flist_dir_len) {
757 rprintf(FINFO, "skipping overly long name: %s\n", fname);
760 clean_fname(cleaned_name);
762 sanitize_path(cleaned_name, NULL);
763 fname = cleaned_name;
765 memset(sum, 0, SUM_LENGTH);
767 if (readlink_stat(fname, &st, linkbuf) != 0) {
768 int save_errno = errno;
769 if (errno == ENOENT && exclude_level != NO_EXCLUDES) {
770 /* either symlink pointing nowhere or file that
771 * was removed during rsync run; see if excluded
772 * before reporting an error */
773 if (check_exclude_file(fname, 0, exclude_level)) {
774 /* file is excluded anyway, ignore silently */
778 io_error |= IOERR_GENERAL;
779 rprintf(FERROR, "readlink %s failed: %s\n",
780 full_fname(fname), strerror(save_errno));
784 /* backup.c calls us with exclude_level set to NO_EXCLUDES. */
785 if (exclude_level == NO_EXCLUDES)
788 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
789 rprintf(FINFO, "skipping directory %s\n", fname);
793 if (one_file_system && st.st_dev != filesystem_dev) {
794 if (skip_filesystem(fname, &st))
798 if (check_exclude_file(fname, S_ISDIR(st.st_mode) != 0, exclude_level))
801 if (lp_ignore_nonreadable(module_id) && access(fname, R_OK) != 0)
807 rprintf(FINFO, "make_file(%s,*,%d)\n", fname, exclude_level);
809 file = new(struct file_struct);
811 out_of_memory("make_file");
812 memset((char *) file, 0, sizeof(*file));
814 if ((p = strrchr(fname, '/'))) {
815 static char *lastdir;
817 if (lastdir && strcmp(fname, lastdir) == 0)
818 file->dirname = lastdir;
820 file->dirname = strdup(fname);
821 lastdir = file->dirname;
823 file->basename = STRDUP(ap, p + 1);
826 file->dirname = NULL;
827 file->basename = STRDUP(ap, fname);
830 file->modtime = st.st_mtime;
831 file->length = st.st_size;
832 file->mode = st.st_mode;
833 file->uid = st.st_uid;
834 file->gid = st.st_gid;
835 if (preserve_hard_links) {
836 if (protocol_version < 28 ? S_ISREG(st.st_mode)
837 : !S_ISDIR(st.st_mode) && st.st_nlink > 1) {
838 if (!(file->link_u.idev = new(struct idev)))
839 out_of_memory("file inode data");
840 file->F_DEV = st.st_dev;
841 file->F_INODE = st.st_ino;
844 #ifdef HAVE_STRUCT_STAT_ST_RDEV
845 if (IS_DEVICE(st.st_mode))
846 file->u.rdev = st.st_rdev;
850 if (S_ISLNK(st.st_mode))
851 file->u.link = STRDUP(ap, linkbuf);
854 if (always_checksum && S_ISREG(st.st_mode)) {
855 if (!(file->u.sum = (char*)MALLOC(ap, MD4_SUM_LENGTH)))
856 out_of_memory("md4 sum");
857 file_checksum(fname, file->u.sum, st.st_size);
860 file->basedir = flist_dir;
862 if (!S_ISDIR(st.st_mode))
863 stats.total_size += st.st_size;
869 void send_file_name(int f, struct file_list *flist, char *fname,
870 int recursive, unsigned short base_flags)
872 struct file_struct *file;
873 char fbuf[MAXPATHLEN];
874 extern int delete_excluded;
876 /* f is set to -1 when calculating deletion file list */
877 file = make_file(fname, &flist->string_area,
878 f == -1 && delete_excluded? SERVER_EXCLUDES
884 maybe_emit_filelist_progress(flist);
889 file->flags |= FLAG_TOP_DIR;
891 if (file->basename[0]) {
892 flist->files[flist->count++] = file;
893 send_file_entry(file, f, base_flags);
896 if (S_ISDIR(file->mode) && recursive) {
897 struct exclude_struct **last_exclude_list = local_exclude_list;
898 send_directory(f, flist, f_name_to(file, fbuf));
899 local_exclude_list = last_exclude_list;
905 static void send_directory(int f, struct file_list *flist, char *dir)
909 char fname[MAXPATHLEN];
915 io_error |= IOERR_GENERAL;
916 rprintf(FERROR, "opendir %s failed: %s\n",
917 full_fname(dir), strerror(errno));
921 offset = strlcpy(fname, dir, MAXPATHLEN);
923 if (offset >= MAXPATHLEN || p[-1] != '/') {
924 if (offset >= MAXPATHLEN - 1) {
925 io_error |= IOERR_GENERAL;
926 rprintf(FERROR, "skipping long-named directory: %s\n",
935 local_exclude_list = NULL;
938 if (strlcpy(p, ".cvsignore", MAXPATHLEN - offset)
939 < MAXPATHLEN - offset)
940 add_exclude_file(&local_exclude_list,fname,MISSING_OK,ADD_EXCLUDE);
942 io_error |= IOERR_GENERAL;
944 "cannot cvs-exclude in long-named directory %s\n",
949 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
950 char *dname = d_name(di);
951 if (dname[0] == '.' && (dname[1] == '\0'
952 || (dname[1] == '.' && dname[2] == '\0')))
954 if (strlcpy(p, dname, MAXPATHLEN - offset) < MAXPATHLEN - offset)
955 send_file_name(f, flist, fname, recurse, 0);
957 io_error |= IOERR_GENERAL;
959 "cannot send long-named file %s\n",
964 io_error |= IOERR_GENERAL;
965 rprintf(FERROR, "readdir(%s): (%d) %s\n",
966 dir, errno, strerror(errno));
969 if (local_exclude_list)
970 free_exclude_list(&local_exclude_list); /* Zeros pointer too */
977 * The delete_files() function in receiver.c sets f to -1 so that we just
978 * construct the file list in memory without sending it over the wire. It
979 * also has the side-effect of ignoring user-excludes if delete_excluded
980 * is set (so that the delete list includes user-excluded files).
982 struct file_list *send_file_list(int f, int argc, char *argv[])
986 char *p, *dir, olddir[sizeof curr_dir];
987 char lastpath[MAXPATHLEN] = "";
988 struct file_list *flist;
992 if (show_filelist_p() && f != -1)
993 start_filelist_progress("building file list");
995 start_write = stats.total_written;
1000 io_start_buffering_out(f);
1001 if (filesfrom_fd >= 0) {
1002 if (argv[0] && !push_dir(argv[0])) {
1003 rprintf(FERROR, "push_dir %s failed: %s\n",
1004 full_fname(argv[0]), strerror(errno));
1005 exit_cleanup(RERR_FILESELECT);
1012 char fname2[MAXPATHLEN];
1013 char *fname = fname2;
1016 if (read_filesfrom_line(filesfrom_fd, fname) == 0)
1018 sanitize_path(fname, NULL);
1022 strlcpy(fname, *argv++, MAXPATHLEN);
1024 sanitize_path(fname, NULL);
1028 if (fname[l - 1] == '/') {
1029 if (l == 2 && fname[0] == '.') {
1030 /* Turn "./" into just "." rather than "./." */
1032 } else if (l < MAXPATHLEN) {
1038 if (link_stat(fname, &st) != 0) {
1040 io_error |= IOERR_GENERAL;
1041 rprintf(FERROR, "link_stat %s failed: %s\n",
1042 full_fname(fname), strerror(errno));
1047 if (S_ISDIR(st.st_mode) && !recurse && !files_from) {
1048 rprintf(FINFO, "skipping directory %s\n", fname);
1055 if (!relative_paths) {
1056 p = strrchr(fname, '/');
1065 } else if (f != -1 && implied_dirs && (p=strrchr(fname,'/')) && p != fname) {
1066 /* this ensures we send the intermediate directories,
1067 thus getting their permissions right */
1068 char *lp = lastpath, *fn = fname, *slash = fname;
1070 /* Skip any initial directories in our path that we
1071 * have in common with lastpath. */
1072 while (*fn && *lp == *fn) {
1078 if (fn != p || (*lp && *lp != '/')) {
1079 int copy_links_saved = copy_links;
1080 int recurse_saved = recurse;
1081 copy_links = copy_unsafe_links;
1082 /* set recurse to 1 to prevent make_file
1083 * from ignoring directory, but still
1084 * turn off the recursive parameter to
1087 while ((slash = strchr(slash+1, '/')) != 0) {
1089 send_file_name(f, flist, fname, 0, 0);
1092 copy_links = copy_links_saved;
1093 recurse = recurse_saved;
1095 strlcpy(lastpath, fname, sizeof lastpath);
1104 static char *lastdir;
1105 static int lastdir_len;
1107 strcpy(olddir, curr_dir); /* can't overflow */
1109 if (!push_dir(dir)) {
1110 io_error |= IOERR_GENERAL;
1111 rprintf(FERROR, "push_dir %s failed: %s\n",
1112 full_fname(dir), strerror(errno));
1116 if (lastdir && strcmp(lastdir, dir) == 0) {
1117 flist_dir = lastdir;
1118 flist_dir_len = lastdir_len;
1122 flist_dir = lastdir = strdup(dir);
1123 flist_dir_len = lastdir_len = strlen(dir);
1127 if (one_file_system)
1128 set_filesystem(fname);
1130 send_file_name(f, flist, fname, recurse, XMIT_TOP_DIR);
1135 if (!pop_dir(olddir)) {
1136 rprintf(FERROR, "pop_dir %s failed: %s\n",
1137 full_fname(dir), strerror(errno));
1138 exit_cleanup(RERR_FILESELECT);
1144 send_file_entry(NULL, f, 0);
1146 if (show_filelist_p())
1147 finish_filelist_progress(flist);
1150 clean_flist(flist, 0, 0);
1153 /* Now send the uid/gid list. This was introduced in
1154 * protocol version 15 */
1157 /* send the io_error flag */
1158 write_int(f, lp_ignore_errors(module_id) ? 0 : io_error);
1161 stats.flist_size = stats.total_written - start_write;
1162 stats.num_files = flist->count;
1164 write_batch_flist_info(flist->count, flist->files);
1168 rprintf(FINFO, "send_file_list done\n");
1174 struct file_list *recv_file_list(int f)
1176 struct file_list *flist;
1177 unsigned short flags;
1179 extern int list_only;
1181 if (show_filelist_p())
1182 start_filelist_progress("receiving file list");
1184 start_read = stats.total_read;
1186 flist = new(struct file_list);
1191 flist->malloced = 1000;
1192 flist->files = new_array(struct file_struct *, flist->malloced);
1197 while ((flags = read_byte(f)) != 0) {
1198 int i = flist->count;
1200 flist_expand(flist);
1202 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1203 flags |= read_byte(f) << 8;
1204 receive_file_entry(&flist->files[i], flags, f);
1206 if (S_ISREG(flist->files[i]->mode))
1207 stats.total_size += flist->files[i]->length;
1211 maybe_emit_filelist_progress(flist);
1214 rprintf(FINFO, "recv_file_name(%s)\n",
1215 f_name(flist->files[i]));
1218 receive_file_entry(NULL, 0, 0); /* Signal that we're done. */
1221 rprintf(FINFO, "received %d names\n", flist->count);
1223 if (show_filelist_p())
1224 finish_filelist_progress(flist);
1226 clean_flist(flist, relative_paths, 1);
1229 /* Now send the uid/gid list. This was introduced in
1230 * protocol version 15 */
1231 recv_uid_list(f, flist);
1234 /* Recv the io_error flag */
1235 if (lp_ignore_errors(module_id) || ignore_errors)
1238 io_error |= read_int(f);
1244 for (i = 0; i < flist->count; i++)
1245 list_file_entry(flist->files[i]);
1249 rprintf(FINFO, "recv_file_list done\n");
1251 stats.flist_size = stats.total_read - start_read;
1252 stats.num_files = flist->count;
1257 out_of_memory("recv_file_list");
1258 return NULL; /* not reached */
1262 int file_compare(struct file_struct **file1, struct file_struct **file2)
1264 struct file_struct *f1 = *file1;
1265 struct file_struct *f2 = *file2;
1267 if (!f1->basename && !f2->basename)
1273 if (f1->dirname == f2->dirname)
1274 return u_strcmp(f1->basename, f2->basename);
1275 return f_name_cmp(f1, f2);
1279 int flist_find(struct file_list *flist, struct file_struct *f)
1281 int low = 0, high = flist->count - 1;
1283 while (high >= 0 && !flist->files[high]->basename) high--;
1288 while (low != high) {
1289 int mid = (low + high) / 2;
1290 int ret = file_compare(&flist->files[flist_up(flist, mid)],&f);
1292 return flist_up(flist, mid);
1299 if (file_compare(&flist->files[flist_up(flist, low)], &f) == 0)
1300 return flist_up(flist, low);
1308 void free_file(struct file_struct *file)
1313 free(file->basename);
1314 if (!IS_DEVICE(file->mode) && file->u.link)
1315 free(file->u.link); /* Handles u.sum too. */
1316 if (file->link_u.idev)
1317 free((char*)file->link_u.idev); /* Handles link_u.links too. */
1323 * allocate a new file list
1325 struct file_list *flist_new(void)
1327 struct file_list *flist;
1329 flist = new(struct file_list);
1331 out_of_memory("send_file_list");
1334 flist->malloced = 0;
1335 flist->files = NULL;
1338 flist->string_area = string_area_new(0);
1340 flist->string_area = NULL;
1346 * free up all elements in a flist
1348 void flist_free(struct file_list *flist)
1351 for (i = 1; i < flist->count; i++) {
1352 if (!flist->string_area)
1353 free_file(flist->files[i]);
1354 free(flist->files[i]);
1356 /* FIXME: I don't think we generally need to blank the flist
1357 * since it's about to be freed. This will just cause more
1358 * memory traffic. If you want a freed-memory debugger, you
1359 * know where to get it. */
1360 memset((char *) flist->files, 0,
1361 sizeof(flist->files[0]) * flist->count);
1363 if (flist->string_area)
1364 string_area_free(flist->string_area);
1365 memset((char *) flist, 0, sizeof(*flist));
1371 * This routine ensures we don't have any duplicate names in our file list.
1372 * duplicate names can cause corruption because of the pipelining
1374 static void clean_flist(struct file_list *flist, int strip_root, int no_dups)
1378 if (!flist || flist->count == 0)
1381 qsort(flist->files, flist->count,
1382 sizeof(flist->files[0]), (int (*)()) file_compare);
1384 for (i = no_dups? 0 : flist->count; i < flist->count; i++) {
1385 if (flist->files[i]->basename) {
1390 while (++i < flist->count) {
1391 if (!flist->files[i]->basename)
1393 if (f_name_cmp(flist->files[i], flist->files[prev_i]) == 0) {
1394 if (verbose > 1 && !am_server) {
1396 "removing duplicate name %s from file list %d\n",
1397 f_name(flist->files[i]), i);
1399 /* Make sure that if we unduplicate '.', that we don't
1400 * lose track of a user-specified starting point (or
1401 * else deletions will mysteriously fail with -R). */
1402 if (flist->files[i]->flags & FLAG_TOP_DIR)
1403 flist->files[prev_i]->flags |= FLAG_TOP_DIR;
1404 /* it's not great that the flist knows the semantics of
1405 * the file memory usage, but i'd rather not add a flag
1406 * byte to that struct.
1407 * XXX can i use a bit in the flags field? */
1408 if (flist->string_area)
1409 flist->files[i][0] = null_file;
1411 free_file(flist->files[i]);
1417 /* we need to strip off the root directory in the case
1418 of relative paths, but this must be done _after_
1419 the sorting phase */
1420 for (i = 0; i < flist->count; i++) {
1421 if (flist->files[i]->dirname &&
1422 flist->files[i]->dirname[0] == '/') {
1423 memmove(&flist->files[i]->dirname[0],
1424 &flist->files[i]->dirname[1],
1425 strlen(flist->files[i]->dirname));
1428 if (flist->files[i]->dirname &&
1429 !flist->files[i]->dirname[0]) {
1430 flist->files[i]->dirname = NULL;
1438 for (i = 0; i < flist->count; i++) {
1439 rprintf(FINFO, "[%ld] i=%d %s %s mode=0%o len=%.0f\n",
1441 NS(flist->files[i]->dirname),
1442 NS(flist->files[i]->basename),
1443 (int) flist->files[i]->mode,
1444 (double) flist->files[i]->length);
1449 enum fnc_state { fnc_DIR, fnc_SLASH, fnc_BASE };
1451 /* Compare the names of two file_struct entities, just like strcmp()
1452 * would do if it were operating on the joined strings. We assume
1453 * that there are no 0-length strings.
1455 int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
1458 const uchar *c1, *c2;
1459 enum fnc_state state1, state2;
1461 if (!f1 || !f1->basename) {
1462 if (!f2 || !f2->basename)
1466 if (!f2 || !f2->basename)
1469 if (!(c1 = (uchar*)f1->dirname)) {
1471 c1 = (uchar*)f1->basename;
1474 if (!(c2 = (uchar*)f2->dirname)) {
1476 c2 = (uchar*)f2->basename;
1481 if ((dif = (int)*c1 - (int)*c2) != 0)
1491 c1 = (uchar*)f1->basename;
1505 c2 = (uchar*)f2->basename;
1519 /* Return a copy of the full filename of a flist entry, using the indicated
1520 * buffer. No size-checking is done because we checked the size when creating
1521 * the file_struct entry.
1523 char *f_name_to(struct file_struct *f, char *fbuf)
1525 if (!f || !f->basename)
1529 int len = strlen(f->dirname);
1530 memcpy(fbuf, f->dirname, len);
1532 strcpy(fbuf + len + 1, f->basename);
1534 strcpy(fbuf, f->basename);
1539 /* Like f_name_to(), but we rotate through 5 static buffers of our own.
1541 char *f_name(struct file_struct *f)
1543 static char names[5][MAXPATHLEN];
1544 static unsigned int n;
1546 n = (n + 1) % (sizeof names / sizeof names[0]);
1548 return f_name_to(f, names[n]);