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-2008 Wayne Davison
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 3 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License along
20 * with this program; if not, visit the http://fsf.org website.
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_uid;
48 extern int preserve_gid;
49 extern int preserve_acls;
50 extern int preserve_xattrs;
51 extern int preserve_links;
52 extern int preserve_hard_links;
53 extern int preserve_devices;
54 extern int preserve_specials;
58 extern int relative_paths;
59 extern int implied_dirs;
60 extern int file_extra_cnt;
61 extern int ignore_perishable;
62 extern int non_perishable_cnt;
63 extern int prune_empty_dirs;
64 extern int copy_links;
65 extern int copy_unsafe_links;
66 extern int protocol_version;
67 extern int sanitize_paths;
68 extern int munge_symlinks;
69 extern int need_unsorted_flist;
70 extern int unsort_ndx;
71 extern struct stats stats;
72 extern char *filesfrom_host;
74 extern char curr_dir[MAXPATHLEN];
76 extern struct chmod_mode_struct *chmod_modes;
78 extern struct filter_list_struct filter_list;
79 extern struct filter_list_struct daemon_filter_list;
82 extern int filesfrom_convert;
83 extern iconv_t ic_send, ic_recv;
86 #define PTR_SIZE (sizeof (struct file_struct *))
90 dev_t filesystem_dev; /* used to implement -x */
92 struct file_list *cur_flist, *first_flist, *dir_flist;
93 int send_dir_ndx = -1, send_dir_depth = -1;
94 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
95 int file_total = 0; /* total of all active items over all file-lists */
96 int flist_eof = 0; /* all the file-lists are now known */
99 #define SLASH_ENDING_NAME 1
102 /* Starting from protocol version 26, we always use 64-bit ino_t and dev_t
103 * internally, even if this platform does not allow files to have 64-bit inums.
104 * The only exception is if we're on a platform with no 64-bit type at all.
106 * Because we use read_longint() to get these off the wire, if you transfer
107 * devices or (for protocols < 30) hardlinks with dev or inum > 2**32 to a
108 * machine with no 64-bit types then you will get an overflow error.
110 * Note that if you transfer devices from a 64-bit-devt machine (say, Solaris)
111 * to a 32-bit-devt machine (say, Linux-2.2/x86) then the device numbers will
112 * be truncated. But it's a kind of silly thing to do anyhow. */
114 /* The tmp_* vars are used as a cache area by make_file() to store data
115 * that the sender doesn't need to remember in its file list. The data
116 * will survive just long enough to be used by send_file_entry(). */
117 static dev_t tmp_rdev;
118 #ifdef SUPPORT_HARD_LINKS
119 static int64 tmp_dev, tmp_ino;
121 static char tmp_sum[MAX_DIGEST_LEN];
123 static char empty_sum[MAX_DIGEST_LEN];
124 static int flist_count_offset; /* for --delete --progress */
125 static int dir_count = 0;
127 static void flist_sort_and_clean(struct file_list *flist, int strip_root);
128 static void output_flist(struct file_list *flist);
130 void init_flist(void)
133 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
134 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
136 checksum_len = protocol_version < 21 ? 2
137 : protocol_version < 30 ? MD4_DIGEST_LEN
141 static int show_filelist_p(void)
143 return verbose && xfer_dirs && !am_server && !inc_recurse;
146 static void start_filelist_progress(char *kind)
148 rprintf(FCLIENT, "%s ... ", kind);
149 if (verbose > 1 || do_progress)
150 rprintf(FCLIENT, "\n");
154 static void emit_filelist_progress(int count)
156 rprintf(FCLIENT, " %d files...\r", count);
159 static void maybe_emit_filelist_progress(int count)
161 if (do_progress && show_filelist_p() && (count % 100) == 0)
162 emit_filelist_progress(count);
165 static void finish_filelist_progress(const struct file_list *flist)
168 /* This overwrites the progress line */
169 rprintf(FINFO, "%d file%sto consider\n",
170 flist->used, flist->used == 1 ? " " : "s ");
172 rprintf(FINFO, "done\n");
175 void show_flist_stats(void)
180 /* Stat either a symlink or its referent, depending on the settings of
181 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
183 * If path is the name of a symlink, then the linkbuf buffer (which must hold
184 * MAXPATHLEN chars) will be set to the symlink's target string.
186 * The stat structure pointed to by stp will contain information about the
187 * link or the referent as appropriate, if they exist. */
188 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
191 if (link_stat(path, stp, copy_dirlinks) < 0)
193 if (S_ISLNK(stp->st_mode)) {
194 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
197 linkbuf[llen] = '\0';
198 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
200 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
203 return x_stat(path, stp, NULL);
205 if (munge_symlinks && am_sender && llen > SYMLINK_PREFIX_LEN
206 && strncmp(linkbuf, SYMLINK_PREFIX, SYMLINK_PREFIX_LEN) == 0) {
207 memmove(linkbuf, linkbuf + SYMLINK_PREFIX_LEN,
208 llen - SYMLINK_PREFIX_LEN + 1);
213 return x_stat(path, stp, NULL);
217 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
221 return x_stat(path, stp, NULL);
222 if (x_lstat(path, stp, NULL) < 0)
224 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
226 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
231 return x_stat(path, stp, NULL);
235 static inline int is_daemon_excluded(const char *fname, int is_dir)
237 if (daemon_filter_list.head
238 && check_filter(&daemon_filter_list, fname, is_dir) < 0) {
245 /* This function is used to check if a file should be included/excluded
246 * from the list of files based on its name and type etc. The value of
247 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
248 static int is_excluded(const char *fname, int is_dir, int filter_level)
250 #if 0 /* This currently never happens, so avoid a useless compare. */
251 if (filter_level == NO_FILTERS)
255 /* never exclude '.', even if somebody does --exclude '*' */
256 if (fname[0] == '.' && !fname[1])
258 /* Handle the -R version of the '.' dir. */
259 if (fname[0] == '/') {
260 int len = strlen(fname);
261 if (fname[len-1] == '.' && fname[len-2] == '/')
265 if (is_daemon_excluded(fname, is_dir))
267 if (filter_level != ALL_FILTERS)
270 && check_filter(&filter_list, fname, is_dir) < 0)
275 static void send_directory(int f, struct file_list *flist,
276 char *fbuf, int len, int flags);
278 static const char *pathname, *orig_dir;
279 static int pathname_len;
282 /* Make sure flist can hold at least flist->used + extra entries. */
283 static void flist_expand(struct file_list *flist, int extra)
285 struct file_struct **new_ptr;
287 if (flist->used + extra <= flist->malloced)
290 if (flist->malloced < FLIST_START)
291 flist->malloced = FLIST_START;
292 else if (flist->malloced >= FLIST_LINEAR)
293 flist->malloced += FLIST_LINEAR;
295 flist->malloced *= 2;
297 /* In case count jumped or we are starting the list
298 * with a known size just set it. */
299 if (flist->malloced < flist->used + extra)
300 flist->malloced = flist->used + extra;
302 new_ptr = realloc_array(flist->files, struct file_struct *,
305 if (verbose >= 2 && flist->malloced != FLIST_START) {
306 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
308 (double)sizeof flist->files[0] * flist->malloced,
309 (new_ptr == flist->files) ? " not" : "");
312 flist->files = new_ptr;
315 out_of_memory("flist_expand");
318 static void flist_done_allocating(struct file_list *flist)
320 void *ptr = pool_boundary(flist->file_pool, 8*1024);
321 if (flist->pool_boundary == ptr)
322 flist->pool_boundary = NULL; /* list didn't use any pool memory */
324 flist->pool_boundary = ptr;
327 int push_pathname(const char *dir, int len)
333 orig_dir = strdup(curr_dir);
335 if (pathname && !pop_dir(orig_dir)) {
336 rsyserr(FERROR, errno, "pop_dir %s failed",
337 full_fname(orig_dir));
338 exit_cleanup(RERR_FILESELECT);
341 if (dir && !push_dir(dir, 0)) {
342 io_error |= IOERR_GENERAL;
343 rsyserr(FERROR, errno, "push_dir %s failed in %s",
344 full_fname(dir), curr_dir);
349 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
354 static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
356 static time_t modtime;
358 #ifdef SUPPORT_HARD_LINKS
362 static uint32 rdev_major;
365 static const char *user_name, *group_name;
366 static char lastname[MAXPATHLEN];
367 char fname[MAXPATHLEN];
368 int first_hlink_ndx = -1;
373 if (ic_send != (iconv_t)-1) {
376 INIT_CONST_XBUF(outbuf, fname);
379 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
380 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
381 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
384 outbuf.buf[outbuf.len++] = '/';
387 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
388 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
390 io_error |= IOERR_GENERAL;
392 "[%s] cannot convert filename: %s (%s)\n",
393 who_am_i(), f_name(file, fname), strerror(errno));
396 outbuf.buf[outbuf.len] = '\0';
401 /* Initialize starting value of xflags. */
402 if (protocol_version >= 30 && S_ISDIR(file->mode)) {
404 if (file->flags & FLAG_CONTENT_DIR)
405 xflags = file->flags & FLAG_TOP_DIR;
406 else if (file->flags & FLAG_IMPLIED_DIR)
407 xflags = XMIT_TOP_DIR | XMIT_NO_CONTENT_DIR;
409 xflags = XMIT_NO_CONTENT_DIR;
411 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
413 if (file->mode == mode)
414 xflags |= XMIT_SAME_MODE;
418 if ((preserve_devices && IS_DEVICE(mode))
419 || (preserve_specials && IS_SPECIAL(mode))) {
420 if (protocol_version < 28) {
421 if (tmp_rdev == rdev)
422 xflags |= XMIT_SAME_RDEV_pre28;
427 if ((uint32)major(rdev) == rdev_major)
428 xflags |= XMIT_SAME_RDEV_MAJOR;
430 rdev_major = major(rdev);
431 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
432 xflags |= XMIT_RDEV_MINOR_8_pre30;
434 } else if (protocol_version < 28)
435 rdev = MAKEDEV(0, 0);
437 if ((uid_t)F_OWNER(file) == uid && *lastname)
438 xflags |= XMIT_SAME_UID;
442 user_name = add_uid(uid);
443 if (inc_recurse && user_name)
444 xflags |= XMIT_USER_NAME_FOLLOWS;
449 if ((gid_t)F_GROUP(file) == gid && *lastname)
450 xflags |= XMIT_SAME_GID;
454 group_name = add_gid(gid);
455 if (inc_recurse && group_name)
456 xflags |= XMIT_GROUP_NAME_FOLLOWS;
460 if (file->modtime == modtime)
461 xflags |= XMIT_SAME_TIME;
463 modtime = file->modtime;
465 #ifdef SUPPORT_HARD_LINKS
467 if (protocol_version >= 30) {
468 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
469 first_hlink_ndx = (int32)(long)np->data - 1;
470 if (first_hlink_ndx < 0) {
471 np->data = (void*)(long)(first_ndx + ndx + 1);
472 xflags |= XMIT_HLINK_FIRST;
474 xflags |= XMIT_HLINKED;
476 if (tmp_dev == dev) {
477 if (protocol_version >= 28)
478 xflags |= XMIT_SAME_DEV_pre30;
481 xflags |= XMIT_HLINKED;
487 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
489 l2 = strlen(fname+l1);
492 xflags |= XMIT_SAME_NAME;
494 xflags |= XMIT_LONG_NAME;
496 /* We must make sure we don't send a zero flag byte or the
497 * other end will terminate the flist transfer. Note that
498 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
499 * it's harmless way to add a bit to the first flag byte. */
500 if (protocol_version >= 28) {
501 if (!xflags && !S_ISDIR(mode))
502 xflags |= XMIT_TOP_DIR;
503 if ((xflags & 0xFF00) || !xflags) {
504 xflags |= XMIT_EXTENDED_FLAGS;
505 write_shortint(f, xflags);
507 write_byte(f, xflags);
509 if (!(xflags & 0xFF))
510 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
511 write_byte(f, xflags);
513 if (xflags & XMIT_SAME_NAME)
515 if (xflags & XMIT_LONG_NAME)
516 write_varint30(f, l2);
519 write_buf(f, fname + l1, l2);
521 if (first_hlink_ndx >= 0) {
522 write_varint(f, first_hlink_ndx);
523 if (first_hlink_ndx >= first_ndx)
527 write_varlong30(f, F_LENGTH(file), 3);
528 if (!(xflags & XMIT_SAME_TIME)) {
529 if (protocol_version >= 30)
530 write_varlong(f, modtime, 4);
532 write_int(f, modtime);
534 if (!(xflags & XMIT_SAME_MODE))
535 write_int(f, to_wire_mode(mode));
536 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
537 if (protocol_version < 30)
540 write_varint(f, uid);
541 if (xflags & XMIT_USER_NAME_FOLLOWS) {
542 int len = strlen(user_name);
544 write_buf(f, user_name, len);
548 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
549 if (protocol_version < 30)
552 write_varint(f, gid);
553 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
554 int len = strlen(group_name);
556 write_buf(f, group_name, len);
560 if ((preserve_devices && IS_DEVICE(mode))
561 || (preserve_specials && IS_SPECIAL(mode))) {
562 if (protocol_version < 28) {
563 if (!(xflags & XMIT_SAME_RDEV_pre28))
564 write_int(f, (int)rdev);
566 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
567 write_varint30(f, major(rdev));
568 if (protocol_version >= 30)
569 write_varint(f, minor(rdev));
570 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
571 write_byte(f, minor(rdev));
573 write_int(f, minor(rdev));
578 if (preserve_links && S_ISLNK(mode)) {
579 const char *sl = F_SYMLINK(file);
580 int len = strlen(sl);
581 write_varint30(f, len);
582 write_buf(f, sl, len);
586 #ifdef SUPPORT_HARD_LINKS
587 if (tmp_dev != 0 && protocol_version < 30) {
588 if (protocol_version < 26) {
589 /* 32-bit dev_t and ino_t */
590 write_int(f, (int32)dev);
591 write_int(f, (int32)tmp_ino);
593 /* 64-bit dev_t and ino_t */
594 if (!(xflags & XMIT_SAME_DEV_pre30))
595 write_longint(f, dev);
596 write_longint(f, tmp_ino);
601 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
606 /* Prior to 28, we sent a useless set of nulls. */
609 write_buf(f, sum, checksum_len);
613 strlcpy(lastname, fname, MAXPATHLEN);
615 if (S_ISREG(mode) || S_ISLNK(mode))
616 stats.total_size += F_LENGTH(file);
619 static struct file_struct *recv_file_entry(struct file_list *flist,
622 static int64 modtime;
624 #ifdef SUPPORT_HARD_LINKS
628 static uint32 rdev_major;
631 static uint16 gid_flags;
632 static char lastname[MAXPATHLEN], *lastdir;
633 static int lastdir_depth, lastdir_len = -1;
634 static unsigned int del_hier_name_len = 0;
635 static int in_del_hier = 0;
636 char thisname[MAXPATHLEN];
637 unsigned int l1 = 0, l2 = 0;
638 int alloc_len, basename_len, linkname_len;
639 int extra_len = file_extra_cnt * EXTRA_LEN;
640 int first_hlink_ndx = -1;
642 const char *basename;
643 struct file_struct *file;
647 if (xflags & XMIT_SAME_NAME)
650 if (xflags & XMIT_LONG_NAME)
651 l2 = read_varint30(f);
655 if (l2 >= MAXPATHLEN - l1) {
657 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
658 xflags, l1, l2, lastname, who_am_i());
659 overflow_exit("recv_file_entry");
662 strlcpy(thisname, lastname, l1 + 1);
663 read_sbuf(f, &thisname[l1], l2);
664 thisname[l1 + l2] = 0;
666 /* Abuse basename_len for a moment... */
667 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
670 if (ic_recv != (iconv_t)-1) {
673 INIT_CONST_XBUF(outbuf, thisname);
674 INIT_XBUF(inbuf, lastname, basename_len, -1);
676 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
677 io_error |= IOERR_GENERAL;
679 "[%s] cannot convert filename: %s (%s)\n",
680 who_am_i(), lastname, strerror(errno));
683 outbuf.buf[outbuf.len] = '\0';
687 clean_fname(thisname, 0);
690 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
692 if ((basename = strrchr(thisname, '/')) != NULL) {
693 int len = basename++ - thisname;
694 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
695 lastdir = new_array(char, len + 1);
696 memcpy(lastdir, thisname, len);
699 lastdir_depth = count_dir_elements(lastdir);
703 basename_len = strlen(basename) + 1; /* count the '\0' */
705 #ifdef SUPPORT_HARD_LINKS
706 if (protocol_version >= 30
707 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
708 first_hlink_ndx = read_varint(f);
709 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
711 "hard-link reference out of range: %d (%d)\n",
712 first_hlink_ndx, flist->ndx_start + flist->used);
713 exit_cleanup(RERR_PROTOCOL);
715 if (first_hlink_ndx >= flist->ndx_start) {
716 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
717 file_length = F_LENGTH(first);
718 modtime = first->modtime;
721 uid = F_OWNER(first);
723 gid = F_GROUP(first);
724 if ((preserve_devices && IS_DEVICE(mode))
725 || (preserve_specials && IS_SPECIAL(mode))) {
726 uint32 *devp = F_RDEV_P(first);
727 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
728 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
730 if (preserve_links && S_ISLNK(mode))
731 linkname_len = strlen(F_SYMLINK(first)) + 1;
739 file_length = read_varlong30(f, 3);
740 if (!(xflags & XMIT_SAME_TIME)) {
741 if (protocol_version >= 30) {
742 modtime = read_varlong(f, 4);
743 #if SIZEOF_TIME_T < SIZEOF_INT64
744 if (!am_generator && (int64)(time_t)modtime != modtime) {
746 "Time value of %s truncated on receiver.\n",
751 modtime = read_int(f);
753 if (!(xflags & XMIT_SAME_MODE))
754 mode = from_wire_mode(read_int(f));
756 if (chmod_modes && !S_ISLNK(mode))
757 mode = tweak_mode(mode, chmod_modes);
759 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
760 if (protocol_version < 30)
761 uid = (uid_t)read_int(f);
763 uid = (uid_t)read_varint(f);
764 if (xflags & XMIT_USER_NAME_FOLLOWS)
765 uid = recv_user_name(f, uid);
766 else if (inc_recurse && am_root && !numeric_ids)
767 uid = match_uid(uid);
770 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
771 if (protocol_version < 30)
772 gid = (gid_t)read_int(f);
774 gid = (gid_t)read_varint(f);
776 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
777 gid = recv_group_name(f, gid, &gid_flags);
778 else if (inc_recurse && (!am_root || !numeric_ids))
779 gid = match_gid(gid, &gid_flags);
783 if ((preserve_devices && IS_DEVICE(mode))
784 || (preserve_specials && IS_SPECIAL(mode))) {
785 if (protocol_version < 28) {
786 if (!(xflags & XMIT_SAME_RDEV_pre28))
787 rdev = (dev_t)read_int(f);
790 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
791 rdev_major = read_varint30(f);
792 if (protocol_version >= 30)
793 rdev_minor = read_varint(f);
794 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
795 rdev_minor = read_byte(f);
797 rdev_minor = read_int(f);
798 rdev = MAKEDEV(rdev_major, rdev_minor);
800 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
802 } else if (protocol_version < 28)
803 rdev = MAKEDEV(0, 0);
806 if (preserve_links && S_ISLNK(mode)) {
807 linkname_len = read_varint30(f) + 1; /* count the '\0' */
808 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
809 rprintf(FERROR, "overflow: linkname_len=%d\n",
811 overflow_exit("recv_file_entry");
814 linkname_len += SYMLINK_PREFIX_LEN;
820 #ifdef SUPPORT_HARD_LINKS
822 if (preserve_hard_links) {
823 if (protocol_version < 28 && S_ISREG(mode))
824 xflags |= XMIT_HLINKED;
825 if (xflags & XMIT_HLINKED)
826 extra_len += (inc_recurse+1) * EXTRA_LEN;
831 /* Directories need an extra int32 for the default ACL. */
832 if (preserve_acls && S_ISDIR(mode))
833 extra_len += EXTRA_LEN;
836 if (always_checksum && S_ISREG(mode))
837 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
839 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
840 extra_len += EXTRA_LEN;
842 if (inc_recurse && S_ISDIR(mode)) {
843 if (one_file_system) {
844 /* Room to save the dir's device for -x */
845 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
847 pool = dir_flist->file_pool;
849 pool = flist->file_pool;
851 #if EXTRA_ROUNDING > 0
852 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
853 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
856 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
858 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
860 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
862 file = (struct file_struct *)bp;
863 bp += FILE_STRUCT_LEN;
865 memcpy(bp, basename, basename_len);
867 #ifdef SUPPORT_HARD_LINKS
868 if (xflags & XMIT_HLINKED)
869 file->flags |= FLAG_HLINKED;
871 file->modtime = (time_t)modtime;
872 file->len32 = (uint32)file_length;
873 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
874 file->flags |= FLAG_LENGTH64;
875 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
882 file->flags |= gid_flags;
885 F_NDX(file) = flist->used + flist->ndx_start;
887 if (basename != thisname) {
888 file->dirname = lastdir;
889 F_DEPTH(file) = lastdir_depth + 1;
894 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
896 if (protocol_version >= 30) {
897 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
898 if (xflags & XMIT_TOP_DIR)
899 file->flags |= FLAG_TOP_DIR;
900 file->flags |= FLAG_CONTENT_DIR;
901 } else if (xflags & XMIT_TOP_DIR)
902 file->flags |= FLAG_IMPLIED_DIR;
903 } else if (xflags & XMIT_TOP_DIR) {
904 in_del_hier = recurse;
905 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
906 if (relative_paths && del_hier_name_len > 2
907 && lastname[del_hier_name_len-1] == '.'
908 && lastname[del_hier_name_len-2] == '/')
909 del_hier_name_len -= 2;
910 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
911 } else if (in_del_hier) {
912 if (!relative_paths || !del_hier_name_len
913 || (l1 >= del_hier_name_len
914 && lastname[del_hier_name_len] == '/'))
915 file->flags |= FLAG_CONTENT_DIR;
921 if ((preserve_devices && IS_DEVICE(mode))
922 || (preserve_specials && IS_SPECIAL(mode))) {
923 uint32 *devp = F_RDEV_P(file);
924 DEV_MAJOR(devp) = major(rdev);
925 DEV_MINOR(devp) = minor(rdev);
931 if (first_hlink_ndx >= flist->ndx_start) {
932 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
933 memcpy(bp, F_SYMLINK(first), linkname_len);
934 } else if (munge_symlinks) {
935 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
936 bp += SYMLINK_PREFIX_LEN;
937 linkname_len -= SYMLINK_PREFIX_LEN;
938 read_sbuf(f, bp, linkname_len - 1);
940 read_sbuf(f, bp, linkname_len - 1);
942 sanitize_path(bp, bp, "", lastdir_depth, SP_DEFAULT);
947 #ifdef SUPPORT_HARD_LINKS
948 if (preserve_hard_links && xflags & XMIT_HLINKED) {
949 if (protocol_version >= 30) {
950 if (xflags & XMIT_HLINK_FIRST) {
951 F_HL_GNUM(file) = flist->ndx_start + flist->used;
953 F_HL_GNUM(file) = first_hlink_ndx;
955 static int32 cnt = 0;
956 struct ht_int64_node *np;
959 if (protocol_version < 26) {
963 if (!(xflags & XMIT_SAME_DEV_pre30))
964 dev = read_longint(f);
965 ino = read_longint(f);
967 np = idev_find(dev, ino);
968 ndx = (int32)(long)np->data - 1;
971 np->data = (void*)(long)cnt;
973 F_HL_GNUM(file) = ndx;
978 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
982 /* Prior to 28, we get a useless set of nulls. */
985 if (first_hlink_ndx >= flist->ndx_start) {
986 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
987 memcpy(bp, F_SUM(first), checksum_len);
989 read_buf(f, bp, checksum_len);
993 if (preserve_acls && !S_ISLNK(mode))
994 receive_acl(file, f);
996 #ifdef SUPPORT_XATTRS
998 receive_xattr(file, f );
1001 if (S_ISREG(mode) || S_ISLNK(mode))
1002 stats.total_size += file_length;
1007 /* Create a file_struct for a named file by reading its stat() information
1008 * and performing extensive checks against global options.
1010 * Returns a pointer to the new file struct, or NULL if there was an error
1011 * or this file should be excluded. */
1012 struct file_struct *make_file(const char *fname, struct file_list *flist,
1013 STRUCT_STAT *stp, int flags, int filter_level)
1015 static char *lastdir;
1016 static int lastdir_len = -1;
1017 struct file_struct *file;
1018 char thisname[MAXPATHLEN];
1019 char linkname[MAXPATHLEN];
1020 int alloc_len, basename_len, linkname_len;
1021 int extra_len = file_extra_cnt * EXTRA_LEN;
1022 const char *basename;
1027 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1028 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1031 clean_fname(thisname, 0);
1033 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
1035 if (stp && S_ISDIR(stp->st_mode)) {
1036 st = *stp; /* Needed for "symlink/." with --relative. */
1037 *linkname = '\0'; /* make IBM code checker happy */
1038 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1039 int save_errno = errno;
1040 /* See if file is excluded before reporting an error. */
1041 if (filter_level != NO_FILTERS
1042 && (is_excluded(thisname, 0, filter_level)
1043 || is_excluded(thisname, 1, filter_level))) {
1044 if (ignore_perishable && save_errno != ENOENT)
1045 non_perishable_cnt++;
1048 if (save_errno == ENOENT) {
1049 #ifdef SUPPORT_LINKS
1050 /* When our options tell us to follow a symlink that
1051 * points nowhere, tell the user about the symlink
1052 * instead of giving a "vanished" message. We only
1053 * dereference a symlink if one of the --copy*links
1054 * options was specified, so there's no need for the
1055 * extra lstat() if one of these options isn't on. */
1056 if ((copy_links || copy_unsafe_links || copy_dirlinks)
1057 && x_lstat(thisname, &st, NULL) == 0
1058 && S_ISLNK(st.st_mode)) {
1059 io_error |= IOERR_GENERAL;
1060 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1061 full_fname(thisname));
1065 enum logcode c = am_daemon && protocol_version < 28
1066 ? FERROR : FWARNING;
1067 io_error |= IOERR_VANISHED;
1068 rprintf(c, "file has vanished: %s\n",
1069 full_fname(thisname));
1072 io_error |= IOERR_GENERAL;
1073 rsyserr(FERROR_XFER, save_errno, "readlink %s failed",
1074 full_fname(thisname));
1079 /* backup.c calls us with filter_level set to NO_FILTERS. */
1080 if (filter_level == NO_FILTERS)
1083 if (S_ISDIR(st.st_mode)) {
1085 rprintf(FINFO, "skipping directory %s\n", thisname);
1088 /* -x only affects dirs because we need to avoid recursing
1089 * into a mount-point directory, not to avoid copying a
1090 * symlinked file if -L (or similar) was specified. */
1091 if (one_file_system && st.st_dev != filesystem_dev
1092 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1093 if (one_file_system > 1) {
1096 "[%s] skipping mount-point dir %s\n",
1097 who_am_i(), thisname);
1101 flags |= FLAG_MOUNT_DIR;
1102 flags &= ~FLAG_CONTENT_DIR;
1105 flags &= ~FLAG_CONTENT_DIR;
1107 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1108 if (ignore_perishable)
1109 non_perishable_cnt++;
1113 if (lp_ignore_nonreadable(module_id)) {
1114 #ifdef SUPPORT_LINKS
1115 if (!S_ISLNK(st.st_mode))
1117 if (access(thisname, R_OK) != 0)
1123 /* Only divert a directory in the main transfer. */
1125 if (flist->prev && S_ISDIR(st.st_mode)
1126 && flags & FLAG_DIVERT_DIRS) {
1127 /* Room for parent/sibling/next-child info. */
1128 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1130 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1131 pool = dir_flist->file_pool;
1133 pool = flist->file_pool;
1136 /* Directories need an extra int32 for the default ACL. */
1137 if (preserve_acls && S_ISDIR(st.st_mode))
1138 extra_len += EXTRA_LEN;
1144 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1145 who_am_i(), thisname, filter_level);
1148 if ((basename = strrchr(thisname, '/')) != NULL) {
1149 int len = basename++ - thisname;
1150 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1151 lastdir = new_array(char, len + 1);
1152 memcpy(lastdir, thisname, len);
1153 lastdir[len] = '\0';
1157 basename = thisname;
1158 basename_len = strlen(basename) + 1; /* count the '\0' */
1160 #ifdef SUPPORT_LINKS
1161 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1166 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1167 extra_len += EXTRA_LEN;
1169 #if EXTRA_ROUNDING > 0
1170 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1171 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1174 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1177 bp = pool_alloc(pool, alloc_len, "make_file");
1179 if (!(bp = new_array(char, alloc_len)))
1180 out_of_memory("make_file");
1183 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1185 file = (struct file_struct *)bp;
1186 bp += FILE_STRUCT_LEN;
1188 memcpy(bp, basename, basename_len);
1190 #ifdef SUPPORT_HARD_LINKS
1191 if (preserve_hard_links && flist && flist->prev) {
1192 if (protocol_version >= 28
1193 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1194 : S_ISREG(st.st_mode)) {
1195 tmp_dev = st.st_dev;
1196 tmp_ino = st.st_ino;
1202 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1203 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1204 tmp_rdev = st.st_rdev;
1209 file->flags = flags;
1210 file->modtime = st.st_mtime;
1211 file->len32 = (uint32)st.st_size;
1212 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1213 file->flags |= FLAG_LENGTH64;
1214 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1216 file->mode = st.st_mode;
1217 if (uid_ndx) /* Check uid_ndx instead of preserve_uid for del support */
1218 F_OWNER(file) = st.st_uid;
1219 if (gid_ndx) /* Check gid_ndx instead of preserve_gid for del support */
1220 F_GROUP(file) = st.st_gid;
1222 if (basename != thisname)
1223 file->dirname = lastdir;
1225 #ifdef SUPPORT_LINKS
1227 memcpy(bp + basename_len, linkname, linkname_len);
1230 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1231 file_checksum(thisname, tmp_sum, st.st_size);
1234 F_PATHNAME(file) = pathname;
1236 F_DEPTH(file) = extra_len / EXTRA_LEN;
1238 /* This code is only used by the receiver when it is building
1239 * a list of files for a delete pass. */
1240 if (keep_dirlinks && linkname_len && flist) {
1242 int save_mode = file->mode;
1243 file->mode = S_IFDIR; /* Find a directory with our name. */
1244 if (flist_find(dir_flist, file) >= 0
1245 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1246 file->modtime = st2.st_mtime;
1248 file->mode = st2.st_mode;
1250 F_OWNER(file) = st2.st_uid;
1252 F_GROUP(file) = st2.st_gid;
1254 file->mode = save_mode;
1257 if (basename_len == 0+1) {
1264 F_NDX(file) = dir_count;
1269 /* Only called for temporary file_struct entries created by make_file(). */
1270 void unmake_file(struct file_struct *file)
1272 free(REQ_EXTRA(file, F_DEPTH(file)));
1275 static struct file_struct *send_file_name(int f, struct file_list *flist,
1276 char *fname, STRUCT_STAT *stp,
1277 int flags, int filter_level)
1279 struct file_struct *file;
1280 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1284 file = make_file(fname, flist, stp, flags, filter_level);
1288 if (chmod_modes && !S_ISLNK(file->mode))
1289 file->mode = tweak_mode(file->mode, chmod_modes);
1292 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1293 sx.st.st_mode = file->mode;
1294 sx.acc_acl = sx.def_acl = NULL;
1295 if (get_acl(fname, &sx) < 0)
1299 #ifdef SUPPORT_XATTRS
1300 if (preserve_xattrs && f >= 0) {
1302 if (get_xattr(fname, &sx) < 0)
1307 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1309 flist_expand(flist, 1);
1310 flist->files[flist->used++] = file;
1312 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1314 if (preserve_acls && !S_ISLNK(file->mode)) {
1319 #ifdef SUPPORT_XATTRS
1320 if (preserve_xattrs) {
1321 F_XATTR(file) = send_xattr(&sx, f);
1329 static void send_if_directory(int f, struct file_list *flist,
1330 struct file_struct *file,
1331 char *fbuf, unsigned int ol,
1334 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1336 if (S_ISDIR(file->mode)
1337 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1339 unsigned int len = strlen(fbuf);
1340 if (len > 1 && fbuf[len-1] == '/')
1342 if (len >= MAXPATHLEN - 1) {
1343 io_error |= IOERR_GENERAL;
1344 rprintf(FERROR_XFER, "skipping long-named directory: %s\n",
1348 save_filters = push_local_filters(fbuf, len);
1349 send_directory(f, flist, fbuf, len, flags);
1350 pop_local_filters(save_filters);
1357 static int file_compare(const void *file1, const void *file2)
1359 return f_name_cmp(*(struct file_struct **)file1,
1360 *(struct file_struct **)file2);
1363 /* The guts of a merge-sort algorithm. This was derived from the glibc
1364 * version, but I (Wayne) changed the merge code to do less copying and
1365 * to require only half the amount of temporary memory. */
1366 static void fsort_tmp(struct file_struct **fp, size_t num,
1367 struct file_struct **tmp)
1369 struct file_struct **f1, **f2, **t;
1378 fsort_tmp(f1, n1, tmp);
1380 fsort_tmp(f2, n2, tmp);
1382 while (f_name_cmp(*f1, *f2) <= 0) {
1389 memcpy(t, f1, n1 * PTR_SIZE);
1391 *f1++ = *f2++, n2--;
1393 while (n1 > 0 && n2 > 0) {
1394 if (f_name_cmp(*t, *f2) <= 0)
1397 *f1++ = *f2++, n2--;
1401 memcpy(f1, t, n1 * PTR_SIZE);
1404 /* This file-struct sorting routine makes sure that any identical names in
1405 * the file list stay in the same order as they were in the original list.
1406 * This is particularly vital in inc_recurse mode where we expect a sort
1407 * on the flist to match the exact order of a sort on the dir_flist. */
1408 static void fsort(struct file_struct **fp, size_t num)
1414 qsort(fp, num, PTR_SIZE, file_compare);
1416 struct file_struct **tmp = new_array(struct file_struct *,
1418 fsort_tmp(fp, num, tmp);
1423 /* We take an entire set of sibling dirs from the sorted flist and link them
1424 * into the tree, setting the appropriate parent/child/sibling pointers. */
1425 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1430 int32 *parent_dp = parent_ndx < 0 ? NULL
1431 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1433 flist_expand(dir_flist, dir_cnt);
1434 dir_flist->sorted = dir_flist->files;
1436 for (i = 0; dir_cnt; i++) {
1437 struct file_struct *file = from_flist->sorted[i];
1439 if (!S_ISDIR(file->mode))
1442 dir_flist->files[dir_flist->used++] = file;
1445 if (file->basename[0] == '.' && file->basename[1] == '\0')
1449 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1451 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1453 send_dir_ndx = dir_flist->used - 1;
1455 dp = F_DIR_NODE_P(file);
1456 DIR_PARENT(dp) = parent_ndx;
1457 DIR_FIRST_CHILD(dp) = -1;
1460 DIR_NEXT_SIBLING(dp) = -1;
1463 /* This function is normally called by the sender, but the receiving side also
1464 * calls it from get_dirlist() with f set to -1 so that we just construct the
1465 * file list in memory without sending it over the wire. Also, get_dirlist()
1466 * might call this with f set to -2, which also indicates that local filter
1467 * rules should be ignored. */
1468 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1475 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1476 int start = flist->used;
1477 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1479 assert(flist != NULL);
1481 if (!(d = opendir(fbuf))) {
1482 io_error |= IOERR_GENERAL;
1483 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1488 if (len != 1 || *fbuf != '/')
1491 remainder = MAXPATHLEN - (p - fbuf);
1493 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1494 char *dname = d_name(di);
1495 if (dname[0] == '.' && (dname[1] == '\0'
1496 || (dname[1] == '.' && dname[2] == '\0')))
1498 if (strlcpy(p, dname, remainder) >= remainder) {
1499 io_error |= IOERR_GENERAL;
1501 "cannot send long-named file %s\n",
1505 if (dname[0] == '\0') {
1506 io_error |= IOERR_GENERAL;
1508 "cannot send file with empty name in %s\n",
1513 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1519 io_error |= IOERR_GENERAL;
1520 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1525 if (f >= 0 && recurse && !divert_dirs) {
1526 int i, end = flist->used - 1;
1527 /* send_if_directory() bumps flist->used, so use "end". */
1528 for (i = start; i <= end; i++)
1529 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1533 static char lastpath[MAXPATHLEN] = "";
1534 static int lastpath_len = 0;
1535 static struct file_struct *lastpath_struct;
1537 static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1538 char *start, char *limit, int flags, char name_type)
1540 struct file_struct *file;
1541 item_list *relname_list;
1542 relnamecache **rnpp;
1544 int len, need_new_dir;
1545 struct filter_list_struct save_filter_list = filter_list;
1547 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1548 filter_list.head = filter_list.tail = NULL; /* Don't filter implied dirs. */
1551 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1552 && lastpath_len == limit - fname
1553 && strncmp(lastpath, fname, lastpath_len) == 0)
1561 int save_copy_links = copy_links;
1562 int save_xfer_dirs = xfer_dirs;
1564 copy_links = xfer_dirs = 1;
1568 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1570 send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1574 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1576 if (file && !S_ISDIR(file->mode))
1578 lastpath_struct = file;
1581 strlcpy(lastpath, fname, sizeof lastpath);
1582 lastpath_len = limit - fname;
1586 copy_links = save_copy_links;
1587 xfer_dirs = save_xfer_dirs;
1593 if (!lastpath_struct)
1594 goto done; /* dir must have vanished */
1596 len = strlen(limit+1);
1597 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1598 if (!relname_list) {
1599 if (!(relname_list = new0(item_list)))
1600 out_of_memory("send_implied_dirs");
1601 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1603 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1604 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1605 out_of_memory("send_implied_dirs");
1606 (*rnpp)->name_type = name_type;
1607 strlcpy((*rnpp)->fname, limit+1, len + 1);
1610 filter_list = save_filter_list;
1613 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1615 char fbuf[MAXPATHLEN];
1616 item_list *relname_list;
1617 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1621 dlen = strlen(fbuf);
1623 if (F_PATHNAME(file) != pathname) {
1624 if (!push_pathname(F_PATHNAME(file), -1))
1625 exit_cleanup(RERR_FILESELECT);
1628 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1630 if (file->flags & FLAG_CONTENT_DIR) {
1631 if (one_file_system) {
1633 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1634 io_error |= IOERR_GENERAL;
1635 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1639 filesystem_dev = st.st_dev;
1641 send_directory(f, flist, fbuf, dlen, flags);
1644 if (!relative_paths)
1647 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1651 for (j = 0; j < relname_list->count; j++) {
1653 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1654 char name_type = rnp->name_type;
1657 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1659 if (len >= (int)sizeof fbuf)
1660 continue; /* Impossible... */
1662 slash = strchr(fbuf+dlen+1, '/');
1664 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1668 if (name_type != NORMAL_NAME) {
1670 if (link_stat(fbuf, &st, 1) != 0) {
1671 io_error |= IOERR_GENERAL;
1672 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1676 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1678 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1684 void send_extra_file_list(int f, int at_least)
1686 struct file_list *flist;
1689 int old_cnt, save_io_error = io_error;
1694 /* Keep sending data until we have the requested number of
1695 * files in the upcoming file-lists. */
1696 old_cnt = cur_flist->used;
1697 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1698 old_cnt += flist->used;
1699 while (file_total - old_cnt < at_least) {
1700 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1701 int dir_ndx, dstart = dir_count;
1702 const char *pathname = F_PATHNAME(file);
1705 flist = flist_new(0, "send_extra_file_list");
1706 start_write = stats.total_written;
1709 dir_ndx = F_NDX(file);
1711 dir_ndx = send_dir_ndx;
1712 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1713 flist->parent_ndx = dir_ndx;
1715 send1extra(f, file, flist);
1716 prev_flags = file->flags;
1717 dp = F_DIR_NODE_P(file);
1719 /* If there are any duplicate directory names that follow, we
1720 * send all the dirs together in one file-list. The dir_flist
1721 * tree links all the child subdirs onto the last dup dir. */
1722 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1723 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1724 send_dir_ndx = dir_ndx;
1725 file = dir_flist->sorted[dir_ndx];
1726 /* Try to avoid some duplicate scanning of identical dirs. */
1727 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1728 file->flags &= ~FLAG_CONTENT_DIR;
1729 send1extra(f, file, flist);
1730 prev_flags = file->flags;
1731 dp = F_DIR_NODE_P(file);
1736 if (need_unsorted_flist) {
1737 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1738 out_of_memory("send_extra_file_list");
1739 memcpy(flist->sorted, flist->files,
1740 flist->used * sizeof (struct file_struct*));
1742 flist->sorted = flist->files;
1744 flist_sort_and_clean(flist, 0);
1746 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1747 flist_done_allocating(flist);
1749 file_total += flist->used;
1750 stats.flist_size += stats.total_written - start_write;
1751 stats.num_files += flist->used;
1753 output_flist(flist);
1755 if (DIR_FIRST_CHILD(dp) >= 0) {
1756 send_dir_ndx = DIR_FIRST_CHILD(dp);
1759 while (DIR_NEXT_SIBLING(dp) < 0) {
1760 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1761 write_ndx(f, NDX_FLIST_EOF);
1763 change_local_filter_dir(NULL, 0, 0);
1767 file = dir_flist->sorted[send_dir_ndx];
1768 dp = F_DIR_NODE_P(file);
1770 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1775 if (io_error != save_io_error && !ignore_errors)
1776 send_msg_int(MSG_IO_ERROR, io_error);
1779 struct file_list *send_file_list(int f, int argc, char *argv[])
1781 static const char *lastdir;
1782 static int lastdir_len = -1;
1786 struct file_list *flist;
1787 struct timeval start_tv, end_tv;
1790 int disable_buffering;
1791 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1792 int reading_remotely = filesfrom_host != NULL;
1793 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1795 | (filesfrom_convert ? RL_CONVERT : 0)
1797 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1798 int implied_dot_dir = 0;
1800 rprintf(FLOG, "building file list\n");
1801 if (show_filelist_p())
1802 start_filelist_progress("building file list");
1803 else if (inc_recurse && verbose && !am_server)
1804 rprintf(FCLIENT, "sending incremental file list\n");
1806 start_write = stats.total_written;
1807 gettimeofday(&start_tv, NULL);
1809 if (relative_paths && protocol_version >= 30)
1810 implied_dirs = 1; /* We send flagged implied dirs */
1812 #ifdef SUPPORT_HARD_LINKS
1813 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1817 flist = cur_flist = flist_new(0, "send_file_list");
1819 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1820 flags |= FLAG_DIVERT_DIRS;
1822 dir_flist = cur_flist;
1824 disable_buffering = io_start_buffering_out(f);
1825 if (filesfrom_fd >= 0) {
1826 if (argv[0] && !push_dir(argv[0], 0)) {
1827 rsyserr(FERROR_XFER, errno, "push_dir %s failed in %s",
1828 full_fname(argv[0]), curr_dir);
1829 exit_cleanup(RERR_FILESELECT);
1835 char fbuf[MAXPATHLEN], *fn, name_type;
1838 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
1840 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
1844 strlcpy(fbuf, *argv++, MAXPATHLEN);
1846 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
1850 if (relative_paths) {
1851 /* We clean up fbuf below. */
1852 name_type = NORMAL_NAME;
1853 } else if (!len || fbuf[len - 1] == '/') {
1854 if (len == 2 && fbuf[0] == '.') {
1855 /* Turn "./" into just "." rather than "./." */
1858 if (len + 1 >= MAXPATHLEN)
1859 overflow_exit("send_file_list");
1863 name_type = DOT_NAME;
1864 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1865 && (len == 2 || fbuf[len-3] == '/')) {
1866 if (len + 2 >= MAXPATHLEN)
1867 overflow_exit("send_file_list");
1871 name_type = DOT_NAME;
1872 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
1873 name_type = DOT_NAME;
1875 name_type = NORMAL_NAME;
1879 if (!relative_paths) {
1880 p = strrchr(fbuf, '/');
1887 len -= p - fbuf + 1;
1892 if ((p = strstr(fbuf, "/./")) != NULL) {
1898 clean_fname(dir, 0);
1904 *--fn = '\0'; /* ensure room for '.' */
1907 /* A leading ./ can be used in relative mode to affect
1908 * the dest dir without its name being in the path. */
1909 if (*fn == '.' && fn[1] == '/' && !implied_dot_dir) {
1910 send_file_name(f, flist, ".", NULL,
1911 (flags | FLAG_IMPLIED_DIR) & ~FLAG_CONTENT_DIR,
1913 implied_dot_dir = 1;
1915 len = clean_fname(fn, CFN_KEEP_TRAILING_SLASH
1916 | CFN_DROP_TRAILING_DOT_DIR);
1921 name_type = DOT_NAME;
1922 } else if (fn[0] == '.')
1923 name_type = DOT_NAME;
1924 } else if (fn[len-1] == '/') {
1926 if (len == 1 && *fn == '.')
1927 name_type = DOT_NAME;
1929 name_type = SLASH_ENDING_NAME;
1931 /* Reject a ".." dir in the active part of the path. */
1932 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1933 if ((p[2] == '/' || p[2] == '\0')
1934 && (p == fn || p[-1] == '/')) {
1936 "found \"..\" dir in relative path: %s\n",
1938 exit_cleanup(RERR_SYNTAX);
1946 name_type = DOT_NAME;
1949 dirlen = dir ? strlen(dir) : 0;
1950 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1951 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1954 lastdir_len = pathname_len;
1955 } else if (!push_pathname(lastdir, lastdir_len))
1959 memmove(fbuf, fn, len + 1);
1961 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0
1962 || is_daemon_excluded(fbuf, S_ISDIR(st.st_mode) != 0)) {
1963 io_error |= IOERR_GENERAL;
1964 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1969 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1970 rprintf(FINFO, "skipping directory %s\n", fbuf);
1974 if (inc_recurse && relative_paths && *fbuf) {
1975 if ((p = strchr(fbuf+1, '/')) != NULL) {
1976 if (p - fbuf == 1 && *fbuf == '.') {
1977 if ((fn = strchr(p+1, '/')) != NULL)
1981 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
1985 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1986 /* Send the implied directories at the start of the
1987 * source spec, so we get their permissions right. */
1988 char *lp = lastpath, *slash = fbuf;
1990 /* Skip any initial directories in our path that we
1991 * have in common with lastpath. */
1992 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1997 if (fn != p || (*lp && *lp != '/'))
1998 send_implied_dirs(f, flist, fbuf, slash, p, flags, 0);
2001 if (one_file_system)
2002 filesystem_dev = st.st_dev;
2004 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
2005 struct file_struct *file;
2006 int top_flags = FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags;
2007 file = send_file_name(f, flist, fbuf, &st,
2008 top_flags, ALL_FILTERS);
2012 if (name_type == DOT_NAME) {
2013 if (send_dir_depth < 0) {
2015 change_local_filter_dir(fbuf, len, send_dir_depth);
2017 send_directory(f, flist, fbuf, len, flags);
2020 send_if_directory(f, flist, file, fbuf, len, flags);
2022 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
2025 gettimeofday(&end_tv, NULL);
2026 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2027 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2028 if (stats.flist_buildtime == 0)
2029 stats.flist_buildtime = 1;
2032 write_byte(f, 0); /* Indicate end of file list */
2034 #ifdef SUPPORT_HARD_LINKS
2035 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2039 if (show_filelist_p())
2040 finish_filelist_progress(flist);
2042 gettimeofday(&end_tv, NULL);
2043 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2044 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2046 /* When converting names, both sides keep an unsorted file-list array
2047 * because the names will differ on the sending and receiving sides
2048 * (both sides will use the unsorted index number for each item). */
2050 /* Sort the list without removing any duplicates. This allows the
2051 * receiving side to ask for whatever name it kept. For incremental
2052 * recursion mode, the sender marks duplicate dirs so that it can
2053 * send them together in a single file-list. */
2054 if (need_unsorted_flist) {
2055 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2056 out_of_memory("send_file_list");
2057 memcpy(flist->sorted, flist->files,
2058 flist->used * sizeof (struct file_struct*));
2060 flist->sorted = flist->files;
2061 flist_sort_and_clean(flist, 0);
2062 file_total += flist->used;
2064 if (numeric_ids <= 0 && !inc_recurse)
2067 /* send the io_error flag */
2068 if (protocol_version < 30)
2069 write_int(f, ignore_errors ? 0 : io_error);
2070 else if (io_error && !ignore_errors)
2071 send_msg_int(MSG_IO_ERROR, io_error);
2073 if (disable_buffering)
2074 io_end_buffering_out();
2076 stats.flist_size = stats.total_written - start_write;
2077 stats.num_files = flist->used;
2080 output_flist(flist);
2083 rprintf(FINFO, "send_file_list done\n");
2087 add_dirs_to_tree(-1, flist, dir_count);
2088 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2089 flist->parent_ndx = -1;
2090 flist_done_allocating(flist);
2091 if (send_dir_ndx < 0) {
2092 write_ndx(f, NDX_FLIST_EOF);
2095 else if (file_total == 1) {
2096 /* If we're creating incremental file-lists and there
2097 * was just 1 item in the first file-list, send 1 more
2098 * file-list to check if this is a 1-file xfer. */
2099 send_extra_file_list(f, 1);
2106 struct file_list *recv_file_list(int f)
2108 struct file_list *flist;
2113 rprintf(FLOG, "receiving file list\n");
2114 if (show_filelist_p())
2115 start_filelist_progress("receiving file list");
2116 else if (inc_recurse && verbose && !am_server && !first_flist)
2117 rprintf(FCLIENT, "receiving incremental file list\n");
2119 start_read = stats.total_read;
2121 #ifdef SUPPORT_HARD_LINKS
2122 if (preserve_hard_links && !first_flist)
2126 flist = flist_new(0, "recv_file_list");
2129 if (flist->ndx_start == 1)
2130 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2131 dstart = dir_flist->used;
2137 while ((flags = read_byte(f)) != 0) {
2138 struct file_struct *file;
2140 flist_expand(flist, 1);
2142 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2143 flags |= read_byte(f) << 8;
2144 file = recv_file_entry(flist, flags, f);
2146 if (inc_recurse && S_ISDIR(file->mode)) {
2147 flist_expand(dir_flist, 1);
2148 dir_flist->files[dir_flist->used++] = file;
2151 flist->files[flist->used++] = file;
2153 maybe_emit_filelist_progress(flist->used);
2156 rprintf(FINFO, "recv_file_name(%s)\n",
2157 f_name(file, NULL));
2160 file_total += flist->used;
2163 rprintf(FINFO, "received %d names\n", flist->used);
2165 if (show_filelist_p())
2166 finish_filelist_progress(flist);
2168 if (need_unsorted_flist) {
2169 /* Create an extra array of index pointers that we can sort for
2170 * the generator's use (for wading through the files in sorted
2171 * order and for calling flist_find()). We keep the "files"
2172 * list unsorted for our exchange of index numbers with the
2173 * other side (since their names may not sort the same). */
2174 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2175 out_of_memory("recv_file_list");
2176 memcpy(flist->sorted, flist->files,
2177 flist->used * sizeof (struct file_struct*));
2178 if (inc_recurse && dir_flist->used > dstart) {
2179 static int dir_flist_malloced = 0;
2180 if (dir_flist_malloced < dir_flist->malloced) {
2181 dir_flist->sorted = realloc_array(dir_flist->sorted,
2182 struct file_struct *,
2183 dir_flist->malloced);
2184 dir_flist_malloced = dir_flist->malloced;
2186 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2187 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2188 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2191 flist->sorted = flist->files;
2192 if (inc_recurse && dir_flist->used > dstart) {
2193 dir_flist->sorted = dir_flist->files;
2194 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2199 flist_done_allocating(flist);
2201 recv_id_list(f, flist);
2203 flist_sort_and_clean(flist, relative_paths);
2205 if (protocol_version < 30) {
2206 /* Recv the io_error flag */
2210 io_error |= read_int(f);
2211 } else if (inc_recurse && flist->ndx_start == 1) {
2212 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2213 flist->parent_ndx = -1;
2217 output_flist(flist);
2220 rprintf(FINFO, "recv_file_list done\n");
2222 stats.flist_size += stats.total_read - start_read;
2223 stats.num_files += flist->used;
2228 /* This is only used once by the receiver if the very first file-list
2229 * has exactly one item in it. */
2230 void recv_additional_file_list(int f)
2232 struct file_list *flist;
2233 int ndx = read_ndx(f);
2234 if (ndx == NDX_FLIST_EOF) {
2236 change_local_filter_dir(NULL, 0, 0);
2238 ndx = NDX_FLIST_OFFSET - ndx;
2239 if (ndx < 0 || ndx >= dir_flist->used) {
2240 ndx = NDX_FLIST_OFFSET - ndx;
2242 "[%s] Invalid dir index: %d (%d - %d)\n",
2243 who_am_i(), ndx, NDX_FLIST_OFFSET,
2244 NDX_FLIST_OFFSET - dir_flist->used + 1);
2245 exit_cleanup(RERR_PROTOCOL);
2248 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2251 flist = recv_file_list(f);
2252 flist->parent_ndx = ndx;
2256 /* Search for an identically-named item in the file list. Note that the
2257 * items must agree in their directory-ness, or no match is returned. */
2258 int flist_find(struct file_list *flist, struct file_struct *f)
2260 int low = flist->low, high = flist->high;
2261 int diff, mid, mid_up;
2263 while (low <= high) {
2264 mid = (low + high) / 2;
2265 if (F_IS_ACTIVE(flist->sorted[mid]))
2268 /* Scan for the next non-empty entry using the cached
2269 * distance values. If the value isn't fully up-to-
2270 * date, update it. */
2271 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2272 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2274 mid_up += F_DEPTH(flist->sorted[mid_up]);
2275 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2276 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2278 if (mid_up > high) {
2279 /* If there's nothing left above us, set high to
2280 * a non-empty entry below us and continue. */
2281 high = mid - (int)flist->sorted[mid]->len32;
2282 if (!F_IS_ACTIVE(flist->sorted[high])) {
2284 high -= (int)flist->sorted[high]->len32;
2285 } while (!F_IS_ACTIVE(flist->sorted[high]));
2286 flist->sorted[mid]->len32 = mid - high;
2291 diff = f_name_cmp(flist->sorted[mid_up], f);
2293 if (protocol_version < 29
2294 && S_ISDIR(flist->sorted[mid_up]->mode)
2295 != S_ISDIR(f->mode))
2308 * Free up any resources a file_struct has allocated
2309 * and clear the file.
2311 void clear_file(struct file_struct *file)
2313 /* The +1 zeros out the first char of the basename. */
2314 memset(file, 0, FILE_STRUCT_LEN + 1);
2315 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2316 * entry. Likewise for len32 in the opposite direction. We assume
2317 * that we're alone for now since flist_find() will adjust the counts
2318 * it runs into that aren't up-to-date. */
2319 file->len32 = F_DEPTH(file) = 1;
2322 /* Allocate a new file list. */
2323 struct file_list *flist_new(int flags, char *msg)
2325 struct file_list *flist;
2327 if (!(flist = new0(struct file_list)))
2330 if (flags & FLIST_TEMP) {
2331 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2332 out_of_memory, POOL_INTERN)))
2335 /* This is a doubly linked list with prev looping back to
2336 * the end of the list, but the last next pointer is NULL. */
2338 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2339 out_of_memory, POOL_INTERN);
2340 if (!flist->file_pool)
2343 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2345 first_flist = cur_flist = flist->prev = flist;
2347 struct file_list *prev = first_flist->prev;
2349 flist->file_pool = first_flist->file_pool;
2351 flist->ndx_start = prev->ndx_start + prev->used + 1;
2352 flist->flist_num = prev->flist_num + 1;
2355 prev->next = first_flist->prev = flist;
2357 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2364 /* Free up all elements in a flist. */
2365 void flist_free(struct file_list *flist)
2368 /* Was FLIST_TEMP dir-list. */
2369 } else if (flist == flist->prev) {
2370 first_flist = cur_flist = NULL;
2374 if (flist == cur_flist)
2375 cur_flist = flist->next;
2376 if (flist == first_flist)
2377 first_flist = first_flist->next;
2379 flist->prev->next = flist->next;
2381 flist->next = first_flist;
2383 flist->next->prev = flist->prev;
2384 file_total -= flist->used;
2388 if (!flist->prev || !flist_cnt)
2389 pool_destroy(flist->file_pool);
2391 pool_free_old(flist->file_pool, flist->pool_boundary);
2393 if (flist->sorted && flist->sorted != flist->files)
2394 free(flist->sorted);
2399 /* This routine ensures we don't have any duplicate names in our file list.
2400 * duplicate names can cause corruption because of the pipelining. */
2401 static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2403 char fbuf[MAXPATHLEN];
2408 if (flist->used == 0) {
2414 fsort(flist->sorted, flist->used);
2416 if (!am_sender || inc_recurse) {
2417 for (i = prev_i = 0; i < flist->used; i++) {
2418 if (F_IS_ACTIVE(flist->sorted[i])) {
2423 flist->low = prev_i;
2425 i = prev_i = flist->used - 1;
2429 while (++i < flist->used) {
2431 struct file_struct *file = flist->sorted[i];
2433 if (!F_IS_ACTIVE(file))
2435 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2437 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2438 int save_mode = file->mode;
2439 /* Make sure that this directory doesn't duplicate a
2440 * non-directory earlier in the list. */
2441 flist->high = prev_i;
2442 file->mode = S_IFREG;
2443 j = flist_find(flist, file);
2444 file->mode = save_mode;
2449 /* If one is a dir and the other is not, we want to
2450 * keep the dir because it might have contents in the
2451 * list. Otherwise keep the first one. */
2452 if (S_ISDIR(file->mode)) {
2453 struct file_struct *fp = flist->sorted[j];
2454 if (!S_ISDIR(fp->mode))
2458 file->flags |= FLAG_DUPLICATE;
2459 else { /* Make sure we merge our vital flags. */
2460 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2461 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2471 "removing duplicate name %s from file list (%d)\n",
2472 f_name(file, fbuf), drop + flist->ndx_start);
2474 clear_file(flist->sorted[drop]);
2478 if (flist->low == drop) {
2480 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2489 flist->high = prev_i;
2492 /* We need to strip off the leading slashes for relative
2493 * paths, but this must be done _after_ the sorting phase. */
2494 for (i = flist->low; i <= flist->high; i++) {
2495 struct file_struct *file = flist->sorted[i];
2499 while (*file->dirname == '/')
2501 if (!*file->dirname)
2502 file->dirname = NULL;
2506 if (prune_empty_dirs && !am_sender) {
2507 int j, prev_depth = 0;
2509 prev_i = 0; /* It's OK that this isn't really true. */
2511 for (i = flist->low; i <= flist->high; i++) {
2512 struct file_struct *fp, *file = flist->sorted[i];
2514 /* This temporarily abuses the F_DEPTH() value for a
2515 * directory that is in a chain that might get pruned.
2516 * We restore the old value if it gets a reprieve. */
2517 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2518 /* Dump empty dirs when coming back down. */
2519 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2520 fp = flist->sorted[prev_i];
2521 if (F_DEPTH(fp) >= 0)
2523 prev_i = -F_DEPTH(fp)-1;
2526 prev_depth = F_DEPTH(file);
2527 if (is_excluded(f_name(file, fbuf), 1,
2529 /* Keep dirs through this dir. */
2530 for (j = prev_depth-1; ; j--) {
2531 fp = flist->sorted[prev_i];
2532 if (F_DEPTH(fp) >= 0)
2534 prev_i = -F_DEPTH(fp)-1;
2538 F_DEPTH(file) = -prev_i-1;
2541 /* Keep dirs through this non-dir. */
2542 for (j = prev_depth; ; j--) {
2543 fp = flist->sorted[prev_i];
2544 if (F_DEPTH(fp) >= 0)
2546 prev_i = -F_DEPTH(fp)-1;
2551 /* Dump all remaining empty dirs. */
2553 struct file_struct *fp = flist->sorted[prev_i];
2554 if (F_DEPTH(fp) >= 0)
2556 prev_i = -F_DEPTH(fp)-1;
2560 for (i = flist->low; i <= flist->high; i++) {
2561 if (F_IS_ACTIVE(flist->sorted[i]))
2565 for (i = flist->high; i >= flist->low; i--) {
2566 if (F_IS_ACTIVE(flist->sorted[i]))
2573 static void output_flist(struct file_list *flist)
2575 char uidbuf[16], gidbuf[16], depthbuf[16];
2576 struct file_struct *file;
2577 const char *root, *dir, *slash, *name, *trail;
2578 const char *who = who_am_i();
2581 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2582 who, flist->ndx_start, flist->used, flist->low, flist->high);
2583 for (i = 0; i < flist->used; i++) {
2584 file = flist->files[i];
2585 if ((am_root || am_sender) && uid_ndx) {
2586 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2591 static char parens[] = "(\0)\0\0\0";
2592 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2593 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2594 pp, F_GROUP(file), pp + 2);
2598 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2599 if (F_IS_ACTIVE(file)) {
2600 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2601 if ((dir = file->dirname) == NULL)
2605 name = file->basename;
2606 trail = S_ISDIR(file->mode) ? "/" : "";
2608 root = dir = slash = name = trail = "";
2610 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2611 who, i + flist->ndx_start,
2612 root, dir, slash, name, trail,
2613 (int)file->mode, (double)F_LENGTH(file),
2614 uidbuf, gidbuf, file->flags);
2618 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2619 enum fnc_type { t_PATH, t_ITEM };
2621 static int found_prefix;
2623 /* Compare the names of two file_struct entities, similar to how strcmp()
2624 * would do if it were operating on the joined strings.
2626 * Some differences beginning with protocol_version 29: (1) directory names
2627 * are compared with an assumed trailing slash so that they compare in a
2628 * way that would cause them to sort immediately prior to any content they
2629 * may have; (2) a directory of any name compares after a non-directory of
2630 * any name at the same depth; (3) a directory with name "." compares prior
2631 * to anything else. These changes mean that a directory and a non-dir
2632 * with the same name will not compare as equal (protocol_version >= 29).
2634 * The dirname component can be an empty string, but the basename component
2635 * cannot (and never is in the current codebase). The basename component
2636 * may be NULL (for a removed item), in which case it is considered to be
2637 * after any existing item. */
2638 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2641 const uchar *c1, *c2;
2642 enum fnc_state state1, state2;
2643 enum fnc_type type1, type2;
2644 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2646 if (!f1 || !F_IS_ACTIVE(f1)) {
2647 if (!f2 || !F_IS_ACTIVE(f2))
2651 if (!f2 || !F_IS_ACTIVE(f2))
2654 c1 = (uchar*)f1->dirname;
2655 c2 = (uchar*)f2->dirname;
2659 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2660 c1 = (const uchar*)f1->basename;
2661 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2663 state1 = s_TRAILING;
2672 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2673 c2 = (const uchar*)f2->basename;
2674 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2676 state2 = s_TRAILING;
2686 return type1 == t_PATH ? 1 : -1;
2696 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2697 c1 = (const uchar*)f1->basename;
2698 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2700 state1 = s_TRAILING;
2706 state1 = s_TRAILING;
2707 if (type1 == t_PATH) {
2716 if (*c2 && type1 != type2)
2717 return type1 == t_PATH ? 1 : -1;
2726 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2727 c2 = (const uchar*)f2->basename;
2728 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2730 state2 = s_TRAILING;
2736 state2 = s_TRAILING;
2737 if (type2 == t_PATH) {
2750 return type1 == t_PATH ? 1 : -1;
2752 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2757 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2758 * not match if f2's basename is not an exact match of a path element in f1.
2759 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2760 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2764 return found_prefix;
2767 char *f_name_buf(void)
2769 static char names[5][MAXPATHLEN];
2770 static unsigned int n;
2772 n = (n + 1) % (sizeof names / sizeof names[0]);
2777 /* Return a copy of the full filename of a flist entry, using the indicated
2778 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2779 * done because we checked the size when creating the file_struct entry.
2781 char *f_name(const struct file_struct *f, char *fbuf)
2783 if (!f || !F_IS_ACTIVE(f))
2787 fbuf = f_name_buf();
2790 int len = strlen(f->dirname);
2791 memcpy(fbuf, f->dirname, len);
2793 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2795 strlcpy(fbuf, f->basename, MAXPATHLEN);
2800 /* Do a non-recursive scan of the named directory, possibly ignoring all
2801 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2802 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2803 * buffer (the functions we call will append names onto the end, but the old
2804 * dir value will be restored on exit). */
2805 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2807 struct file_list *dirlist;
2808 char dirbuf[MAXPATHLEN];
2809 int save_recurse = recurse;
2810 int save_xfer_dirs = xfer_dirs;
2811 int save_prune_empty_dirs = prune_empty_dirs;
2814 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2815 if (dlen >= MAXPATHLEN)
2820 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2824 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2825 xfer_dirs = save_xfer_dirs;
2826 recurse = save_recurse;
2828 flist_count_offset += dirlist->used;
2830 prune_empty_dirs = 0;
2831 dirlist->sorted = dirlist->files;
2832 flist_sort_and_clean(dirlist, 0);
2833 prune_empty_dirs = save_prune_empty_dirs;
2836 output_flist(dirlist);