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;
55 extern int relative_paths;
56 extern int implied_dirs;
57 extern int file_extra_cnt;
58 extern int ignore_perishable;
59 extern int non_perishable_cnt;
60 extern int prune_empty_dirs;
61 extern int copy_links;
62 extern int copy_unsafe_links;
63 extern int protocol_version;
64 extern int sanitize_paths;
65 extern struct stats stats;
67 extern char curr_dir[MAXPATHLEN];
69 extern struct chmod_mode_struct *chmod_modes;
71 extern struct filter_list_struct filter_list;
72 extern struct filter_list_struct server_filter_list;
76 extern int need_unsorted_flist;
77 extern iconv_t ic_send, ic_recv;
80 #define PTR_SIZE (sizeof (struct file_struct *))
84 dev_t filesystem_dev; /* used to implement -x */
86 struct file_list *cur_flist, *first_flist, *dir_flist;
87 int send_dir_ndx = -1, send_dir_depth = 0;
88 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
89 int file_total = 0; /* total of all active items over all file-lists */
90 int flist_eof = 0; /* all the file-lists are now known */
92 /* The tmp_* vars are used as a cache area by make_file() to store data
93 * that the sender doesn't need to remember in its file list. The data
94 * will survive just long enough to be used by send_file_entry(). */
95 static dev_t tmp_rdev;
96 #ifdef SUPPORT_HARD_LINKS
97 static int64 tmp_dev, tmp_ino;
99 static char tmp_sum[MAX_DIGEST_LEN];
101 static char empty_sum[MAX_DIGEST_LEN];
102 static int flist_count_offset; /* for --delete --progress */
103 static int dir_count = 0;
105 static void clean_flist(struct file_list *flist, int strip_root);
106 static void output_flist(struct file_list *flist);
108 void init_flist(void)
111 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
112 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
114 checksum_len = protocol_version < 21 ? 2
115 : protocol_version < 30 ? MD4_DIGEST_LEN
119 static int show_filelist_p(void)
121 return verbose && xfer_dirs && !am_server && !inc_recurse;
124 static void start_filelist_progress(char *kind)
126 rprintf(FCLIENT, "%s ... ", kind);
127 if (verbose > 1 || do_progress)
128 rprintf(FCLIENT, "\n");
132 static void emit_filelist_progress(int count)
134 rprintf(FCLIENT, " %d files...\r", count);
137 static void maybe_emit_filelist_progress(int count)
139 if (do_progress && show_filelist_p() && (count % 100) == 0)
140 emit_filelist_progress(count);
143 static void finish_filelist_progress(const struct file_list *flist)
146 /* This overwrites the progress line */
147 rprintf(FINFO, "%d file%sto consider\n",
148 flist->used, flist->used == 1 ? " " : "s ");
150 rprintf(FINFO, "done\n");
153 void show_flist_stats(void)
158 static void list_file_entry(struct file_struct *f)
160 char permbuf[PERMSTRING_SIZE];
163 if (!F_IS_ACTIVE(f)) {
164 /* this can happen if duplicate names were removed */
168 permstring(permbuf, f->mode);
171 /* TODO: indicate '+' if the entry has an ACL. */
174 if (preserve_links && S_ISLNK(f->mode)) {
175 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
176 permbuf, len, timestring(f->modtime),
177 f_name(f, NULL), F_SYMLINK(f));
181 rprintf(FINFO, "%s %11.0f %s %s\n",
182 permbuf, len, timestring(f->modtime),
187 /* Stat either a symlink or its referent, depending on the settings of
188 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
190 * If path is the name of a symlink, then the linkbuf buffer (which must hold
191 * MAXPATHLEN chars) will be set to the symlink's target string.
193 * The stat structure pointed to by stp will contain information about the
194 * link or the referent as appropriate, if they exist. */
195 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
198 if (link_stat(path, stp, copy_dirlinks) < 0)
200 if (S_ISLNK(stp->st_mode)) {
201 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
204 linkbuf[llen] = '\0';
205 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
207 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
210 return x_stat(path, stp, NULL);
215 return x_stat(path, stp, NULL);
219 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
223 return x_stat(path, stp, NULL);
224 if (x_lstat(path, stp, NULL) < 0)
226 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
228 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
233 return x_stat(path, stp, NULL);
237 /* This function is used to check if a file should be included/excluded
238 * from the list of files based on its name and type etc. The value of
239 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
240 static int is_excluded(char *fname, int is_dir, int filter_level)
242 #if 0 /* This currently never happens, so avoid a useless compare. */
243 if (filter_level == NO_FILTERS)
247 /* never exclude '.', even if somebody does --exclude '*' */
248 if (fname[0] == '.' && !fname[1])
250 /* Handle the -R version of the '.' dir. */
251 if (fname[0] == '/') {
252 int len = strlen(fname);
253 if (fname[len-1] == '.' && fname[len-2] == '/')
257 if (server_filter_list.head
258 && check_filter(&server_filter_list, fname, is_dir) < 0)
260 if (filter_level != ALL_FILTERS)
263 && check_filter(&filter_list, fname, is_dir) < 0)
268 static void send_directory(int f, struct file_list *flist,
269 char *fbuf, int len, int flags);
271 static const char *pathname, *orig_dir;
272 static int pathname_len;
275 /* Make sure flist can hold at least flist->used + extra entries. */
276 static void flist_expand(struct file_list *flist, int extra)
278 struct file_struct **new_ptr;
280 if (flist->used + extra <= flist->malloced)
283 if (flist->malloced < FLIST_START)
284 flist->malloced = FLIST_START;
285 else if (flist->malloced >= FLIST_LINEAR)
286 flist->malloced += FLIST_LINEAR;
288 flist->malloced *= 2;
290 /* In case count jumped or we are starting the list
291 * with a known size just set it. */
292 if (flist->malloced < flist->used + extra)
293 flist->malloced = flist->used + extra;
295 new_ptr = realloc_array(flist->files, struct file_struct *,
298 if (verbose >= 2 && flist->malloced != FLIST_START) {
299 rprintf(FCLIENT, "[%s] expand file_list to %.0f bytes, did%s move\n",
301 (double)sizeof flist->files[0] * flist->malloced,
302 (new_ptr == flist->files) ? " not" : "");
305 flist->files = new_ptr;
308 out_of_memory("flist_expand");
311 static void flist_done_allocating(struct file_list *flist)
313 void *ptr = pool_boundary(flist->file_pool, 8*1024);
314 if (flist->pool_boundary == ptr)
315 flist->pool_boundary = NULL; /* list didn't use any pool memory */
317 flist->pool_boundary = ptr;
320 int push_pathname(const char *dir, int len)
326 orig_dir = strdup(curr_dir);
328 if (pathname && !pop_dir(orig_dir)) {
329 rsyserr(FERROR, errno, "pop_dir %s failed",
330 full_fname(orig_dir));
331 exit_cleanup(RERR_FILESELECT);
334 if (dir && !push_dir(dir, 0)) {
335 io_error |= IOERR_GENERAL;
336 rsyserr(FERROR, errno, "push_dir %s failed in %s",
337 full_fname(dir), curr_dir);
342 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
347 static void send_file_entry(int f, struct file_struct *file, int ndx)
349 static time_t modtime;
353 static uint32 rdev_major;
356 static char *user_name, *group_name;
357 static char lastname[MAXPATHLEN];
358 char fname[MAXPATHLEN];
359 int first_hlink_ndx = -1;
364 if (ic_send != (iconv_t)-1) {
365 ICONV_CONST char *ibuf;
367 size_t ocnt = MAXPATHLEN, icnt;
369 iconv(ic_send, NULL,0, NULL,0);
370 if ((ibuf = (ICONV_CONST char *)file->dirname) != NULL) {
372 ocnt--; /* pre-subtract the space for the '/' */
373 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1)
378 ibuf = (ICONV_CONST char *)file->basename;
380 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
382 io_error |= IOERR_GENERAL;
384 "[%s] cannot convert filename: %s (%s)\n",
385 who_am_i(), f_name(file, fname), strerror(errno));
393 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
395 if (file->mode == mode)
396 xflags |= XMIT_SAME_MODE;
400 if (protocol_version >= 30 && S_ISDIR(mode) && !(file->flags & FLAG_XFER_DIR))
401 xflags |= XMIT_NON_XFER_DIR;
403 if ((preserve_devices && IS_DEVICE(mode))
404 || (preserve_specials && IS_SPECIAL(mode))) {
405 if (protocol_version < 28) {
406 if (tmp_rdev == rdev)
407 xflags |= XMIT_SAME_RDEV_pre28;
412 if ((uint32)major(rdev) == rdev_major)
413 xflags |= XMIT_SAME_RDEV_MAJOR;
415 rdev_major = major(rdev);
416 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
417 xflags |= XMIT_RDEV_MINOR_8_pre30;
419 } else if (protocol_version < 28)
420 rdev = MAKEDEV(0, 0);
422 if ((uid_t)F_OWNER(file) == uid && *lastname)
423 xflags |= XMIT_SAME_UID;
426 if (uid_ndx && !numeric_ids) {
427 user_name = add_uid(uid);
428 if (inc_recurse && user_name)
429 xflags |= XMIT_USER_NAME_FOLLOWS;
434 if ((gid_t)F_GROUP(file) == gid && *lastname)
435 xflags |= XMIT_SAME_GID;
438 if (gid_ndx && !numeric_ids) {
439 group_name = add_gid(gid);
440 if (inc_recurse && group_name)
441 xflags |= XMIT_GROUP_NAME_FOLLOWS;
445 if (file->modtime == modtime)
446 xflags |= XMIT_SAME_TIME;
448 modtime = file->modtime;
450 #ifdef SUPPORT_HARD_LINKS
452 if (protocol_version >= 30) {
453 struct idev_node *np = idev_node(tmp_dev, tmp_ino);
454 first_hlink_ndx = (int32)(long)np->data - 1;
455 if (first_hlink_ndx < 0) {
456 np->data = (void*)(long)(ndx + 1);
457 xflags |= XMIT_HLINK_FIRST;
459 xflags |= XMIT_HLINKED;
461 if (tmp_dev == dev) {
462 if (protocol_version >= 28)
463 xflags |= XMIT_SAME_DEV_pre30;
466 xflags |= XMIT_HLINKED;
472 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
474 l2 = strlen(fname+l1);
477 xflags |= XMIT_SAME_NAME;
479 xflags |= XMIT_LONG_NAME;
481 /* We must make sure we don't send a zero flag byte or the
482 * other end will terminate the flist transfer. Note that
483 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
484 * it's harmless way to add a bit to the first flag byte. */
485 if (protocol_version >= 28) {
486 if (!xflags && !S_ISDIR(mode))
487 xflags |= XMIT_TOP_DIR;
488 if ((xflags & 0xFF00) || !xflags) {
489 xflags |= XMIT_EXTENDED_FLAGS;
490 write_shortint(f, xflags);
492 write_byte(f, xflags);
494 if (!(xflags & 0xFF))
495 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
496 write_byte(f, xflags);
498 if (xflags & XMIT_SAME_NAME)
500 if (xflags & XMIT_LONG_NAME)
501 write_varint30(f, l2);
504 write_buf(f, fname + l1, l2);
506 if (first_hlink_ndx >= 0) {
507 write_varint30(f, first_hlink_ndx);
511 write_varlong30(f, F_LENGTH(file), 3);
512 if (!(xflags & XMIT_SAME_TIME)) {
513 if (protocol_version >= 30)
514 write_varlong(f, modtime, 4);
516 write_int(f, modtime);
518 if (!(xflags & XMIT_SAME_MODE))
519 write_int(f, to_wire_mode(mode));
520 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
521 if (protocol_version < 30)
524 write_varint(f, uid);
525 if (xflags & XMIT_USER_NAME_FOLLOWS) {
526 int len = strlen(user_name);
528 write_buf(f, user_name, len);
532 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
533 if (protocol_version < 30)
536 write_varint(f, gid);
537 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
538 int len = strlen(group_name);
540 write_buf(f, group_name, len);
544 if ((preserve_devices && IS_DEVICE(mode))
545 || (preserve_specials && IS_SPECIAL(mode))) {
546 if (protocol_version < 28) {
547 if (!(xflags & XMIT_SAME_RDEV_pre28))
548 write_int(f, (int)rdev);
550 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
551 write_varint30(f, major(rdev));
552 if (protocol_version >= 30)
553 write_varint(f, minor(rdev));
554 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
555 write_byte(f, minor(rdev));
557 write_int(f, minor(rdev));
562 if (preserve_links && S_ISLNK(mode)) {
563 const char *sl = F_SYMLINK(file);
564 int len = strlen(sl);
565 write_varint30(f, len);
566 write_buf(f, sl, len);
570 #ifdef SUPPORT_HARD_LINKS
571 if (tmp_dev != 0 && protocol_version < 30) {
572 if (protocol_version < 26) {
573 /* 32-bit dev_t and ino_t */
574 write_int(f, (int32)dev);
575 write_int(f, (int32)tmp_ino);
577 /* 64-bit dev_t and ino_t */
578 if (!(xflags & XMIT_SAME_DEV_pre30))
579 write_longint(f, dev);
580 write_longint(f, tmp_ino);
585 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
590 /* Prior to 28, we sent a useless set of nulls. */
593 write_buf(f, sum, checksum_len);
597 strlcpy(lastname, fname, MAXPATHLEN);
599 if (S_ISREG(mode) || S_ISLNK(mode))
600 stats.total_size += F_LENGTH(file);
603 static struct file_struct *recv_file_entry(struct file_list *flist,
606 static int64 modtime;
610 static uint32 rdev_major;
613 static uint16 gid_flags;
614 static char lastname[MAXPATHLEN], *lastdir;
615 static int lastdir_depth, lastdir_len = -1;
616 static unsigned int del_hier_name_len = 0;
617 static int in_del_hier = 0;
618 char thisname[MAXPATHLEN];
619 unsigned int l1 = 0, l2 = 0;
620 int alloc_len, basename_len, linkname_len;
621 int extra_len = file_extra_cnt * EXTRA_LEN;
622 int first_hlink_ndx = -1;
624 const char *basename;
625 struct file_struct *file;
629 if (xflags & XMIT_SAME_NAME)
632 if (xflags & XMIT_LONG_NAME)
633 l2 = read_varint30(f);
637 if (l2 >= MAXPATHLEN - l1) {
639 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
640 xflags, l1, l2, lastname, who_am_i());
641 overflow_exit("recv_file_entry");
644 strlcpy(thisname, lastname, l1 + 1);
645 read_sbuf(f, &thisname[l1], l2);
646 thisname[l1 + l2] = 0;
648 /* Abuse basename_len for a moment... */
649 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
652 if (ic_recv != (iconv_t)-1) {
653 char *obuf = thisname;
654 ICONV_CONST char *ibuf = (ICONV_CONST char *)lastname;
655 size_t ocnt = MAXPATHLEN, icnt = basename_len;
657 if (icnt >= MAXPATHLEN) {
662 iconv(ic_recv, NULL,0, NULL,0);
663 if (iconv(ic_recv, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
665 io_error |= IOERR_GENERAL;
667 "[%s] cannot convert filename: %s (%s)\n",
668 who_am_i(), lastname, strerror(errno));
675 clean_fname(thisname, 0);
678 sanitize_path(thisname, thisname, "", 0, NULL);
680 if ((basename = strrchr(thisname, '/')) != NULL) {
681 int len = basename++ - thisname;
682 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
683 lastdir = new_array(char, len + 1);
684 memcpy(lastdir, thisname, len);
687 lastdir_depth = count_dir_elements(lastdir);
691 basename_len = strlen(basename) + 1; /* count the '\0' */
693 #ifdef SUPPORT_HARD_LINKS
694 if (protocol_version >= 30
695 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
696 struct file_struct *first;
697 first_hlink_ndx = read_varint30(f);
698 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->used) {
700 "hard-link reference out of range: %d (%d)\n",
701 first_hlink_ndx, flist->used);
702 exit_cleanup(RERR_PROTOCOL);
704 first = flist->files[first_hlink_ndx];
705 file_length = F_LENGTH(first);
706 modtime = first->modtime;
709 uid = F_OWNER(first);
711 gid = F_GROUP(first);
712 if ((preserve_devices && IS_DEVICE(mode))
713 || (preserve_specials && IS_SPECIAL(mode))) {
714 uint32 *devp = F_RDEV_P(first);
715 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
716 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
718 if (preserve_links && S_ISLNK(mode))
719 linkname_len = strlen(F_SYMLINK(first)) + 1;
726 file_length = read_varlong30(f, 3);
727 if (!(xflags & XMIT_SAME_TIME)) {
728 if (protocol_version >= 30) {
729 modtime = read_varlong(f, 4);
730 #if SIZEOF_TIME_T < SIZEOF_INT64
731 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
733 "Time value of %s truncated on receiver.\n",
738 modtime = read_int(f);
740 if (!(xflags & XMIT_SAME_MODE))
741 mode = from_wire_mode(read_int(f));
743 if (chmod_modes && !S_ISLNK(mode))
744 mode = tweak_mode(mode, chmod_modes);
746 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
747 if (protocol_version < 30)
748 uid = (uid_t)read_int(f);
750 uid = (uid_t)read_varint(f);
751 if (xflags & XMIT_USER_NAME_FOLLOWS)
752 uid = recv_user_name(f, uid);
753 else if (inc_recurse && am_root && !numeric_ids)
754 uid = match_uid(uid);
757 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
758 if (protocol_version < 30)
759 gid = (gid_t)read_int(f);
761 gid = (gid_t)read_varint(f);
763 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
764 gid = recv_group_name(f, gid, &gid_flags);
765 else if (inc_recurse && (!am_root || !numeric_ids))
766 gid = match_gid(gid, &gid_flags);
770 if ((preserve_devices && IS_DEVICE(mode))
771 || (preserve_specials && IS_SPECIAL(mode))) {
772 if (protocol_version < 28) {
773 if (!(xflags & XMIT_SAME_RDEV_pre28))
774 rdev = (dev_t)read_int(f);
777 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
778 rdev_major = read_varint30(f);
779 if (protocol_version >= 30)
780 rdev_minor = read_varint(f);
781 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
782 rdev_minor = read_byte(f);
784 rdev_minor = read_int(f);
785 rdev = MAKEDEV(rdev_major, rdev_minor);
787 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
789 } else if (protocol_version < 28)
790 rdev = MAKEDEV(0, 0);
793 if (preserve_links && S_ISLNK(mode)) {
794 linkname_len = read_varint30(f) + 1; /* count the '\0' */
795 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
796 rprintf(FERROR, "overflow: linkname_len=%d\n",
798 overflow_exit("recv_file_entry");
805 #ifdef SUPPORT_HARD_LINKS
807 if (preserve_hard_links) {
808 if (protocol_version < 28 && S_ISREG(mode))
809 xflags |= XMIT_HLINKED;
810 if (xflags & XMIT_HLINKED)
811 extra_len += EXTRA_LEN;
816 /* We need one or two index int32s when we're preserving ACLs. */
818 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
821 if (always_checksum && S_ISREG(mode))
822 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
824 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
825 extra_len += EXTRA_LEN;
827 #if EXTRA_ROUNDING > 0
828 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
829 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
832 if (inc_recurse && S_ISDIR(mode)) {
833 if (one_file_system) {
834 /* Room to save the dir's device for -x */
835 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
837 pool = dir_flist->file_pool;
839 pool = flist->file_pool;
841 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
843 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
845 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
847 file = (struct file_struct *)bp;
848 bp += FILE_STRUCT_LEN;
850 memcpy(bp, basename, basename_len);
851 bp += basename_len + linkname_len; /* skip space for symlink too */
853 #ifdef SUPPORT_HARD_LINKS
854 if (xflags & XMIT_HLINKED)
855 file->flags |= FLAG_HLINKED;
857 file->modtime = (time_t)modtime;
858 file->len32 = (uint32)file_length;
859 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
860 file->flags |= FLAG_LENGTH64;
861 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
868 file->flags |= gid_flags;
872 F_NDX(file) = flist->used + flist->ndx_start;
875 if (basename != thisname) {
876 file->dirname = lastdir;
877 F_DEPTH(file) = lastdir_depth + 1;
882 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
884 if (xflags & XMIT_TOP_DIR) {
885 in_del_hier = recurse;
886 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
887 if (relative_paths && del_hier_name_len > 2
888 && lastname[del_hier_name_len-1] == '.'
889 && lastname[del_hier_name_len-2] == '/')
890 del_hier_name_len -= 2;
891 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
892 } else if (protocol_version >= 30) {
893 if (!(xflags & XMIT_NON_XFER_DIR))
894 file->flags |= FLAG_XFER_DIR;
895 } else if (in_del_hier) {
896 if (!relative_paths || !del_hier_name_len
897 || (l1 >= del_hier_name_len
898 && lastname[del_hier_name_len] == '/'))
899 file->flags |= FLAG_XFER_DIR;
905 if ((preserve_devices && IS_DEVICE(mode))
906 || (preserve_specials && IS_SPECIAL(mode))) {
907 uint32 *devp = F_RDEV_P(file);
908 DEV_MAJOR(devp) = major(rdev);
909 DEV_MINOR(devp) = minor(rdev);
914 bp = (char*)file->basename + basename_len;
915 if (first_hlink_ndx >= 0) {
916 struct file_struct *first = flist->files[first_hlink_ndx];
917 memcpy(bp, F_SYMLINK(first), linkname_len);
919 read_sbuf(f, bp, linkname_len - 1);
921 sanitize_path(bp, bp, "", lastdir_depth, NULL);
925 #ifdef SUPPORT_HARD_LINKS
926 if (preserve_hard_links && xflags & XMIT_HLINKED) {
927 if (protocol_version >= 30) {
928 F_HL_GNUM(file) = xflags & XMIT_HLINK_FIRST
929 ? flist->used : first_hlink_ndx;
931 static int32 cnt = 0;
932 struct idev_node *np;
935 if (protocol_version < 26) {
939 if (!(xflags & XMIT_SAME_DEV_pre30))
940 dev = read_longint(f);
941 ino = read_longint(f);
943 np = idev_node(dev, ino);
944 ndx = (int32)(long)np->data - 1;
947 np->data = (void*)(long)cnt;
949 F_HL_GNUM(file) = ndx;
954 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
958 /* Prior to 28, we get a useless set of nulls. */
961 if (first_hlink_ndx >= 0) {
962 struct file_struct *first = flist->files[first_hlink_ndx];
963 memcpy(bp, F_SUM(first), checksum_len);
965 read_buf(f, bp, checksum_len);
969 if (preserve_acls && !S_ISLNK(mode))
970 receive_acl(file, f);
972 #ifdef SUPPORT_XATTRS
974 receive_xattr(file, f );
977 if (S_ISREG(mode) || S_ISLNK(mode))
978 stats.total_size += file_length;
984 * Create a file_struct for a named file by reading its stat()
985 * information and performing extensive checks against global
988 * @return the new file, or NULL if there was an error or this file
989 * should be excluded.
991 * @todo There is a small optimization opportunity here to avoid
992 * stat()ing the file in some circumstances, which has a certain cost.
993 * We are called immediately after doing readdir(), and so we may
994 * already know the d_type of the file. We could for example avoid
995 * statting directories if we're not recursing, but this is not a very
996 * important case. Some systems may not have d_type.
998 struct file_struct *make_file(const char *fname, struct file_list *flist,
999 STRUCT_STAT *stp, int flags, int filter_level)
1001 static char *lastdir;
1002 static int lastdir_len = -1;
1003 struct file_struct *file;
1005 char thisname[MAXPATHLEN];
1006 char linkname[MAXPATHLEN];
1007 int alloc_len, basename_len, linkname_len;
1008 int extra_len = file_extra_cnt * EXTRA_LEN;
1009 const char *basename;
1013 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1014 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1017 clean_fname(thisname, 0);
1019 sanitize_path(thisname, thisname, "", 0, NULL);
1021 if (stp && S_ISDIR(stp->st_mode)) {
1022 st = *stp; /* Needed for "symlink/." with --relative. */
1023 *linkname = '\0'; /* make IBM code checker happy */
1024 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1025 int save_errno = errno;
1026 /* See if file is excluded before reporting an error. */
1027 if (filter_level != NO_FILTERS
1028 && (is_excluded(thisname, 0, filter_level)
1029 || is_excluded(thisname, 1, filter_level))) {
1030 if (ignore_perishable && save_errno != ENOENT)
1031 non_perishable_cnt++;
1034 if (save_errno == ENOENT) {
1035 #ifdef SUPPORT_LINKS
1036 /* Avoid "vanished" error if symlink points nowhere. */
1037 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1038 && S_ISLNK(st.st_mode)) {
1039 io_error |= IOERR_GENERAL;
1040 rprintf(FERROR, "symlink has no referent: %s\n",
1041 full_fname(thisname));
1045 enum logcode c = am_daemon && protocol_version < 28
1047 io_error |= IOERR_VANISHED;
1048 rprintf(c, "file has vanished: %s\n",
1049 full_fname(thisname));
1052 io_error |= IOERR_GENERAL;
1053 rsyserr(FERROR, save_errno, "readlink %s failed",
1054 full_fname(thisname));
1059 /* backup.c calls us with filter_level set to NO_FILTERS. */
1060 if (filter_level == NO_FILTERS)
1063 if (S_ISDIR(st.st_mode)) {
1065 rprintf(FINFO, "skipping directory %s\n", thisname);
1069 flags &= ~FLAG_XFER_DIR;
1071 /* -x only affects directories because we need to avoid recursing
1072 * into a mount-point directory, not to avoid copying a symlinked
1073 * file if -L (or similar) was specified. */
1074 if (one_file_system && st.st_dev != filesystem_dev
1075 && S_ISDIR(st.st_mode)) {
1076 if (one_file_system > 1) {
1078 rprintf(FINFO, "skipping mount-point dir %s\n",
1083 flags |= FLAG_MOUNT_DIR;
1086 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1087 if (ignore_perishable)
1088 non_perishable_cnt++;
1092 if (lp_ignore_nonreadable(module_id)) {
1093 #ifdef SUPPORT_LINKS
1094 if (!S_ISLNK(st.st_mode))
1096 if (access(thisname, R_OK) != 0)
1102 /* Only divert a directory in the main transfer. */
1104 if (flist->prev && S_ISDIR(st.st_mode)
1105 && flags & FLAG_DIVERT_DIRS) {
1106 /* Room for parent/sibling/next-child info. */
1107 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1109 pool = dir_flist->file_pool;
1111 pool = flist->file_pool;
1116 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1117 who_am_i(), thisname, filter_level);
1120 if ((basename = strrchr(thisname, '/')) != NULL) {
1121 int len = basename++ - thisname;
1122 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1123 lastdir = new_array(char, len + 1);
1124 memcpy(lastdir, thisname, len);
1125 lastdir[len] = '\0';
1129 basename = thisname;
1130 basename_len = strlen(basename) + 1; /* count the '\0' */
1132 #ifdef SUPPORT_LINKS
1133 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1138 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1139 extra_len += EXTRA_LEN;
1141 #if EXTRA_ROUNDING > 0
1142 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1143 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1146 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1149 bp = pool_alloc(pool, alloc_len, "make_file");
1151 if (!(bp = new_array(char, alloc_len)))
1152 out_of_memory("make_file");
1155 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1157 file = (struct file_struct *)bp;
1158 bp += FILE_STRUCT_LEN;
1160 memcpy(bp, basename, basename_len);
1161 bp += basename_len + linkname_len; /* skip space for symlink too */
1163 #ifdef SUPPORT_HARD_LINKS
1164 if (preserve_hard_links && flist && flist->prev) {
1165 if (protocol_version >= 28
1166 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1167 : S_ISREG(st.st_mode)) {
1168 tmp_dev = st.st_dev;
1169 tmp_ino = st.st_ino;
1175 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1176 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1177 tmp_rdev = st.st_rdev;
1182 file->flags = flags;
1183 file->modtime = st.st_mtime;
1184 file->len32 = (uint32)st.st_size;
1185 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1186 file->flags |= FLAG_LENGTH64;
1187 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1189 file->mode = st.st_mode;
1191 F_OWNER(file) = st.st_uid;
1193 F_GROUP(file) = st.st_gid;
1195 if (basename != thisname)
1196 file->dirname = lastdir;
1198 #ifdef SUPPORT_LINKS
1200 bp = (char*)file->basename + basename_len;
1201 memcpy(bp, linkname, linkname_len);
1205 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1206 file_checksum(thisname, tmp_sum, st.st_size);
1208 F_PATHNAME(file) = pathname;
1210 /* This code is only used by the receiver when it is building
1211 * a list of files for a delete pass. */
1212 if (keep_dirlinks && linkname_len && flist) {
1214 int save_mode = file->mode;
1215 file->mode = S_IFDIR; /* Find a directory with our name. */
1216 if (flist_find(dir_flist, file) >= 0
1217 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1218 file->modtime = st2.st_mtime;
1220 file->mode = st2.st_mode;
1222 F_OWNER(file) = st2.st_uid;
1224 F_GROUP(file) = st2.st_gid;
1226 file->mode = save_mode;
1229 if (basename_len == 0+1)
1234 F_NDX(file) = dir_count - 1;
1240 /* Only called for temporary file_struct entries created by make_file(). */
1241 void unmake_file(struct file_struct *file)
1243 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1244 #if EXTRA_ROUNDING > 0
1245 if (extra_cnt & EXTRA_ROUNDING)
1246 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1248 free(REQ_EXTRA(file, extra_cnt));
1251 static struct file_struct *send_file_name(int f, struct file_list *flist,
1252 char *fname, STRUCT_STAT *stp,
1253 int flags, int filter_level)
1255 struct file_struct *file;
1256 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1260 file = make_file(fname, flist, stp, flags, filter_level);
1264 if (chmod_modes && !S_ISLNK(file->mode))
1265 file->mode = tweak_mode(file->mode, chmod_modes);
1268 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1269 sx.st.st_mode = file->mode;
1270 sx.acc_acl = sx.def_acl = NULL;
1271 if (get_acl(fname, &sx) < 0)
1275 #ifdef SUPPORT_XATTRS
1276 if (preserve_xattrs && f >= 0) {
1278 if (get_xattr(fname, &sx) < 0)
1283 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1285 flist_expand(flist, 1);
1286 flist->files[flist->used++] = file;
1288 send_file_entry(f, file, flist->used - 1);
1290 if (preserve_acls && !S_ISLNK(file->mode)) {
1295 #ifdef SUPPORT_XATTRS
1296 if (preserve_xattrs) {
1297 F_XATTR(file) = send_xattr(&sx, f);
1305 static void send_if_directory(int f, struct file_list *flist,
1306 struct file_struct *file,
1307 char *fbuf, unsigned int ol,
1310 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1312 if (S_ISDIR(file->mode)
1313 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1315 unsigned int len = strlen(fbuf);
1316 if (len > 1 && fbuf[len-1] == '/')
1318 if (len >= MAXPATHLEN - 1) {
1319 io_error |= IOERR_GENERAL;
1320 rprintf(FERROR, "skipping long-named directory: %s\n",
1324 save_filters = push_local_filters(fbuf, len);
1325 send_directory(f, flist, fbuf, len, flags);
1326 pop_local_filters(save_filters);
1333 static int file_compare(const void *file1, const void *file2)
1335 return f_name_cmp(*(struct file_struct **)file1,
1336 *(struct file_struct **)file2);
1339 /* The guts of a merge-sort algorithm. This was derived from the glibc
1340 * version, but I (Wayne) changed the merge code to do less copying and
1341 * to require only half the amount of temporary memory. */
1342 static void fsort_tmp(struct file_struct **fp, size_t num,
1343 struct file_struct **tmp)
1345 struct file_struct **f1, **f2, **t;
1354 fsort_tmp(f1, n1, tmp);
1356 fsort_tmp(f2, n2, tmp);
1358 while (f_name_cmp(*f1, *f2) <= 0) {
1365 memcpy(t, f1, n1 * PTR_SIZE);
1367 *f1++ = *f2++, n2--;
1369 while (n1 > 0 && n2 > 0) {
1370 if (f_name_cmp(*t, *f2) <= 0)
1373 *f1++ = *f2++, n2--;
1377 memcpy(f1, t, n1 * PTR_SIZE);
1380 /* This file-struct sorting routine makes sure that any identical names in
1381 * the file list stay in the same order as they were in the original list.
1382 * This is particularly vital in inc_recurse mode where we expect a sort
1383 * on the flist to match the exact order of a sort on the dir_flist. */
1384 static void fsort(struct file_struct **fp, size_t num)
1390 qsort(fp, num, PTR_SIZE, file_compare);
1392 struct file_struct **tmp = new_array(struct file_struct *,
1394 fsort_tmp(fp, num, tmp);
1399 /* We take an entire set of sibling dirs from the sorted flist and link them
1400 * into the tree, setting the appropriate parent/child/sibling pointers. */
1401 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1406 int32 *parent_dp = parent_ndx < 0 ? NULL
1407 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1409 flist_expand(dir_flist, dir_cnt);
1410 dir_flist->sorted = dir_flist->files;
1412 for (i = 0; dir_cnt; i++) {
1413 struct file_struct *file = from_flist->sorted[i];
1415 if (!S_ISDIR(file->mode))
1418 dir_flist->files[dir_flist->used++] = file;
1421 if (!(file->flags & FLAG_XFER_DIR)
1422 || file->flags & FLAG_MOUNT_DIR)
1426 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1428 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1430 send_dir_ndx = dir_flist->used - 1;
1432 dp = F_DIR_NODE_P(file);
1433 DIR_PARENT(dp) = parent_ndx;
1434 DIR_FIRST_CHILD(dp) = -1;
1437 DIR_NEXT_SIBLING(dp) = -1;
1440 /* This function is normally called by the sender, but the receiving side also
1441 * calls it from get_dirlist() with f set to -1 so that we just construct the
1442 * file list in memory without sending it over the wire. Also, get_dirlist()
1443 * might call this with f set to -2, which also indicates that local filter
1444 * rules should be ignored. */
1445 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1452 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1453 int start = flist->used;
1454 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1456 assert(flist != NULL);
1458 if (!(d = opendir(fbuf))) {
1459 io_error |= IOERR_GENERAL;
1460 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1465 if (len != 1 || *fbuf != '/')
1468 remainder = MAXPATHLEN - (p - fbuf);
1470 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1471 char *dname = d_name(di);
1472 if (dname[0] == '.' && (dname[1] == '\0'
1473 || (dname[1] == '.' && dname[2] == '\0')))
1475 if (strlcpy(p, dname, remainder) >= remainder) {
1476 io_error |= IOERR_GENERAL;
1478 "cannot send long-named file %s\n",
1482 if (dname[0] == '\0') {
1483 io_error |= IOERR_GENERAL;
1485 "cannot send file with empty name in %s\n",
1490 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1496 io_error |= IOERR_GENERAL;
1497 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1502 if (f >= 0 && recurse && !divert_dirs) {
1503 int i, end = flist->used - 1;
1504 /* send_if_directory() bumps flist->used, so use "end". */
1505 for (i = start; i <= end; i++)
1506 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1510 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1512 char fbuf[MAXPATHLEN];
1516 dlen = strlen(fbuf);
1518 if (F_PATHNAME(file) != pathname) {
1519 if (!push_pathname(F_PATHNAME(file), -1))
1520 exit_cleanup(RERR_FILESELECT);
1523 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1525 send_directory(f, flist, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1528 void send_extra_file_list(int f, int at_least)
1530 struct file_list *flist;
1532 int future_cnt, save_io_error = io_error;
1537 /* Keep sending data until we have the requested number of
1538 * files in the upcoming file-lists. */
1539 if (cur_flist->next) {
1540 flist = first_flist->prev; /* the newest flist */
1541 future_cnt = flist->ndx_end - cur_flist->next->ndx_start + 1;
1544 while (future_cnt < at_least) {
1545 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1546 int dir_ndx, dstart = dir_count;
1549 flist = flist_new(0, "send_extra_file_list");
1550 start_write = stats.total_written;
1554 dir_ndx = F_NDX(file);
1557 dir_ndx = send_dir_ndx;
1558 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1559 flist->parent_ndx = dir_ndx;
1561 send1extra(f, file, flist);
1562 dp = F_DIR_NODE_P(file);
1564 /* If there are any duplicate directory names that follow, we
1565 * send all the dirs together in one file-list. The dir_flist
1566 * tree links all the child subdirs onto the last dup dir. */
1567 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1568 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1569 send_dir_ndx = dir_ndx;
1570 file = dir_flist->sorted[dir_ndx];
1571 send1extra(f, file, flist);
1572 dp = F_DIR_NODE_P(file);
1578 if (need_unsorted_flist) {
1579 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1580 out_of_memory("send_extra_file_list");
1581 memcpy(flist->sorted, flist->files,
1582 flist->used * sizeof (struct file_struct*));
1585 flist->sorted = flist->files;
1587 clean_flist(flist, 0);
1589 flist->ndx_end = flist->ndx_start + flist->used - 1
1590 - (dir_count - dstart);
1592 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1593 flist_done_allocating(flist);
1595 file_total += flist->used;
1596 future_cnt += flist->used;
1597 stats.flist_size += stats.total_written - start_write;
1598 stats.num_files += flist->used;
1600 output_flist(flist);
1602 if (DIR_FIRST_CHILD(dp) >= 0) {
1603 send_dir_ndx = DIR_FIRST_CHILD(dp);
1606 while (DIR_NEXT_SIBLING(dp) < 0) {
1607 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1608 write_ndx(f, NDX_FLIST_EOF);
1610 change_local_filter_dir(NULL, 0, 0);
1614 file = dir_flist->sorted[send_dir_ndx];
1615 dp = F_DIR_NODE_P(file);
1617 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1622 if (io_error != save_io_error && !ignore_errors)
1623 send_msg_int(MSG_IO_ERROR, io_error);
1626 struct file_list *send_file_list(int f, int argc, char *argv[])
1628 static const char *lastdir;
1629 static int lastdir_len = -1;
1633 char lastpath[MAXPATHLEN] = "";
1634 struct file_list *flist;
1635 struct timeval start_tv, end_tv;
1638 int flags, disable_buffering;
1640 rprintf(FLOG, "building file list\n");
1641 if (show_filelist_p())
1642 start_filelist_progress("building file list");
1643 else if (inc_recurse && verbose && !am_server)
1644 rprintf(FCLIENT, "sending incremental file list\n");
1646 start_write = stats.total_written;
1647 gettimeofday(&start_tv, NULL);
1649 #ifdef SUPPORT_HARD_LINKS
1650 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1654 flist = cur_flist = flist_new(0, "send_file_list");
1656 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1657 flags = FLAG_DIVERT_DIRS | FLAG_XFER_DIR;
1659 dir_flist = cur_flist;
1660 flags = FLAG_XFER_DIR;
1663 disable_buffering = io_start_buffering_out(f);
1664 if (filesfrom_fd >= 0) {
1665 if (argv[0] && !push_dir(argv[0], 0)) {
1666 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1667 full_fname(argv[0]), curr_dir);
1668 exit_cleanup(RERR_FILESELECT);
1674 char fbuf[MAXPATHLEN];
1679 if (read_filesfrom_line(filesfrom_fd, fbuf) == 0)
1681 sanitize_path(fbuf, fbuf, "", 0, NULL);
1685 strlcpy(fbuf, *argv++, MAXPATHLEN);
1687 sanitize_path(fbuf, fbuf, "", 0, NULL);
1691 if (relative_paths) {
1692 /* We clean up fbuf below. */
1694 } else if (!len || fbuf[len - 1] == '/') {
1695 if (len == 2 && fbuf[0] == '.') {
1696 /* Turn "./" into just "." rather than "./." */
1699 if (len + 1 >= MAXPATHLEN)
1700 overflow_exit("send_file_list");
1705 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1706 && (len == 2 || fbuf[len-3] == '/')) {
1707 if (len + 2 >= MAXPATHLEN)
1708 overflow_exit("send_file_list");
1714 is_dot_dir = fbuf[len-1] == '.'
1715 && (len == 1 || fbuf[len-2] == '/');
1720 if (!relative_paths) {
1721 p = strrchr(fbuf, '/');
1728 len -= p - fbuf + 1;
1733 if ((p = strstr(fbuf, "/./")) != NULL) {
1739 len -= p - fbuf + 3;
1743 /* Get rid of trailing "/" and "/.". */
1745 if (fn[len - 1] == '/') {
1747 if (!--len && !dir) {
1752 else if (len >= 2 && fn[len - 1] == '.'
1753 && fn[len - 2] == '/') {
1755 if (!(len -= 2) && !dir) {
1762 if (len == 1 && fn[0] == '/')
1765 /* Reject a ".." dir in the active part of the path. */
1766 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1767 if ((p[2] == '/' || p[2] == '\0')
1768 && (p == fn || p[-1] == '/')) {
1770 "found \"..\" dir in relative path: %s\n",
1772 exit_cleanup(RERR_SYNTAX);
1782 dirlen = dir ? strlen(dir) : 0;
1783 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1784 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1787 lastdir_len = pathname_len;
1788 } else if (!push_pathname(lastdir, lastdir_len)) {
1790 io_error |= IOERR_GENERAL;
1791 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1792 full_fname(dir), curr_dir);
1797 memmove(fbuf, fn, len + 1);
1799 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1800 io_error |= IOERR_GENERAL;
1801 rsyserr(FERROR, errno, "link_stat %s failed",
1806 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1807 rprintf(FINFO, "skipping directory %s\n", fbuf);
1811 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1812 /* Send the implied directories at the start of the
1813 * source spec, so we get their permissions right. */
1814 char *lp = lastpath, *slash = fbuf;
1816 /* Skip any initial directories in our path that we
1817 * have in common with lastpath. */
1818 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1823 if (fn != p || (*lp && *lp != '/')) {
1824 int save_copy_links = copy_links;
1825 int save_xfer_dirs = xfer_dirs;
1826 int dir_flags = flags & ~FLAG_XFER_DIR;
1827 copy_links |= copy_unsafe_links;
1829 while ((slash = strchr(slash+1, '/')) != 0) {
1831 send_file_name(f, flist, fbuf, NULL,
1832 dir_flags, ALL_FILTERS);
1835 copy_links = save_copy_links;
1836 xfer_dirs = save_xfer_dirs;
1838 strlcpy(lastpath, fbuf, sizeof lastpath);
1843 if (one_file_system)
1844 filesystem_dev = st.st_dev;
1846 if (recurse || (xfer_dirs && is_dot_dir)) {
1847 struct file_struct *file;
1848 int top_flags = FLAG_TOP_DIR | flags;
1849 file = send_file_name(f, flist, fbuf, &st,
1850 top_flags, ALL_FILTERS);
1851 if (file && !inc_recurse)
1852 send_if_directory(f, flist, file, fbuf, len, flags);
1854 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1857 gettimeofday(&end_tv, NULL);
1858 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1859 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1860 if (stats.flist_buildtime == 0)
1861 stats.flist_buildtime = 1;
1864 write_byte(f, 0); /* Indicate end of file list */
1866 #ifdef SUPPORT_HARD_LINKS
1867 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1871 if (show_filelist_p())
1872 finish_filelist_progress(flist);
1874 gettimeofday(&end_tv, NULL);
1875 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1876 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1878 /* When converting names, both sides keep an unsorted file-list array
1879 * because the names will differ on the sending and receiving sides
1880 * (both sides will use the unsorted index number for each item). */
1882 /* Sort the list without removing any duplicates. This allows the
1883 * receiving side to ask for whatever name it kept. For incremental
1884 * recursion mode, the sender marks duplicate dirs so that it can
1885 * send them together in a single file-list. */
1887 if (need_unsorted_flist) {
1889 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1890 out_of_memory("send_file_list");
1891 memcpy(flist->sorted, flist->files,
1892 flist->used * sizeof (struct file_struct*));
1893 clean_flist(flist, 0);
1895 flist->sorted = flist->files;
1897 flist->high = flist->used - 1;
1902 flist->sorted = flist->files;
1903 clean_flist(flist, 0);
1905 file_total += flist->used;
1907 /* We don't subtract dir_count for the first send since we
1908 * might have one or more dot dirs which need to get sent. */
1909 flist->ndx_end = flist->ndx_start + flist->used - 1;
1911 if (!numeric_ids && !inc_recurse)
1914 /* send the io_error flag */
1915 if (protocol_version < 30)
1916 write_int(f, ignore_errors ? 0 : io_error);
1917 else if (io_error && !ignore_errors)
1918 send_msg_int(MSG_IO_ERROR, io_error);
1920 if (disable_buffering)
1921 io_end_buffering_out();
1923 stats.flist_size = stats.total_written - start_write;
1924 stats.num_files = flist->used;
1927 output_flist(flist);
1930 rprintf(FINFO, "send_file_list done\n");
1933 add_dirs_to_tree(-1, flist, dir_count);
1934 flist_done_allocating(flist);
1935 if (send_dir_ndx < 0) {
1936 write_ndx(f, NDX_FLIST_EOF);
1939 else if (file_total == 1) {
1940 /* If we're creating incremental file-lists and there
1941 * was just 1 item in the first file-list, send 1 more
1942 * file-list to check if this is a 1-file xfer. */
1943 send_extra_file_list(f, 1);
1950 struct file_list *recv_file_list(int f)
1952 struct file_list *flist;
1957 rprintf(FLOG, "receiving file list\n");
1958 if (show_filelist_p())
1959 start_filelist_progress("receiving file list");
1960 else if (inc_recurse && verbose && !am_server && !first_flist)
1961 rprintf(FCLIENT, "receiving incremental file list\n");
1963 start_read = stats.total_read;
1965 flist = flist_new(0, "recv_file_list");
1967 #ifdef SUPPORT_HARD_LINKS
1968 if (preserve_hard_links && protocol_version < 30)
1973 if (flist->ndx_start == 0)
1974 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1975 dstart = dir_flist->used;
1981 while ((flags = read_byte(f)) != 0) {
1982 struct file_struct *file;
1984 flist_expand(flist, 1);
1986 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1987 flags |= read_byte(f) << 8;
1988 file = recv_file_entry(flist, flags, f);
1990 if (inc_recurse && S_ISDIR(file->mode)) {
1991 flist_expand(dir_flist, 1);
1992 dir_flist->files[dir_flist->used++] = file;
1995 flist->files[flist->used++] = file;
1997 maybe_emit_filelist_progress(flist->used);
2000 rprintf(FINFO, "recv_file_name(%s)\n",
2001 f_name(file, NULL));
2004 file_total += flist->used;
2006 flist->ndx_end = flist->ndx_start + flist->used - 1;
2007 if (inc_recurse && flist->ndx_start)
2008 flist->ndx_end -= dir_flist->used - dstart;
2011 rprintf(FINFO, "received %d names\n", flist->used);
2013 if (show_filelist_p())
2014 finish_filelist_progress(flist);
2017 if (need_unsorted_flist) {
2018 /* Create an extra array of index pointers that we can sort for
2019 * the generator's use (for wading through the files in sorted
2020 * order and for calling flist_find()). We keep the "files"
2021 * list unsorted for our exchange of index numbers with the
2022 * other side (since their names may not sort the same). */
2023 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2024 out_of_memory("recv_file_list");
2025 memcpy(flist->sorted, flist->files,
2026 flist->used * sizeof (struct file_struct*));
2027 if (inc_recurse && dir_flist->used > dstart) {
2028 dir_flist->sorted = realloc_array(dir_flist->sorted,
2029 struct file_struct *,
2031 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2032 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2033 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2038 flist->sorted = flist->files;
2039 if (inc_recurse && dir_flist->used > dstart) {
2040 dir_flist->sorted = dir_flist->files;
2041 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2046 flist_done_allocating(flist);
2048 recv_id_list(f, flist);
2050 clean_flist(flist, relative_paths);
2052 if (protocol_version < 30) {
2053 /* Recv the io_error flag */
2057 io_error |= read_int(f);
2061 output_flist(flist);
2065 for (i = flist->low; i <= flist->high; i++)
2066 list_file_entry(flist->files[i]);
2070 rprintf(FINFO, "recv_file_list done\n");
2072 stats.flist_size += stats.total_read - start_read;
2073 stats.num_files += flist->used;
2078 /* This is only used once by the receiver if the very first file-list
2079 * has exactly one item in it. */
2080 void recv_additional_file_list(int f)
2082 struct file_list *flist;
2083 int ndx = read_ndx(f);
2084 if (ndx == NDX_FLIST_EOF) {
2086 change_local_filter_dir(NULL, 0, 0);
2088 ndx = NDX_FLIST_OFFSET - ndx;
2089 if (ndx < 0 || ndx >= dir_flist->used) {
2090 ndx = NDX_FLIST_OFFSET - ndx;
2092 "[%s] Invalid dir index: %d (%d - %d)\n",
2093 who_am_i(), ndx, NDX_FLIST_OFFSET,
2094 NDX_FLIST_OFFSET - dir_flist->used + 1);
2095 exit_cleanup(RERR_PROTOCOL);
2098 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2101 flist = recv_file_list(f);
2102 flist->parent_ndx = ndx;
2106 /* Search for an identically-named item in the file list. Note that the
2107 * items must agree in their directory-ness, or no match is returned. */
2108 int flist_find(struct file_list *flist, struct file_struct *f)
2110 int low = flist->low, high = flist->high;
2111 int diff, mid, mid_up;
2113 while (low <= high) {
2114 mid = (low + high) / 2;
2115 if (F_IS_ACTIVE(flist->sorted[mid]))
2118 /* Scan for the next non-empty entry using the cached
2119 * distance values. If the value isn't fully up-to-
2120 * date, update it. */
2121 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2122 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2124 mid_up += F_DEPTH(flist->sorted[mid_up]);
2125 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2126 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2128 if (mid_up > high) {
2129 /* If there's nothing left above us, set high to
2130 * a non-empty entry below us and continue. */
2131 high = mid - (int)flist->sorted[mid]->len32;
2132 if (!F_IS_ACTIVE(flist->sorted[high])) {
2134 high -= (int)flist->sorted[high]->len32;
2135 } while (!F_IS_ACTIVE(flist->sorted[high]));
2136 flist->sorted[mid]->len32 = mid - high;
2141 diff = f_name_cmp(flist->sorted[mid_up], f);
2143 if (protocol_version < 29
2144 && S_ISDIR(flist->sorted[mid_up]->mode)
2145 != S_ISDIR(f->mode))
2158 * Free up any resources a file_struct has allocated
2159 * and clear the file.
2161 void clear_file(struct file_struct *file)
2163 /* The +1 zeros out the first char of the basename. */
2164 memset(file, 0, FILE_STRUCT_LEN + 1);
2165 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2166 * entry. Likewise for len32 in the opposite direction. We assume
2167 * that we're alone for now since flist_find() will adjust the counts
2168 * it runs into that aren't up-to-date. */
2169 file->len32 = F_DEPTH(file) = 1;
2172 /* Allocate a new file list. */
2173 struct file_list *flist_new(int flags, char *msg)
2175 struct file_list *flist;
2177 flist = new(struct file_list);
2181 memset(flist, 0, sizeof flist[0]);
2183 if (flags & FLIST_TEMP) {
2184 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2185 out_of_memory, POOL_INTERN)))
2188 /* This is a doubly linked list with prev looping back to
2189 * the end of the list, but the last next pointer is NULL. */
2191 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2192 out_of_memory, POOL_INTERN);
2193 if (!flist->file_pool)
2196 first_flist = cur_flist = flist->prev = flist;
2198 flist->file_pool = first_flist->file_pool;
2200 flist->ndx_start = first_flist->prev->ndx_end + 2;
2202 flist->prev = first_flist->prev;
2203 flist->prev->next = first_flist->prev = flist;
2205 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2212 /* Free up all elements in a flist. */
2213 void flist_free(struct file_list *flist)
2216 /* Was FLIST_TEMP dir-list. */
2217 } else if (flist == flist->prev) {
2218 first_flist = cur_flist = NULL;
2222 if (flist == cur_flist)
2223 cur_flist = flist->next;
2224 if (flist == first_flist)
2225 first_flist = first_flist->next;
2227 flist->prev->next = flist->next;
2229 flist->next = first_flist;
2231 flist->next->prev = flist->prev;
2232 file_total -= flist->used;
2236 if (!flist->prev || !flist_cnt)
2237 pool_destroy(flist->file_pool);
2239 pool_free_old(flist->file_pool, flist->pool_boundary);
2241 if (flist->sorted && flist->sorted != flist->files)
2242 free(flist->sorted);
2247 /* This routine ensures we don't have any duplicate names in our file list.
2248 * duplicate names can cause corruption because of the pipelining. */
2249 static void clean_flist(struct file_list *flist, int strip_root)
2251 char fbuf[MAXPATHLEN];
2256 if (flist->used == 0) {
2262 fsort(flist->sorted, flist->used);
2264 if (!am_sender || inc_recurse) {
2265 for (i = prev_i = 0; i < flist->used; i++) {
2266 if (F_IS_ACTIVE(flist->sorted[i])) {
2271 flist->low = prev_i;
2273 i = prev_i = flist->used - 1;
2277 while (++i < flist->used) {
2279 struct file_struct *file = flist->sorted[i];
2281 if (!F_IS_ACTIVE(file))
2283 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2285 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2286 int save_mode = file->mode;
2287 /* Make sure that this directory doesn't duplicate a
2288 * non-directory earlier in the list. */
2289 flist->high = prev_i;
2290 file->mode = S_IFREG;
2291 j = flist_find(flist, file);
2292 file->mode = save_mode;
2297 /* If one is a dir and the other is not, we want to
2298 * keep the dir because it might have contents in the
2300 if (S_ISDIR(file->mode)) {
2301 struct file_struct *fp = flist->sorted[j];
2302 if (!S_ISDIR(fp->mode))
2310 flist->sorted[drop]->flags |= FLAG_DUPLICATE;
2314 "removing duplicate name %s from file list (%d)\n",
2315 f_name(file, fbuf), drop + flist->ndx_start);
2317 /* Make sure we don't lose track of a user-specified
2319 flist->sorted[keep]->flags |= flist->sorted[drop]->flags
2320 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2322 clear_file(flist->sorted[drop]);
2326 if (flist->low == drop) {
2328 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2337 flist->high = prev_i;
2340 /* We need to strip off the leading slashes for relative
2341 * paths, but this must be done _after_ the sorting phase. */
2342 for (i = flist->low; i <= flist->high; i++) {
2343 struct file_struct *file = flist->sorted[i];
2347 while (*file->dirname == '/')
2349 if (!*file->dirname)
2350 file->dirname = NULL;
2354 if (prune_empty_dirs && !am_sender) {
2355 int j, prev_depth = 0;
2357 prev_i = 0; /* It's OK that this isn't really true. */
2359 for (i = flist->low; i <= flist->high; i++) {
2360 struct file_struct *fp, *file = flist->sorted[i];
2362 /* This temporarily abuses the F_DEPTH() value for a
2363 * directory that is in a chain that might get pruned.
2364 * We restore the old value if it gets a reprieve. */
2365 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2366 /* Dump empty dirs when coming back down. */
2367 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2368 fp = flist->sorted[prev_i];
2369 if (F_DEPTH(fp) >= 0)
2371 prev_i = -F_DEPTH(fp)-1;
2374 prev_depth = F_DEPTH(file);
2375 if (is_excluded(f_name(file, fbuf), 1,
2377 /* Keep dirs through this dir. */
2378 for (j = prev_depth-1; ; j--) {
2379 fp = flist->sorted[prev_i];
2380 if (F_DEPTH(fp) >= 0)
2382 prev_i = -F_DEPTH(fp)-1;
2386 F_DEPTH(file) = -prev_i-1;
2389 /* Keep dirs through this non-dir. */
2390 for (j = prev_depth; ; j--) {
2391 fp = flist->sorted[prev_i];
2392 if (F_DEPTH(fp) >= 0)
2394 prev_i = -F_DEPTH(fp)-1;
2399 /* Dump all remaining empty dirs. */
2401 struct file_struct *fp = flist->sorted[prev_i];
2402 if (F_DEPTH(fp) >= 0)
2404 prev_i = -F_DEPTH(fp)-1;
2408 for (i = flist->low; i <= flist->high; i++) {
2409 if (F_IS_ACTIVE(flist->sorted[i]))
2413 for (i = flist->high; i >= flist->low; i--) {
2414 if (F_IS_ACTIVE(flist->sorted[i]))
2421 static void output_flist(struct file_list *flist)
2423 char uidbuf[16], gidbuf[16], depthbuf[16];
2424 struct file_struct *file;
2425 const char *root, *dir, *slash, *name, *trail;
2426 const char *who = who_am_i();
2429 rprintf(FINFO, "[%s] flist start=%d, end=%d, used=%d, low=%d, high=%d\n",
2430 who, flist->ndx_start, flist->ndx_end, flist->used, flist->low, flist->high);
2431 for (i = 0; i < flist->used; i++) {
2432 file = flist->sorted[i];
2433 if ((am_root || am_sender) && uid_ndx) {
2434 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2439 static char parens[] = "(\0)\0\0\0";
2440 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2441 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2442 pp, F_GROUP(file), pp + 2);
2446 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2447 if (F_IS_ACTIVE(file)) {
2448 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2449 if ((dir = file->dirname) == NULL)
2453 name = file->basename;
2454 trail = S_ISDIR(file->mode) ? "/" : "";
2456 root = dir = slash = name = trail = "";
2458 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2459 who, i + flist->ndx_start,
2460 root, dir, slash, name, trail,
2461 (int)file->mode, (double)F_LENGTH(file),
2462 uidbuf, gidbuf, file->flags);
2466 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2467 enum fnc_type { t_PATH, t_ITEM };
2469 static int found_prefix;
2471 /* Compare the names of two file_struct entities, similar to how strcmp()
2472 * would do if it were operating on the joined strings.
2474 * Some differences beginning with protocol_version 29: (1) directory names
2475 * are compared with an assumed trailing slash so that they compare in a
2476 * way that would cause them to sort immediately prior to any content they
2477 * may have; (2) a directory of any name compares after a non-directory of
2478 * any name at the same depth; (3) a directory with name "." compares prior
2479 * to anything else. These changes mean that a directory and a non-dir
2480 * with the same name will not compare as equal (protocol_version >= 29).
2482 * The dirname component can be an empty string, but the basename component
2483 * cannot (and never is in the current codebase). The basename component
2484 * may be NULL (for a removed item), in which case it is considered to be
2485 * after any existing item. */
2486 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2489 const uchar *c1, *c2;
2490 enum fnc_state state1, state2;
2491 enum fnc_type type1, type2;
2492 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2494 if (!f1 || !F_IS_ACTIVE(f1)) {
2495 if (!f2 || !F_IS_ACTIVE(f2))
2499 if (!f2 || !F_IS_ACTIVE(f2))
2502 c1 = (uchar*)f1->dirname;
2503 c2 = (uchar*)f2->dirname;
2507 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2508 c1 = (const uchar*)f1->basename;
2509 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2511 state1 = s_TRAILING;
2520 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2521 c2 = (const uchar*)f2->basename;
2522 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2524 state2 = s_TRAILING;
2534 return type1 == t_PATH ? 1 : -1;
2544 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2545 c1 = (const uchar*)f1->basename;
2546 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2548 state1 = s_TRAILING;
2554 state1 = s_TRAILING;
2555 if (type1 == t_PATH) {
2564 if (*c2 && type1 != type2)
2565 return type1 == t_PATH ? 1 : -1;
2574 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2575 c2 = (const uchar*)f2->basename;
2576 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2578 state2 = s_TRAILING;
2584 state2 = s_TRAILING;
2585 if (type2 == t_PATH) {
2598 return type1 == t_PATH ? 1 : -1;
2600 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2605 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2606 * not match if f2's basename is not an exact match of a path element in f1.
2607 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2608 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2612 return found_prefix;
2615 char *f_name_buf(void)
2617 static char names[5][MAXPATHLEN];
2618 static unsigned int n;
2620 n = (n + 1) % (sizeof names / sizeof names[0]);
2625 /* Return a copy of the full filename of a flist entry, using the indicated
2626 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2627 * done because we checked the size when creating the file_struct entry.
2629 char *f_name(const struct file_struct *f, char *fbuf)
2631 if (!f || !F_IS_ACTIVE(f))
2635 fbuf = f_name_buf();
2638 int len = strlen(f->dirname);
2639 memcpy(fbuf, f->dirname, len);
2641 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2643 strlcpy(fbuf, f->basename, MAXPATHLEN);
2648 /* Do a non-recursive scan of the named directory, possibly ignoring all
2649 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2650 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2651 * buffer (the functions we call will append names onto the end, but the old
2652 * dir value will be restored on exit). */
2653 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2655 struct file_list *dirlist;
2656 char dirbuf[MAXPATHLEN];
2657 int save_recurse = recurse;
2658 int save_xfer_dirs = xfer_dirs;
2659 int save_prune_empty_dirs = prune_empty_dirs;
2662 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2663 if (dlen >= MAXPATHLEN)
2668 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2672 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2673 xfer_dirs = save_xfer_dirs;
2674 recurse = save_recurse;
2676 flist_count_offset += dirlist->used;
2678 prune_empty_dirs = 0;
2679 dirlist->sorted = dirlist->files;
2680 clean_flist(dirlist, 0);
2681 prune_empty_dirs = save_prune_empty_dirs;
2684 output_flist(dirlist);