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-2007 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 version 2 as
11 * published by the Free Software Foundation.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License along
19 * with this program; if not, write to the Free Software Foundation, Inc.,
20 * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.
33 extern int am_generator;
34 extern int inc_recurse;
35 extern int do_progress;
36 extern int always_checksum;
38 extern int ignore_errors;
39 extern int numeric_ids;
42 extern int filesfrom_fd;
43 extern int one_file_system;
44 extern int copy_dirlinks;
45 extern int keep_dirlinks;
46 extern int preserve_acls;
47 extern int preserve_xattrs;
48 extern int preserve_links;
49 extern int preserve_hard_links;
50 extern int preserve_devices;
51 extern int preserve_specials;
52 extern int preserve_uid;
53 extern int preserve_gid;
54 extern int relative_paths;
55 extern int implied_dirs;
56 extern int file_extra_cnt;
57 extern int ignore_perishable;
58 extern int non_perishable_cnt;
59 extern int prune_empty_dirs;
60 extern int copy_links;
61 extern int copy_unsafe_links;
62 extern int protocol_version;
63 extern int sanitize_paths;
64 extern struct stats stats;
66 extern char curr_dir[MAXPATHLEN];
68 extern struct chmod_mode_struct *chmod_modes;
70 extern struct filter_list_struct filter_list;
71 extern struct filter_list_struct server_filter_list;
75 extern int need_unsorted_flist;
76 extern iconv_t ic_send, ic_recv;
81 dev_t filesystem_dev; /* used to implement -x */
83 struct file_list *cur_flist, *first_flist, *dir_flist;
84 int send_dir_ndx = -1, send_dir_depth = 0;
85 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
86 int file_total = 0; /* total of all active items over all file-lists */
87 int flist_eof = 0; /* all the file-lists are now known */
89 /* The tmp_* vars are used as a cache area by make_file() to store data
90 * that the sender doesn't need to remember in its file list. The data
91 * will survive just long enough to be used by send_file_entry(). */
92 static dev_t tmp_rdev;
93 #ifdef SUPPORT_HARD_LINKS
94 static int64 tmp_dev, tmp_ino;
96 static char tmp_sum[MAX_DIGEST_LEN];
98 static char empty_sum[MAX_DIGEST_LEN];
99 static int flist_count_offset; /* for --delete --progress */
101 static void clean_flist(struct file_list *flist, int strip_root);
102 static void output_flist(struct file_list *flist);
104 void init_flist(void)
107 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
108 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
110 checksum_len = protocol_version < 21 ? 2
111 : protocol_version < 30 ? MD4_DIGEST_LEN
115 static int show_filelist_p(void)
117 return verbose && xfer_dirs && !am_server && !inc_recurse;
120 static void start_filelist_progress(char *kind)
122 rprintf(FCLIENT, "%s ... ", kind);
123 if (verbose > 1 || do_progress)
124 rprintf(FCLIENT, "\n");
128 static void emit_filelist_progress(int count)
130 rprintf(FCLIENT, " %d files...\r", count);
133 static void maybe_emit_filelist_progress(int count)
135 if (do_progress && show_filelist_p() && (count % 100) == 0)
136 emit_filelist_progress(count);
139 static void finish_filelist_progress(const struct file_list *flist)
142 /* This overwrites the progress line */
143 rprintf(FINFO, "%d file%sto consider\n",
144 flist->count, flist->count == 1 ? " " : "s ");
146 rprintf(FINFO, "done\n");
149 void show_flist_stats(void)
154 static void list_file_entry(struct file_struct *f)
156 char permbuf[PERMSTRING_SIZE];
159 if (!F_IS_ACTIVE(f)) {
160 /* this can happen if duplicate names were removed */
164 permstring(permbuf, f->mode);
167 /* TODO: indicate '+' if the entry has an ACL. */
170 if (preserve_links && S_ISLNK(f->mode)) {
171 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
172 permbuf, len, timestring(f->modtime),
173 f_name(f, NULL), F_SYMLINK(f));
177 rprintf(FINFO, "%s %11.0f %s %s\n",
178 permbuf, len, timestring(f->modtime),
183 /* Stat either a symlink or its referent, depending on the settings of
184 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
186 * If path is the name of a symlink, then the linkbuf buffer (which must hold
187 * MAXPATHLEN chars) will be set to the symlink's target string.
189 * The stat structure pointed to by stp will contain information about the
190 * link or the referent as appropriate, if they exist. */
191 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
194 if (link_stat(path, stp, copy_dirlinks) < 0)
196 if (S_ISLNK(stp->st_mode)) {
197 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
200 linkbuf[llen] = '\0';
201 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
203 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
206 return x_stat(path, stp, NULL);
211 return x_stat(path, stp, NULL);
215 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
219 return x_stat(path, stp, NULL);
220 if (x_lstat(path, stp, NULL) < 0)
222 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
224 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
229 return x_stat(path, stp, NULL);
233 /* This function is used to check if a file should be included/excluded
234 * from the list of files based on its name and type etc. The value of
235 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
236 static int is_excluded(char *fname, int is_dir, int filter_level)
238 #if 0 /* This currently never happens, so avoid a useless compare. */
239 if (filter_level == NO_FILTERS)
243 /* never exclude '.', even if somebody does --exclude '*' */
244 if (fname[0] == '.' && !fname[1])
246 /* Handle the -R version of the '.' dir. */
247 if (fname[0] == '/') {
248 int len = strlen(fname);
249 if (fname[len-1] == '.' && fname[len-2] == '/')
253 if (server_filter_list.head
254 && check_filter(&server_filter_list, fname, is_dir) < 0)
256 if (filter_level != ALL_FILTERS)
259 && check_filter(&filter_list, fname, is_dir) < 0)
264 static void send_directory(int f, struct file_list *flist,
265 char *fbuf, int len, int flags);
267 static const char *pathname, *orig_dir;
268 static int pathname_len;
272 * Make sure @p flist is big enough to hold at least @p flist->count
275 void flist_expand(struct file_list *flist)
277 struct file_struct **new_ptr;
279 if (flist->count < flist->malloced)
282 if (flist->malloced < FLIST_START)
283 flist->malloced = FLIST_START;
284 else if (flist->malloced >= FLIST_LINEAR)
285 flist->malloced += FLIST_LINEAR;
287 flist->malloced *= 2;
289 /* In case count jumped or we are starting the list
290 * with a known size just set it. */
291 if (flist->malloced < flist->count)
292 flist->malloced = flist->count;
295 if (inc_recurse && flist == dir_flist && need_unsorted_flist) {
296 flist->sorted = realloc_array(flist->sorted, struct file_struct *,
301 new_ptr = realloc_array(flist->files, struct file_struct *,
304 if (verbose >= 2 && flist->malloced != FLIST_START) {
305 rprintf(FCLIENT, "[%s] expand file_list to %.0f bytes, did%s move\n",
307 (double)sizeof flist->files[0] * flist->malloced,
308 (new_ptr == flist->files) ? " not" : "");
311 flist->files = new_ptr;
314 out_of_memory("flist_expand");
317 int push_pathname(const char *dir, int len)
323 orig_dir = strdup(curr_dir);
325 if (pathname && !pop_dir(orig_dir)) {
326 rsyserr(FERROR, errno, "pop_dir %s failed",
327 full_fname(orig_dir));
328 exit_cleanup(RERR_FILESELECT);
331 if (dir && !push_dir(dir, 0)) {
332 io_error |= IOERR_GENERAL;
333 rsyserr(FERROR, errno, "push_dir %s failed in %s",
334 full_fname(dir), curr_dir);
339 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
344 static void send_file_entry(int f, struct file_struct *file, int ndx)
346 static time_t modtime;
350 static uint32 rdev_major;
353 static char *user_name, *group_name;
354 static char lastname[MAXPATHLEN];
355 char fname[MAXPATHLEN];
356 int first_hlink_ndx = -1;
361 if (ic_send != (iconv_t)-1) {
362 ICONV_CONST char *ibuf;
364 size_t ocnt = MAXPATHLEN, icnt;
366 iconv(ic_send, NULL,0, NULL,0);
367 if ((ibuf = (ICONV_CONST char *)file->dirname) != NULL) {
369 ocnt--; /* pre-subtract the space for the '/' */
370 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1)
375 ibuf = (ICONV_CONST char *)file->basename;
377 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
379 io_error |= IOERR_GENERAL;
381 "[%s] cannot convert filename: %s (%s)\n",
382 who_am_i(), f_name(file, fname), strerror(errno));
390 flags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
392 if (file->mode == mode)
393 flags |= XMIT_SAME_MODE;
396 if ((preserve_devices && IS_DEVICE(mode))
397 || (preserve_specials && IS_SPECIAL(mode))) {
398 if (protocol_version < 28) {
399 if (tmp_rdev == rdev)
400 flags |= XMIT_SAME_RDEV_pre28;
405 if ((uint32)major(rdev) == rdev_major)
406 flags |= XMIT_SAME_RDEV_MAJOR;
408 rdev_major = major(rdev);
409 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
410 flags |= XMIT_RDEV_MINOR_8_pre30;
412 } else if (protocol_version < 28)
413 rdev = MAKEDEV(0, 0);
415 if (F_UID(file) == uid && *lastname)
416 flags |= XMIT_SAME_UID;
419 if (preserve_uid && !numeric_ids) {
420 user_name = add_uid(uid);
421 if (inc_recurse && user_name)
422 flags |= XMIT_USER_NAME_FOLLOWS;
427 if (F_GID(file) == gid && *lastname)
428 flags |= XMIT_SAME_GID;
431 if (preserve_gid && !numeric_ids) {
432 group_name = add_gid(gid);
433 if (inc_recurse && group_name)
434 flags |= XMIT_GROUP_NAME_FOLLOWS;
438 if (file->modtime == modtime)
439 flags |= XMIT_SAME_TIME;
441 modtime = file->modtime;
443 #ifdef SUPPORT_HARD_LINKS
445 if (protocol_version >= 30) {
446 struct idev_node *np = idev_node(tmp_dev, tmp_ino);
447 first_hlink_ndx = (int32)(long)np->data - 1;
448 if (first_hlink_ndx < 0) {
449 np->data = (void*)(long)(ndx + 1);
450 flags |= XMIT_HLINK_FIRST;
452 flags |= XMIT_HLINKED;
454 if (tmp_dev == dev) {
455 if (protocol_version >= 28)
456 flags |= XMIT_SAME_DEV_pre30;
459 flags |= XMIT_HLINKED;
465 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
467 l2 = strlen(fname+l1);
470 flags |= XMIT_SAME_NAME;
472 flags |= XMIT_LONG_NAME;
474 /* We must make sure we don't send a zero flag byte or the
475 * other end will terminate the flist transfer. Note that
476 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
477 * it's harmless way to add a bit to the first flag byte. */
478 if (protocol_version >= 28) {
479 if (!flags && !S_ISDIR(mode))
480 flags |= XMIT_TOP_DIR;
481 if ((flags & 0xFF00) || !flags) {
482 flags |= XMIT_EXTENDED_FLAGS;
483 write_shortint(f, flags);
485 write_byte(f, flags);
488 flags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
489 write_byte(f, flags);
491 if (flags & XMIT_SAME_NAME)
493 if (flags & XMIT_LONG_NAME)
494 write_varint30(f, l2);
497 write_buf(f, fname + l1, l2);
499 if (first_hlink_ndx >= 0) {
500 write_varint30(f, first_hlink_ndx);
504 write_varlong30(f, F_LENGTH(file), 3);
505 if (!(flags & XMIT_SAME_TIME)) {
506 if (protocol_version >= 30)
507 write_varlong(f, modtime, 4);
509 write_int(f, modtime);
511 if (!(flags & XMIT_SAME_MODE))
512 write_int(f, to_wire_mode(mode));
513 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
514 if (protocol_version < 30)
517 write_varint(f, uid);
518 if (flags & XMIT_USER_NAME_FOLLOWS) {
519 int len = strlen(user_name);
521 write_buf(f, user_name, len);
525 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
526 if (protocol_version < 30)
529 write_varint(f, gid);
530 if (flags & XMIT_GROUP_NAME_FOLLOWS) {
531 int len = strlen(group_name);
533 write_buf(f, group_name, len);
537 if ((preserve_devices && IS_DEVICE(mode))
538 || (preserve_specials && IS_SPECIAL(mode))) {
539 if (protocol_version < 28) {
540 if (!(flags & XMIT_SAME_RDEV_pre28))
541 write_int(f, (int)rdev);
543 if (!(flags & XMIT_SAME_RDEV_MAJOR))
544 write_varint30(f, major(rdev));
545 if (protocol_version >= 30)
546 write_varint(f, minor(rdev));
547 else if (flags & XMIT_RDEV_MINOR_8_pre30)
548 write_byte(f, minor(rdev));
550 write_int(f, minor(rdev));
555 if (preserve_links && S_ISLNK(mode)) {
556 const char *sl = F_SYMLINK(file);
557 int len = strlen(sl);
558 write_varint30(f, len);
559 write_buf(f, sl, len);
563 #ifdef SUPPORT_HARD_LINKS
564 if (tmp_dev != 0 && protocol_version < 30) {
565 if (protocol_version < 26) {
566 /* 32-bit dev_t and ino_t */
567 write_int(f, (int32)dev);
568 write_int(f, (int32)tmp_ino);
570 /* 64-bit dev_t and ino_t */
571 if (!(flags & XMIT_SAME_DEV_pre30))
572 write_longint(f, dev);
573 write_longint(f, tmp_ino);
578 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
583 /* Prior to 28, we sent a useless set of nulls. */
586 write_buf(f, sum, checksum_len);
590 strlcpy(lastname, fname, MAXPATHLEN);
592 if (S_ISREG(mode) || S_ISLNK(mode))
593 stats.total_size += F_LENGTH(file);
596 static struct file_struct *recv_file_entry(struct file_list *flist,
599 static int64 modtime;
603 static uint32 rdev_major;
606 static char lastname[MAXPATHLEN], *lastdir;
607 static int lastdir_depth, lastdir_len = -1;
608 static unsigned int del_hier_name_len = 0;
609 static int in_del_hier = 0;
610 char thisname[MAXPATHLEN];
611 unsigned int l1 = 0, l2 = 0;
612 int alloc_len, basename_len, linkname_len;
613 int extra_len = file_extra_cnt * EXTRA_LEN;
614 int first_hlink_ndx = -1;
616 const char *basename;
617 struct file_struct *file;
621 if (flags & XMIT_SAME_NAME)
624 if (flags & XMIT_LONG_NAME)
625 l2 = read_varint30(f);
629 if (l2 >= MAXPATHLEN - l1) {
631 "overflow: flags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
632 flags, l1, l2, lastname, who_am_i());
633 overflow_exit("recv_file_entry");
636 strlcpy(thisname, lastname, l1 + 1);
637 read_sbuf(f, &thisname[l1], l2);
638 thisname[l1 + l2] = 0;
640 /* Abuse basename_len for a moment... */
641 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
644 if (ic_recv != (iconv_t)-1) {
645 char *obuf = thisname, *ibuf = lastname;
646 size_t ocnt = MAXPATHLEN, icnt = basename_len;
648 if (icnt >= MAXPATHLEN) {
653 iconv(ic_recv, NULL,0, NULL,0);
654 if (iconv(ic_recv, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
656 io_error |= IOERR_GENERAL;
658 "[%s] cannot convert filename: %s (%s)\n",
659 who_am_i(), lastname, strerror(errno));
666 clean_fname(thisname, 0);
669 sanitize_path(thisname, thisname, "", 0, NULL);
671 if ((basename = strrchr(thisname, '/')) != NULL) {
672 int len = basename++ - thisname;
673 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
674 lastdir = new_array(char, len + 1);
675 memcpy(lastdir, thisname, len);
678 lastdir_depth = count_dir_elements(lastdir);
682 basename_len = strlen(basename) + 1; /* count the '\0' */
684 #ifdef SUPPORT_HARD_LINKS
685 if (protocol_version >= 30
686 && BITS_SETnUNSET(flags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
687 struct file_struct *first;
688 first_hlink_ndx = read_varint30(f);
689 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->count) {
691 "hard-link reference out of range: %d (%d)\n",
692 first_hlink_ndx, flist->count);
693 exit_cleanup(RERR_PROTOCOL);
695 first = flist->files[first_hlink_ndx];
696 file_length = F_LENGTH(first);
697 modtime = first->modtime;
703 if ((preserve_devices && IS_DEVICE(mode))
704 || (preserve_specials && IS_SPECIAL(mode))) {
705 uint32 *devp = F_RDEV_P(first);
706 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
707 extra_len += 2 * EXTRA_LEN;
709 if (preserve_links && S_ISLNK(mode))
710 linkname_len = strlen(F_SYMLINK(first)) + 1;
717 file_length = read_varlong30(f, 3);
718 if (!(flags & XMIT_SAME_TIME)) {
719 if (protocol_version >= 30) {
720 modtime = read_varlong(f, 4);
721 #if SIZEOF_TIME_T < SIZEOF_INT64
722 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
724 "Time value of %s truncated on receiver.\n",
729 modtime = read_int(f);
731 if (!(flags & XMIT_SAME_MODE))
732 mode = from_wire_mode(read_int(f));
734 if (chmod_modes && !S_ISLNK(mode))
735 mode = tweak_mode(mode, chmod_modes);
737 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
738 if (protocol_version < 30)
739 uid = (uid_t)read_int(f);
741 uid = (uid_t)read_varint(f);
742 if (flags & XMIT_USER_NAME_FOLLOWS)
743 uid = recv_user_name(f, uid);
744 else if (inc_recurse && am_root && !numeric_ids)
745 uid = match_uid(uid);
748 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
749 if (protocol_version < 30)
750 gid = (gid_t)read_int(f);
752 gid = (gid_t)read_varint(f);
753 if (flags & XMIT_GROUP_NAME_FOLLOWS)
754 gid = recv_group_name(f, gid);
755 else if (inc_recurse && (!am_root || !numeric_ids))
756 gid = match_gid(gid);
760 if ((preserve_devices && IS_DEVICE(mode))
761 || (preserve_specials && IS_SPECIAL(mode))) {
762 if (protocol_version < 28) {
763 if (!(flags & XMIT_SAME_RDEV_pre28))
764 rdev = (dev_t)read_int(f);
767 if (!(flags & XMIT_SAME_RDEV_MAJOR))
768 rdev_major = read_varint30(f);
769 if (protocol_version >= 30)
770 rdev_minor = read_varint(f);
771 else if (flags & XMIT_RDEV_MINOR_8_pre30)
772 rdev_minor = read_byte(f);
774 rdev_minor = read_int(f);
775 rdev = MAKEDEV(rdev_major, rdev_minor);
777 extra_len += 2 * EXTRA_LEN;
779 } else if (protocol_version < 28)
780 rdev = MAKEDEV(0, 0);
783 if (preserve_links && S_ISLNK(mode)) {
784 linkname_len = read_varint30(f) + 1; /* count the '\0' */
785 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
786 rprintf(FERROR, "overflow: linkname_len=%d\n",
788 overflow_exit("recv_file_entry");
795 #ifdef SUPPORT_HARD_LINKS
797 if (preserve_hard_links) {
798 if (protocol_version < 28 && S_ISREG(mode))
799 flags |= XMIT_HLINKED;
800 if (flags & XMIT_HLINKED)
801 extra_len += EXTRA_LEN;
806 /* We need one or two index int32s when we're preserving ACLs. */
808 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
811 if (always_checksum && S_ISREG(mode))
812 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
814 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
815 extra_len += EXTRA_LEN;
817 #if EXTRA_ROUNDING > 0
818 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
819 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
822 if (inc_recurse && S_ISDIR(mode)) {
823 if (one_file_system) {
824 /* Room to save the dir's device for -x */
825 extra_len += 2 * EXTRA_LEN;
827 pool = dir_flist->file_pool;
829 pool = flist->file_pool;
831 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
833 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
835 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
837 file = (struct file_struct *)bp;
838 bp += FILE_STRUCT_LEN;
840 memcpy(bp, basename, basename_len);
841 bp += basename_len + linkname_len; /* skip space for symlink too */
843 #ifdef SUPPORT_HARD_LINKS
844 if (flags & XMIT_HLINKED)
845 file->flags |= FLAG_HLINKED;
847 file->modtime = (time_t)modtime;
848 file->len32 = (uint32)file_length;
849 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
850 file->flags |= FLAG_LENGTH64;
851 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
860 F_NDX(file) = flist->count + flist->ndx_start;
863 if (basename != thisname) {
864 file->dirname = lastdir;
865 F_DEPTH(file) = lastdir_depth + 1;
870 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
872 if (flags & XMIT_TOP_DIR) {
873 in_del_hier = recurse;
874 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
875 if (relative_paths && del_hier_name_len > 2
876 && lastname[del_hier_name_len-1] == '.'
877 && lastname[del_hier_name_len-2] == '/')
878 del_hier_name_len -= 2;
879 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
880 } else if (in_del_hier) {
881 if (!relative_paths || !del_hier_name_len
882 || (l1 >= del_hier_name_len
883 && lastname[del_hier_name_len] == '/'))
884 file->flags |= FLAG_XFER_DIR;
890 if ((preserve_devices && IS_DEVICE(mode))
891 || (preserve_specials && IS_SPECIAL(mode))) {
892 uint32 *devp = F_RDEV_P(file);
893 DEV_MAJOR(devp) = major(rdev);
894 DEV_MINOR(devp) = minor(rdev);
899 bp = (char*)file->basename + basename_len;
900 if (first_hlink_ndx >= 0) {
901 struct file_struct *first = flist->files[first_hlink_ndx];
902 memcpy(bp, F_SYMLINK(first), linkname_len);
904 read_sbuf(f, bp, linkname_len - 1);
906 sanitize_path(bp, bp, "", lastdir_depth, NULL);
910 #ifdef SUPPORT_HARD_LINKS
911 if (preserve_hard_links && flags & XMIT_HLINKED) {
912 if (protocol_version >= 30) {
913 F_HL_GNUM(file) = flags & XMIT_HLINK_FIRST
914 ? flist->count : first_hlink_ndx;
916 static int32 cnt = 0;
917 struct idev_node *np;
920 if (protocol_version < 26) {
924 if (!(flags & XMIT_SAME_DEV_pre30))
925 dev = read_longint(f);
926 ino = read_longint(f);
928 np = idev_node(dev, ino);
929 ndx = (int32)(long)np->data - 1;
932 np->data = (void*)(long)cnt;
934 F_HL_GNUM(file) = ndx;
939 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
941 bp = (char*)F_SUM(file);
943 /* Prior to 28, we get a useless set of nulls. */
946 if (first_hlink_ndx >= 0) {
947 struct file_struct *first = flist->files[first_hlink_ndx];
948 memcpy(bp, F_SUM(first), checksum_len);
950 read_buf(f, bp, checksum_len);
954 if (preserve_acls && !S_ISLNK(mode))
955 receive_acl(file, f);
957 #ifdef SUPPORT_XATTRS
959 receive_xattr(file, f );
962 if (S_ISREG(mode) || S_ISLNK(mode))
963 stats.total_size += file_length;
969 * Create a file_struct for a named file by reading its stat()
970 * information and performing extensive checks against global
973 * @return the new file, or NULL if there was an error or this file
974 * should be excluded.
976 * @todo There is a small optimization opportunity here to avoid
977 * stat()ing the file in some circumstances, which has a certain cost.
978 * We are called immediately after doing readdir(), and so we may
979 * already know the d_type of the file. We could for example avoid
980 * statting directories if we're not recursing, but this is not a very
981 * important case. Some systems may not have d_type.
983 struct file_struct *make_file(const char *fname, struct file_list *flist,
984 STRUCT_STAT *stp, int flags, int filter_level)
986 static char *lastdir;
987 static int lastdir_len = -1;
988 struct file_struct *file;
990 char thisname[MAXPATHLEN];
991 char linkname[MAXPATHLEN];
992 int alloc_len, basename_len, linkname_len;
993 int extra_len = file_extra_cnt * EXTRA_LEN;
994 const char *basename;
997 if (strlcpy(thisname, fname, sizeof thisname)
998 >= sizeof thisname - pathname_len) {
999 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1002 clean_fname(thisname, 0);
1004 sanitize_path(thisname, thisname, "", 0, NULL);
1006 if (stp && S_ISDIR(stp->st_mode)) {
1007 st = *stp; /* Needed for "symlink/." with --relative. */
1008 *linkname = '\0'; /* make IBM code checker happy */
1009 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1010 int save_errno = errno;
1011 /* See if file is excluded before reporting an error. */
1012 if (filter_level != NO_FILTERS
1013 && (is_excluded(thisname, 0, filter_level)
1014 || is_excluded(thisname, 1, filter_level))) {
1015 if (ignore_perishable && save_errno != ENOENT)
1016 non_perishable_cnt++;
1019 if (save_errno == ENOENT) {
1020 #ifdef SUPPORT_LINKS
1021 /* Avoid "vanished" error if symlink points nowhere. */
1022 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1023 && S_ISLNK(st.st_mode)) {
1024 io_error |= IOERR_GENERAL;
1025 rprintf(FERROR, "symlink has no referent: %s\n",
1026 full_fname(thisname));
1030 enum logcode c = am_daemon && protocol_version < 28
1032 io_error |= IOERR_VANISHED;
1033 rprintf(c, "file has vanished: %s\n",
1034 full_fname(thisname));
1037 io_error |= IOERR_GENERAL;
1038 rsyserr(FERROR, save_errno, "readlink %s failed",
1039 full_fname(thisname));
1044 /* backup.c calls us with filter_level set to NO_FILTERS. */
1045 if (filter_level == NO_FILTERS)
1048 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1049 rprintf(FINFO, "skipping directory %s\n", thisname);
1053 /* -x only affects directories because we need to avoid recursing
1054 * into a mount-point directory, not to avoid copying a symlinked
1055 * file if -L (or similar) was specified. */
1056 if (one_file_system && st.st_dev != filesystem_dev
1057 && S_ISDIR(st.st_mode)) {
1058 if (one_file_system > 1) {
1060 rprintf(FINFO, "skipping mount-point dir %s\n",
1065 flags |= FLAG_MOUNT_DIR;
1068 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1069 if (ignore_perishable)
1070 non_perishable_cnt++;
1074 if (lp_ignore_nonreadable(module_id)) {
1075 #ifdef SUPPORT_LINKS
1076 if (!S_ISLNK(st.st_mode))
1078 if (access(thisname, R_OK) != 0)
1084 /* Only divert a directory in the main transfer. */
1085 if (flist && flist->prev && S_ISDIR(st.st_mode)
1086 && flags & FLAG_DIVERT_DIRS) {
1088 /* Room for parent/sibling/next-child info. */
1089 extra_len += 3 * EXTRA_LEN;
1093 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1094 who_am_i(), thisname, filter_level);
1097 if ((basename = strrchr(thisname, '/')) != NULL) {
1098 int len = basename++ - thisname;
1099 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1100 lastdir = new_array(char, len + 1);
1101 memcpy(lastdir, thisname, len);
1102 lastdir[len] = '\0';
1106 basename = thisname;
1107 basename_len = strlen(basename) + 1; /* count the '\0' */
1109 #ifdef SUPPORT_LINKS
1110 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1115 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1116 extra_len += EXTRA_LEN;
1118 #if EXTRA_ROUNDING > 0
1119 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1120 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1123 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1126 bp = pool_alloc(flist->file_pool, alloc_len, "make_file");
1128 if (!(bp = new_array(char, alloc_len)))
1129 out_of_memory("make_file");
1132 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1134 file = (struct file_struct *)bp;
1135 bp += FILE_STRUCT_LEN;
1137 memcpy(bp, basename, basename_len);
1138 bp += basename_len + linkname_len; /* skip space for symlink too */
1140 #ifdef SUPPORT_HARD_LINKS
1141 if (preserve_hard_links && flist && flist->prev) {
1142 if (protocol_version >= 28
1143 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1144 : S_ISREG(st.st_mode)) {
1145 tmp_dev = st.st_dev;
1146 tmp_ino = st.st_ino;
1152 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1153 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1154 tmp_rdev = st.st_rdev;
1159 file->flags = flags;
1160 file->modtime = st.st_mtime;
1161 file->len32 = (uint32)st.st_size;
1162 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1163 file->flags |= FLAG_LENGTH64;
1164 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1166 file->mode = st.st_mode;
1168 F_OWNER(file) = st.st_uid;
1170 F_GROUP(file) = st.st_gid;
1172 if (basename != thisname)
1173 file->dirname = lastdir;
1175 #ifdef SUPPORT_LINKS
1177 bp = (char*)file->basename + basename_len;
1178 memcpy(bp, linkname, linkname_len);
1182 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1183 file_checksum(thisname, tmp_sum, st.st_size);
1185 F_PATHNAME(file) = pathname;
1187 /* This code is only used by the receiver when it is building
1188 * a list of files for a delete pass. */
1189 if (keep_dirlinks && linkname_len && flist) {
1191 int save_mode = file->mode;
1192 file->mode = S_IFDIR; /* Find a directory with our name. */
1193 if (flist_find(dir_flist, file) >= 0
1194 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1195 file->modtime = st2.st_mtime;
1197 file->mode = st2.st_mode;
1199 F_OWNER(file) = st2.st_uid;
1201 F_GROUP(file) = st2.st_gid;
1203 file->mode = save_mode;
1206 if (basename_len == 0+1)
1209 if (inc_recurse && flist == dir_flist) {
1212 F_NDX(file) = dir_flist->count;
1214 flist_expand(dir_flist);
1215 if (need_unsorted_flist)
1216 dir_flist->sorted[dir_flist->count] = file;
1217 dir_flist->files[dir_flist->count++] = file;
1223 /* Only called for temporary file_struct entries created by make_file(). */
1224 void unmake_file(struct file_struct *file)
1226 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1227 #if EXTRA_ROUNDING > 0
1228 if (extra_cnt & EXTRA_ROUNDING)
1229 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1231 free(REQ_EXTRA(file, extra_cnt));
1234 static struct file_struct *send_file_name(int f, struct file_list *flist,
1235 char *fname, STRUCT_STAT *stp,
1236 int flags, int filter_flags)
1238 struct file_struct *file;
1239 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1243 file = make_file(fname, flist, stp, flags, filter_flags);
1247 if (chmod_modes && !S_ISLNK(file->mode))
1248 file->mode = tweak_mode(file->mode, chmod_modes);
1251 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1252 sx.st.st_mode = file->mode;
1253 sx.acc_acl = sx.def_acl = NULL;
1254 if (get_acl(fname, &sx) < 0)
1258 #ifdef SUPPORT_XATTRS
1259 if (preserve_xattrs && f >= 0) {
1261 if (get_xattr(fname, &sx) < 0)
1266 maybe_emit_filelist_progress(flist->count + flist_count_offset);
1268 flist_expand(flist);
1269 flist->files[flist->count++] = file;
1271 send_file_entry(f, file, flist->count - 1);
1273 if (preserve_acls && !S_ISLNK(file->mode)) {
1278 #ifdef SUPPORT_XATTRS
1279 if (preserve_xattrs) {
1280 F_XATTR(file) = send_xattr(&sx, f);
1288 static void send_if_directory(int f, struct file_list *flist,
1289 struct file_struct *file,
1290 char *fbuf, unsigned int ol,
1293 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1295 if (S_ISDIR(file->mode)
1296 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1298 unsigned int len = strlen(fbuf);
1299 if (len > 1 && fbuf[len-1] == '/')
1301 if (len >= MAXPATHLEN - 1) {
1302 io_error |= IOERR_GENERAL;
1303 rprintf(FERROR, "skipping long-named directory: %s\n",
1307 save_filters = push_local_filters(fbuf, len);
1308 send_directory(f, flist, fbuf, len, flags);
1309 pop_local_filters(save_filters);
1316 static int file_compare(struct file_struct **file1, struct file_struct **file2)
1318 return f_name_cmp(*file1, *file2);
1321 /* We take an entire set of sibling dirs from dir_flist (start <= ndx <= end),
1322 * sort them by name, and link them into the tree, setting the appropriate
1323 * parent/child/sibling pointers. */
1324 static void add_dirs_to_tree(int parent_ndx, int start, int end)
1328 int32 *parent_dp = parent_ndx < 0 ? NULL
1329 : F_DIRNODE_P(dir_flist->sorted[parent_ndx]);
1331 qsort(dir_flist->sorted + start, end - start + 1,
1332 sizeof dir_flist->sorted[0], (int (*)())file_compare);
1334 for (i = start; i <= end; i++) {
1335 struct file_struct *file = dir_flist->sorted[i];
1336 if (!(file->flags & FLAG_XFER_DIR)
1337 || file->flags & FLAG_MOUNT_DIR)
1340 DIR_NEXT_SIBLING(dp) = i;
1342 DIR_FIRST_CHILD(parent_dp) = i;
1345 dp = F_DIRNODE_P(file);
1346 DIR_PARENT(dp) = parent_ndx;
1347 DIR_FIRST_CHILD(dp) = -1;
1350 DIR_NEXT_SIBLING(dp) = -1;
1353 /* This function is normally called by the sender, but the receiving side also
1354 * calls it from get_dirlist() with f set to -1 so that we just construct the
1355 * file list in memory without sending it over the wire. Also, get_dirlist()
1356 * might call this with f set to -2, which also indicates that local filter
1357 * rules should be ignored. */
1358 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1365 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1366 int start = flist->count;
1367 int filter_flags = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1369 assert(flist != NULL);
1371 if (!(d = opendir(fbuf))) {
1372 io_error |= IOERR_GENERAL;
1373 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1378 if (len != 1 || *fbuf != '/')
1381 remainder = MAXPATHLEN - (p - fbuf);
1383 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1384 char *dname = d_name(di);
1385 if (dname[0] == '.' && (dname[1] == '\0'
1386 || (dname[1] == '.' && dname[2] == '\0')))
1388 if (strlcpy(p, dname, remainder) >= remainder) {
1389 io_error |= IOERR_GENERAL;
1391 "cannot send long-named file %s\n",
1396 send_file_name(f, flist, fbuf, NULL, flags, filter_flags);
1402 io_error |= IOERR_GENERAL;
1403 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1408 if (f >= 0 && recurse && !divert_dirs) {
1409 int i, end = flist->count - 1;
1410 /* send_if_directory() bumps flist->count, so use "end". */
1411 for (i = start; i <= end; i++)
1412 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1416 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1418 char fbuf[MAXPATHLEN];
1422 dlen = strlen(fbuf);
1424 if (F_PATHNAME(file) != pathname) {
1425 if (!push_pathname(F_PATHNAME(file), -1))
1426 exit_cleanup(RERR_FILESELECT);
1429 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1431 send_directory(f, flist, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1434 void send_extra_file_list(int f, int at_least)
1436 struct file_list *flist;
1438 int future_cnt, save_io_error = io_error;
1443 /* Keep sending data until we have the requested number of
1444 * files in the upcoming file-lists. */
1445 if (cur_flist->next) {
1446 flist = first_flist->prev; /* the newest flist */
1447 future_cnt = flist->count + flist->ndx_start
1448 - cur_flist->next->ndx_start;
1451 while (future_cnt < at_least) {
1452 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1453 int start = dir_flist->count;
1456 flist = flist_new(0, "send_extra_file_list");
1457 start_write = stats.total_written;
1459 /* If this is the first of a set of duplicate dirs, we must
1460 * send all the dirs together in a single file-list. We must
1461 * also send the index of the last dir in the header. */
1462 if (file->flags & FLAG_DUPLICATE) {
1463 int dir_ndx, end_ndx = send_dir_ndx;
1464 struct file_struct *fp = file;
1467 dp = F_DIRNODE_P(fp);
1468 end_ndx = DIR_NEXT_SIBLING(dp);
1469 fp = dir_flist->sorted[end_ndx];
1470 if (!(fp->flags & FLAG_DUPLICATE))
1476 dir_ndx = F_NDX(fp);
1480 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1483 send1extra(f, file, flist);
1484 if (send_dir_ndx == end_ndx)
1486 dp = F_DIRNODE_P(file);
1487 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1488 file = dir_flist->sorted[send_dir_ndx];
1494 dir_ndx = F_NDX(file);
1497 dir_ndx = send_dir_ndx;
1498 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1500 send1extra(f, file, flist);
1504 if (!need_unsorted_flist)
1505 dir_flist->sorted = dir_flist->files;
1506 add_dirs_to_tree(send_dir_ndx, start, dir_flist->count - 1);
1509 if (need_unsorted_flist) {
1511 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1512 out_of_memory("send_extra_file_list");
1513 memcpy(flist->sorted, flist->files,
1514 flist->count * sizeof (struct file_struct*));
1515 clean_flist(flist, 0);
1517 flist->sorted = flist->files;
1521 flist->sorted = flist->files;
1522 clean_flist(flist, 0);
1525 file_total += flist->count;
1526 future_cnt += flist->count;
1527 stats.flist_size += stats.total_written - start_write;
1528 stats.num_files += flist->count;
1530 output_flist(flist);
1532 dp = F_DIRNODE_P(file);
1533 if (DIR_FIRST_CHILD(dp) >= 0) {
1534 send_dir_ndx = DIR_FIRST_CHILD(dp);
1537 while (DIR_NEXT_SIBLING(dp) < 0) {
1538 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1539 write_ndx(f, NDX_FLIST_EOF);
1541 change_local_filter_dir(NULL, 0, 0);
1545 file = dir_flist->sorted[send_dir_ndx];
1546 dp = F_DIRNODE_P(file);
1548 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1553 if (io_error != save_io_error && !ignore_errors)
1554 send_msg_int(MSG_IO_ERROR, io_error);
1557 struct file_list *send_file_list(int f, int argc, char *argv[])
1559 static const char *lastdir;
1560 static int lastdir_len = -1;
1564 char lastpath[MAXPATHLEN] = "";
1565 struct file_list *flist;
1566 struct timeval start_tv, end_tv;
1569 int flags, disable_buffering;
1571 rprintf(FLOG, "building file list\n");
1572 if (show_filelist_p())
1573 start_filelist_progress("building file list");
1574 else if (inc_recurse && verbose && !am_server)
1575 rprintf(FCLIENT, "sending incremental file list\n");
1577 start_write = stats.total_written;
1578 gettimeofday(&start_tv, NULL);
1580 #ifdef SUPPORT_HARD_LINKS
1581 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1585 flist = cur_flist = flist_new(0, "send_file_list");
1587 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1588 flags = FLAG_DIVERT_DIRS;
1590 dir_flist = cur_flist;
1594 disable_buffering = io_start_buffering_out(f);
1595 if (filesfrom_fd >= 0) {
1596 if (argv[0] && !push_dir(argv[0], 0)) {
1597 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1598 full_fname(argv[0]), curr_dir);
1599 exit_cleanup(RERR_FILESELECT);
1605 char fbuf[MAXPATHLEN];
1610 if (read_filesfrom_line(filesfrom_fd, fbuf) == 0)
1612 sanitize_path(fbuf, fbuf, "", 0, NULL);
1616 strlcpy(fbuf, *argv++, MAXPATHLEN);
1618 sanitize_path(fbuf, fbuf, "", 0, NULL);
1622 if (relative_paths) {
1623 /* We clean up fbuf below. */
1625 } else if (!len || fbuf[len - 1] == '/') {
1626 if (len == 2 && fbuf[0] == '.') {
1627 /* Turn "./" into just "." rather than "./." */
1630 if (len + 1 >= MAXPATHLEN)
1631 overflow_exit("send_file_list");
1636 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1637 && (len == 2 || fbuf[len-3] == '/')) {
1638 if (len + 2 >= MAXPATHLEN)
1639 overflow_exit("send_file_list");
1645 is_dot_dir = fbuf[len-1] == '.'
1646 && (len == 1 || fbuf[len-2] == '/');
1651 if (!relative_paths) {
1652 p = strrchr(fbuf, '/');
1659 len -= p - fbuf + 1;
1664 if ((p = strstr(fbuf, "/./")) != NULL) {
1670 len -= p - fbuf + 3;
1674 /* Get rid of trailing "/" and "/.". */
1676 if (fn[len - 1] == '/') {
1678 if (!--len && !dir) {
1683 else if (len >= 2 && fn[len - 1] == '.'
1684 && fn[len - 2] == '/') {
1686 if (!(len -= 2) && !dir) {
1693 if (len == 1 && fn[0] == '/')
1696 /* Reject a ".." dir in the active part of the path. */
1697 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1698 if ((p[2] == '/' || p[2] == '\0')
1699 && (p == fn || p[-1] == '/')) {
1701 "found \"..\" dir in relative path: %s\n",
1703 exit_cleanup(RERR_SYNTAX);
1713 dirlen = dir ? strlen(dir) : 0;
1714 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1715 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1718 lastdir_len = pathname_len;
1719 } else if (!push_pathname(lastdir, lastdir_len)) {
1721 io_error |= IOERR_GENERAL;
1722 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1723 full_fname(dir), curr_dir);
1728 memmove(fbuf, fn, len + 1);
1730 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1731 io_error |= IOERR_GENERAL;
1732 rsyserr(FERROR, errno, "link_stat %s failed",
1737 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1738 rprintf(FINFO, "skipping directory %s\n", fbuf);
1742 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1743 /* Send the implied directories at the start of the
1744 * source spec, so we get their permissions right. */
1745 char *lp = lastpath, *slash = fbuf;
1747 /* Skip any initial directories in our path that we
1748 * have in common with lastpath. */
1749 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1754 if (fn != p || (*lp && *lp != '/')) {
1755 int save_copy_links = copy_links;
1756 int save_xfer_dirs = xfer_dirs;
1757 int dir_flags = inc_recurse ? FLAG_DIVERT_DIRS : 0;
1758 copy_links |= copy_unsafe_links;
1760 while ((slash = strchr(slash+1, '/')) != 0) {
1762 send_file_name(f, flist, fbuf, NULL,
1763 dir_flags, ALL_FILTERS);
1766 copy_links = save_copy_links;
1767 xfer_dirs = save_xfer_dirs;
1769 strlcpy(lastpath, fbuf, sizeof lastpath);
1774 if (one_file_system)
1775 filesystem_dev = st.st_dev;
1777 if (recurse || (xfer_dirs && is_dot_dir)) {
1778 struct file_struct *file;
1779 int top_flags = FLAG_TOP_DIR | FLAG_XFER_DIR | flags;
1780 file = send_file_name(f, flist, fbuf, &st,
1781 top_flags, ALL_FILTERS);
1782 if (file && !inc_recurse)
1783 send_if_directory(f, flist, file, fbuf, len, flags);
1785 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1788 gettimeofday(&end_tv, NULL);
1789 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1790 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1791 if (stats.flist_buildtime == 0)
1792 stats.flist_buildtime = 1;
1795 write_byte(f, 0); /* Indicate end of file list */
1797 #ifdef SUPPORT_HARD_LINKS
1798 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1802 if (show_filelist_p())
1803 finish_filelist_progress(flist);
1805 gettimeofday(&end_tv, NULL);
1806 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1807 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1809 /* When converting names, both sides keep an unsorted file-list array
1810 * because the names will differ on the sending and receiving sides
1811 * (both sides will use the unsorted index number for each item). */
1813 /* Sort the list without removing any duplicates. This allows the
1814 * receiving side to ask for whatever name it kept. For incremental
1815 * recursion mode, the sender marks duplicate dirs so that it can
1816 * send them together in a single file-list. */
1818 if (need_unsorted_flist) {
1820 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1821 out_of_memory("send_file_list");
1822 memcpy(flist->sorted, flist->files,
1823 flist->count * sizeof (struct file_struct*));
1824 clean_flist(flist, 0);
1826 flist->sorted = flist->files;
1830 flist->sorted = flist->files;
1831 clean_flist(flist, 0);
1833 file_total += flist->count;
1835 if (!numeric_ids && !inc_recurse)
1838 /* send the io_error flag */
1839 if (protocol_version < 30)
1840 write_int(f, ignore_errors ? 0 : io_error);
1841 else if (io_error && !ignore_errors)
1842 send_msg_int(MSG_IO_ERROR, io_error);
1844 if (disable_buffering)
1845 io_end_buffering_out();
1847 stats.flist_size = stats.total_written - start_write;
1848 stats.num_files = flist->count;
1851 output_flist(flist);
1854 rprintf(FINFO, "send_file_list done\n");
1857 if (!need_unsorted_flist)
1858 dir_flist->sorted = dir_flist->files;
1859 add_dirs_to_tree(-1, 0, dir_flist->count - 1);
1860 if (send_dir_ndx < 0) {
1861 write_ndx(f, NDX_FLIST_EOF);
1864 else if (file_total == 1) {
1865 /* If we're creating incremental file-lists and there
1866 * was just 1 item in the first file-list, send 1 more
1867 * file-list to check if this is a 1-file xfer. */
1868 send_extra_file_list(f, 1);
1875 struct file_list *recv_file_list(int f)
1877 struct file_list *flist;
1882 rprintf(FLOG, "receiving file list\n");
1883 if (show_filelist_p())
1884 start_filelist_progress("receiving file list");
1885 else if (inc_recurse && verbose && !am_server && !first_flist)
1886 rprintf(FCLIENT, "receiving incremental file list\n");
1888 start_read = stats.total_read;
1890 flist = flist_new(0, "recv_file_list");
1892 #ifdef SUPPORT_HARD_LINKS
1893 if (preserve_hard_links && protocol_version < 30)
1898 if (flist->ndx_start == 0)
1899 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1900 dstart = dir_flist->count;
1906 while ((flags = read_byte(f)) != 0) {
1907 struct file_struct *file;
1909 flist_expand(flist);
1911 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1912 flags |= read_byte(f) << 8;
1913 file = recv_file_entry(flist, flags, f);
1915 if (inc_recurse && S_ISDIR(file->mode)) {
1916 flist_expand(dir_flist);
1917 if (need_unsorted_flist)
1918 dir_flist->sorted[dir_flist->count] = file;
1919 dir_flist->files[dir_flist->count++] = file;
1922 flist->files[flist->count++] = file;
1924 maybe_emit_filelist_progress(flist->count);
1927 rprintf(FINFO, "recv_file_name(%s)\n",
1928 f_name(file, NULL));
1931 file_total += flist->count;
1934 rprintf(FINFO, "received %d names\n", flist->count);
1936 if (show_filelist_p())
1937 finish_filelist_progress(flist);
1940 if (need_unsorted_flist) {
1941 /* Create an extra array of index pointers that we can sort for
1942 * the generator's use (for wading through the files in sorted
1943 * order and for calling flist_find()). We keep the "files"
1944 * list unsorted for our exchange of index numbers with the
1945 * other side (since their names may not sort the same). */
1946 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1947 out_of_memory("recv_file_list");
1948 memcpy(flist->sorted, flist->files,
1949 flist->count * sizeof (struct file_struct*));
1951 qsort(dir_flist->sorted + dstart, dir_flist->count - dstart,
1952 sizeof (struct file_struct*), (int (*)())file_compare);
1957 flist->sorted = flist->files;
1959 dir_flist->sorted = dir_flist->files;
1960 qsort(dir_flist->sorted + dstart, dir_flist->count - dstart,
1961 sizeof (struct file_struct*), (int (*)())file_compare);
1965 if (!inc_recurse && f >= 0)
1966 recv_uid_list(f, flist);
1968 clean_flist(flist, relative_paths);
1970 if (protocol_version < 30) {
1971 /* Recv the io_error flag */
1975 io_error |= read_int(f);
1979 output_flist(flist);
1983 for (i = 0; i < flist->count; i++)
1984 list_file_entry(flist->files[i]);
1988 rprintf(FINFO, "recv_file_list done\n");
1990 stats.flist_size += stats.total_read - start_read;
1991 stats.num_files += flist->count;
1996 /* This is only used once by the receiver if the very first file-list
1997 * has exactly one item in it. */
1998 void recv_additional_file_list(int f)
2000 struct file_list *flist;
2001 int ndx = read_ndx(f);
2002 if (ndx == NDX_FLIST_EOF) {
2004 change_local_filter_dir(NULL, 0, 0);
2006 ndx = NDX_FLIST_OFFSET - ndx;
2007 if (ndx < 0 || ndx >= dir_flist->count) {
2008 ndx = NDX_FLIST_OFFSET - ndx;
2010 "Invalid dir index: %d (%d - %d)\n",
2011 ndx, NDX_FLIST_OFFSET,
2012 NDX_FLIST_OFFSET - dir_flist->count);
2013 exit_cleanup(RERR_PROTOCOL);
2015 flist = recv_file_list(f);
2016 flist->parent_ndx = ndx;
2020 /* Search for an identically-named item in the file list. Note that the
2021 * items must agree in their directory-ness, or no match is returned. */
2022 int flist_find(struct file_list *flist, struct file_struct *f)
2024 int low = flist->low, high = flist->high;
2025 int diff, mid, mid_up;
2027 while (low <= high) {
2028 mid = (low + high) / 2;
2029 if (F_IS_ACTIVE(flist->sorted[mid]))
2032 /* Scan for the next non-empty entry using the cached
2033 * distance values. If the value isn't fully up-to-
2034 * date, update it. */
2035 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2036 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2038 mid_up += F_DEPTH(flist->sorted[mid_up]);
2039 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2040 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2042 if (mid_up > high) {
2043 /* If there's nothing left above us, set high to
2044 * a non-empty entry below us and continue. */
2045 high = mid - (int)flist->sorted[mid]->len32;
2046 if (!F_IS_ACTIVE(flist->sorted[high])) {
2048 high -= (int)flist->sorted[high]->len32;
2049 } while (!F_IS_ACTIVE(flist->sorted[high]));
2050 flist->sorted[mid]->len32 = mid - high;
2055 diff = f_name_cmp(flist->sorted[mid_up], f);
2057 if (protocol_version < 29
2058 && S_ISDIR(flist->sorted[mid_up]->mode)
2059 != S_ISDIR(f->mode))
2072 * Free up any resources a file_struct has allocated
2073 * and clear the file.
2075 void clear_file(struct file_struct *file)
2077 /* The +1 zeros out the first char of the basename. */
2078 memset(file, 0, FILE_STRUCT_LEN + 1);
2079 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2080 * entry. Likewise for len32 in the opposite direction. We assume
2081 * that we're alone for now since flist_find() will adjust the counts
2082 * it runs into that aren't up-to-date. */
2083 file->len32 = F_DEPTH(file) = 1;
2086 /* Allocate a new file list. */
2087 struct file_list *flist_new(int flags, char *msg)
2089 struct file_list *flist;
2091 flist = new(struct file_list);
2095 memset(flist, 0, sizeof flist[0]);
2097 if (!(flags & FLIST_TEMP)) {
2099 flist->ndx_start = first_flist->prev->ndx_start
2100 + first_flist->prev->count;
2102 /* This is a doubly linked list with prev looping back to
2103 * the end of the list, but the last next pointer is NULL. */
2105 first_flist = cur_flist = flist->prev = flist;
2107 flist->prev = first_flist->prev;
2108 flist->prev->next = first_flist->prev = flist;
2113 if (!(flist->file_pool = pool_create(FILE_EXTENT, 0, out_of_memory, POOL_INTERN)))
2119 /* Free up all elements in a flist. */
2120 void flist_free(struct file_list *flist)
2123 ; /* Was FLIST_TEMP dir-list. */
2124 else if (flist == flist->prev) {
2125 first_flist = cur_flist = NULL;
2129 if (flist == cur_flist)
2130 cur_flist = flist->next;
2131 if (flist == first_flist)
2132 first_flist = first_flist->next;
2134 flist->prev->next = flist->next;
2136 flist->next = first_flist;
2138 flist->next->prev = flist->prev;
2139 file_total -= flist->count;
2143 pool_destroy(flist->file_pool);
2144 if (flist->sorted && flist->sorted != flist->files)
2145 free(flist->sorted);
2150 /* This routine ensures we don't have any duplicate names in our file list.
2151 * duplicate names can cause corruption because of the pipelining. */
2152 static void clean_flist(struct file_list *flist, int strip_root)
2154 char fbuf[MAXPATHLEN];
2159 if (flist->count == 0) {
2164 qsort(flist->sorted, flist->count,
2165 sizeof flist->sorted[0], (int (*)())file_compare);
2167 if (!am_sender || inc_recurse) {
2168 for (i = prev_i = 0; i < flist->count; i++) {
2169 if (F_IS_ACTIVE(flist->sorted[i])) {
2174 flist->low = prev_i;
2176 i = prev_i = flist->count - 1;
2180 while (++i < flist->count) {
2182 struct file_struct *file = flist->sorted[i];
2184 if (!F_IS_ACTIVE(file))
2186 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2188 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2189 int save_mode = file->mode;
2190 /* Make sure that this directory doesn't duplicate a
2191 * non-directory earlier in the list. */
2192 flist->high = prev_i;
2193 file->mode = S_IFREG;
2194 j = flist_find(flist, file);
2195 file->mode = save_mode;
2199 struct file_struct *fp = flist->sorted[j];
2201 /* If one is a dir and the other is not, we want to
2202 * keep the dir because it might have contents in the
2204 if (S_ISDIR(file->mode) != S_ISDIR(fp->mode)) {
2205 if (S_ISDIR(file->mode))
2209 } else if (protocol_version < 27)
2215 flist->sorted[drop]->flags |= FLAG_DUPLICATE;
2219 "removing duplicate name %s from file list (%d)\n",
2220 f_name(file, fbuf), drop);
2222 /* Make sure we don't lose track of a user-specified
2224 flist->sorted[keep]->flags |= flist->sorted[drop]->flags
2225 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2227 clear_file(flist->sorted[drop]);
2231 if (flist->low == drop) {
2233 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2242 flist->high = prev_i;
2245 /* We need to strip off the leading slashes for relative
2246 * paths, but this must be done _after_ the sorting phase. */
2247 for (i = flist->low; i <= flist->high; i++) {
2248 struct file_struct *file = flist->sorted[i];
2252 while (*file->dirname == '/')
2254 if (!*file->dirname)
2255 file->dirname = NULL;
2259 if (prune_empty_dirs && !am_sender) {
2260 int j, prev_depth = 0;
2262 prev_i = 0; /* It's OK that this isn't really true. */
2264 for (i = flist->low; i <= flist->high; i++) {
2265 struct file_struct *fp, *file = flist->sorted[i];
2267 /* This temporarily abuses the F_DEPTH() value for a
2268 * directory that is in a chain that might get pruned.
2269 * We restore the old value if it gets a reprieve. */
2270 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2271 /* Dump empty dirs when coming back down. */
2272 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2273 fp = flist->sorted[prev_i];
2274 if (F_DEPTH(fp) >= 0)
2276 prev_i = -F_DEPTH(fp)-1;
2279 prev_depth = F_DEPTH(file);
2280 if (is_excluded(f_name(file, fbuf), 1,
2282 /* Keep dirs through this dir. */
2283 for (j = prev_depth-1; ; j--) {
2284 fp = flist->sorted[prev_i];
2285 if (F_DEPTH(fp) >= 0)
2287 prev_i = -F_DEPTH(fp)-1;
2291 F_DEPTH(file) = -prev_i-1;
2294 /* Keep dirs through this non-dir. */
2295 for (j = prev_depth; ; j--) {
2296 fp = flist->sorted[prev_i];
2297 if (F_DEPTH(fp) >= 0)
2299 prev_i = -F_DEPTH(fp)-1;
2304 /* Dump all remaining empty dirs. */
2306 struct file_struct *fp = flist->sorted[prev_i];
2307 if (F_DEPTH(fp) >= 0)
2309 prev_i = -F_DEPTH(fp)-1;
2313 for (i = flist->low; i <= flist->high; i++) {
2314 if (F_IS_ACTIVE(flist->sorted[i]))
2318 for (i = flist->high; i >= flist->low; i--) {
2319 if (F_IS_ACTIVE(flist->sorted[i]))
2326 static void output_flist(struct file_list *flist)
2328 char uidbuf[16], gidbuf[16], depthbuf[16];
2329 struct file_struct *file;
2330 const char *root, *dir, *slash, *name, *trail;
2331 const char *who = who_am_i();
2334 rprintf(FINFO, "[%s] flist start=%d, count=%d, low=%d, high=%d\n",
2335 who, flist->ndx_start, flist->count, flist->low, flist->high);
2336 for (i = 0; i < flist->count; i++) {
2337 file = flist->sorted[i];
2338 if ((am_root || am_sender) && preserve_uid) {
2339 snprintf(uidbuf, sizeof uidbuf, " uid=%ld",
2343 if (preserve_gid && F_GID(file) != GID_NONE) {
2344 snprintf(gidbuf, sizeof gidbuf, " gid=%ld",
2349 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2350 if (F_IS_ACTIVE(file)) {
2351 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2352 if ((dir = file->dirname) == NULL)
2356 name = file->basename;
2357 trail = S_ISDIR(file->mode) ? "/" : "";
2359 root = dir = slash = name = trail = "";
2360 rprintf(FINFO, "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2361 who, i, root, dir, slash, name, trail, (int)file->mode,
2362 (double)F_LENGTH(file), uidbuf, gidbuf, file->flags);
2366 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2367 enum fnc_type { t_PATH, t_ITEM };
2369 /* Compare the names of two file_struct entities, similar to how strcmp()
2370 * would do if it were operating on the joined strings.
2372 * Some differences beginning with protocol_version 29: (1) directory names
2373 * are compared with an assumed trailing slash so that they compare in a
2374 * way that would cause them to sort immediately prior to any content they
2375 * may have; (2) a directory of any name compares after a non-directory of
2376 * any name at the same depth; (3) a directory with name "." compares prior
2377 * to anything else. These changes mean that a directory and a non-dir
2378 * with the same name will not compare as equal (protocol_version >= 29).
2380 * The dirname component can be an empty string, but the basename component
2381 * cannot (and never is in the current codebase). The basename component
2382 * may be NULL (for a removed item), in which case it is considered to be
2383 * after any existing item. */
2384 int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
2387 const uchar *c1, *c2;
2388 enum fnc_state state1, state2;
2389 enum fnc_type type1, type2;
2390 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2392 if (!f1 || !F_IS_ACTIVE(f1)) {
2393 if (!f2 || !F_IS_ACTIVE(f2))
2397 if (!f2 || !F_IS_ACTIVE(f2))
2400 c1 = (uchar*)f1->dirname;
2401 c2 = (uchar*)f2->dirname;
2405 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2406 c1 = (const uchar*)f1->basename;
2407 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2409 state1 = s_TRAILING;
2418 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2419 c2 = (const uchar*)f2->basename;
2420 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2422 state2 = s_TRAILING;
2432 return type1 == t_PATH ? 1 : -1;
2442 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2443 c1 = (const uchar*)f1->basename;
2444 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2446 state1 = s_TRAILING;
2452 state1 = s_TRAILING;
2453 if (type1 == t_PATH) {
2462 if (*c2 && type1 != type2)
2463 return type1 == t_PATH ? 1 : -1;
2472 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2473 c2 = (const uchar*)f2->basename;
2474 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2476 state2 = s_TRAILING;
2482 state2 = s_TRAILING;
2483 if (type2 == t_PATH) {
2495 return type1 == t_PATH ? 1 : -1;
2497 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2502 char *f_name_buf(void)
2504 static char names[5][MAXPATHLEN];
2505 static unsigned int n;
2507 n = (n + 1) % (sizeof names / sizeof names[0]);
2512 /* Return a copy of the full filename of a flist entry, using the indicated
2513 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2514 * done because we checked the size when creating the file_struct entry.
2516 char *f_name(struct file_struct *f, char *fbuf)
2518 if (!f || !F_IS_ACTIVE(f))
2522 fbuf = f_name_buf();
2525 int len = strlen(f->dirname);
2526 memcpy(fbuf, f->dirname, len);
2528 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2530 strlcpy(fbuf, f->basename, MAXPATHLEN);
2535 /* Do a non-recursive scan of the named directory, possibly ignoring all
2536 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2537 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2538 * buffer (the functions we call will append names onto the end, but the old
2539 * dir value will be restored on exit). */
2540 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2542 struct file_list *dirlist;
2543 char dirbuf[MAXPATHLEN];
2544 int save_recurse = recurse;
2545 int save_xfer_dirs = xfer_dirs;
2548 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2549 if (dlen >= MAXPATHLEN)
2554 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2558 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2559 xfer_dirs = save_xfer_dirs;
2560 recurse = save_recurse;
2562 flist_count_offset += dirlist->count;
2564 dirlist->sorted = dirlist->files;
2565 clean_flist(dirlist, 0);
2568 output_flist(dirlist);