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 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_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;
56 extern int relative_paths;
57 extern int implied_dirs;
58 extern int file_extra_cnt;
59 extern int ignore_perishable;
60 extern int non_perishable_cnt;
61 extern int prune_empty_dirs;
62 extern int copy_links;
63 extern int copy_unsafe_links;
64 extern int protocol_version;
65 extern int sanitize_paths;
66 extern struct stats stats;
67 extern char *filesfrom_host;
69 extern char curr_dir[MAXPATHLEN];
71 extern struct chmod_mode_struct *chmod_modes;
73 extern struct filter_list_struct filter_list;
74 extern struct filter_list_struct server_filter_list;
78 extern int need_unsorted_flist;
79 extern iconv_t ic_send, ic_recv;
82 #define PTR_SIZE (sizeof (struct file_struct *))
86 dev_t filesystem_dev; /* used to implement -x */
88 struct file_list *cur_flist, *first_flist, *dir_flist;
89 int send_dir_ndx = -1, send_dir_depth = 0;
90 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
91 int file_total = 0; /* total of all active items over all file-lists */
92 int flist_eof = 0; /* all the file-lists are now known */
94 /* Starting from protocol version 26, we always use 64-bit ino_t and dev_t
95 * internally, even if this platform does not allow files to have 64-bit inums.
96 * The only exception is if we're on a platform with no 64-bit type at all.
98 * Because we use read_longint() to get these off the wire, if you transfer
99 * devices or (for protocols < 30) hardlinks with dev or inum > 2**32 to a
100 * machine with no 64-bit types then you will get an overflow error.
102 * Note that if you transfer devices from a 64-bit-devt machine (say, Solaris)
103 * to a 32-bit-devt machine (say, Linux-2.2/x86) then the device numbers will
104 * be truncated. But it's a kind of silly thing to do anyhow. */
106 /* The tmp_* vars are used as a cache area by make_file() to store data
107 * that the sender doesn't need to remember in its file list. The data
108 * will survive just long enough to be used by send_file_entry(). */
109 static dev_t tmp_rdev;
110 #ifdef SUPPORT_HARD_LINKS
111 static int64 tmp_dev, tmp_ino;
113 static char tmp_sum[MAX_DIGEST_LEN];
115 static char empty_sum[MAX_DIGEST_LEN];
116 static int flist_count_offset; /* for --delete --progress */
117 static int dir_count = 0;
119 static void clean_flist(struct file_list *flist, int strip_root);
120 static void output_flist(struct file_list *flist);
122 void init_flist(void)
125 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
126 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
128 checksum_len = protocol_version < 21 ? 2
129 : protocol_version < 30 ? MD4_DIGEST_LEN
133 static int show_filelist_p(void)
135 return verbose && xfer_dirs && !am_server && !inc_recurse;
138 static void start_filelist_progress(char *kind)
140 rprintf(FCLIENT, "%s ... ", kind);
141 if (verbose > 1 || do_progress)
142 rprintf(FCLIENT, "\n");
146 static void emit_filelist_progress(int count)
148 rprintf(FCLIENT, " %d files...\r", count);
151 static void maybe_emit_filelist_progress(int count)
153 if (do_progress && show_filelist_p() && (count % 100) == 0)
154 emit_filelist_progress(count);
157 static void finish_filelist_progress(const struct file_list *flist)
160 /* This overwrites the progress line */
161 rprintf(FINFO, "%d file%sto consider\n",
162 flist->used, flist->used == 1 ? " " : "s ");
164 rprintf(FINFO, "done\n");
167 void show_flist_stats(void)
172 static void list_file_entry(struct file_struct *f)
174 char permbuf[PERMSTRING_SIZE];
177 if (!F_IS_ACTIVE(f)) {
178 /* this can happen if duplicate names were removed */
182 permstring(permbuf, f->mode);
185 /* TODO: indicate '+' if the entry has an ACL. */
188 if (preserve_links && S_ISLNK(f->mode)) {
189 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
190 permbuf, len, timestring(f->modtime),
191 f_name(f, NULL), F_SYMLINK(f));
195 rprintf(FINFO, "%s %11.0f %s %s\n",
196 permbuf, len, timestring(f->modtime),
201 /* Stat either a symlink or its referent, depending on the settings of
202 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
204 * If path is the name of a symlink, then the linkbuf buffer (which must hold
205 * MAXPATHLEN chars) will be set to the symlink's target string.
207 * The stat structure pointed to by stp will contain information about the
208 * link or the referent as appropriate, if they exist. */
209 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
212 if (link_stat(path, stp, copy_dirlinks) < 0)
214 if (S_ISLNK(stp->st_mode)) {
215 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
218 linkbuf[llen] = '\0';
219 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
221 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
224 return x_stat(path, stp, NULL);
229 return x_stat(path, stp, NULL);
233 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
237 return x_stat(path, stp, NULL);
238 if (x_lstat(path, stp, NULL) < 0)
240 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
242 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
247 return x_stat(path, stp, NULL);
251 /* This function is used to check if a file should be included/excluded
252 * from the list of files based on its name and type etc. The value of
253 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
254 static int is_excluded(char *fname, int is_dir, int filter_level)
256 #if 0 /* This currently never happens, so avoid a useless compare. */
257 if (filter_level == NO_FILTERS)
261 /* never exclude '.', even if somebody does --exclude '*' */
262 if (fname[0] == '.' && !fname[1])
264 /* Handle the -R version of the '.' dir. */
265 if (fname[0] == '/') {
266 int len = strlen(fname);
267 if (fname[len-1] == '.' && fname[len-2] == '/')
271 if (server_filter_list.head
272 && check_filter(&server_filter_list, fname, is_dir) < 0)
274 if (filter_level != ALL_FILTERS)
277 && check_filter(&filter_list, fname, is_dir) < 0)
282 static void send_directory(int f, struct file_list *flist,
283 char *fbuf, int len, int flags);
285 static const char *pathname, *orig_dir;
286 static int pathname_len;
289 /* Make sure flist can hold at least flist->used + extra entries. */
290 static void flist_expand(struct file_list *flist, int extra)
292 struct file_struct **new_ptr;
294 if (flist->used + extra <= flist->malloced)
297 if (flist->malloced < FLIST_START)
298 flist->malloced = FLIST_START;
299 else if (flist->malloced >= FLIST_LINEAR)
300 flist->malloced += FLIST_LINEAR;
302 flist->malloced *= 2;
304 /* In case count jumped or we are starting the list
305 * with a known size just set it. */
306 if (flist->malloced < flist->used + extra)
307 flist->malloced = flist->used + extra;
309 new_ptr = realloc_array(flist->files, struct file_struct *,
312 if (verbose >= 2 && flist->malloced != FLIST_START) {
313 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
315 (double)sizeof flist->files[0] * flist->malloced,
316 (new_ptr == flist->files) ? " not" : "");
319 flist->files = new_ptr;
322 out_of_memory("flist_expand");
325 static void flist_done_allocating(struct file_list *flist)
327 void *ptr = pool_boundary(flist->file_pool, 8*1024);
328 if (flist->pool_boundary == ptr)
329 flist->pool_boundary = NULL; /* list didn't use any pool memory */
331 flist->pool_boundary = ptr;
334 int push_pathname(const char *dir, int len)
340 orig_dir = strdup(curr_dir);
342 if (pathname && !pop_dir(orig_dir)) {
343 rsyserr(FERROR, errno, "pop_dir %s failed",
344 full_fname(orig_dir));
345 exit_cleanup(RERR_FILESELECT);
348 if (dir && !push_dir(dir, 0)) {
349 io_error |= IOERR_GENERAL;
350 rsyserr(FERROR, errno, "push_dir %s failed in %s",
351 full_fname(dir), curr_dir);
356 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
361 static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
363 static time_t modtime;
367 static uint32 rdev_major;
370 static char *user_name, *group_name;
371 static char lastname[MAXPATHLEN];
372 char fname[MAXPATHLEN];
373 int first_hlink_ndx = -1;
378 if (ic_send != (iconv_t)-1) {
379 ICONV_CONST char *ibuf;
381 size_t ocnt = MAXPATHLEN, icnt;
383 iconv(ic_send, NULL,0, NULL,0);
384 if ((ibuf = (ICONV_CONST char *)file->dirname) != NULL) {
386 ocnt--; /* pre-subtract the space for the '/' */
387 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1)
392 ibuf = (ICONV_CONST char *)file->basename;
394 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
396 io_error |= IOERR_GENERAL;
398 "[%s] cannot convert filename: %s (%s)\n",
399 who_am_i(), f_name(file, fname), strerror(errno));
407 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
409 if (file->mode == mode)
410 xflags |= XMIT_SAME_MODE;
414 if (protocol_version >= 30 && S_ISDIR(mode) && !(file->flags & FLAG_XFER_DIR))
415 xflags |= XMIT_NON_XFER_DIR;
417 if ((preserve_devices && IS_DEVICE(mode))
418 || (preserve_specials && IS_SPECIAL(mode))) {
419 if (protocol_version < 28) {
420 if (tmp_rdev == rdev)
421 xflags |= XMIT_SAME_RDEV_pre28;
426 if ((uint32)major(rdev) == rdev_major)
427 xflags |= XMIT_SAME_RDEV_MAJOR;
429 rdev_major = major(rdev);
430 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
431 xflags |= XMIT_RDEV_MINOR_8_pre30;
433 } else if (protocol_version < 28)
434 rdev = MAKEDEV(0, 0);
436 if ((uid_t)F_OWNER(file) == uid && *lastname)
437 xflags |= XMIT_SAME_UID;
440 if (uid_ndx && !numeric_ids) {
441 user_name = add_uid(uid);
442 if (inc_recurse && user_name)
443 xflags |= XMIT_USER_NAME_FOLLOWS;
448 if ((gid_t)F_GROUP(file) == gid && *lastname)
449 xflags |= XMIT_SAME_GID;
452 if (gid_ndx && !numeric_ids) {
453 group_name = add_gid(gid);
454 if (inc_recurse && group_name)
455 xflags |= XMIT_GROUP_NAME_FOLLOWS;
459 if (file->modtime == modtime)
460 xflags |= XMIT_SAME_TIME;
462 modtime = file->modtime;
464 #ifdef SUPPORT_HARD_LINKS
466 if (protocol_version >= 30) {
467 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
468 first_hlink_ndx = (int32)(long)np->data - 1;
469 if (first_hlink_ndx < 0) {
470 np->data = (void*)(long)(ndx + first_ndx + 1);
471 xflags |= XMIT_HLINK_FIRST;
473 xflags |= XMIT_HLINKED;
475 if (tmp_dev == dev) {
476 if (protocol_version >= 28)
477 xflags |= XMIT_SAME_DEV_pre30;
480 xflags |= XMIT_HLINKED;
486 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
488 l2 = strlen(fname+l1);
491 xflags |= XMIT_SAME_NAME;
493 xflags |= XMIT_LONG_NAME;
495 /* We must make sure we don't send a zero flag byte or the
496 * other end will terminate the flist transfer. Note that
497 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
498 * it's harmless way to add a bit to the first flag byte. */
499 if (protocol_version >= 28) {
500 if (!xflags && !S_ISDIR(mode))
501 xflags |= XMIT_TOP_DIR;
502 if ((xflags & 0xFF00) || !xflags) {
503 xflags |= XMIT_EXTENDED_FLAGS;
504 write_shortint(f, xflags);
506 write_byte(f, xflags);
508 if (!(xflags & 0xFF))
509 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
510 write_byte(f, xflags);
512 if (xflags & XMIT_SAME_NAME)
514 if (xflags & XMIT_LONG_NAME)
515 write_varint30(f, l2);
518 write_buf(f, fname + l1, l2);
520 if (first_hlink_ndx >= 0) {
521 write_varint(f, first_hlink_ndx);
522 if (first_hlink_ndx >= first_ndx)
526 write_varlong30(f, F_LENGTH(file), 3);
527 if (!(xflags & XMIT_SAME_TIME)) {
528 if (protocol_version >= 30)
529 write_varlong(f, modtime, 4);
531 write_int(f, modtime);
533 if (!(xflags & XMIT_SAME_MODE))
534 write_int(f, to_wire_mode(mode));
535 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
536 if (protocol_version < 30)
539 write_varint(f, uid);
540 if (xflags & XMIT_USER_NAME_FOLLOWS) {
541 int len = strlen(user_name);
543 write_buf(f, user_name, len);
547 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
548 if (protocol_version < 30)
551 write_varint(f, gid);
552 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
553 int len = strlen(group_name);
555 write_buf(f, group_name, len);
559 if ((preserve_devices && IS_DEVICE(mode))
560 || (preserve_specials && IS_SPECIAL(mode))) {
561 if (protocol_version < 28) {
562 if (!(xflags & XMIT_SAME_RDEV_pre28))
563 write_int(f, (int)rdev);
565 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
566 write_varint30(f, major(rdev));
567 if (protocol_version >= 30)
568 write_varint(f, minor(rdev));
569 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
570 write_byte(f, minor(rdev));
572 write_int(f, minor(rdev));
577 if (preserve_links && S_ISLNK(mode)) {
578 const char *sl = F_SYMLINK(file);
579 int len = strlen(sl);
580 write_varint30(f, len);
581 write_buf(f, sl, len);
585 #ifdef SUPPORT_HARD_LINKS
586 if (tmp_dev != 0 && protocol_version < 30) {
587 if (protocol_version < 26) {
588 /* 32-bit dev_t and ino_t */
589 write_int(f, (int32)dev);
590 write_int(f, (int32)tmp_ino);
592 /* 64-bit dev_t and ino_t */
593 if (!(xflags & XMIT_SAME_DEV_pre30))
594 write_longint(f, dev);
595 write_longint(f, tmp_ino);
600 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
605 /* Prior to 28, we sent a useless set of nulls. */
608 write_buf(f, sum, checksum_len);
612 strlcpy(lastname, fname, MAXPATHLEN);
614 if (S_ISREG(mode) || S_ISLNK(mode))
615 stats.total_size += F_LENGTH(file);
618 static struct file_struct *recv_file_entry(struct file_list *flist,
621 static int64 modtime;
625 static uint32 rdev_major;
628 static uint16 gid_flags;
629 static char lastname[MAXPATHLEN], *lastdir;
630 static int lastdir_depth, lastdir_len = -1;
631 static unsigned int del_hier_name_len = 0;
632 static int in_del_hier = 0;
633 char thisname[MAXPATHLEN];
634 unsigned int l1 = 0, l2 = 0;
635 int alloc_len, basename_len, linkname_len;
636 int extra_len = file_extra_cnt * EXTRA_LEN;
637 int first_hlink_ndx = -1;
639 const char *basename;
640 struct file_struct *file;
644 if (xflags & XMIT_SAME_NAME)
647 if (xflags & XMIT_LONG_NAME)
648 l2 = read_varint30(f);
652 if (l2 >= MAXPATHLEN - l1) {
654 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
655 xflags, l1, l2, lastname, who_am_i());
656 overflow_exit("recv_file_entry");
659 strlcpy(thisname, lastname, l1 + 1);
660 read_sbuf(f, &thisname[l1], l2);
661 thisname[l1 + l2] = 0;
663 /* Abuse basename_len for a moment... */
664 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
667 if (ic_recv != (iconv_t)-1) {
668 char *obuf = thisname;
669 ICONV_CONST char *ibuf = (ICONV_CONST char *)lastname;
670 size_t ocnt = MAXPATHLEN, icnt = basename_len;
672 if (icnt >= MAXPATHLEN) {
677 iconv(ic_recv, NULL,0, NULL,0);
678 if (iconv(ic_recv, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
680 io_error |= IOERR_GENERAL;
682 "[%s] cannot convert filename: %s (%s)\n",
683 who_am_i(), lastname, strerror(errno));
690 clean_fname(thisname, 0);
693 sanitize_path(thisname, thisname, "", 0, NULL);
695 if ((basename = strrchr(thisname, '/')) != NULL) {
696 int len = basename++ - thisname;
697 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
698 lastdir = new_array(char, len + 1);
699 memcpy(lastdir, thisname, len);
702 lastdir_depth = count_dir_elements(lastdir);
706 basename_len = strlen(basename) + 1; /* count the '\0' */
708 #ifdef SUPPORT_HARD_LINKS
709 if (protocol_version >= 30
710 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
711 first_hlink_ndx = read_varint(f);
712 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
714 "hard-link reference out of range: %d (%d)\n",
715 first_hlink_ndx, flist->ndx_start + flist->used);
716 exit_cleanup(RERR_PROTOCOL);
718 if (first_hlink_ndx >= flist->ndx_start) {
719 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
720 file_length = F_LENGTH(first);
721 modtime = first->modtime;
724 uid = F_OWNER(first);
726 gid = F_GROUP(first);
727 if ((preserve_devices && IS_DEVICE(mode))
728 || (preserve_specials && IS_SPECIAL(mode))) {
729 uint32 *devp = F_RDEV_P(first);
730 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
731 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
733 if (preserve_links && S_ISLNK(mode))
734 linkname_len = strlen(F_SYMLINK(first)) + 1;
742 file_length = read_varlong30(f, 3);
743 if (!(xflags & XMIT_SAME_TIME)) {
744 if (protocol_version >= 30) {
745 modtime = read_varlong(f, 4);
746 #if SIZEOF_TIME_T < SIZEOF_INT64
747 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
749 "Time value of %s truncated on receiver.\n",
754 modtime = read_int(f);
756 if (!(xflags & XMIT_SAME_MODE))
757 mode = from_wire_mode(read_int(f));
759 if (chmod_modes && !S_ISLNK(mode))
760 mode = tweak_mode(mode, chmod_modes);
762 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
763 if (protocol_version < 30)
764 uid = (uid_t)read_int(f);
766 uid = (uid_t)read_varint(f);
767 if (xflags & XMIT_USER_NAME_FOLLOWS)
768 uid = recv_user_name(f, uid);
769 else if (inc_recurse && am_root && !numeric_ids)
770 uid = match_uid(uid);
773 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
774 if (protocol_version < 30)
775 gid = (gid_t)read_int(f);
777 gid = (gid_t)read_varint(f);
779 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
780 gid = recv_group_name(f, gid, &gid_flags);
781 else if (inc_recurse && (!am_root || !numeric_ids))
782 gid = match_gid(gid, &gid_flags);
786 if ((preserve_devices && IS_DEVICE(mode))
787 || (preserve_specials && IS_SPECIAL(mode))) {
788 if (protocol_version < 28) {
789 if (!(xflags & XMIT_SAME_RDEV_pre28))
790 rdev = (dev_t)read_int(f);
793 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
794 rdev_major = read_varint30(f);
795 if (protocol_version >= 30)
796 rdev_minor = read_varint(f);
797 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
798 rdev_minor = read_byte(f);
800 rdev_minor = read_int(f);
801 rdev = MAKEDEV(rdev_major, rdev_minor);
803 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
805 } else if (protocol_version < 28)
806 rdev = MAKEDEV(0, 0);
809 if (preserve_links && S_ISLNK(mode)) {
810 linkname_len = read_varint30(f) + 1; /* count the '\0' */
811 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
812 rprintf(FERROR, "overflow: linkname_len=%d\n",
814 overflow_exit("recv_file_entry");
821 #ifdef SUPPORT_HARD_LINKS
823 if (preserve_hard_links) {
824 if (protocol_version < 28 && S_ISREG(mode))
825 xflags |= XMIT_HLINKED;
826 if (xflags & XMIT_HLINKED)
827 extra_len += (inc_recurse+1) * EXTRA_LEN;
832 /* We need one or two index int32s when we're preserving ACLs. */
834 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
837 if (always_checksum && S_ISREG(mode))
838 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
840 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
841 extra_len += EXTRA_LEN;
843 #if EXTRA_ROUNDING > 0
844 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
845 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
848 if (inc_recurse && S_ISDIR(mode)) {
849 if (one_file_system) {
850 /* Room to save the dir's device for -x */
851 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
853 pool = dir_flist->file_pool;
855 pool = flist->file_pool;
857 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
859 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
861 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
863 file = (struct file_struct *)bp;
864 bp += FILE_STRUCT_LEN;
866 memcpy(bp, basename, basename_len);
867 bp += basename_len + linkname_len; /* skip space for symlink too */
869 #ifdef SUPPORT_HARD_LINKS
870 if (xflags & XMIT_HLINKED)
871 file->flags |= FLAG_HLINKED;
873 file->modtime = (time_t)modtime;
874 file->len32 = (uint32)file_length;
875 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
876 file->flags |= FLAG_LENGTH64;
877 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
884 file->flags |= gid_flags;
888 F_NDX(file) = flist->used + flist->ndx_start;
891 if (basename != thisname) {
892 file->dirname = lastdir;
893 F_DEPTH(file) = lastdir_depth + 1;
898 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
900 if (xflags & XMIT_TOP_DIR) {
901 in_del_hier = recurse;
902 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
903 if (relative_paths && del_hier_name_len > 2
904 && lastname[del_hier_name_len-1] == '.'
905 && lastname[del_hier_name_len-2] == '/')
906 del_hier_name_len -= 2;
907 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
908 } else if (protocol_version >= 30) {
909 if (!(xflags & XMIT_NON_XFER_DIR))
910 file->flags |= FLAG_XFER_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_XFER_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);
930 bp = (char*)file->basename + basename_len;
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);
935 read_sbuf(f, bp, linkname_len - 1);
937 sanitize_path(bp, bp, "", lastdir_depth, NULL);
941 #ifdef SUPPORT_HARD_LINKS
942 if (preserve_hard_links && xflags & XMIT_HLINKED) {
943 if (protocol_version >= 30) {
944 F_HL_GNUM(file) = xflags & XMIT_HLINK_FIRST
945 ? flist->ndx_start + flist->used
948 static int32 cnt = 0;
949 struct ht_int64_node *np;
952 if (protocol_version < 26) {
956 if (!(xflags & XMIT_SAME_DEV_pre30))
957 dev = read_longint(f);
958 ino = read_longint(f);
960 np = idev_find(dev, ino);
961 ndx = (int32)(long)np->data - 1;
964 np->data = (void*)(long)cnt;
966 F_HL_GNUM(file) = ndx;
971 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
975 /* Prior to 28, we get a useless set of nulls. */
978 if (first_hlink_ndx >= flist->ndx_start) {
979 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
980 memcpy(bp, F_SUM(first), checksum_len);
982 read_buf(f, bp, checksum_len);
986 if (preserve_acls && !S_ISLNK(mode))
987 receive_acl(file, f);
989 #ifdef SUPPORT_XATTRS
991 receive_xattr(file, f );
994 if (S_ISREG(mode) || S_ISLNK(mode))
995 stats.total_size += file_length;
1000 /* Create a file_struct for a named file by reading its stat() information
1001 * and performing extensive checks against global options.
1003 * Returns a pointer to the new file struct, or NULL if there was an error
1004 * or this file should be excluded. */
1005 struct file_struct *make_file(const char *fname, struct file_list *flist,
1006 STRUCT_STAT *stp, int flags, int filter_level)
1008 static char *lastdir;
1009 static int lastdir_len = -1;
1010 struct file_struct *file;
1011 char thisname[MAXPATHLEN];
1012 char linkname[MAXPATHLEN];
1013 int alloc_len, basename_len, linkname_len;
1014 int extra_len = file_extra_cnt * EXTRA_LEN;
1015 const char *basename;
1020 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1021 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1024 clean_fname(thisname, 0);
1026 sanitize_path(thisname, thisname, "", 0, NULL);
1028 if (stp && S_ISDIR(stp->st_mode)) {
1029 st = *stp; /* Needed for "symlink/." with --relative. */
1030 *linkname = '\0'; /* make IBM code checker happy */
1031 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1032 int save_errno = errno;
1033 /* See if file is excluded before reporting an error. */
1034 if (filter_level != NO_FILTERS
1035 && (is_excluded(thisname, 0, filter_level)
1036 || is_excluded(thisname, 1, filter_level))) {
1037 if (ignore_perishable && save_errno != ENOENT)
1038 non_perishable_cnt++;
1041 if (save_errno == ENOENT) {
1042 #ifdef SUPPORT_LINKS
1043 /* Avoid "vanished" error if symlink points nowhere. */
1044 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1045 && S_ISLNK(st.st_mode)) {
1046 io_error |= IOERR_GENERAL;
1047 rprintf(FERROR, "symlink has no referent: %s\n",
1048 full_fname(thisname));
1052 enum logcode c = am_daemon && protocol_version < 28
1054 io_error |= IOERR_VANISHED;
1055 rprintf(c, "file has vanished: %s\n",
1056 full_fname(thisname));
1059 io_error |= IOERR_GENERAL;
1060 rsyserr(FERROR, save_errno, "readlink %s failed",
1061 full_fname(thisname));
1066 /* backup.c calls us with filter_level set to NO_FILTERS. */
1067 if (filter_level == NO_FILTERS)
1070 if (S_ISDIR(st.st_mode)) {
1072 rprintf(FINFO, "skipping directory %s\n", thisname);
1076 flags &= ~FLAG_XFER_DIR;
1078 /* -x only affects directories because we need to avoid recursing
1079 * into a mount-point directory, not to avoid copying a symlinked
1080 * file if -L (or similar) was specified. */
1081 if (one_file_system && st.st_dev != filesystem_dev
1082 && S_ISDIR(st.st_mode)) {
1083 if (one_file_system > 1) {
1085 rprintf(FINFO, "skipping mount-point dir %s\n",
1090 flags |= FLAG_MOUNT_DIR;
1093 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1094 if (ignore_perishable)
1095 non_perishable_cnt++;
1099 if (lp_ignore_nonreadable(module_id)) {
1100 #ifdef SUPPORT_LINKS
1101 if (!S_ISLNK(st.st_mode))
1103 if (access(thisname, R_OK) != 0)
1109 /* Only divert a directory in the main transfer. */
1111 if (flist->prev && S_ISDIR(st.st_mode)
1112 && flags & FLAG_DIVERT_DIRS) {
1113 /* Room for parent/sibling/next-child info. */
1114 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1116 pool = dir_flist->file_pool;
1118 pool = flist->file_pool;
1123 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1124 who_am_i(), thisname, filter_level);
1127 if ((basename = strrchr(thisname, '/')) != NULL) {
1128 int len = basename++ - thisname;
1129 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1130 lastdir = new_array(char, len + 1);
1131 memcpy(lastdir, thisname, len);
1132 lastdir[len] = '\0';
1136 basename = thisname;
1137 basename_len = strlen(basename) + 1; /* count the '\0' */
1139 #ifdef SUPPORT_LINKS
1140 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1145 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1146 extra_len += EXTRA_LEN;
1148 #if EXTRA_ROUNDING > 0
1149 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1150 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1153 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1156 bp = pool_alloc(pool, alloc_len, "make_file");
1158 if (!(bp = new_array(char, alloc_len)))
1159 out_of_memory("make_file");
1162 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1164 file = (struct file_struct *)bp;
1165 bp += FILE_STRUCT_LEN;
1167 memcpy(bp, basename, basename_len);
1168 bp += basename_len + linkname_len; /* skip space for symlink too */
1170 #ifdef SUPPORT_HARD_LINKS
1171 if (preserve_hard_links && flist && flist->prev) {
1172 if (protocol_version >= 28
1173 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1174 : S_ISREG(st.st_mode)) {
1175 tmp_dev = st.st_dev;
1176 tmp_ino = st.st_ino;
1182 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1183 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1184 tmp_rdev = st.st_rdev;
1189 file->flags = flags;
1190 file->modtime = st.st_mtime;
1191 file->len32 = (uint32)st.st_size;
1192 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1193 file->flags |= FLAG_LENGTH64;
1194 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1196 file->mode = st.st_mode;
1198 F_OWNER(file) = st.st_uid;
1200 F_GROUP(file) = st.st_gid;
1202 if (basename != thisname)
1203 file->dirname = lastdir;
1205 #ifdef SUPPORT_LINKS
1207 bp = (char*)file->basename + basename_len;
1208 memcpy(bp, linkname, linkname_len);
1212 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1213 file_checksum(thisname, tmp_sum, st.st_size);
1215 F_PATHNAME(file) = pathname;
1217 /* This code is only used by the receiver when it is building
1218 * a list of files for a delete pass. */
1219 if (keep_dirlinks && linkname_len && flist) {
1221 int save_mode = file->mode;
1222 file->mode = S_IFDIR; /* Find a directory with our name. */
1223 if (flist_find(dir_flist, file) >= 0
1224 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1225 file->modtime = st2.st_mtime;
1227 file->mode = st2.st_mode;
1229 F_OWNER(file) = st2.st_uid;
1231 F_GROUP(file) = st2.st_gid;
1233 file->mode = save_mode;
1236 if (basename_len == 0+1)
1241 F_NDX(file) = dir_count - 1;
1247 /* Only called for temporary file_struct entries created by make_file(). */
1248 void unmake_file(struct file_struct *file)
1250 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1251 #if EXTRA_ROUNDING > 0
1252 if (extra_cnt & EXTRA_ROUNDING)
1253 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1255 free(REQ_EXTRA(file, extra_cnt));
1258 static struct file_struct *send_file_name(int f, struct file_list *flist,
1259 char *fname, STRUCT_STAT *stp,
1260 int flags, int filter_level)
1262 struct file_struct *file;
1263 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1267 file = make_file(fname, flist, stp, flags, filter_level);
1271 if (chmod_modes && !S_ISLNK(file->mode))
1272 file->mode = tweak_mode(file->mode, chmod_modes);
1275 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1276 sx.st.st_mode = file->mode;
1277 sx.acc_acl = sx.def_acl = NULL;
1278 if (get_acl(fname, &sx) < 0)
1282 #ifdef SUPPORT_XATTRS
1283 if (preserve_xattrs && f >= 0) {
1285 if (get_xattr(fname, &sx) < 0)
1290 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1292 flist_expand(flist, 1);
1293 flist->files[flist->used++] = file;
1295 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1297 if (preserve_acls && !S_ISLNK(file->mode)) {
1302 #ifdef SUPPORT_XATTRS
1303 if (preserve_xattrs) {
1304 F_XATTR(file) = send_xattr(&sx, f);
1312 static void send_if_directory(int f, struct file_list *flist,
1313 struct file_struct *file,
1314 char *fbuf, unsigned int ol,
1317 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1319 if (S_ISDIR(file->mode)
1320 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1322 unsigned int len = strlen(fbuf);
1323 if (len > 1 && fbuf[len-1] == '/')
1325 if (len >= MAXPATHLEN - 1) {
1326 io_error |= IOERR_GENERAL;
1327 rprintf(FERROR, "skipping long-named directory: %s\n",
1331 save_filters = push_local_filters(fbuf, len);
1332 send_directory(f, flist, fbuf, len, flags);
1333 pop_local_filters(save_filters);
1340 static int file_compare(const void *file1, const void *file2)
1342 return f_name_cmp(*(struct file_struct **)file1,
1343 *(struct file_struct **)file2);
1346 /* The guts of a merge-sort algorithm. This was derived from the glibc
1347 * version, but I (Wayne) changed the merge code to do less copying and
1348 * to require only half the amount of temporary memory. */
1349 static void fsort_tmp(struct file_struct **fp, size_t num,
1350 struct file_struct **tmp)
1352 struct file_struct **f1, **f2, **t;
1361 fsort_tmp(f1, n1, tmp);
1363 fsort_tmp(f2, n2, tmp);
1365 while (f_name_cmp(*f1, *f2) <= 0) {
1372 memcpy(t, f1, n1 * PTR_SIZE);
1374 *f1++ = *f2++, n2--;
1376 while (n1 > 0 && n2 > 0) {
1377 if (f_name_cmp(*t, *f2) <= 0)
1380 *f1++ = *f2++, n2--;
1384 memcpy(f1, t, n1 * PTR_SIZE);
1387 /* This file-struct sorting routine makes sure that any identical names in
1388 * the file list stay in the same order as they were in the original list.
1389 * This is particularly vital in inc_recurse mode where we expect a sort
1390 * on the flist to match the exact order of a sort on the dir_flist. */
1391 static void fsort(struct file_struct **fp, size_t num)
1397 qsort(fp, num, PTR_SIZE, file_compare);
1399 struct file_struct **tmp = new_array(struct file_struct *,
1401 fsort_tmp(fp, num, tmp);
1406 /* We take an entire set of sibling dirs from the sorted flist and link them
1407 * into the tree, setting the appropriate parent/child/sibling pointers. */
1408 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1413 int32 *parent_dp = parent_ndx < 0 ? NULL
1414 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1416 flist_expand(dir_flist, dir_cnt);
1417 dir_flist->sorted = dir_flist->files;
1419 for (i = 0; dir_cnt; i++) {
1420 struct file_struct *file = from_flist->sorted[i];
1422 if (!S_ISDIR(file->mode))
1425 dir_flist->files[dir_flist->used++] = file;
1428 if (!(file->flags & FLAG_XFER_DIR)
1429 || file->flags & FLAG_MOUNT_DIR)
1433 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1435 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1437 send_dir_ndx = dir_flist->used - 1;
1439 dp = F_DIR_NODE_P(file);
1440 DIR_PARENT(dp) = parent_ndx;
1441 DIR_FIRST_CHILD(dp) = -1;
1444 DIR_NEXT_SIBLING(dp) = -1;
1447 /* This function is normally called by the sender, but the receiving side also
1448 * calls it from get_dirlist() with f set to -1 so that we just construct the
1449 * file list in memory without sending it over the wire. Also, get_dirlist()
1450 * might call this with f set to -2, which also indicates that local filter
1451 * rules should be ignored. */
1452 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1459 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1460 int start = flist->used;
1461 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1463 assert(flist != NULL);
1465 if (!(d = opendir(fbuf))) {
1466 io_error |= IOERR_GENERAL;
1467 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1472 if (len != 1 || *fbuf != '/')
1475 remainder = MAXPATHLEN - (p - fbuf);
1477 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1478 char *dname = d_name(di);
1479 if (dname[0] == '.' && (dname[1] == '\0'
1480 || (dname[1] == '.' && dname[2] == '\0')))
1482 if (strlcpy(p, dname, remainder) >= remainder) {
1483 io_error |= IOERR_GENERAL;
1485 "cannot send long-named file %s\n",
1489 if (dname[0] == '\0') {
1490 io_error |= IOERR_GENERAL;
1492 "cannot send file with empty name in %s\n",
1497 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1503 io_error |= IOERR_GENERAL;
1504 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1509 if (f >= 0 && recurse && !divert_dirs) {
1510 int i, end = flist->used - 1;
1511 /* send_if_directory() bumps flist->used, so use "end". */
1512 for (i = start; i <= end; i++)
1513 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1517 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1519 char fbuf[MAXPATHLEN];
1523 dlen = strlen(fbuf);
1525 if (F_PATHNAME(file) != pathname) {
1526 if (!push_pathname(F_PATHNAME(file), -1))
1527 exit_cleanup(RERR_FILESELECT);
1530 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1532 send_directory(f, flist, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1535 void send_extra_file_list(int f, int at_least)
1537 struct file_list *flist;
1539 int future_cnt, save_io_error = io_error;
1544 /* Keep sending data until we have the requested number of
1545 * files in the upcoming file-lists. */
1546 if (cur_flist->next) {
1547 flist = first_flist->prev; /* the newest flist */
1548 future_cnt = flist->ndx_end - cur_flist->next->ndx_start + 1;
1551 while (future_cnt < at_least) {
1552 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1553 int dir_ndx, dstart = dir_count;
1556 flist = flist_new(0, "send_extra_file_list");
1557 start_write = stats.total_written;
1561 dir_ndx = F_NDX(file);
1564 dir_ndx = send_dir_ndx;
1565 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1566 flist->parent_ndx = dir_ndx;
1568 send1extra(f, file, flist);
1569 dp = F_DIR_NODE_P(file);
1571 /* If there are any duplicate directory names that follow, we
1572 * send all the dirs together in one file-list. The dir_flist
1573 * tree links all the child subdirs onto the last dup dir. */
1574 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1575 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1576 send_dir_ndx = dir_ndx;
1577 file = dir_flist->sorted[dir_ndx];
1578 send1extra(f, file, flist);
1579 dp = F_DIR_NODE_P(file);
1585 if (need_unsorted_flist) {
1586 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1587 out_of_memory("send_extra_file_list");
1588 memcpy(flist->sorted, flist->files,
1589 flist->used * sizeof (struct file_struct*));
1592 flist->sorted = flist->files;
1594 clean_flist(flist, 0);
1596 flist->ndx_end = flist->ndx_start + flist->used - 1
1597 - (dir_count - dstart);
1599 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1600 flist_done_allocating(flist);
1602 file_total += flist->used;
1603 future_cnt += flist->used;
1604 stats.flist_size += stats.total_written - start_write;
1605 stats.num_files += flist->used;
1607 output_flist(flist);
1609 if (DIR_FIRST_CHILD(dp) >= 0) {
1610 send_dir_ndx = DIR_FIRST_CHILD(dp);
1613 while (DIR_NEXT_SIBLING(dp) < 0) {
1614 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1615 write_ndx(f, NDX_FLIST_EOF);
1617 change_local_filter_dir(NULL, 0, 0);
1621 file = dir_flist->sorted[send_dir_ndx];
1622 dp = F_DIR_NODE_P(file);
1624 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1629 if (io_error != save_io_error && !ignore_errors)
1630 send_msg_int(MSG_IO_ERROR, io_error);
1633 struct file_list *send_file_list(int f, int argc, char *argv[])
1635 static const char *lastdir;
1636 static int lastdir_len = -1;
1640 char lastpath[MAXPATHLEN] = "";
1641 struct file_list *flist;
1642 struct timeval start_tv, end_tv;
1645 int flags, disable_buffering;
1646 int reading_remotely = filesfrom_host != NULL;
1647 int rl_nulls = eol_nulls || reading_remotely;
1649 rprintf(FLOG, "building file list\n");
1650 if (show_filelist_p())
1651 start_filelist_progress("building file list");
1652 else if (inc_recurse && verbose && !am_server)
1653 rprintf(FCLIENT, "sending incremental file list\n");
1655 start_write = stats.total_written;
1656 gettimeofday(&start_tv, NULL);
1658 #ifdef SUPPORT_HARD_LINKS
1659 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1663 flist = cur_flist = flist_new(0, "send_file_list");
1665 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1666 flags = FLAG_DIVERT_DIRS | FLAG_XFER_DIR;
1668 dir_flist = cur_flist;
1669 flags = FLAG_XFER_DIR;
1672 disable_buffering = io_start_buffering_out(f);
1673 if (filesfrom_fd >= 0) {
1674 if (argv[0] && !push_dir(argv[0], 0)) {
1675 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1676 full_fname(argv[0]), curr_dir);
1677 exit_cleanup(RERR_FILESELECT);
1683 char fbuf[MAXPATHLEN];
1688 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, !reading_remotely, rl_nulls) == 0)
1690 sanitize_path(fbuf, fbuf, "", 0, NULL);
1694 strlcpy(fbuf, *argv++, MAXPATHLEN);
1696 sanitize_path(fbuf, fbuf, "", 0, NULL);
1700 if (relative_paths) {
1701 /* We clean up fbuf below. */
1703 } else if (!len || fbuf[len - 1] == '/') {
1704 if (len == 2 && fbuf[0] == '.') {
1705 /* Turn "./" into just "." rather than "./." */
1708 if (len + 1 >= MAXPATHLEN)
1709 overflow_exit("send_file_list");
1714 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1715 && (len == 2 || fbuf[len-3] == '/')) {
1716 if (len + 2 >= MAXPATHLEN)
1717 overflow_exit("send_file_list");
1723 is_dot_dir = fbuf[len-1] == '.'
1724 && (len == 1 || fbuf[len-2] == '/');
1729 if (!relative_paths) {
1730 p = strrchr(fbuf, '/');
1737 len -= p - fbuf + 1;
1742 if ((p = strstr(fbuf, "/./")) != NULL) {
1748 len -= p - fbuf + 3;
1752 /* Get rid of trailing "/" and "/.". */
1754 if (fn[len - 1] == '/') {
1756 if (!--len && !dir) {
1761 else if (len >= 2 && fn[len - 1] == '.'
1762 && fn[len - 2] == '/') {
1764 if (!(len -= 2) && !dir) {
1771 if (len == 1 && fn[0] == '/')
1774 /* Reject a ".." dir in the active part of the path. */
1775 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1776 if ((p[2] == '/' || p[2] == '\0')
1777 && (p == fn || p[-1] == '/')) {
1779 "found \"..\" dir in relative path: %s\n",
1781 exit_cleanup(RERR_SYNTAX);
1791 dirlen = dir ? strlen(dir) : 0;
1792 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1793 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1796 lastdir_len = pathname_len;
1797 } else if (!push_pathname(lastdir, lastdir_len)) {
1799 io_error |= IOERR_GENERAL;
1800 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1801 full_fname(dir), curr_dir);
1806 memmove(fbuf, fn, len + 1);
1808 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1809 io_error |= IOERR_GENERAL;
1810 rsyserr(FERROR, errno, "link_stat %s failed",
1815 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1816 rprintf(FINFO, "skipping directory %s\n", fbuf);
1820 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1821 /* Send the implied directories at the start of the
1822 * source spec, so we get their permissions right. */
1823 char *lp = lastpath, *slash = fbuf;
1825 /* Skip any initial directories in our path that we
1826 * have in common with lastpath. */
1827 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1832 if (fn != p || (*lp && *lp != '/')) {
1833 int save_copy_links = copy_links;
1834 int save_xfer_dirs = xfer_dirs;
1835 int dir_flags = flags & ~FLAG_XFER_DIR;
1836 copy_links |= copy_unsafe_links;
1838 while ((slash = strchr(slash+1, '/')) != 0) {
1840 send_file_name(f, flist, fbuf, NULL,
1841 dir_flags, ALL_FILTERS);
1844 copy_links = save_copy_links;
1845 xfer_dirs = save_xfer_dirs;
1847 strlcpy(lastpath, fbuf, sizeof lastpath);
1852 if (one_file_system)
1853 filesystem_dev = st.st_dev;
1855 if (recurse || (xfer_dirs && is_dot_dir)) {
1856 struct file_struct *file;
1857 int top_flags = FLAG_TOP_DIR | flags;
1858 file = send_file_name(f, flist, fbuf, &st,
1859 top_flags, ALL_FILTERS);
1860 if (file && !inc_recurse)
1861 send_if_directory(f, flist, file, fbuf, len, flags);
1863 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1866 gettimeofday(&end_tv, NULL);
1867 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1868 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1869 if (stats.flist_buildtime == 0)
1870 stats.flist_buildtime = 1;
1873 write_byte(f, 0); /* Indicate end of file list */
1875 #ifdef SUPPORT_HARD_LINKS
1876 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1880 if (show_filelist_p())
1881 finish_filelist_progress(flist);
1883 gettimeofday(&end_tv, NULL);
1884 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1885 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1887 /* When converting names, both sides keep an unsorted file-list array
1888 * because the names will differ on the sending and receiving sides
1889 * (both sides will use the unsorted index number for each item). */
1891 /* Sort the list without removing any duplicates. This allows the
1892 * receiving side to ask for whatever name it kept. For incremental
1893 * recursion mode, the sender marks duplicate dirs so that it can
1894 * send them together in a single file-list. */
1896 if (need_unsorted_flist) {
1898 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1899 out_of_memory("send_file_list");
1900 memcpy(flist->sorted, flist->files,
1901 flist->used * sizeof (struct file_struct*));
1902 clean_flist(flist, 0);
1904 flist->sorted = flist->files;
1906 flist->high = flist->used - 1;
1911 flist->sorted = flist->files;
1912 clean_flist(flist, 0);
1914 file_total += flist->used;
1916 /* We don't subtract dir_count for the first send since we
1917 * might have one or more dot dirs which need to get sent. */
1918 flist->ndx_end = flist->ndx_start + flist->used - 1;
1920 if (!numeric_ids && !inc_recurse)
1923 /* send the io_error flag */
1924 if (protocol_version < 30)
1925 write_int(f, ignore_errors ? 0 : io_error);
1926 else if (io_error && !ignore_errors)
1927 send_msg_int(MSG_IO_ERROR, io_error);
1929 if (disable_buffering)
1930 io_end_buffering_out();
1932 stats.flist_size = stats.total_written - start_write;
1933 stats.num_files = flist->used;
1936 output_flist(flist);
1939 rprintf(FINFO, "send_file_list done\n");
1942 add_dirs_to_tree(-1, flist, dir_count);
1943 flist_done_allocating(flist);
1944 if (send_dir_ndx < 0) {
1945 write_ndx(f, NDX_FLIST_EOF);
1948 else if (file_total == 1) {
1949 /* If we're creating incremental file-lists and there
1950 * was just 1 item in the first file-list, send 1 more
1951 * file-list to check if this is a 1-file xfer. */
1952 send_extra_file_list(f, 1);
1959 struct file_list *recv_file_list(int f)
1961 struct file_list *flist;
1966 rprintf(FLOG, "receiving file list\n");
1967 if (show_filelist_p())
1968 start_filelist_progress("receiving file list");
1969 else if (inc_recurse && verbose && !am_server && !first_flist)
1970 rprintf(FCLIENT, "receiving incremental file list\n");
1972 start_read = stats.total_read;
1974 #ifdef SUPPORT_HARD_LINKS
1975 if (preserve_hard_links && !first_flist)
1979 flist = flist_new(0, "recv_file_list");
1982 if (flist->ndx_start == 0)
1983 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1984 dstart = dir_flist->used;
1990 while ((flags = read_byte(f)) != 0) {
1991 struct file_struct *file;
1993 flist_expand(flist, 1);
1995 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1996 flags |= read_byte(f) << 8;
1997 file = recv_file_entry(flist, flags, f);
1999 if (inc_recurse && S_ISDIR(file->mode)) {
2000 flist_expand(dir_flist, 1);
2001 dir_flist->files[dir_flist->used++] = file;
2004 flist->files[flist->used++] = file;
2006 maybe_emit_filelist_progress(flist->used);
2009 rprintf(FINFO, "recv_file_name(%s)\n",
2010 f_name(file, NULL));
2013 file_total += flist->used;
2015 flist->ndx_end = flist->ndx_start + flist->used - 1;
2016 if (inc_recurse && flist->ndx_start)
2017 flist->ndx_end -= dir_flist->used - dstart;
2020 rprintf(FINFO, "received %d names\n", flist->used);
2022 if (show_filelist_p())
2023 finish_filelist_progress(flist);
2026 if (need_unsorted_flist) {
2027 /* Create an extra array of index pointers that we can sort for
2028 * the generator's use (for wading through the files in sorted
2029 * order and for calling flist_find()). We keep the "files"
2030 * list unsorted for our exchange of index numbers with the
2031 * other side (since their names may not sort the same). */
2032 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2033 out_of_memory("recv_file_list");
2034 memcpy(flist->sorted, flist->files,
2035 flist->used * sizeof (struct file_struct*));
2036 if (inc_recurse && dir_flist->used > dstart) {
2037 dir_flist->sorted = realloc_array(dir_flist->sorted,
2038 struct file_struct *,
2040 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2041 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2042 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2047 flist->sorted = flist->files;
2048 if (inc_recurse && dir_flist->used > dstart) {
2049 dir_flist->sorted = dir_flist->files;
2050 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2055 flist_done_allocating(flist);
2057 recv_id_list(f, flist);
2059 clean_flist(flist, relative_paths);
2061 if (protocol_version < 30) {
2062 /* Recv the io_error flag */
2066 io_error |= read_int(f);
2070 output_flist(flist);
2074 for (i = flist->low; i <= flist->high; i++)
2075 list_file_entry(flist->files[i]);
2079 rprintf(FINFO, "recv_file_list done\n");
2081 stats.flist_size += stats.total_read - start_read;
2082 stats.num_files += flist->used;
2087 /* This is only used once by the receiver if the very first file-list
2088 * has exactly one item in it. */
2089 void recv_additional_file_list(int f)
2091 struct file_list *flist;
2092 int ndx = read_ndx(f);
2093 if (ndx == NDX_FLIST_EOF) {
2095 change_local_filter_dir(NULL, 0, 0);
2097 ndx = NDX_FLIST_OFFSET - ndx;
2098 if (ndx < 0 || ndx >= dir_flist->used) {
2099 ndx = NDX_FLIST_OFFSET - ndx;
2101 "[%s] Invalid dir index: %d (%d - %d)\n",
2102 who_am_i(), ndx, NDX_FLIST_OFFSET,
2103 NDX_FLIST_OFFSET - dir_flist->used + 1);
2104 exit_cleanup(RERR_PROTOCOL);
2107 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2110 flist = recv_file_list(f);
2111 flist->parent_ndx = ndx;
2115 /* Search for an identically-named item in the file list. Note that the
2116 * items must agree in their directory-ness, or no match is returned. */
2117 int flist_find(struct file_list *flist, struct file_struct *f)
2119 int low = flist->low, high = flist->high;
2120 int diff, mid, mid_up;
2122 while (low <= high) {
2123 mid = (low + high) / 2;
2124 if (F_IS_ACTIVE(flist->sorted[mid]))
2127 /* Scan for the next non-empty entry using the cached
2128 * distance values. If the value isn't fully up-to-
2129 * date, update it. */
2130 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2131 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2133 mid_up += F_DEPTH(flist->sorted[mid_up]);
2134 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2135 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2137 if (mid_up > high) {
2138 /* If there's nothing left above us, set high to
2139 * a non-empty entry below us and continue. */
2140 high = mid - (int)flist->sorted[mid]->len32;
2141 if (!F_IS_ACTIVE(flist->sorted[high])) {
2143 high -= (int)flist->sorted[high]->len32;
2144 } while (!F_IS_ACTIVE(flist->sorted[high]));
2145 flist->sorted[mid]->len32 = mid - high;
2150 diff = f_name_cmp(flist->sorted[mid_up], f);
2152 if (protocol_version < 29
2153 && S_ISDIR(flist->sorted[mid_up]->mode)
2154 != S_ISDIR(f->mode))
2167 * Free up any resources a file_struct has allocated
2168 * and clear the file.
2170 void clear_file(struct file_struct *file)
2172 /* The +1 zeros out the first char of the basename. */
2173 memset(file, 0, FILE_STRUCT_LEN + 1);
2174 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2175 * entry. Likewise for len32 in the opposite direction. We assume
2176 * that we're alone for now since flist_find() will adjust the counts
2177 * it runs into that aren't up-to-date. */
2178 file->len32 = F_DEPTH(file) = 1;
2181 /* Allocate a new file list. */
2182 struct file_list *flist_new(int flags, char *msg)
2184 struct file_list *flist;
2186 flist = new0(struct file_list);
2190 if (flags & FLIST_TEMP) {
2191 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2192 out_of_memory, POOL_INTERN)))
2195 /* This is a doubly linked list with prev looping back to
2196 * the end of the list, but the last next pointer is NULL. */
2198 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2199 out_of_memory, POOL_INTERN);
2200 if (!flist->file_pool)
2203 first_flist = cur_flist = flist->prev = flist;
2205 flist->file_pool = first_flist->file_pool;
2207 flist->ndx_start = first_flist->prev->ndx_end + 2;
2209 flist->prev = first_flist->prev;
2210 flist->prev->next = first_flist->prev = flist;
2212 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2219 /* Free up all elements in a flist. */
2220 void flist_free(struct file_list *flist)
2223 /* Was FLIST_TEMP dir-list. */
2224 } else if (flist == flist->prev) {
2225 first_flist = cur_flist = NULL;
2229 if (flist == cur_flist)
2230 cur_flist = flist->next;
2231 if (flist == first_flist)
2232 first_flist = first_flist->next;
2234 flist->prev->next = flist->next;
2236 flist->next = first_flist;
2238 flist->next->prev = flist->prev;
2239 file_total -= flist->used;
2243 if (!flist->prev || !flist_cnt)
2244 pool_destroy(flist->file_pool);
2246 pool_free_old(flist->file_pool, flist->pool_boundary);
2248 if (flist->sorted && flist->sorted != flist->files)
2249 free(flist->sorted);
2254 /* This routine ensures we don't have any duplicate names in our file list.
2255 * duplicate names can cause corruption because of the pipelining. */
2256 static void clean_flist(struct file_list *flist, int strip_root)
2258 char fbuf[MAXPATHLEN];
2263 if (flist->used == 0) {
2269 fsort(flist->sorted, flist->used);
2271 if (!am_sender || inc_recurse) {
2272 for (i = prev_i = 0; i < flist->used; i++) {
2273 if (F_IS_ACTIVE(flist->sorted[i])) {
2278 flist->low = prev_i;
2280 i = prev_i = flist->used - 1;
2284 while (++i < flist->used) {
2286 struct file_struct *file = flist->sorted[i];
2288 if (!F_IS_ACTIVE(file))
2290 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2292 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2293 int save_mode = file->mode;
2294 /* Make sure that this directory doesn't duplicate a
2295 * non-directory earlier in the list. */
2296 flist->high = prev_i;
2297 file->mode = S_IFREG;
2298 j = flist_find(flist, file);
2299 file->mode = save_mode;
2304 /* If one is a dir and the other is not, we want to
2305 * keep the dir because it might have contents in the
2307 if (S_ISDIR(file->mode)) {
2308 struct file_struct *fp = flist->sorted[j];
2309 if (!S_ISDIR(fp->mode))
2317 flist->sorted[drop]->flags |= FLAG_DUPLICATE;
2321 "removing duplicate name %s from file list (%d)\n",
2322 f_name(file, fbuf), drop + flist->ndx_start);
2324 /* Make sure we don't lose track of a user-specified
2326 flist->sorted[keep]->flags |= flist->sorted[drop]->flags
2327 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2329 clear_file(flist->sorted[drop]);
2333 if (flist->low == drop) {
2335 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2344 flist->high = prev_i;
2347 /* We need to strip off the leading slashes for relative
2348 * paths, but this must be done _after_ the sorting phase. */
2349 for (i = flist->low; i <= flist->high; i++) {
2350 struct file_struct *file = flist->sorted[i];
2354 while (*file->dirname == '/')
2356 if (!*file->dirname)
2357 file->dirname = NULL;
2361 if (prune_empty_dirs && !am_sender) {
2362 int j, prev_depth = 0;
2364 prev_i = 0; /* It's OK that this isn't really true. */
2366 for (i = flist->low; i <= flist->high; i++) {
2367 struct file_struct *fp, *file = flist->sorted[i];
2369 /* This temporarily abuses the F_DEPTH() value for a
2370 * directory that is in a chain that might get pruned.
2371 * We restore the old value if it gets a reprieve. */
2372 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2373 /* Dump empty dirs when coming back down. */
2374 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2375 fp = flist->sorted[prev_i];
2376 if (F_DEPTH(fp) >= 0)
2378 prev_i = -F_DEPTH(fp)-1;
2381 prev_depth = F_DEPTH(file);
2382 if (is_excluded(f_name(file, fbuf), 1,
2384 /* Keep dirs through this dir. */
2385 for (j = prev_depth-1; ; j--) {
2386 fp = flist->sorted[prev_i];
2387 if (F_DEPTH(fp) >= 0)
2389 prev_i = -F_DEPTH(fp)-1;
2393 F_DEPTH(file) = -prev_i-1;
2396 /* Keep dirs through this non-dir. */
2397 for (j = prev_depth; ; j--) {
2398 fp = flist->sorted[prev_i];
2399 if (F_DEPTH(fp) >= 0)
2401 prev_i = -F_DEPTH(fp)-1;
2406 /* Dump all remaining empty dirs. */
2408 struct file_struct *fp = flist->sorted[prev_i];
2409 if (F_DEPTH(fp) >= 0)
2411 prev_i = -F_DEPTH(fp)-1;
2415 for (i = flist->low; i <= flist->high; i++) {
2416 if (F_IS_ACTIVE(flist->sorted[i]))
2420 for (i = flist->high; i >= flist->low; i--) {
2421 if (F_IS_ACTIVE(flist->sorted[i]))
2428 static void output_flist(struct file_list *flist)
2430 char uidbuf[16], gidbuf[16], depthbuf[16];
2431 struct file_struct *file;
2432 const char *root, *dir, *slash, *name, *trail;
2433 const char *who = who_am_i();
2436 rprintf(FINFO, "[%s] flist start=%d, end=%d, used=%d, low=%d, high=%d\n",
2437 who, flist->ndx_start, flist->ndx_end, flist->used, flist->low, flist->high);
2438 for (i = 0; i < flist->used; i++) {
2439 file = flist->sorted[i];
2440 if ((am_root || am_sender) && uid_ndx) {
2441 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2446 static char parens[] = "(\0)\0\0\0";
2447 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2448 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2449 pp, F_GROUP(file), pp + 2);
2453 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2454 if (F_IS_ACTIVE(file)) {
2455 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2456 if ((dir = file->dirname) == NULL)
2460 name = file->basename;
2461 trail = S_ISDIR(file->mode) ? "/" : "";
2463 root = dir = slash = name = trail = "";
2465 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2466 who, i + flist->ndx_start,
2467 root, dir, slash, name, trail,
2468 (int)file->mode, (double)F_LENGTH(file),
2469 uidbuf, gidbuf, file->flags);
2473 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2474 enum fnc_type { t_PATH, t_ITEM };
2476 static int found_prefix;
2478 /* Compare the names of two file_struct entities, similar to how strcmp()
2479 * would do if it were operating on the joined strings.
2481 * Some differences beginning with protocol_version 29: (1) directory names
2482 * are compared with an assumed trailing slash so that they compare in a
2483 * way that would cause them to sort immediately prior to any content they
2484 * may have; (2) a directory of any name compares after a non-directory of
2485 * any name at the same depth; (3) a directory with name "." compares prior
2486 * to anything else. These changes mean that a directory and a non-dir
2487 * with the same name will not compare as equal (protocol_version >= 29).
2489 * The dirname component can be an empty string, but the basename component
2490 * cannot (and never is in the current codebase). The basename component
2491 * may be NULL (for a removed item), in which case it is considered to be
2492 * after any existing item. */
2493 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2496 const uchar *c1, *c2;
2497 enum fnc_state state1, state2;
2498 enum fnc_type type1, type2;
2499 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2501 if (!f1 || !F_IS_ACTIVE(f1)) {
2502 if (!f2 || !F_IS_ACTIVE(f2))
2506 if (!f2 || !F_IS_ACTIVE(f2))
2509 c1 = (uchar*)f1->dirname;
2510 c2 = (uchar*)f2->dirname;
2514 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2515 c1 = (const uchar*)f1->basename;
2516 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2518 state1 = s_TRAILING;
2527 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2528 c2 = (const uchar*)f2->basename;
2529 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2531 state2 = s_TRAILING;
2541 return type1 == t_PATH ? 1 : -1;
2551 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2552 c1 = (const uchar*)f1->basename;
2553 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2555 state1 = s_TRAILING;
2561 state1 = s_TRAILING;
2562 if (type1 == t_PATH) {
2571 if (*c2 && type1 != type2)
2572 return type1 == t_PATH ? 1 : -1;
2581 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2582 c2 = (const uchar*)f2->basename;
2583 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2585 state2 = s_TRAILING;
2591 state2 = s_TRAILING;
2592 if (type2 == t_PATH) {
2605 return type1 == t_PATH ? 1 : -1;
2607 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2612 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2613 * not match if f2's basename is not an exact match of a path element in f1.
2614 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2615 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2619 return found_prefix;
2622 char *f_name_buf(void)
2624 static char names[5][MAXPATHLEN];
2625 static unsigned int n;
2627 n = (n + 1) % (sizeof names / sizeof names[0]);
2632 /* Return a copy of the full filename of a flist entry, using the indicated
2633 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2634 * done because we checked the size when creating the file_struct entry.
2636 char *f_name(const struct file_struct *f, char *fbuf)
2638 if (!f || !F_IS_ACTIVE(f))
2642 fbuf = f_name_buf();
2645 int len = strlen(f->dirname);
2646 memcpy(fbuf, f->dirname, len);
2648 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2650 strlcpy(fbuf, f->basename, MAXPATHLEN);
2655 /* Do a non-recursive scan of the named directory, possibly ignoring all
2656 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2657 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2658 * buffer (the functions we call will append names onto the end, but the old
2659 * dir value will be restored on exit). */
2660 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2662 struct file_list *dirlist;
2663 char dirbuf[MAXPATHLEN];
2664 int save_recurse = recurse;
2665 int save_xfer_dirs = xfer_dirs;
2666 int save_prune_empty_dirs = prune_empty_dirs;
2669 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2670 if (dlen >= MAXPATHLEN)
2675 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2679 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2680 xfer_dirs = save_xfer_dirs;
2681 recurse = save_recurse;
2683 flist_count_offset += dirlist->used;
2685 prune_empty_dirs = 0;
2686 dirlist->sorted = dirlist->files;
2687 clean_flist(dirlist, 0);
2688 prune_empty_dirs = save_prune_empty_dirs;
2691 output_flist(dirlist);