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;
43 extern int filesfrom_fd;
44 extern int one_file_system;
45 extern int copy_dirlinks;
46 extern int keep_dirlinks;
47 extern int preserve_acls;
48 extern int preserve_xattrs;
49 extern int preserve_links;
50 extern int preserve_hard_links;
51 extern int preserve_devices;
52 extern int preserve_specials;
53 extern int preserve_uid;
54 extern int preserve_gid;
55 extern int relative_paths;
56 extern int implied_dirs;
57 extern int file_extra_cnt;
58 extern int ignore_perishable;
59 extern int non_perishable_cnt;
60 extern int prune_empty_dirs;
61 extern int copy_links;
62 extern int copy_unsafe_links;
63 extern int protocol_version;
64 extern int sanitize_paths;
65 extern struct stats stats;
67 extern char curr_dir[MAXPATHLEN];
69 extern struct chmod_mode_struct *chmod_modes;
71 extern struct filter_list_struct filter_list;
72 extern struct filter_list_struct server_filter_list;
76 extern int need_unsorted_flist;
77 extern iconv_t ic_send, ic_recv;
80 #define PTR_SIZE (sizeof (struct file_struct *))
84 dev_t filesystem_dev; /* used to implement -x */
86 struct file_list *cur_flist, *first_flist, *dir_flist;
87 int send_dir_ndx = -1, send_dir_depth = 0;
88 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
89 int file_total = 0; /* total of all active items over all file-lists */
90 int flist_eof = 0; /* all the file-lists are now known */
92 /* The tmp_* vars are used as a cache area by make_file() to store data
93 * that the sender doesn't need to remember in its file list. The data
94 * will survive just long enough to be used by send_file_entry(). */
95 static dev_t tmp_rdev;
96 #ifdef SUPPORT_HARD_LINKS
97 static int64 tmp_dev, tmp_ino;
99 static char tmp_sum[MAX_DIGEST_LEN];
101 static char empty_sum[MAX_DIGEST_LEN];
102 static int flist_count_offset; /* for --delete --progress */
103 static int dir_count = 0;
105 static void clean_flist(struct file_list *flist, int strip_root);
106 static void output_flist(struct file_list *flist);
108 void init_flist(void)
111 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
112 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
114 checksum_len = protocol_version < 21 ? 2
115 : protocol_version < 30 ? MD4_DIGEST_LEN
119 static int show_filelist_p(void)
121 return verbose && xfer_dirs && !am_server && !inc_recurse;
124 static void start_filelist_progress(char *kind)
126 rprintf(FCLIENT, "%s ... ", kind);
127 if (verbose > 1 || do_progress)
128 rprintf(FCLIENT, "\n");
132 static void emit_filelist_progress(int count)
134 rprintf(FCLIENT, " %d files...\r", count);
137 static void maybe_emit_filelist_progress(int count)
139 if (do_progress && show_filelist_p() && (count % 100) == 0)
140 emit_filelist_progress(count);
143 static void finish_filelist_progress(const struct file_list *flist)
146 /* This overwrites the progress line */
147 rprintf(FINFO, "%d file%sto consider\n",
148 flist->count, flist->count == 1 ? " " : "s ");
150 rprintf(FINFO, "done\n");
153 void show_flist_stats(void)
158 static void list_file_entry(struct file_struct *f)
160 char permbuf[PERMSTRING_SIZE];
163 if (!F_IS_ACTIVE(f)) {
164 /* this can happen if duplicate names were removed */
168 permstring(permbuf, f->mode);
171 /* TODO: indicate '+' if the entry has an ACL. */
174 if (preserve_links && S_ISLNK(f->mode)) {
175 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
176 permbuf, len, timestring(f->modtime),
177 f_name(f, NULL), F_SYMLINK(f));
181 rprintf(FINFO, "%s %11.0f %s %s\n",
182 permbuf, len, timestring(f->modtime),
187 /* Stat either a symlink or its referent, depending on the settings of
188 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
190 * If path is the name of a symlink, then the linkbuf buffer (which must hold
191 * MAXPATHLEN chars) will be set to the symlink's target string.
193 * The stat structure pointed to by stp will contain information about the
194 * link or the referent as appropriate, if they exist. */
195 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
198 if (link_stat(path, stp, copy_dirlinks) < 0)
200 if (S_ISLNK(stp->st_mode)) {
201 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
204 linkbuf[llen] = '\0';
205 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
207 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
210 return x_stat(path, stp, NULL);
215 return x_stat(path, stp, NULL);
219 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
223 return x_stat(path, stp, NULL);
224 if (x_lstat(path, stp, NULL) < 0)
226 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
228 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
233 return x_stat(path, stp, NULL);
237 /* This function is used to check if a file should be included/excluded
238 * from the list of files based on its name and type etc. The value of
239 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
240 static int is_excluded(char *fname, int is_dir, int filter_level)
242 #if 0 /* This currently never happens, so avoid a useless compare. */
243 if (filter_level == NO_FILTERS)
247 /* never exclude '.', even if somebody does --exclude '*' */
248 if (fname[0] == '.' && !fname[1])
250 /* Handle the -R version of the '.' dir. */
251 if (fname[0] == '/') {
252 int len = strlen(fname);
253 if (fname[len-1] == '.' && fname[len-2] == '/')
257 if (server_filter_list.head
258 && check_filter(&server_filter_list, fname, is_dir) < 0)
260 if (filter_level != ALL_FILTERS)
263 && check_filter(&filter_list, fname, is_dir) < 0)
268 static void send_directory(int f, struct file_list *flist,
269 char *fbuf, int len, int flags);
271 static const char *pathname, *orig_dir;
272 static int pathname_len;
275 /* Make sure flist can hold at least flist->count + extra entries. */
276 static void flist_expand(struct file_list *flist, int extra)
278 struct file_struct **new_ptr;
280 if (flist->count + extra <= flist->malloced)
283 if (flist->malloced < FLIST_START)
284 flist->malloced = FLIST_START;
285 else if (flist->malloced >= FLIST_LINEAR)
286 flist->malloced += FLIST_LINEAR;
288 flist->malloced *= 2;
290 /* In case count jumped or we are starting the list
291 * with a known size just set it. */
292 if (flist->malloced < flist->count + extra)
293 flist->malloced = flist->count + extra;
295 new_ptr = realloc_array(flist->files, struct file_struct *,
298 if (verbose >= 2 && flist->malloced != FLIST_START) {
299 rprintf(FCLIENT, "[%s] expand file_list to %.0f bytes, did%s move\n",
301 (double)sizeof flist->files[0] * flist->malloced,
302 (new_ptr == flist->files) ? " not" : "");
305 flist->files = new_ptr;
308 out_of_memory("flist_expand");
311 int push_pathname(const char *dir, int len)
317 orig_dir = strdup(curr_dir);
319 if (pathname && !pop_dir(orig_dir)) {
320 rsyserr(FERROR, errno, "pop_dir %s failed",
321 full_fname(orig_dir));
322 exit_cleanup(RERR_FILESELECT);
325 if (dir && !push_dir(dir, 0)) {
326 io_error |= IOERR_GENERAL;
327 rsyserr(FERROR, errno, "push_dir %s failed in %s",
328 full_fname(dir), curr_dir);
333 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
338 static void send_file_entry(int f, struct file_struct *file, int ndx)
340 static time_t modtime;
344 static uint32 rdev_major;
347 static char *user_name, *group_name;
348 static char lastname[MAXPATHLEN];
349 char fname[MAXPATHLEN];
350 int first_hlink_ndx = -1;
355 if (ic_send != (iconv_t)-1) {
356 ICONV_CONST char *ibuf;
358 size_t ocnt = MAXPATHLEN, icnt;
360 iconv(ic_send, NULL,0, NULL,0);
361 if ((ibuf = (ICONV_CONST char *)file->dirname) != NULL) {
363 ocnt--; /* pre-subtract the space for the '/' */
364 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1)
369 ibuf = (ICONV_CONST char *)file->basename;
371 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
373 io_error |= IOERR_GENERAL;
375 "[%s] cannot convert filename: %s (%s)\n",
376 who_am_i(), f_name(file, fname), strerror(errno));
384 flags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
386 if (file->mode == mode)
387 flags |= XMIT_SAME_MODE;
390 if ((preserve_devices && IS_DEVICE(mode))
391 || (preserve_specials && IS_SPECIAL(mode))) {
392 if (protocol_version < 28) {
393 if (tmp_rdev == rdev)
394 flags |= XMIT_SAME_RDEV_pre28;
399 if ((uint32)major(rdev) == rdev_major)
400 flags |= XMIT_SAME_RDEV_MAJOR;
402 rdev_major = major(rdev);
403 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
404 flags |= XMIT_RDEV_MINOR_8_pre30;
406 } else if (protocol_version < 28)
407 rdev = MAKEDEV(0, 0);
409 if ((uid_t)F_OWNER(file) == uid && *lastname)
410 flags |= XMIT_SAME_UID;
413 if (preserve_uid && !numeric_ids) {
414 user_name = add_uid(uid);
415 if (inc_recurse && user_name)
416 flags |= XMIT_USER_NAME_FOLLOWS;
421 if ((gid_t)F_GROUP(file) == gid && *lastname)
422 flags |= XMIT_SAME_GID;
425 if (preserve_gid && !numeric_ids) {
426 group_name = add_gid(gid);
427 if (inc_recurse && group_name)
428 flags |= XMIT_GROUP_NAME_FOLLOWS;
432 if (file->modtime == modtime)
433 flags |= XMIT_SAME_TIME;
435 modtime = file->modtime;
437 #ifdef SUPPORT_HARD_LINKS
439 if (protocol_version >= 30) {
440 struct idev_node *np = idev_node(tmp_dev, tmp_ino);
441 first_hlink_ndx = (int32)(long)np->data - 1;
442 if (first_hlink_ndx < 0) {
443 np->data = (void*)(long)(ndx + 1);
444 flags |= XMIT_HLINK_FIRST;
446 flags |= XMIT_HLINKED;
448 if (tmp_dev == dev) {
449 if (protocol_version >= 28)
450 flags |= XMIT_SAME_DEV_pre30;
453 flags |= XMIT_HLINKED;
459 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
461 l2 = strlen(fname+l1);
464 flags |= XMIT_SAME_NAME;
466 flags |= XMIT_LONG_NAME;
468 /* We must make sure we don't send a zero flag byte or the
469 * other end will terminate the flist transfer. Note that
470 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
471 * it's harmless way to add a bit to the first flag byte. */
472 if (protocol_version >= 28) {
473 if (!flags && !S_ISDIR(mode))
474 flags |= XMIT_TOP_DIR;
475 if ((flags & 0xFF00) || !flags) {
476 flags |= XMIT_EXTENDED_FLAGS;
477 write_shortint(f, flags);
479 write_byte(f, flags);
482 flags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
483 write_byte(f, flags);
485 if (flags & XMIT_SAME_NAME)
487 if (flags & XMIT_LONG_NAME)
488 write_varint30(f, l2);
491 write_buf(f, fname + l1, l2);
493 if (first_hlink_ndx >= 0) {
494 write_varint30(f, first_hlink_ndx);
498 write_varlong30(f, F_LENGTH(file), 3);
499 if (!(flags & XMIT_SAME_TIME)) {
500 if (protocol_version >= 30)
501 write_varlong(f, modtime, 4);
503 write_int(f, modtime);
505 if (!(flags & XMIT_SAME_MODE))
506 write_int(f, to_wire_mode(mode));
507 if (preserve_uid && !(flags & XMIT_SAME_UID)) {
508 if (protocol_version < 30)
511 write_varint(f, uid);
512 if (flags & XMIT_USER_NAME_FOLLOWS) {
513 int len = strlen(user_name);
515 write_buf(f, user_name, len);
519 if (preserve_gid && !(flags & XMIT_SAME_GID)) {
520 if (protocol_version < 30)
523 write_varint(f, gid);
524 if (flags & XMIT_GROUP_NAME_FOLLOWS) {
525 int len = strlen(group_name);
527 write_buf(f, group_name, len);
531 if ((preserve_devices && IS_DEVICE(mode))
532 || (preserve_specials && IS_SPECIAL(mode))) {
533 if (protocol_version < 28) {
534 if (!(flags & XMIT_SAME_RDEV_pre28))
535 write_int(f, (int)rdev);
537 if (!(flags & XMIT_SAME_RDEV_MAJOR))
538 write_varint30(f, major(rdev));
539 if (protocol_version >= 30)
540 write_varint(f, minor(rdev));
541 else if (flags & XMIT_RDEV_MINOR_8_pre30)
542 write_byte(f, minor(rdev));
544 write_int(f, minor(rdev));
549 if (preserve_links && S_ISLNK(mode)) {
550 const char *sl = F_SYMLINK(file);
551 int len = strlen(sl);
552 write_varint30(f, len);
553 write_buf(f, sl, len);
557 #ifdef SUPPORT_HARD_LINKS
558 if (tmp_dev != 0 && protocol_version < 30) {
559 if (protocol_version < 26) {
560 /* 32-bit dev_t and ino_t */
561 write_int(f, (int32)dev);
562 write_int(f, (int32)tmp_ino);
564 /* 64-bit dev_t and ino_t */
565 if (!(flags & XMIT_SAME_DEV_pre30))
566 write_longint(f, dev);
567 write_longint(f, tmp_ino);
572 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
577 /* Prior to 28, we sent a useless set of nulls. */
580 write_buf(f, sum, checksum_len);
584 strlcpy(lastname, fname, MAXPATHLEN);
586 if (S_ISREG(mode) || S_ISLNK(mode))
587 stats.total_size += F_LENGTH(file);
590 static struct file_struct *recv_file_entry(struct file_list *flist,
593 static int64 modtime;
597 static uint32 rdev_major;
600 static uint16 gid_flags;
601 static char lastname[MAXPATHLEN], *lastdir;
602 static int lastdir_depth, lastdir_len = -1;
603 static unsigned int del_hier_name_len = 0;
604 static int in_del_hier = 0;
605 char thisname[MAXPATHLEN];
606 unsigned int l1 = 0, l2 = 0;
607 int alloc_len, basename_len, linkname_len;
608 int extra_len = file_extra_cnt * EXTRA_LEN;
609 int first_hlink_ndx = -1;
611 const char *basename;
612 struct file_struct *file;
616 if (xflags & XMIT_SAME_NAME)
619 if (xflags & XMIT_LONG_NAME)
620 l2 = read_varint30(f);
624 if (l2 >= MAXPATHLEN - l1) {
626 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
627 xflags, l1, l2, lastname, who_am_i());
628 overflow_exit("recv_file_entry");
631 strlcpy(thisname, lastname, l1 + 1);
632 read_sbuf(f, &thisname[l1], l2);
633 thisname[l1 + l2] = 0;
635 /* Abuse basename_len for a moment... */
636 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
639 if (ic_recv != (iconv_t)-1) {
640 char *obuf = thisname;
641 ICONV_CONST char *ibuf = (ICONV_CONST char *)lastname;
642 size_t ocnt = MAXPATHLEN, icnt = basename_len;
644 if (icnt >= MAXPATHLEN) {
649 iconv(ic_recv, NULL,0, NULL,0);
650 if (iconv(ic_recv, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
652 io_error |= IOERR_GENERAL;
654 "[%s] cannot convert filename: %s (%s)\n",
655 who_am_i(), lastname, strerror(errno));
662 clean_fname(thisname, 0);
665 sanitize_path(thisname, thisname, "", 0, NULL);
667 if ((basename = strrchr(thisname, '/')) != NULL) {
668 int len = basename++ - thisname;
669 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
670 lastdir = new_array(char, len + 1);
671 memcpy(lastdir, thisname, len);
674 lastdir_depth = count_dir_elements(lastdir);
678 basename_len = strlen(basename) + 1; /* count the '\0' */
680 #ifdef SUPPORT_HARD_LINKS
681 if (protocol_version >= 30
682 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
683 struct file_struct *first;
684 first_hlink_ndx = read_varint30(f);
685 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->count) {
687 "hard-link reference out of range: %d (%d)\n",
688 first_hlink_ndx, flist->count);
689 exit_cleanup(RERR_PROTOCOL);
691 first = flist->files[first_hlink_ndx];
692 file_length = F_LENGTH(first);
693 modtime = first->modtime;
696 uid = F_OWNER(first);
698 gid = F_GROUP(first);
699 if ((preserve_devices && IS_DEVICE(mode))
700 || (preserve_specials && IS_SPECIAL(mode))) {
701 uint32 *devp = F_RDEV_P(first);
702 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
703 extra_len += 2 * EXTRA_LEN;
705 if (preserve_links && S_ISLNK(mode))
706 linkname_len = strlen(F_SYMLINK(first)) + 1;
713 file_length = read_varlong30(f, 3);
714 if (!(xflags & XMIT_SAME_TIME)) {
715 if (protocol_version >= 30) {
716 modtime = read_varlong(f, 4);
717 #if SIZEOF_TIME_T < SIZEOF_INT64
718 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
720 "Time value of %s truncated on receiver.\n",
725 modtime = read_int(f);
727 if (!(xflags & XMIT_SAME_MODE))
728 mode = from_wire_mode(read_int(f));
730 if (chmod_modes && !S_ISLNK(mode))
731 mode = tweak_mode(mode, chmod_modes);
733 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
734 if (protocol_version < 30)
735 uid = (uid_t)read_int(f);
737 uid = (uid_t)read_varint(f);
738 if (xflags & XMIT_USER_NAME_FOLLOWS)
739 uid = recv_user_name(f, uid);
740 else if (inc_recurse && am_root && !numeric_ids)
741 uid = match_uid(uid);
744 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
745 if (protocol_version < 30)
746 gid = (gid_t)read_int(f);
748 gid = (gid_t)read_varint(f);
750 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
751 gid = recv_group_name(f, gid, &gid_flags);
752 else if (inc_recurse && (!am_root || !numeric_ids))
753 gid = match_gid(gid, &gid_flags);
757 if ((preserve_devices && IS_DEVICE(mode))
758 || (preserve_specials && IS_SPECIAL(mode))) {
759 if (protocol_version < 28) {
760 if (!(xflags & XMIT_SAME_RDEV_pre28))
761 rdev = (dev_t)read_int(f);
764 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
765 rdev_major = read_varint30(f);
766 if (protocol_version >= 30)
767 rdev_minor = read_varint(f);
768 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
769 rdev_minor = read_byte(f);
771 rdev_minor = read_int(f);
772 rdev = MAKEDEV(rdev_major, rdev_minor);
774 extra_len += 2 * EXTRA_LEN;
776 } else if (protocol_version < 28)
777 rdev = MAKEDEV(0, 0);
780 if (preserve_links && S_ISLNK(mode)) {
781 linkname_len = read_varint30(f) + 1; /* count the '\0' */
782 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
783 rprintf(FERROR, "overflow: linkname_len=%d\n",
785 overflow_exit("recv_file_entry");
792 #ifdef SUPPORT_HARD_LINKS
794 if (preserve_hard_links) {
795 if (protocol_version < 28 && S_ISREG(mode))
796 xflags |= XMIT_HLINKED;
797 if (xflags & XMIT_HLINKED)
798 extra_len += EXTRA_LEN;
803 /* We need one or two index int32s when we're preserving ACLs. */
805 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
808 if (always_checksum && S_ISREG(mode))
809 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
811 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
812 extra_len += EXTRA_LEN;
814 #if EXTRA_ROUNDING > 0
815 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
816 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
819 if (inc_recurse && S_ISDIR(mode)) {
820 if (one_file_system) {
821 /* Room to save the dir's device for -x */
822 extra_len += 2 * EXTRA_LEN;
824 pool = dir_flist->file_pool;
826 pool = flist->file_pool;
828 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
830 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
832 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
834 file = (struct file_struct *)bp;
835 bp += FILE_STRUCT_LEN;
837 memcpy(bp, basename, basename_len);
838 bp += basename_len + linkname_len; /* skip space for symlink too */
840 #ifdef SUPPORT_HARD_LINKS
841 if (xflags & XMIT_HLINKED)
842 file->flags |= FLAG_HLINKED;
844 file->modtime = (time_t)modtime;
845 file->len32 = (uint32)file_length;
846 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
847 file->flags |= FLAG_LENGTH64;
848 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
855 file->flags |= gid_flags;
859 F_NDX(file) = flist->count + flist->ndx_start;
862 if (basename != thisname) {
863 file->dirname = lastdir;
864 F_DEPTH(file) = lastdir_depth + 1;
869 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
871 if (xflags & XMIT_TOP_DIR) {
872 in_del_hier = recurse;
873 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
874 if (relative_paths && del_hier_name_len > 2
875 && lastname[del_hier_name_len-1] == '.'
876 && lastname[del_hier_name_len-2] == '/')
877 del_hier_name_len -= 2;
878 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
879 } else if (in_del_hier) {
880 if (!relative_paths || !del_hier_name_len
881 || (l1 >= del_hier_name_len
882 && lastname[del_hier_name_len] == '/'))
883 file->flags |= FLAG_XFER_DIR;
889 if ((preserve_devices && IS_DEVICE(mode))
890 || (preserve_specials && IS_SPECIAL(mode))) {
891 uint32 *devp = F_RDEV_P(file);
892 DEV_MAJOR(devp) = major(rdev);
893 DEV_MINOR(devp) = minor(rdev);
898 bp = (char*)file->basename + basename_len;
899 if (first_hlink_ndx >= 0) {
900 struct file_struct *first = flist->files[first_hlink_ndx];
901 memcpy(bp, F_SYMLINK(first), linkname_len);
903 read_sbuf(f, bp, linkname_len - 1);
905 sanitize_path(bp, bp, "", lastdir_depth, NULL);
909 #ifdef SUPPORT_HARD_LINKS
910 if (preserve_hard_links && xflags & XMIT_HLINKED) {
911 if (protocol_version >= 30) {
912 F_HL_GNUM(file) = xflags & XMIT_HLINK_FIRST
913 ? flist->count : first_hlink_ndx;
915 static int32 cnt = 0;
916 struct idev_node *np;
919 if (protocol_version < 26) {
923 if (!(xflags & XMIT_SAME_DEV_pre30))
924 dev = read_longint(f);
925 ino = read_longint(f);
927 np = idev_node(dev, ino);
928 ndx = (int32)(long)np->data - 1;
931 np->data = (void*)(long)cnt;
933 F_HL_GNUM(file) = ndx;
938 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
940 bp = (char*)F_SUM(file);
942 /* Prior to 28, we get a useless set of nulls. */
945 if (first_hlink_ndx >= 0) {
946 struct file_struct *first = flist->files[first_hlink_ndx];
947 memcpy(bp, F_SUM(first), checksum_len);
949 read_buf(f, bp, checksum_len);
953 if (preserve_acls && !S_ISLNK(mode))
954 receive_acl(file, f);
956 #ifdef SUPPORT_XATTRS
958 receive_xattr(file, f );
961 if (S_ISREG(mode) || S_ISLNK(mode))
962 stats.total_size += file_length;
968 * Create a file_struct for a named file by reading its stat()
969 * information and performing extensive checks against global
972 * @return the new file, or NULL if there was an error or this file
973 * should be excluded.
975 * @todo There is a small optimization opportunity here to avoid
976 * stat()ing the file in some circumstances, which has a certain cost.
977 * We are called immediately after doing readdir(), and so we may
978 * already know the d_type of the file. We could for example avoid
979 * statting directories if we're not recursing, but this is not a very
980 * important case. Some systems may not have d_type.
982 struct file_struct *make_file(const char *fname, struct file_list *flist,
983 STRUCT_STAT *stp, int flags, int filter_level)
985 static char *lastdir;
986 static int lastdir_len = -1;
987 struct file_struct *file;
989 char thisname[MAXPATHLEN];
990 char linkname[MAXPATHLEN];
991 int alloc_len, basename_len, linkname_len;
992 int extra_len = file_extra_cnt * EXTRA_LEN;
993 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. */
1086 if (flist->prev && S_ISDIR(st.st_mode)
1087 && flags & FLAG_DIVERT_DIRS) {
1088 /* Room for parent/sibling/next-child info. */
1089 extra_len += 3 * EXTRA_LEN;
1091 pool = dir_flist->file_pool;
1093 pool = flist->file_pool;
1098 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1099 who_am_i(), thisname, filter_level);
1102 if ((basename = strrchr(thisname, '/')) != NULL) {
1103 int len = basename++ - thisname;
1104 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1105 lastdir = new_array(char, len + 1);
1106 memcpy(lastdir, thisname, len);
1107 lastdir[len] = '\0';
1111 basename = thisname;
1112 basename_len = strlen(basename) + 1; /* count the '\0' */
1114 #ifdef SUPPORT_LINKS
1115 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1120 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1121 extra_len += EXTRA_LEN;
1123 #if EXTRA_ROUNDING > 0
1124 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1125 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1128 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1131 bp = pool_alloc(pool, alloc_len, "make_file");
1133 if (!(bp = new_array(char, alloc_len)))
1134 out_of_memory("make_file");
1137 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1139 file = (struct file_struct *)bp;
1140 bp += FILE_STRUCT_LEN;
1142 memcpy(bp, basename, basename_len);
1143 bp += basename_len + linkname_len; /* skip space for symlink too */
1145 #ifdef SUPPORT_HARD_LINKS
1146 if (preserve_hard_links && flist && flist->prev) {
1147 if (protocol_version >= 28
1148 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1149 : S_ISREG(st.st_mode)) {
1150 tmp_dev = st.st_dev;
1151 tmp_ino = st.st_ino;
1157 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1158 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1159 tmp_rdev = st.st_rdev;
1164 file->flags = flags;
1165 file->modtime = st.st_mtime;
1166 file->len32 = (uint32)st.st_size;
1167 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1168 file->flags |= FLAG_LENGTH64;
1169 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1171 file->mode = st.st_mode;
1173 F_OWNER(file) = st.st_uid;
1175 F_GROUP(file) = st.st_gid;
1177 if (basename != thisname)
1178 file->dirname = lastdir;
1180 #ifdef SUPPORT_LINKS
1182 bp = (char*)file->basename + basename_len;
1183 memcpy(bp, linkname, linkname_len);
1187 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1188 file_checksum(thisname, tmp_sum, st.st_size);
1190 F_PATHNAME(file) = pathname;
1192 /* This code is only used by the receiver when it is building
1193 * a list of files for a delete pass. */
1194 if (keep_dirlinks && linkname_len && flist) {
1196 int save_mode = file->mode;
1197 file->mode = S_IFDIR; /* Find a directory with our name. */
1198 if (flist_find(dir_flist, file) >= 0
1199 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1200 file->modtime = st2.st_mtime;
1202 file->mode = st2.st_mode;
1204 F_OWNER(file) = st2.st_uid;
1206 F_GROUP(file) = st2.st_gid;
1208 file->mode = save_mode;
1211 if (basename_len == 0+1)
1216 F_NDX(file) = dir_count - 1;
1222 /* Only called for temporary file_struct entries created by make_file(). */
1223 void unmake_file(struct file_struct *file)
1225 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1226 #if EXTRA_ROUNDING > 0
1227 if (extra_cnt & EXTRA_ROUNDING)
1228 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1230 free(REQ_EXTRA(file, extra_cnt));
1233 static struct file_struct *send_file_name(int f, struct file_list *flist,
1234 char *fname, STRUCT_STAT *stp,
1235 int flags, int filter_flags)
1237 struct file_struct *file;
1238 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1242 file = make_file(fname, flist, stp, flags, filter_flags);
1246 if (chmod_modes && !S_ISLNK(file->mode))
1247 file->mode = tweak_mode(file->mode, chmod_modes);
1250 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1251 sx.st.st_mode = file->mode;
1252 sx.acc_acl = sx.def_acl = NULL;
1253 if (get_acl(fname, &sx) < 0)
1257 #ifdef SUPPORT_XATTRS
1258 if (preserve_xattrs && f >= 0) {
1260 if (get_xattr(fname, &sx) < 0)
1265 maybe_emit_filelist_progress(flist->count + flist_count_offset);
1267 flist_expand(flist, 1);
1268 flist->files[flist->count++] = file;
1270 send_file_entry(f, file, flist->count - 1);
1272 if (preserve_acls && !S_ISLNK(file->mode)) {
1277 #ifdef SUPPORT_XATTRS
1278 if (preserve_xattrs) {
1279 F_XATTR(file) = send_xattr(&sx, f);
1287 static void send_if_directory(int f, struct file_list *flist,
1288 struct file_struct *file,
1289 char *fbuf, unsigned int ol,
1292 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1294 if (S_ISDIR(file->mode)
1295 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1297 unsigned int len = strlen(fbuf);
1298 if (len > 1 && fbuf[len-1] == '/')
1300 if (len >= MAXPATHLEN - 1) {
1301 io_error |= IOERR_GENERAL;
1302 rprintf(FERROR, "skipping long-named directory: %s\n",
1306 save_filters = push_local_filters(fbuf, len);
1307 send_directory(f, flist, fbuf, len, flags);
1308 pop_local_filters(save_filters);
1315 static int file_compare(const void *file1, const void *file2)
1317 return f_name_cmp(*(struct file_struct **)file1,
1318 *(struct file_struct **)file2);
1321 /* The guts of a merge-sort algorithm. This was derived from the glibc
1322 * version, but I (Wayne) changed the merge code to do less copying and
1323 * to require only half the amount of temporary memory. */
1324 static void fsort_tmp(struct file_struct **fp, size_t num,
1325 struct file_struct **tmp)
1327 struct file_struct **f1, **f2, **t;
1336 fsort_tmp(f1, n1, tmp);
1338 fsort_tmp(f2, n2, tmp);
1340 while (f_name_cmp(*f1, *f2) <= 0) {
1347 memcpy(t, f1, n1 * PTR_SIZE);
1349 *f1++ = *f2++, n2--;
1351 while (n1 > 0 && n2 > 0) {
1352 if (f_name_cmp(*t, *f2) <= 0)
1355 *f1++ = *f2++, n2--;
1359 memcpy(f1, t, n1 * PTR_SIZE);
1362 /* This file-struct sorting routine makes sure that any identical names in
1363 * the file list stay in the same order as they were in the original list.
1364 * This is particularly vital in inc_recurse mode where we expect a sort
1365 * on the flist to match the exact order of a sort on the dir_flist. */
1366 static void fsort(struct file_struct **fp, size_t num)
1372 qsort(fp, num, PTR_SIZE, file_compare);
1374 struct file_struct **tmp = new_array(struct file_struct *,
1376 fsort_tmp(fp, num, tmp);
1381 /* We take an entire set of sibling dirs from the sorted flist and link them
1382 * into the tree, setting the appropriate parent/child/sibling pointers. */
1383 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1388 int32 *parent_dp = parent_ndx < 0 ? NULL
1389 : F_DIRNODE_P(dir_flist->sorted[parent_ndx]);
1391 flist_expand(dir_flist, dir_cnt);
1392 dir_flist->sorted = dir_flist->files;
1394 for (i = 0; dir_cnt; i++) {
1395 struct file_struct *file = from_flist->sorted[i];
1397 if (!S_ISDIR(file->mode))
1400 dir_flist->files[dir_flist->count++] = file;
1403 if (!(file->flags & FLAG_XFER_DIR)
1404 || file->flags & FLAG_MOUNT_DIR)
1408 DIR_NEXT_SIBLING(dp) = dir_flist->count - 1;
1410 DIR_FIRST_CHILD(parent_dp) = dir_flist->count - 1;
1412 send_dir_ndx = dir_flist->count - 1;
1414 dp = F_DIRNODE_P(file);
1415 DIR_PARENT(dp) = parent_ndx;
1416 DIR_FIRST_CHILD(dp) = -1;
1419 DIR_NEXT_SIBLING(dp) = -1;
1422 /* This function is normally called by the sender, but the receiving side also
1423 * calls it from get_dirlist() with f set to -1 so that we just construct the
1424 * file list in memory without sending it over the wire. Also, get_dirlist()
1425 * might call this with f set to -2, which also indicates that local filter
1426 * rules should be ignored. */
1427 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1434 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1435 int start = flist->count;
1436 int filter_flags = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1438 assert(flist != NULL);
1440 if (!(d = opendir(fbuf))) {
1441 io_error |= IOERR_GENERAL;
1442 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1447 if (len != 1 || *fbuf != '/')
1450 remainder = MAXPATHLEN - (p - fbuf);
1452 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1453 char *dname = d_name(di);
1454 if (dname[0] == '.' && (dname[1] == '\0'
1455 || (dname[1] == '.' && dname[2] == '\0')))
1457 if (strlcpy(p, dname, remainder) >= remainder) {
1458 io_error |= IOERR_GENERAL;
1460 "cannot send long-named file %s\n",
1465 send_file_name(f, flist, fbuf, NULL, flags, filter_flags);
1471 io_error |= IOERR_GENERAL;
1472 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1477 if (f >= 0 && recurse && !divert_dirs) {
1478 int i, end = flist->count - 1;
1479 /* send_if_directory() bumps flist->count, so use "end". */
1480 for (i = start; i <= end; i++)
1481 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1485 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1487 char fbuf[MAXPATHLEN];
1491 dlen = strlen(fbuf);
1493 if (F_PATHNAME(file) != pathname) {
1494 if (!push_pathname(F_PATHNAME(file), -1))
1495 exit_cleanup(RERR_FILESELECT);
1498 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1500 send_directory(f, flist, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1503 void send_extra_file_list(int f, int at_least)
1505 struct file_list *flist;
1507 int future_cnt, save_io_error = io_error;
1512 /* Keep sending data until we have the requested number of
1513 * files in the upcoming file-lists. */
1514 if (cur_flist->next) {
1515 flist = first_flist->prev; /* the newest flist */
1516 future_cnt = flist->count + flist->ndx_start
1517 - cur_flist->next->ndx_start;
1520 while (future_cnt < at_least) {
1521 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1522 int dir_ndx, dstart = dir_count;
1525 flist = flist_new(0, "send_extra_file_list");
1526 start_write = stats.total_written;
1530 dir_ndx = F_NDX(file);
1533 dir_ndx = send_dir_ndx;
1534 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1536 send1extra(f, file, flist);
1537 dp = F_DIRNODE_P(file);
1539 /* If there are any duplicate directory names that follow, we
1540 * send all the dirs together in one file-list. The dir_flist
1541 * tree links all the child subdirs onto the last dup dir. */
1542 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1543 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1544 send_dir_ndx = dir_ndx;
1545 file = dir_flist->sorted[dir_ndx];
1546 send1extra(f, file, flist);
1547 dp = F_DIRNODE_P(file);
1553 if (need_unsorted_flist) {
1554 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1555 out_of_memory("send_extra_file_list");
1556 memcpy(flist->sorted, flist->files,
1557 flist->count * sizeof (struct file_struct*));
1560 flist->sorted = flist->files;
1562 clean_flist(flist, 0);
1564 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1566 file_total += flist->count;
1567 future_cnt += flist->count;
1568 stats.flist_size += stats.total_written - start_write;
1569 stats.num_files += flist->count;
1571 output_flist(flist);
1573 if (DIR_FIRST_CHILD(dp) >= 0) {
1574 send_dir_ndx = DIR_FIRST_CHILD(dp);
1577 while (DIR_NEXT_SIBLING(dp) < 0) {
1578 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1579 write_ndx(f, NDX_FLIST_EOF);
1581 change_local_filter_dir(NULL, 0, 0);
1585 file = dir_flist->sorted[send_dir_ndx];
1586 dp = F_DIRNODE_P(file);
1588 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1593 if (io_error != save_io_error && !ignore_errors)
1594 send_msg_int(MSG_IO_ERROR, io_error);
1597 struct file_list *send_file_list(int f, int argc, char *argv[])
1599 static const char *lastdir;
1600 static int lastdir_len = -1;
1604 char lastpath[MAXPATHLEN] = "";
1605 struct file_list *flist;
1606 struct timeval start_tv, end_tv;
1609 int flags, disable_buffering;
1611 rprintf(FLOG, "building file list\n");
1612 if (show_filelist_p())
1613 start_filelist_progress("building file list");
1614 else if (inc_recurse && verbose && !am_server)
1615 rprintf(FCLIENT, "sending incremental file list\n");
1617 start_write = stats.total_written;
1618 gettimeofday(&start_tv, NULL);
1620 #ifdef SUPPORT_HARD_LINKS
1621 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1625 flist = cur_flist = flist_new(0, "send_file_list");
1627 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1628 flags = FLAG_DIVERT_DIRS;
1630 dir_flist = cur_flist;
1634 disable_buffering = io_start_buffering_out(f);
1635 if (filesfrom_fd >= 0) {
1636 if (argv[0] && !push_dir(argv[0], 0)) {
1637 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1638 full_fname(argv[0]), curr_dir);
1639 exit_cleanup(RERR_FILESELECT);
1645 char fbuf[MAXPATHLEN];
1650 if (read_filesfrom_line(filesfrom_fd, fbuf) == 0)
1652 sanitize_path(fbuf, fbuf, "", 0, NULL);
1656 strlcpy(fbuf, *argv++, MAXPATHLEN);
1658 sanitize_path(fbuf, fbuf, "", 0, NULL);
1662 if (relative_paths) {
1663 /* We clean up fbuf below. */
1665 } else if (!len || fbuf[len - 1] == '/') {
1666 if (len == 2 && fbuf[0] == '.') {
1667 /* Turn "./" into just "." rather than "./." */
1670 if (len + 1 >= MAXPATHLEN)
1671 overflow_exit("send_file_list");
1676 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1677 && (len == 2 || fbuf[len-3] == '/')) {
1678 if (len + 2 >= MAXPATHLEN)
1679 overflow_exit("send_file_list");
1685 is_dot_dir = fbuf[len-1] == '.'
1686 && (len == 1 || fbuf[len-2] == '/');
1691 if (!relative_paths) {
1692 p = strrchr(fbuf, '/');
1699 len -= p - fbuf + 1;
1704 if ((p = strstr(fbuf, "/./")) != NULL) {
1710 len -= p - fbuf + 3;
1714 /* Get rid of trailing "/" and "/.". */
1716 if (fn[len - 1] == '/') {
1718 if (!--len && !dir) {
1723 else if (len >= 2 && fn[len - 1] == '.'
1724 && fn[len - 2] == '/') {
1726 if (!(len -= 2) && !dir) {
1733 if (len == 1 && fn[0] == '/')
1736 /* Reject a ".." dir in the active part of the path. */
1737 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1738 if ((p[2] == '/' || p[2] == '\0')
1739 && (p == fn || p[-1] == '/')) {
1741 "found \"..\" dir in relative path: %s\n",
1743 exit_cleanup(RERR_SYNTAX);
1753 dirlen = dir ? strlen(dir) : 0;
1754 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1755 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1758 lastdir_len = pathname_len;
1759 } else if (!push_pathname(lastdir, lastdir_len)) {
1761 io_error |= IOERR_GENERAL;
1762 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1763 full_fname(dir), curr_dir);
1768 memmove(fbuf, fn, len + 1);
1770 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1771 io_error |= IOERR_GENERAL;
1772 rsyserr(FERROR, errno, "link_stat %s failed",
1777 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1778 rprintf(FINFO, "skipping directory %s\n", fbuf);
1782 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1783 /* Send the implied directories at the start of the
1784 * source spec, so we get their permissions right. */
1785 char *lp = lastpath, *slash = fbuf;
1787 /* Skip any initial directories in our path that we
1788 * have in common with lastpath. */
1789 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1794 if (fn != p || (*lp && *lp != '/')) {
1795 int save_copy_links = copy_links;
1796 int save_xfer_dirs = xfer_dirs;
1797 int dir_flags = inc_recurse ? FLAG_DIVERT_DIRS : 0;
1798 copy_links |= copy_unsafe_links;
1800 while ((slash = strchr(slash+1, '/')) != 0) {
1802 send_file_name(f, flist, fbuf, NULL,
1803 dir_flags, ALL_FILTERS);
1806 copy_links = save_copy_links;
1807 xfer_dirs = save_xfer_dirs;
1809 strlcpy(lastpath, fbuf, sizeof lastpath);
1814 if (one_file_system)
1815 filesystem_dev = st.st_dev;
1817 if (recurse || (xfer_dirs && is_dot_dir)) {
1818 struct file_struct *file;
1819 int top_flags = FLAG_TOP_DIR | FLAG_XFER_DIR | flags;
1820 file = send_file_name(f, flist, fbuf, &st,
1821 top_flags, ALL_FILTERS);
1822 if (file && !inc_recurse)
1823 send_if_directory(f, flist, file, fbuf, len, flags);
1825 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1828 gettimeofday(&end_tv, NULL);
1829 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1830 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1831 if (stats.flist_buildtime == 0)
1832 stats.flist_buildtime = 1;
1835 write_byte(f, 0); /* Indicate end of file list */
1837 #ifdef SUPPORT_HARD_LINKS
1838 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1842 if (show_filelist_p())
1843 finish_filelist_progress(flist);
1845 gettimeofday(&end_tv, NULL);
1846 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1847 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1849 /* When converting names, both sides keep an unsorted file-list array
1850 * because the names will differ on the sending and receiving sides
1851 * (both sides will use the unsorted index number for each item). */
1853 /* Sort the list without removing any duplicates. This allows the
1854 * receiving side to ask for whatever name it kept. For incremental
1855 * recursion mode, the sender marks duplicate dirs so that it can
1856 * send them together in a single file-list. */
1858 if (need_unsorted_flist) {
1860 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1861 out_of_memory("send_file_list");
1862 memcpy(flist->sorted, flist->files,
1863 flist->count * sizeof (struct file_struct*));
1864 clean_flist(flist, 0);
1866 flist->sorted = flist->files;
1870 flist->sorted = flist->files;
1871 clean_flist(flist, 0);
1873 file_total += flist->count;
1875 if (!numeric_ids && !inc_recurse)
1878 /* send the io_error flag */
1879 if (protocol_version < 30)
1880 write_int(f, ignore_errors ? 0 : io_error);
1881 else if (io_error && !ignore_errors)
1882 send_msg_int(MSG_IO_ERROR, io_error);
1884 if (disable_buffering)
1885 io_end_buffering_out();
1887 stats.flist_size = stats.total_written - start_write;
1888 stats.num_files = flist->count;
1891 output_flist(flist);
1894 rprintf(FINFO, "send_file_list done\n");
1897 add_dirs_to_tree(-1, flist, dir_count);
1898 if (send_dir_ndx < 0) {
1899 write_ndx(f, NDX_FLIST_EOF);
1902 else if (file_total == 1) {
1903 /* If we're creating incremental file-lists and there
1904 * was just 1 item in the first file-list, send 1 more
1905 * file-list to check if this is a 1-file xfer. */
1906 send_extra_file_list(f, 1);
1913 struct file_list *recv_file_list(int f)
1915 struct file_list *flist;
1920 rprintf(FLOG, "receiving file list\n");
1921 if (show_filelist_p())
1922 start_filelist_progress("receiving file list");
1923 else if (inc_recurse && verbose && !am_server && !first_flist)
1924 rprintf(FCLIENT, "receiving incremental file list\n");
1926 start_read = stats.total_read;
1928 flist = flist_new(0, "recv_file_list");
1930 #ifdef SUPPORT_HARD_LINKS
1931 if (preserve_hard_links && protocol_version < 30)
1936 if (flist->ndx_start == 0)
1937 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1938 dstart = dir_flist->count;
1944 while ((flags = read_byte(f)) != 0) {
1945 struct file_struct *file;
1947 flist_expand(flist, 1);
1949 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1950 flags |= read_byte(f) << 8;
1951 file = recv_file_entry(flist, flags, f);
1953 if (inc_recurse && S_ISDIR(file->mode)) {
1954 flist_expand(dir_flist, 1);
1955 dir_flist->files[dir_flist->count++] = file;
1958 flist->files[flist->count++] = file;
1960 maybe_emit_filelist_progress(flist->count);
1963 rprintf(FINFO, "recv_file_name(%s)\n",
1964 f_name(file, NULL));
1967 file_total += flist->count;
1970 rprintf(FINFO, "received %d names\n", flist->count);
1972 if (show_filelist_p())
1973 finish_filelist_progress(flist);
1976 if (need_unsorted_flist) {
1977 /* Create an extra array of index pointers that we can sort for
1978 * the generator's use (for wading through the files in sorted
1979 * order and for calling flist_find()). We keep the "files"
1980 * list unsorted for our exchange of index numbers with the
1981 * other side (since their names may not sort the same). */
1982 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1983 out_of_memory("recv_file_list");
1984 memcpy(flist->sorted, flist->files,
1985 flist->count * sizeof (struct file_struct*));
1986 if (inc_recurse && dir_flist->count > dstart) {
1987 dir_flist->sorted = realloc_array(dir_flist->sorted,
1988 struct file_struct *,
1990 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
1991 (dir_flist->count - dstart) * sizeof (struct file_struct*));
1992 fsort(dir_flist->sorted + dstart, dir_flist->count - dstart);
1997 flist->sorted = flist->files;
1998 if (inc_recurse && dir_flist->count > dstart) {
1999 dir_flist->sorted = dir_flist->files;
2000 fsort(dir_flist->sorted + dstart, dir_flist->count - dstart);
2004 if (!inc_recurse && f >= 0)
2005 recv_id_list(f, flist);
2007 clean_flist(flist, relative_paths);
2009 if (protocol_version < 30) {
2010 /* Recv the io_error flag */
2014 io_error |= read_int(f);
2018 output_flist(flist);
2022 for (i = 0; i < flist->count; i++)
2023 list_file_entry(flist->files[i]);
2027 rprintf(FINFO, "recv_file_list done\n");
2029 stats.flist_size += stats.total_read - start_read;
2030 stats.num_files += flist->count;
2035 /* This is only used once by the receiver if the very first file-list
2036 * has exactly one item in it. */
2037 void recv_additional_file_list(int f)
2039 struct file_list *flist;
2040 int ndx = read_ndx(f);
2041 if (ndx == NDX_FLIST_EOF) {
2043 change_local_filter_dir(NULL, 0, 0);
2045 ndx = NDX_FLIST_OFFSET - ndx;
2046 if (ndx < 0 || ndx >= dir_flist->count) {
2047 ndx = NDX_FLIST_OFFSET - ndx;
2049 "[%s] Invalid dir index: %d (%d - %d)\n",
2050 who_am_i(), ndx, NDX_FLIST_OFFSET,
2051 NDX_FLIST_OFFSET - dir_flist->count + 1);
2052 exit_cleanup(RERR_PROTOCOL);
2055 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2058 flist = recv_file_list(f);
2059 flist->parent_ndx = ndx;
2063 /* Search for an identically-named item in the file list. Note that the
2064 * items must agree in their directory-ness, or no match is returned. */
2065 int flist_find(struct file_list *flist, struct file_struct *f)
2067 int low = flist->low, high = flist->high;
2068 int diff, mid, mid_up;
2070 while (low <= high) {
2071 mid = (low + high) / 2;
2072 if (F_IS_ACTIVE(flist->sorted[mid]))
2075 /* Scan for the next non-empty entry using the cached
2076 * distance values. If the value isn't fully up-to-
2077 * date, update it. */
2078 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2079 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2081 mid_up += F_DEPTH(flist->sorted[mid_up]);
2082 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2083 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2085 if (mid_up > high) {
2086 /* If there's nothing left above us, set high to
2087 * a non-empty entry below us and continue. */
2088 high = mid - (int)flist->sorted[mid]->len32;
2089 if (!F_IS_ACTIVE(flist->sorted[high])) {
2091 high -= (int)flist->sorted[high]->len32;
2092 } while (!F_IS_ACTIVE(flist->sorted[high]));
2093 flist->sorted[mid]->len32 = mid - high;
2098 diff = f_name_cmp(flist->sorted[mid_up], f);
2100 if (protocol_version < 29
2101 && S_ISDIR(flist->sorted[mid_up]->mode)
2102 != S_ISDIR(f->mode))
2115 * Free up any resources a file_struct has allocated
2116 * and clear the file.
2118 void clear_file(struct file_struct *file)
2120 /* The +1 zeros out the first char of the basename. */
2121 memset(file, 0, FILE_STRUCT_LEN + 1);
2122 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2123 * entry. Likewise for len32 in the opposite direction. We assume
2124 * that we're alone for now since flist_find() will adjust the counts
2125 * it runs into that aren't up-to-date. */
2126 file->len32 = F_DEPTH(file) = 1;
2129 /* Allocate a new file list. */
2130 struct file_list *flist_new(int flags, char *msg)
2132 struct file_list *flist;
2134 flist = new(struct file_list);
2138 memset(flist, 0, sizeof flist[0]);
2140 if (!(flags & FLIST_TEMP)) {
2142 flist->ndx_start = first_flist->prev->ndx_start
2143 + first_flist->prev->count;
2145 /* This is a doubly linked list with prev looping back to
2146 * the end of the list, but the last next pointer is NULL. */
2148 first_flist = cur_flist = flist->prev = flist;
2150 flist->prev = first_flist->prev;
2151 flist->prev->next = first_flist->prev = flist;
2156 if (!(flist->file_pool = pool_create(FILE_EXTENT, 0, out_of_memory, POOL_INTERN)))
2162 /* Free up all elements in a flist. */
2163 void flist_free(struct file_list *flist)
2166 ; /* Was FLIST_TEMP dir-list. */
2167 else if (flist == flist->prev) {
2168 first_flist = cur_flist = NULL;
2172 if (flist == cur_flist)
2173 cur_flist = flist->next;
2174 if (flist == first_flist)
2175 first_flist = first_flist->next;
2177 flist->prev->next = flist->next;
2179 flist->next = first_flist;
2181 flist->next->prev = flist->prev;
2182 file_total -= flist->count;
2186 pool_destroy(flist->file_pool);
2187 if (flist->sorted && flist->sorted != flist->files)
2188 free(flist->sorted);
2193 /* This routine ensures we don't have any duplicate names in our file list.
2194 * duplicate names can cause corruption because of the pipelining. */
2195 static void clean_flist(struct file_list *flist, int strip_root)
2197 char fbuf[MAXPATHLEN];
2202 if (flist->count == 0) {
2207 fsort(flist->sorted, flist->count);
2209 if (!am_sender || inc_recurse) {
2210 for (i = prev_i = 0; i < flist->count; i++) {
2211 if (F_IS_ACTIVE(flist->sorted[i])) {
2216 flist->low = prev_i;
2218 i = prev_i = flist->count - 1;
2222 while (++i < flist->count) {
2224 struct file_struct *file = flist->sorted[i];
2226 if (!F_IS_ACTIVE(file))
2228 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2230 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2231 int save_mode = file->mode;
2232 /* Make sure that this directory doesn't duplicate a
2233 * non-directory earlier in the list. */
2234 flist->high = prev_i;
2235 file->mode = S_IFREG;
2236 j = flist_find(flist, file);
2237 file->mode = save_mode;
2242 /* If one is a dir and the other is not, we want to
2243 * keep the dir because it might have contents in the
2245 if (S_ISDIR(file->mode)) {
2246 struct file_struct *fp = flist->sorted[j];
2247 if (!S_ISDIR(fp->mode))
2255 flist->sorted[drop]->flags |= FLAG_DUPLICATE;
2259 "removing duplicate name %s from file list (%d)\n",
2260 f_name(file, fbuf), drop + flist->ndx_start);
2262 /* Make sure we don't lose track of a user-specified
2264 flist->sorted[keep]->flags |= flist->sorted[drop]->flags
2265 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2267 clear_file(flist->sorted[drop]);
2271 if (flist->low == drop) {
2273 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2282 flist->high = prev_i;
2285 /* We need to strip off the leading slashes for relative
2286 * paths, but this must be done _after_ the sorting phase. */
2287 for (i = flist->low; i <= flist->high; i++) {
2288 struct file_struct *file = flist->sorted[i];
2292 while (*file->dirname == '/')
2294 if (!*file->dirname)
2295 file->dirname = NULL;
2299 if (prune_empty_dirs && !am_sender) {
2300 int j, prev_depth = 0;
2302 prev_i = 0; /* It's OK that this isn't really true. */
2304 for (i = flist->low; i <= flist->high; i++) {
2305 struct file_struct *fp, *file = flist->sorted[i];
2307 /* This temporarily abuses the F_DEPTH() value for a
2308 * directory that is in a chain that might get pruned.
2309 * We restore the old value if it gets a reprieve. */
2310 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2311 /* Dump empty dirs when coming back down. */
2312 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2313 fp = flist->sorted[prev_i];
2314 if (F_DEPTH(fp) >= 0)
2316 prev_i = -F_DEPTH(fp)-1;
2319 prev_depth = F_DEPTH(file);
2320 if (is_excluded(f_name(file, fbuf), 1,
2322 /* Keep dirs through this dir. */
2323 for (j = prev_depth-1; ; j--) {
2324 fp = flist->sorted[prev_i];
2325 if (F_DEPTH(fp) >= 0)
2327 prev_i = -F_DEPTH(fp)-1;
2331 F_DEPTH(file) = -prev_i-1;
2334 /* Keep dirs through this non-dir. */
2335 for (j = prev_depth; ; j--) {
2336 fp = flist->sorted[prev_i];
2337 if (F_DEPTH(fp) >= 0)
2339 prev_i = -F_DEPTH(fp)-1;
2344 /* Dump all remaining empty dirs. */
2346 struct file_struct *fp = flist->sorted[prev_i];
2347 if (F_DEPTH(fp) >= 0)
2349 prev_i = -F_DEPTH(fp)-1;
2353 for (i = flist->low; i <= flist->high; i++) {
2354 if (F_IS_ACTIVE(flist->sorted[i]))
2358 for (i = flist->high; i >= flist->low; i--) {
2359 if (F_IS_ACTIVE(flist->sorted[i]))
2366 static void output_flist(struct file_list *flist)
2368 char uidbuf[16], gidbuf[16], depthbuf[16];
2369 struct file_struct *file;
2370 const char *root, *dir, *slash, *name, *trail;
2371 const char *who = who_am_i();
2374 rprintf(FINFO, "[%s] flist start=%d, count=%d, low=%d, high=%d\n",
2375 who, flist->ndx_start, flist->count, flist->low, flist->high);
2376 for (i = 0; i < flist->count; i++) {
2377 file = flist->sorted[i];
2378 if ((am_root || am_sender) && preserve_uid) {
2379 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2384 static char parens[] = "(\0)\0\0\0";
2385 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2386 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2387 pp, F_GROUP(file), pp + 2);
2391 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2392 if (F_IS_ACTIVE(file)) {
2393 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2394 if ((dir = file->dirname) == NULL)
2398 name = file->basename;
2399 trail = S_ISDIR(file->mode) ? "/" : "";
2401 root = dir = slash = name = trail = "";
2403 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2404 who, i + flist->ndx_start,
2405 root, dir, slash, name, trail,
2406 (int)file->mode, (double)F_LENGTH(file),
2407 uidbuf, gidbuf, file->flags);
2411 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2412 enum fnc_type { t_PATH, t_ITEM };
2414 /* Compare the names of two file_struct entities, similar to how strcmp()
2415 * would do if it were operating on the joined strings.
2417 * Some differences beginning with protocol_version 29: (1) directory names
2418 * are compared with an assumed trailing slash so that they compare in a
2419 * way that would cause them to sort immediately prior to any content they
2420 * may have; (2) a directory of any name compares after a non-directory of
2421 * any name at the same depth; (3) a directory with name "." compares prior
2422 * to anything else. These changes mean that a directory and a non-dir
2423 * with the same name will not compare as equal (protocol_version >= 29).
2425 * The dirname component can be an empty string, but the basename component
2426 * cannot (and never is in the current codebase). The basename component
2427 * may be NULL (for a removed item), in which case it is considered to be
2428 * after any existing item. */
2429 int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
2432 const uchar *c1, *c2;
2433 enum fnc_state state1, state2;
2434 enum fnc_type type1, type2;
2435 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2437 if (!f1 || !F_IS_ACTIVE(f1)) {
2438 if (!f2 || !F_IS_ACTIVE(f2))
2442 if (!f2 || !F_IS_ACTIVE(f2))
2445 c1 = (uchar*)f1->dirname;
2446 c2 = (uchar*)f2->dirname;
2450 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2451 c1 = (const uchar*)f1->basename;
2452 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2454 state1 = s_TRAILING;
2463 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2464 c2 = (const uchar*)f2->basename;
2465 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2467 state2 = s_TRAILING;
2477 return type1 == t_PATH ? 1 : -1;
2487 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2488 c1 = (const uchar*)f1->basename;
2489 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2491 state1 = s_TRAILING;
2497 state1 = s_TRAILING;
2498 if (type1 == t_PATH) {
2507 if (*c2 && type1 != type2)
2508 return type1 == t_PATH ? 1 : -1;
2517 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2518 c2 = (const uchar*)f2->basename;
2519 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2521 state2 = s_TRAILING;
2527 state2 = s_TRAILING;
2528 if (type2 == t_PATH) {
2540 return type1 == t_PATH ? 1 : -1;
2542 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2547 char *f_name_buf(void)
2549 static char names[5][MAXPATHLEN];
2550 static unsigned int n;
2552 n = (n + 1) % (sizeof names / sizeof names[0]);
2557 /* Return a copy of the full filename of a flist entry, using the indicated
2558 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2559 * done because we checked the size when creating the file_struct entry.
2561 char *f_name(struct file_struct *f, char *fbuf)
2563 if (!f || !F_IS_ACTIVE(f))
2567 fbuf = f_name_buf();
2570 int len = strlen(f->dirname);
2571 memcpy(fbuf, f->dirname, len);
2573 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2575 strlcpy(fbuf, f->basename, MAXPATHLEN);
2580 /* Do a non-recursive scan of the named directory, possibly ignoring all
2581 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2582 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2583 * buffer (the functions we call will append names onto the end, but the old
2584 * dir value will be restored on exit). */
2585 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2587 struct file_list *dirlist;
2588 char dirbuf[MAXPATHLEN];
2589 int save_recurse = recurse;
2590 int save_xfer_dirs = xfer_dirs;
2593 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2594 if (dlen >= MAXPATHLEN)
2599 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2603 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2604 xfer_dirs = save_xfer_dirs;
2605 recurse = save_recurse;
2607 flist_count_offset += dirlist->count;
2609 dirlist->sorted = dirlist->files;
2610 clean_flist(dirlist, 0);
2613 output_flist(dirlist);