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;
118 static int high_hlink_ndx;
120 static void clean_flist(struct file_list *flist, int strip_root);
121 static void output_flist(struct file_list *flist);
123 void init_flist(void)
126 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
127 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
129 checksum_len = protocol_version < 21 ? 2
130 : protocol_version < 30 ? MD4_DIGEST_LEN
134 static int show_filelist_p(void)
136 return verbose && xfer_dirs && !am_server && !inc_recurse;
139 static void start_filelist_progress(char *kind)
141 rprintf(FCLIENT, "%s ... ", kind);
142 if (verbose > 1 || do_progress)
143 rprintf(FCLIENT, "\n");
147 static void emit_filelist_progress(int count)
149 rprintf(FCLIENT, " %d files...\r", count);
152 static void maybe_emit_filelist_progress(int count)
154 if (do_progress && show_filelist_p() && (count % 100) == 0)
155 emit_filelist_progress(count);
158 static void finish_filelist_progress(const struct file_list *flist)
161 /* This overwrites the progress line */
162 rprintf(FINFO, "%d file%sto consider\n",
163 flist->used, flist->used == 1 ? " " : "s ");
165 rprintf(FINFO, "done\n");
168 void show_flist_stats(void)
173 static void list_file_entry(struct file_struct *f)
175 char permbuf[PERMSTRING_SIZE];
178 if (!F_IS_ACTIVE(f)) {
179 /* this can happen if duplicate names were removed */
183 permstring(permbuf, f->mode);
186 /* TODO: indicate '+' if the entry has an ACL. */
189 if (preserve_links && S_ISLNK(f->mode)) {
190 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
191 permbuf, len, timestring(f->modtime),
192 f_name(f, NULL), F_SYMLINK(f));
196 rprintf(FINFO, "%s %11.0f %s %s\n",
197 permbuf, len, timestring(f->modtime),
202 /* Stat either a symlink or its referent, depending on the settings of
203 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
205 * If path is the name of a symlink, then the linkbuf buffer (which must hold
206 * MAXPATHLEN chars) will be set to the symlink's target string.
208 * The stat structure pointed to by stp will contain information about the
209 * link or the referent as appropriate, if they exist. */
210 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
213 if (link_stat(path, stp, copy_dirlinks) < 0)
215 if (S_ISLNK(stp->st_mode)) {
216 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
219 linkbuf[llen] = '\0';
220 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
222 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
225 return x_stat(path, stp, NULL);
230 return x_stat(path, stp, NULL);
234 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
238 return x_stat(path, stp, NULL);
239 if (x_lstat(path, stp, NULL) < 0)
241 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
243 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
248 return x_stat(path, stp, NULL);
252 /* This function is used to check if a file should be included/excluded
253 * from the list of files based on its name and type etc. The value of
254 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
255 static int is_excluded(char *fname, int is_dir, int filter_level)
257 #if 0 /* This currently never happens, so avoid a useless compare. */
258 if (filter_level == NO_FILTERS)
262 /* never exclude '.', even if somebody does --exclude '*' */
263 if (fname[0] == '.' && !fname[1])
265 /* Handle the -R version of the '.' dir. */
266 if (fname[0] == '/') {
267 int len = strlen(fname);
268 if (fname[len-1] == '.' && fname[len-2] == '/')
272 if (server_filter_list.head
273 && check_filter(&server_filter_list, fname, is_dir) < 0)
275 if (filter_level != ALL_FILTERS)
278 && check_filter(&filter_list, fname, is_dir) < 0)
283 static void send_directory(int f, struct file_list *flist,
284 char *fbuf, int len, int flags);
286 static const char *pathname, *orig_dir;
287 static int pathname_len;
290 /* Make sure flist can hold at least flist->used + extra entries. */
291 static void flist_expand(struct file_list *flist, int extra)
293 struct file_struct **new_ptr;
295 if (flist->used + extra <= flist->malloced)
298 if (flist->malloced < FLIST_START)
299 flist->malloced = FLIST_START;
300 else if (flist->malloced >= FLIST_LINEAR)
301 flist->malloced += FLIST_LINEAR;
303 flist->malloced *= 2;
305 /* In case count jumped or we are starting the list
306 * with a known size just set it. */
307 if (flist->malloced < flist->used + extra)
308 flist->malloced = flist->used + extra;
310 new_ptr = realloc_array(flist->files, struct file_struct *,
313 if (verbose >= 2 && flist->malloced != FLIST_START) {
314 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
316 (double)sizeof flist->files[0] * flist->malloced,
317 (new_ptr == flist->files) ? " not" : "");
320 flist->files = new_ptr;
323 out_of_memory("flist_expand");
326 static void flist_done_allocating(struct file_list *flist)
328 void *ptr = pool_boundary(flist->file_pool, 8*1024);
329 if (flist->pool_boundary == ptr)
330 flist->pool_boundary = NULL; /* list didn't use any pool memory */
332 flist->pool_boundary = ptr;
335 int push_pathname(const char *dir, int len)
341 orig_dir = strdup(curr_dir);
343 if (pathname && !pop_dir(orig_dir)) {
344 rsyserr(FERROR, errno, "pop_dir %s failed",
345 full_fname(orig_dir));
346 exit_cleanup(RERR_FILESELECT);
349 if (dir && !push_dir(dir, 0)) {
350 io_error |= IOERR_GENERAL;
351 rsyserr(FERROR, errno, "push_dir %s failed in %s",
352 full_fname(dir), curr_dir);
357 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
362 static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
364 static time_t modtime;
368 static uint32 rdev_major;
371 static char *user_name, *group_name;
372 static char lastname[MAXPATHLEN];
373 char fname[MAXPATHLEN];
374 int first_hlink_ndx = -1;
379 if (ic_send != (iconv_t)-1) {
380 ICONV_CONST char *ibuf;
382 size_t ocnt = MAXPATHLEN, icnt;
384 iconv(ic_send, NULL,0, NULL,0);
385 if ((ibuf = (ICONV_CONST char *)file->dirname) != NULL) {
387 ocnt--; /* pre-subtract the space for the '/' */
388 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1)
393 ibuf = (ICONV_CONST char *)file->basename;
395 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
397 io_error |= IOERR_GENERAL;
399 "[%s] cannot convert filename: %s (%s)\n",
400 who_am_i(), f_name(file, fname), strerror(errno));
408 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
410 if (file->mode == mode)
411 xflags |= XMIT_SAME_MODE;
415 if (protocol_version >= 30 && S_ISDIR(mode) && !(file->flags & FLAG_XFER_DIR))
416 xflags |= XMIT_NON_XFER_DIR;
418 if ((preserve_devices && IS_DEVICE(mode))
419 || (preserve_specials && IS_SPECIAL(mode))) {
420 if (protocol_version < 28) {
421 if (tmp_rdev == rdev)
422 xflags |= XMIT_SAME_RDEV_pre28;
427 if ((uint32)major(rdev) == rdev_major)
428 xflags |= XMIT_SAME_RDEV_MAJOR;
430 rdev_major = major(rdev);
431 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
432 xflags |= XMIT_RDEV_MINOR_8_pre30;
434 } else if (protocol_version < 28)
435 rdev = MAKEDEV(0, 0);
437 if ((uid_t)F_OWNER(file) == uid && *lastname)
438 xflags |= XMIT_SAME_UID;
441 if (uid_ndx && !numeric_ids) {
442 user_name = add_uid(uid);
443 if (inc_recurse && user_name)
444 xflags |= XMIT_USER_NAME_FOLLOWS;
449 if ((gid_t)F_GROUP(file) == gid && *lastname)
450 xflags |= XMIT_SAME_GID;
453 if (gid_ndx && !numeric_ids) {
454 group_name = add_gid(gid);
455 if (inc_recurse && group_name)
456 xflags |= XMIT_GROUP_NAME_FOLLOWS;
460 if (file->modtime == modtime)
461 xflags |= XMIT_SAME_TIME;
463 modtime = file->modtime;
465 #ifdef SUPPORT_HARD_LINKS
467 if (protocol_version >= 30) {
468 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
469 first_hlink_ndx = (int32)(long)np->data - 1;
470 if (first_hlink_ndx < 0) {
471 high_hlink_ndx = ndx + first_ndx;
472 np->data = (void*)(long)(high_hlink_ndx + 1);
473 xflags |= XMIT_HLINK_FIRST;
475 xflags |= XMIT_HLINKED;
477 if (tmp_dev == dev) {
478 if (protocol_version >= 28)
479 xflags |= XMIT_SAME_DEV_pre30;
482 xflags |= XMIT_HLINKED;
488 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
490 l2 = strlen(fname+l1);
493 xflags |= XMIT_SAME_NAME;
495 xflags |= XMIT_LONG_NAME;
497 /* We must make sure we don't send a zero flag byte or the
498 * other end will terminate the flist transfer. Note that
499 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
500 * it's harmless way to add a bit to the first flag byte. */
501 if (protocol_version >= 28) {
502 if (!xflags && !S_ISDIR(mode))
503 xflags |= XMIT_TOP_DIR;
504 if ((xflags & 0xFF00) || !xflags) {
505 xflags |= XMIT_EXTENDED_FLAGS;
506 write_shortint(f, xflags);
508 write_byte(f, xflags);
510 if (!(xflags & 0xFF))
511 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
512 write_byte(f, xflags);
514 if (xflags & XMIT_SAME_NAME)
516 if (xflags & XMIT_LONG_NAME)
517 write_varint30(f, l2);
520 write_buf(f, fname + l1, l2);
522 if (first_hlink_ndx >= 0) {
523 write_varint(f, first_hlink_ndx);
524 if (first_hlink_ndx >= first_ndx)
528 write_varlong30(f, F_LENGTH(file), 3);
529 if (!(xflags & XMIT_SAME_TIME)) {
530 if (protocol_version >= 30)
531 write_varlong(f, modtime, 4);
533 write_int(f, modtime);
535 if (!(xflags & XMIT_SAME_MODE))
536 write_int(f, to_wire_mode(mode));
537 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
538 if (protocol_version < 30)
541 write_varint(f, uid);
542 if (xflags & XMIT_USER_NAME_FOLLOWS) {
543 int len = strlen(user_name);
545 write_buf(f, user_name, len);
549 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
550 if (protocol_version < 30)
553 write_varint(f, gid);
554 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
555 int len = strlen(group_name);
557 write_buf(f, group_name, len);
561 if ((preserve_devices && IS_DEVICE(mode))
562 || (preserve_specials && IS_SPECIAL(mode))) {
563 if (protocol_version < 28) {
564 if (!(xflags & XMIT_SAME_RDEV_pre28))
565 write_int(f, (int)rdev);
567 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
568 write_varint30(f, major(rdev));
569 if (protocol_version >= 30)
570 write_varint(f, minor(rdev));
571 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
572 write_byte(f, minor(rdev));
574 write_int(f, minor(rdev));
579 if (preserve_links && S_ISLNK(mode)) {
580 const char *sl = F_SYMLINK(file);
581 int len = strlen(sl);
582 write_varint30(f, len);
583 write_buf(f, sl, len);
587 #ifdef SUPPORT_HARD_LINKS
588 if (tmp_dev != 0 && protocol_version < 30) {
589 if (protocol_version < 26) {
590 /* 32-bit dev_t and ino_t */
591 write_int(f, (int32)dev);
592 write_int(f, (int32)tmp_ino);
594 /* 64-bit dev_t and ino_t */
595 if (!(xflags & XMIT_SAME_DEV_pre30))
596 write_longint(f, dev);
597 write_longint(f, tmp_ino);
602 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
607 /* Prior to 28, we sent a useless set of nulls. */
610 write_buf(f, sum, checksum_len);
614 strlcpy(lastname, fname, MAXPATHLEN);
616 if (S_ISREG(mode) || S_ISLNK(mode))
617 stats.total_size += F_LENGTH(file);
620 static struct file_struct *recv_file_entry(struct file_list *flist,
623 static int64 modtime;
627 static uint32 rdev_major;
630 static uint16 gid_flags;
631 static char lastname[MAXPATHLEN], *lastdir;
632 static int lastdir_depth, lastdir_len = -1;
633 static unsigned int del_hier_name_len = 0;
634 static int in_del_hier = 0;
635 char thisname[MAXPATHLEN];
636 unsigned int l1 = 0, l2 = 0;
637 int alloc_len, basename_len, linkname_len;
638 int extra_len = file_extra_cnt * EXTRA_LEN;
639 int first_hlink_ndx = -1;
641 const char *basename;
642 struct file_struct *file;
646 if (xflags & XMIT_SAME_NAME)
649 if (xflags & XMIT_LONG_NAME)
650 l2 = read_varint30(f);
654 if (l2 >= MAXPATHLEN - l1) {
656 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
657 xflags, l1, l2, lastname, who_am_i());
658 overflow_exit("recv_file_entry");
661 strlcpy(thisname, lastname, l1 + 1);
662 read_sbuf(f, &thisname[l1], l2);
663 thisname[l1 + l2] = 0;
665 /* Abuse basename_len for a moment... */
666 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
669 if (ic_recv != (iconv_t)-1) {
670 char *obuf = thisname;
671 ICONV_CONST char *ibuf = (ICONV_CONST char *)lastname;
672 size_t ocnt = MAXPATHLEN, icnt = basename_len;
674 if (icnt >= MAXPATHLEN) {
679 iconv(ic_recv, NULL,0, NULL,0);
680 if (iconv(ic_recv, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
682 io_error |= IOERR_GENERAL;
684 "[%s] cannot convert filename: %s (%s)\n",
685 who_am_i(), lastname, strerror(errno));
692 clean_fname(thisname, 0);
695 sanitize_path(thisname, thisname, "", 0, NULL);
697 if ((basename = strrchr(thisname, '/')) != NULL) {
698 int len = basename++ - thisname;
699 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
700 lastdir = new_array(char, len + 1);
701 memcpy(lastdir, thisname, len);
704 lastdir_depth = count_dir_elements(lastdir);
708 basename_len = strlen(basename) + 1; /* count the '\0' */
710 #ifdef SUPPORT_HARD_LINKS
711 if (protocol_version >= 30
712 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
713 first_hlink_ndx = read_varint(f);
714 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
716 "hard-link reference out of range: %d (%d)\n",
717 first_hlink_ndx, flist->ndx_start + flist->used);
718 exit_cleanup(RERR_PROTOCOL);
720 if (first_hlink_ndx >= flist->ndx_start) {
721 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
722 file_length = F_LENGTH(first);
723 modtime = first->modtime;
726 uid = F_OWNER(first);
728 gid = F_GROUP(first);
729 if ((preserve_devices && IS_DEVICE(mode))
730 || (preserve_specials && IS_SPECIAL(mode))) {
731 uint32 *devp = F_RDEV_P(first);
732 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
733 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
735 if (preserve_links && S_ISLNK(mode))
736 linkname_len = strlen(F_SYMLINK(first)) + 1;
744 file_length = read_varlong30(f, 3);
745 if (!(xflags & XMIT_SAME_TIME)) {
746 if (protocol_version >= 30) {
747 modtime = read_varlong(f, 4);
748 #if SIZEOF_TIME_T < SIZEOF_INT64
749 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
751 "Time value of %s truncated on receiver.\n",
756 modtime = read_int(f);
758 if (!(xflags & XMIT_SAME_MODE))
759 mode = from_wire_mode(read_int(f));
761 if (chmod_modes && !S_ISLNK(mode))
762 mode = tweak_mode(mode, chmod_modes);
764 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
765 if (protocol_version < 30)
766 uid = (uid_t)read_int(f);
768 uid = (uid_t)read_varint(f);
769 if (xflags & XMIT_USER_NAME_FOLLOWS)
770 uid = recv_user_name(f, uid);
771 else if (inc_recurse && am_root && !numeric_ids)
772 uid = match_uid(uid);
775 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
776 if (protocol_version < 30)
777 gid = (gid_t)read_int(f);
779 gid = (gid_t)read_varint(f);
781 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
782 gid = recv_group_name(f, gid, &gid_flags);
783 else if (inc_recurse && (!am_root || !numeric_ids))
784 gid = match_gid(gid, &gid_flags);
788 if ((preserve_devices && IS_DEVICE(mode))
789 || (preserve_specials && IS_SPECIAL(mode))) {
790 if (protocol_version < 28) {
791 if (!(xflags & XMIT_SAME_RDEV_pre28))
792 rdev = (dev_t)read_int(f);
795 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
796 rdev_major = read_varint30(f);
797 if (protocol_version >= 30)
798 rdev_minor = read_varint(f);
799 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
800 rdev_minor = read_byte(f);
802 rdev_minor = read_int(f);
803 rdev = MAKEDEV(rdev_major, rdev_minor);
805 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
807 } else if (protocol_version < 28)
808 rdev = MAKEDEV(0, 0);
811 if (preserve_links && S_ISLNK(mode)) {
812 linkname_len = read_varint30(f) + 1; /* count the '\0' */
813 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
814 rprintf(FERROR, "overflow: linkname_len=%d\n",
816 overflow_exit("recv_file_entry");
823 #ifdef SUPPORT_HARD_LINKS
825 if (preserve_hard_links) {
826 if (protocol_version < 28 && S_ISREG(mode))
827 xflags |= XMIT_HLINKED;
828 if (xflags & XMIT_HLINKED)
829 extra_len += (inc_recurse+1) * EXTRA_LEN;
834 /* We need one or two index int32s when we're preserving ACLs. */
836 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
839 if (always_checksum && S_ISREG(mode))
840 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
842 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
843 extra_len += EXTRA_LEN;
845 #if EXTRA_ROUNDING > 0
846 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
847 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
850 if (inc_recurse && S_ISDIR(mode)) {
851 if (one_file_system) {
852 /* Room to save the dir's device for -x */
853 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
855 pool = dir_flist->file_pool;
857 pool = flist->file_pool;
859 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
861 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
863 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
865 file = (struct file_struct *)bp;
866 bp += FILE_STRUCT_LEN;
868 memcpy(bp, basename, basename_len);
869 bp += basename_len + linkname_len; /* skip space for symlink too */
871 #ifdef SUPPORT_HARD_LINKS
872 if (xflags & XMIT_HLINKED)
873 file->flags |= FLAG_HLINKED;
875 file->modtime = (time_t)modtime;
876 file->len32 = (uint32)file_length;
877 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
878 file->flags |= FLAG_LENGTH64;
879 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
886 file->flags |= gid_flags;
890 F_NDX(file) = flist->used + flist->ndx_start;
893 if (basename != thisname) {
894 file->dirname = lastdir;
895 F_DEPTH(file) = lastdir_depth + 1;
900 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
902 if (xflags & XMIT_TOP_DIR) {
903 in_del_hier = recurse;
904 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
905 if (relative_paths && del_hier_name_len > 2
906 && lastname[del_hier_name_len-1] == '.'
907 && lastname[del_hier_name_len-2] == '/')
908 del_hier_name_len -= 2;
909 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
910 } else if (protocol_version >= 30) {
911 if (!(xflags & XMIT_NON_XFER_DIR))
912 file->flags |= FLAG_XFER_DIR;
913 } else if (in_del_hier) {
914 if (!relative_paths || !del_hier_name_len
915 || (l1 >= del_hier_name_len
916 && lastname[del_hier_name_len] == '/'))
917 file->flags |= FLAG_XFER_DIR;
923 if ((preserve_devices && IS_DEVICE(mode))
924 || (preserve_specials && IS_SPECIAL(mode))) {
925 uint32 *devp = F_RDEV_P(file);
926 DEV_MAJOR(devp) = major(rdev);
927 DEV_MINOR(devp) = minor(rdev);
932 bp = (char*)file->basename + basename_len;
933 if (first_hlink_ndx >= flist->ndx_start) {
934 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
935 memcpy(bp, F_SYMLINK(first), linkname_len);
937 read_sbuf(f, bp, linkname_len - 1);
939 sanitize_path(bp, bp, "", lastdir_depth, NULL);
943 #ifdef SUPPORT_HARD_LINKS
944 if (preserve_hard_links && xflags & XMIT_HLINKED) {
945 if (protocol_version >= 30) {
946 if (xflags & XMIT_HLINK_FIRST) {
947 high_hlink_ndx = flist->ndx_start + flist->used;
948 F_HL_GNUM(file) = high_hlink_ndx;
950 F_HL_GNUM(file) = first_hlink_ndx;
952 static int32 cnt = 0;
953 struct ht_int64_node *np;
956 if (protocol_version < 26) {
960 if (!(xflags & XMIT_SAME_DEV_pre30))
961 dev = read_longint(f);
962 ino = read_longint(f);
964 np = idev_find(dev, ino);
965 ndx = (int32)(long)np->data - 1;
968 np->data = (void*)(long)cnt;
970 F_HL_GNUM(file) = ndx;
975 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
979 /* Prior to 28, we get a useless set of nulls. */
982 if (first_hlink_ndx >= flist->ndx_start) {
983 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
984 memcpy(bp, F_SUM(first), checksum_len);
986 read_buf(f, bp, checksum_len);
990 if (preserve_acls && !S_ISLNK(mode))
991 receive_acl(file, f);
993 #ifdef SUPPORT_XATTRS
995 receive_xattr(file, f );
998 if (S_ISREG(mode) || S_ISLNK(mode))
999 stats.total_size += file_length;
1004 /* Create a file_struct for a named file by reading its stat() information
1005 * and performing extensive checks against global options.
1007 * Returns a pointer to the new file struct, or NULL if there was an error
1008 * or this file should be excluded. */
1009 struct file_struct *make_file(const char *fname, struct file_list *flist,
1010 STRUCT_STAT *stp, int flags, int filter_level)
1012 static char *lastdir;
1013 static int lastdir_len = -1;
1014 struct file_struct *file;
1015 char thisname[MAXPATHLEN];
1016 char linkname[MAXPATHLEN];
1017 int alloc_len, basename_len, linkname_len;
1018 int extra_len = file_extra_cnt * EXTRA_LEN;
1019 const char *basename;
1024 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1025 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1028 clean_fname(thisname, 0);
1030 sanitize_path(thisname, thisname, "", 0, NULL);
1032 if (stp && S_ISDIR(stp->st_mode)) {
1033 st = *stp; /* Needed for "symlink/." with --relative. */
1034 *linkname = '\0'; /* make IBM code checker happy */
1035 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1036 int save_errno = errno;
1037 /* See if file is excluded before reporting an error. */
1038 if (filter_level != NO_FILTERS
1039 && (is_excluded(thisname, 0, filter_level)
1040 || is_excluded(thisname, 1, filter_level))) {
1041 if (ignore_perishable && save_errno != ENOENT)
1042 non_perishable_cnt++;
1045 if (save_errno == ENOENT) {
1046 #ifdef SUPPORT_LINKS
1047 /* Avoid "vanished" error if symlink points nowhere. */
1048 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1049 && S_ISLNK(st.st_mode)) {
1050 io_error |= IOERR_GENERAL;
1051 rprintf(FERROR, "symlink has no referent: %s\n",
1052 full_fname(thisname));
1056 enum logcode c = am_daemon && protocol_version < 28
1058 io_error |= IOERR_VANISHED;
1059 rprintf(c, "file has vanished: %s\n",
1060 full_fname(thisname));
1063 io_error |= IOERR_GENERAL;
1064 rsyserr(FERROR, save_errno, "readlink %s failed",
1065 full_fname(thisname));
1070 /* backup.c calls us with filter_level set to NO_FILTERS. */
1071 if (filter_level == NO_FILTERS)
1074 if (S_ISDIR(st.st_mode)) {
1076 rprintf(FINFO, "skipping directory %s\n", thisname);
1080 flags &= ~FLAG_XFER_DIR;
1082 /* -x only affects directories because we need to avoid recursing
1083 * into a mount-point directory, not to avoid copying a symlinked
1084 * file if -L (or similar) was specified. */
1085 if (one_file_system && st.st_dev != filesystem_dev
1086 && S_ISDIR(st.st_mode)) {
1087 if (one_file_system > 1) {
1089 rprintf(FINFO, "skipping mount-point dir %s\n",
1094 flags |= FLAG_MOUNT_DIR;
1097 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1098 if (ignore_perishable)
1099 non_perishable_cnt++;
1103 if (lp_ignore_nonreadable(module_id)) {
1104 #ifdef SUPPORT_LINKS
1105 if (!S_ISLNK(st.st_mode))
1107 if (access(thisname, R_OK) != 0)
1113 /* Only divert a directory in the main transfer. */
1115 if (flist->prev && S_ISDIR(st.st_mode)
1116 && flags & FLAG_DIVERT_DIRS) {
1117 /* Room for parent/sibling/next-child info. */
1118 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1120 pool = dir_flist->file_pool;
1122 pool = flist->file_pool;
1127 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1128 who_am_i(), thisname, filter_level);
1131 if ((basename = strrchr(thisname, '/')) != NULL) {
1132 int len = basename++ - thisname;
1133 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1134 lastdir = new_array(char, len + 1);
1135 memcpy(lastdir, thisname, len);
1136 lastdir[len] = '\0';
1140 basename = thisname;
1141 basename_len = strlen(basename) + 1; /* count the '\0' */
1143 #ifdef SUPPORT_LINKS
1144 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1149 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1150 extra_len += EXTRA_LEN;
1152 #if EXTRA_ROUNDING > 0
1153 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1154 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1157 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1160 bp = pool_alloc(pool, alloc_len, "make_file");
1162 if (!(bp = new_array(char, alloc_len)))
1163 out_of_memory("make_file");
1166 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1168 file = (struct file_struct *)bp;
1169 bp += FILE_STRUCT_LEN;
1171 memcpy(bp, basename, basename_len);
1172 bp += basename_len + linkname_len; /* skip space for symlink too */
1174 #ifdef SUPPORT_HARD_LINKS
1175 if (preserve_hard_links && flist && flist->prev) {
1176 if (protocol_version >= 28
1177 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1178 : S_ISREG(st.st_mode)) {
1179 tmp_dev = st.st_dev;
1180 tmp_ino = st.st_ino;
1186 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1187 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1188 tmp_rdev = st.st_rdev;
1193 file->flags = flags;
1194 file->modtime = st.st_mtime;
1195 file->len32 = (uint32)st.st_size;
1196 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1197 file->flags |= FLAG_LENGTH64;
1198 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1200 file->mode = st.st_mode;
1202 F_OWNER(file) = st.st_uid;
1204 F_GROUP(file) = st.st_gid;
1206 if (basename != thisname)
1207 file->dirname = lastdir;
1209 #ifdef SUPPORT_LINKS
1211 bp = (char*)file->basename + basename_len;
1212 memcpy(bp, linkname, linkname_len);
1216 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1217 file_checksum(thisname, tmp_sum, st.st_size);
1219 F_PATHNAME(file) = pathname;
1221 /* This code is only used by the receiver when it is building
1222 * a list of files for a delete pass. */
1223 if (keep_dirlinks && linkname_len && flist) {
1225 int save_mode = file->mode;
1226 file->mode = S_IFDIR; /* Find a directory with our name. */
1227 if (flist_find(dir_flist, file) >= 0
1228 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1229 file->modtime = st2.st_mtime;
1231 file->mode = st2.st_mode;
1233 F_OWNER(file) = st2.st_uid;
1235 F_GROUP(file) = st2.st_gid;
1237 file->mode = save_mode;
1240 if (basename_len == 0+1)
1245 F_NDX(file) = dir_count - 1;
1251 /* Only called for temporary file_struct entries created by make_file(). */
1252 void unmake_file(struct file_struct *file)
1254 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1255 #if EXTRA_ROUNDING > 0
1256 if (extra_cnt & EXTRA_ROUNDING)
1257 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1259 free(REQ_EXTRA(file, extra_cnt));
1262 static struct file_struct *send_file_name(int f, struct file_list *flist,
1263 char *fname, STRUCT_STAT *stp,
1264 int flags, int filter_level)
1266 struct file_struct *file;
1267 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1271 file = make_file(fname, flist, stp, flags, filter_level);
1275 if (chmod_modes && !S_ISLNK(file->mode))
1276 file->mode = tweak_mode(file->mode, chmod_modes);
1279 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1280 sx.st.st_mode = file->mode;
1281 sx.acc_acl = sx.def_acl = NULL;
1282 if (get_acl(fname, &sx) < 0)
1286 #ifdef SUPPORT_XATTRS
1287 if (preserve_xattrs && f >= 0) {
1289 if (get_xattr(fname, &sx) < 0)
1294 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1296 flist_expand(flist, 1);
1297 flist->files[flist->used++] = file;
1299 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1301 if (preserve_acls && !S_ISLNK(file->mode)) {
1306 #ifdef SUPPORT_XATTRS
1307 if (preserve_xattrs) {
1308 F_XATTR(file) = send_xattr(&sx, f);
1316 static void send_if_directory(int f, struct file_list *flist,
1317 struct file_struct *file,
1318 char *fbuf, unsigned int ol,
1321 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1323 if (S_ISDIR(file->mode)
1324 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1326 unsigned int len = strlen(fbuf);
1327 if (len > 1 && fbuf[len-1] == '/')
1329 if (len >= MAXPATHLEN - 1) {
1330 io_error |= IOERR_GENERAL;
1331 rprintf(FERROR, "skipping long-named directory: %s\n",
1335 save_filters = push_local_filters(fbuf, len);
1336 send_directory(f, flist, fbuf, len, flags);
1337 pop_local_filters(save_filters);
1344 static int file_compare(const void *file1, const void *file2)
1346 return f_name_cmp(*(struct file_struct **)file1,
1347 *(struct file_struct **)file2);
1350 /* The guts of a merge-sort algorithm. This was derived from the glibc
1351 * version, but I (Wayne) changed the merge code to do less copying and
1352 * to require only half the amount of temporary memory. */
1353 static void fsort_tmp(struct file_struct **fp, size_t num,
1354 struct file_struct **tmp)
1356 struct file_struct **f1, **f2, **t;
1365 fsort_tmp(f1, n1, tmp);
1367 fsort_tmp(f2, n2, tmp);
1369 while (f_name_cmp(*f1, *f2) <= 0) {
1376 memcpy(t, f1, n1 * PTR_SIZE);
1378 *f1++ = *f2++, n2--;
1380 while (n1 > 0 && n2 > 0) {
1381 if (f_name_cmp(*t, *f2) <= 0)
1384 *f1++ = *f2++, n2--;
1388 memcpy(f1, t, n1 * PTR_SIZE);
1391 /* This file-struct sorting routine makes sure that any identical names in
1392 * the file list stay in the same order as they were in the original list.
1393 * This is particularly vital in inc_recurse mode where we expect a sort
1394 * on the flist to match the exact order of a sort on the dir_flist. */
1395 static void fsort(struct file_struct **fp, size_t num)
1401 qsort(fp, num, PTR_SIZE, file_compare);
1403 struct file_struct **tmp = new_array(struct file_struct *,
1405 fsort_tmp(fp, num, tmp);
1410 /* We take an entire set of sibling dirs from the sorted flist and link them
1411 * into the tree, setting the appropriate parent/child/sibling pointers. */
1412 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1417 int32 *parent_dp = parent_ndx < 0 ? NULL
1418 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1420 flist_expand(dir_flist, dir_cnt);
1421 dir_flist->sorted = dir_flist->files;
1423 for (i = 0; dir_cnt; i++) {
1424 struct file_struct *file = from_flist->sorted[i];
1426 if (!S_ISDIR(file->mode))
1429 dir_flist->files[dir_flist->used++] = file;
1432 if (!(file->flags & FLAG_XFER_DIR)
1433 || file->flags & FLAG_MOUNT_DIR)
1437 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1439 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1441 send_dir_ndx = dir_flist->used - 1;
1443 dp = F_DIR_NODE_P(file);
1444 DIR_PARENT(dp) = parent_ndx;
1445 DIR_FIRST_CHILD(dp) = -1;
1448 DIR_NEXT_SIBLING(dp) = -1;
1451 /* This function is normally called by the sender, but the receiving side also
1452 * calls it from get_dirlist() with f set to -1 so that we just construct the
1453 * file list in memory without sending it over the wire. Also, get_dirlist()
1454 * might call this with f set to -2, which also indicates that local filter
1455 * rules should be ignored. */
1456 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1463 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1464 int start = flist->used;
1465 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1467 assert(flist != NULL);
1469 if (!(d = opendir(fbuf))) {
1470 io_error |= IOERR_GENERAL;
1471 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1476 if (len != 1 || *fbuf != '/')
1479 remainder = MAXPATHLEN - (p - fbuf);
1481 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1482 char *dname = d_name(di);
1483 if (dname[0] == '.' && (dname[1] == '\0'
1484 || (dname[1] == '.' && dname[2] == '\0')))
1486 if (strlcpy(p, dname, remainder) >= remainder) {
1487 io_error |= IOERR_GENERAL;
1489 "cannot send long-named file %s\n",
1493 if (dname[0] == '\0') {
1494 io_error |= IOERR_GENERAL;
1496 "cannot send file with empty name in %s\n",
1501 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1507 io_error |= IOERR_GENERAL;
1508 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1513 if (f >= 0 && recurse && !divert_dirs) {
1514 int i, end = flist->used - 1;
1515 /* send_if_directory() bumps flist->used, so use "end". */
1516 for (i = start; i <= end; i++)
1517 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1521 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1523 char fbuf[MAXPATHLEN];
1527 dlen = strlen(fbuf);
1529 if (F_PATHNAME(file) != pathname) {
1530 if (!push_pathname(F_PATHNAME(file), -1))
1531 exit_cleanup(RERR_FILESELECT);
1534 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1536 send_directory(f, flist, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1539 void send_extra_file_list(int f, int at_least)
1541 struct file_list *flist;
1543 int future_cnt, save_io_error = io_error;
1548 /* Keep sending data until we have the requested number of
1549 * files in the upcoming file-lists. */
1550 if (cur_flist->next) {
1551 flist = first_flist->prev; /* the newest flist */
1552 future_cnt = flist->ndx_end - cur_flist->next->ndx_start + 1;
1555 while (future_cnt < at_least) {
1556 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1557 int dir_ndx, dstart = dir_count;
1558 const char *pathname = F_PATHNAME(file);
1561 flist = flist_new(0, "send_extra_file_list");
1562 start_write = stats.total_written;
1566 dir_ndx = F_NDX(file);
1569 dir_ndx = send_dir_ndx;
1570 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1571 flist->parent_ndx = dir_ndx;
1573 send1extra(f, file, flist);
1574 dp = F_DIR_NODE_P(file);
1576 /* If there are any duplicate directory names that follow, we
1577 * send all the dirs together in one file-list. The dir_flist
1578 * tree links all the child subdirs onto the last dup dir. */
1579 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1580 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1581 send_dir_ndx = dir_ndx;
1582 file = dir_flist->sorted[dir_ndx];
1583 if (F_PATHNAME(file) != pathname)
1584 send1extra(f, file, flist);
1585 dp = F_DIR_NODE_P(file);
1591 if (need_unsorted_flist) {
1592 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1593 out_of_memory("send_extra_file_list");
1594 memcpy(flist->sorted, flist->files,
1595 flist->used * sizeof (struct file_struct*));
1598 flist->sorted = flist->files;
1600 clean_flist(flist, 0);
1602 flist->ndx_end = flist->ndx_start + flist->used - 1
1603 - (dir_count - dstart);
1605 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1606 flist_done_allocating(flist);
1608 file_total += flist->used;
1609 future_cnt += flist->used;
1610 stats.flist_size += stats.total_written - start_write;
1611 stats.num_files += flist->used;
1613 output_flist(flist);
1615 if (DIR_FIRST_CHILD(dp) >= 0) {
1616 send_dir_ndx = DIR_FIRST_CHILD(dp);
1619 while (DIR_NEXT_SIBLING(dp) < 0) {
1620 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1621 write_ndx(f, NDX_FLIST_EOF);
1623 change_local_filter_dir(NULL, 0, 0);
1627 file = dir_flist->sorted[send_dir_ndx];
1628 dp = F_DIR_NODE_P(file);
1630 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1635 if (io_error != save_io_error && !ignore_errors)
1636 send_msg_int(MSG_IO_ERROR, io_error);
1639 struct file_list *send_file_list(int f, int argc, char *argv[])
1641 static const char *lastdir;
1642 static int lastdir_len = -1;
1646 char lastpath[MAXPATHLEN] = "";
1647 struct file_list *flist;
1648 struct timeval start_tv, end_tv;
1651 int flags, disable_buffering;
1652 int reading_remotely = filesfrom_host != NULL;
1653 int rl_nulls = eol_nulls || reading_remotely;
1655 rprintf(FLOG, "building file list\n");
1656 if (show_filelist_p())
1657 start_filelist_progress("building file list");
1658 else if (inc_recurse && verbose && !am_server)
1659 rprintf(FCLIENT, "sending incremental file list\n");
1661 start_write = stats.total_written;
1662 gettimeofday(&start_tv, NULL);
1664 #ifdef SUPPORT_HARD_LINKS
1665 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1669 flist = cur_flist = flist_new(0, "send_file_list");
1671 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1672 flags = FLAG_DIVERT_DIRS | FLAG_XFER_DIR;
1674 dir_flist = cur_flist;
1675 flags = FLAG_XFER_DIR;
1678 disable_buffering = io_start_buffering_out(f);
1679 if (filesfrom_fd >= 0) {
1680 if (argv[0] && !push_dir(argv[0], 0)) {
1681 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1682 full_fname(argv[0]), curr_dir);
1683 exit_cleanup(RERR_FILESELECT);
1689 char fbuf[MAXPATHLEN];
1694 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, !reading_remotely, rl_nulls) == 0)
1696 sanitize_path(fbuf, fbuf, "", 0, NULL);
1700 strlcpy(fbuf, *argv++, MAXPATHLEN);
1702 sanitize_path(fbuf, fbuf, "", 0, NULL);
1706 if (relative_paths) {
1707 /* We clean up fbuf below. */
1709 } else if (!len || fbuf[len - 1] == '/') {
1710 if (len == 2 && fbuf[0] == '.') {
1711 /* Turn "./" into just "." rather than "./." */
1714 if (len + 1 >= MAXPATHLEN)
1715 overflow_exit("send_file_list");
1720 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1721 && (len == 2 || fbuf[len-3] == '/')) {
1722 if (len + 2 >= MAXPATHLEN)
1723 overflow_exit("send_file_list");
1729 is_dot_dir = fbuf[len-1] == '.'
1730 && (len == 1 || fbuf[len-2] == '/');
1735 if (!relative_paths) {
1736 p = strrchr(fbuf, '/');
1743 len -= p - fbuf + 1;
1748 if ((p = strstr(fbuf, "/./")) != NULL) {
1754 len -= p - fbuf + 3;
1758 /* Get rid of trailing "/" and "/.". */
1760 if (fn[len - 1] == '/') {
1762 if (!--len && !dir) {
1767 else if (len >= 2 && fn[len - 1] == '.'
1768 && fn[len - 2] == '/') {
1770 if (!(len -= 2) && !dir) {
1777 if (len == 1 && fn[0] == '/')
1780 /* Reject a ".." dir in the active part of the path. */
1781 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1782 if ((p[2] == '/' || p[2] == '\0')
1783 && (p == fn || p[-1] == '/')) {
1785 "found \"..\" dir in relative path: %s\n",
1787 exit_cleanup(RERR_SYNTAX);
1797 dirlen = dir ? strlen(dir) : 0;
1798 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1799 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1802 lastdir_len = pathname_len;
1803 } else if (!push_pathname(lastdir, lastdir_len))
1807 memmove(fbuf, fn, len + 1);
1809 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1810 io_error |= IOERR_GENERAL;
1811 rsyserr(FERROR, errno, "link_stat %s failed",
1816 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1817 rprintf(FINFO, "skipping directory %s\n", fbuf);
1821 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1822 /* Send the implied directories at the start of the
1823 * source spec, so we get their permissions right. */
1824 char *lp = lastpath, *slash = fbuf;
1826 /* Skip any initial directories in our path that we
1827 * have in common with lastpath. */
1828 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1833 if (fn != p || (*lp && *lp != '/')) {
1834 int save_copy_links = copy_links;
1835 int save_xfer_dirs = xfer_dirs;
1836 int dir_flags = flags & ~FLAG_XFER_DIR;
1837 copy_links |= copy_unsafe_links;
1839 while ((slash = strchr(slash+1, '/')) != 0) {
1841 send_file_name(f, flist, fbuf, NULL,
1842 dir_flags, ALL_FILTERS);
1845 copy_links = save_copy_links;
1846 xfer_dirs = save_xfer_dirs;
1848 strlcpy(lastpath, fbuf, sizeof lastpath);
1853 if (one_file_system)
1854 filesystem_dev = st.st_dev;
1856 if (recurse || (xfer_dirs && is_dot_dir)) {
1857 struct file_struct *file;
1858 int top_flags = FLAG_TOP_DIR | flags;
1859 file = send_file_name(f, flist, fbuf, &st,
1860 top_flags, ALL_FILTERS);
1861 if (file && !inc_recurse)
1862 send_if_directory(f, flist, file, fbuf, len, flags);
1864 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1867 gettimeofday(&end_tv, NULL);
1868 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1869 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1870 if (stats.flist_buildtime == 0)
1871 stats.flist_buildtime = 1;
1874 write_byte(f, 0); /* Indicate end of file list */
1876 #ifdef SUPPORT_HARD_LINKS
1877 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1881 if (show_filelist_p())
1882 finish_filelist_progress(flist);
1884 gettimeofday(&end_tv, NULL);
1885 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1886 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1888 /* When converting names, both sides keep an unsorted file-list array
1889 * because the names will differ on the sending and receiving sides
1890 * (both sides will use the unsorted index number for each item). */
1892 /* Sort the list without removing any duplicates. This allows the
1893 * receiving side to ask for whatever name it kept. For incremental
1894 * recursion mode, the sender marks duplicate dirs so that it can
1895 * send them together in a single file-list. */
1897 if (need_unsorted_flist) {
1899 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1900 out_of_memory("send_file_list");
1901 memcpy(flist->sorted, flist->files,
1902 flist->used * sizeof (struct file_struct*));
1903 clean_flist(flist, 0);
1905 flist->sorted = flist->files;
1907 flist->high = flist->used - 1;
1912 flist->sorted = flist->files;
1913 clean_flist(flist, 0);
1915 file_total += flist->used;
1917 /* We don't subtract dir_count for the first send since we
1918 * might have one or more dot dirs which need to get sent. */
1919 flist->ndx_end = flist->ndx_start + flist->used - 1;
1921 if (!numeric_ids && !inc_recurse)
1924 /* send the io_error flag */
1925 if (protocol_version < 30)
1926 write_int(f, ignore_errors ? 0 : io_error);
1927 else if (io_error && !ignore_errors)
1928 send_msg_int(MSG_IO_ERROR, io_error);
1930 if (disable_buffering)
1931 io_end_buffering_out();
1933 stats.flist_size = stats.total_written - start_write;
1934 stats.num_files = flist->used;
1937 output_flist(flist);
1940 rprintf(FINFO, "send_file_list done\n");
1943 add_dirs_to_tree(-1, flist, dir_count);
1944 flist_done_allocating(flist);
1945 if (send_dir_ndx < 0) {
1946 write_ndx(f, NDX_FLIST_EOF);
1949 else if (file_total == 1) {
1950 /* If we're creating incremental file-lists and there
1951 * was just 1 item in the first file-list, send 1 more
1952 * file-list to check if this is a 1-file xfer. */
1953 send_extra_file_list(f, 1);
1960 struct file_list *recv_file_list(int f)
1962 struct file_list *flist;
1967 rprintf(FLOG, "receiving file list\n");
1968 if (show_filelist_p())
1969 start_filelist_progress("receiving file list");
1970 else if (inc_recurse && verbose && !am_server && !first_flist)
1971 rprintf(FCLIENT, "receiving incremental file list\n");
1973 start_read = stats.total_read;
1975 #ifdef SUPPORT_HARD_LINKS
1976 if (preserve_hard_links && !first_flist)
1980 flist = flist_new(0, "recv_file_list");
1983 if (flist->ndx_start == 0)
1984 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1985 dstart = dir_flist->used;
1991 while ((flags = read_byte(f)) != 0) {
1992 struct file_struct *file;
1994 flist_expand(flist, 1);
1996 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1997 flags |= read_byte(f) << 8;
1998 file = recv_file_entry(flist, flags, f);
2000 if (inc_recurse && S_ISDIR(file->mode)) {
2001 flist_expand(dir_flist, 1);
2002 dir_flist->files[dir_flist->used++] = file;
2005 flist->files[flist->used++] = file;
2007 maybe_emit_filelist_progress(flist->used);
2010 rprintf(FINFO, "recv_file_name(%s)\n",
2011 f_name(file, NULL));
2014 file_total += flist->used;
2016 flist->ndx_end = flist->ndx_start + flist->used - 1;
2017 if (inc_recurse && flist->ndx_start)
2018 flist->ndx_end -= dir_flist->used - dstart;
2021 rprintf(FINFO, "received %d names\n", flist->used);
2023 if (show_filelist_p())
2024 finish_filelist_progress(flist);
2027 if (need_unsorted_flist) {
2028 /* Create an extra array of index pointers that we can sort for
2029 * the generator's use (for wading through the files in sorted
2030 * order and for calling flist_find()). We keep the "files"
2031 * list unsorted for our exchange of index numbers with the
2032 * other side (since their names may not sort the same). */
2033 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2034 out_of_memory("recv_file_list");
2035 memcpy(flist->sorted, flist->files,
2036 flist->used * sizeof (struct file_struct*));
2037 if (inc_recurse && dir_flist->used > dstart) {
2038 dir_flist->sorted = realloc_array(dir_flist->sorted,
2039 struct file_struct *,
2041 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2042 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2043 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2048 flist->sorted = flist->files;
2049 if (inc_recurse && dir_flist->used > dstart) {
2050 dir_flist->sorted = dir_flist->files;
2051 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2056 flist_done_allocating(flist);
2058 recv_id_list(f, flist);
2060 clean_flist(flist, relative_paths);
2062 if (protocol_version < 30) {
2063 /* Recv the io_error flag */
2067 io_error |= read_int(f);
2071 output_flist(flist);
2075 for (i = flist->low; i <= flist->high; i++)
2076 list_file_entry(flist->files[i]);
2080 rprintf(FINFO, "recv_file_list done\n");
2082 stats.flist_size += stats.total_read - start_read;
2083 stats.num_files += flist->used;
2088 /* This is only used once by the receiver if the very first file-list
2089 * has exactly one item in it. */
2090 void recv_additional_file_list(int f)
2092 struct file_list *flist;
2093 int ndx = read_ndx(f);
2094 if (ndx == NDX_FLIST_EOF) {
2096 change_local_filter_dir(NULL, 0, 0);
2098 ndx = NDX_FLIST_OFFSET - ndx;
2099 if (ndx < 0 || ndx >= dir_flist->used) {
2100 ndx = NDX_FLIST_OFFSET - ndx;
2102 "[%s] Invalid dir index: %d (%d - %d)\n",
2103 who_am_i(), ndx, NDX_FLIST_OFFSET,
2104 NDX_FLIST_OFFSET - dir_flist->used + 1);
2105 exit_cleanup(RERR_PROTOCOL);
2108 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2111 flist = recv_file_list(f);
2112 flist->parent_ndx = ndx;
2116 /* Search for an identically-named item in the file list. Note that the
2117 * items must agree in their directory-ness, or no match is returned. */
2118 int flist_find(struct file_list *flist, struct file_struct *f)
2120 int low = flist->low, high = flist->high;
2121 int diff, mid, mid_up;
2123 while (low <= high) {
2124 mid = (low + high) / 2;
2125 if (F_IS_ACTIVE(flist->sorted[mid]))
2128 /* Scan for the next non-empty entry using the cached
2129 * distance values. If the value isn't fully up-to-
2130 * date, update it. */
2131 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2132 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2134 mid_up += F_DEPTH(flist->sorted[mid_up]);
2135 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2136 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2138 if (mid_up > high) {
2139 /* If there's nothing left above us, set high to
2140 * a non-empty entry below us and continue. */
2141 high = mid - (int)flist->sorted[mid]->len32;
2142 if (!F_IS_ACTIVE(flist->sorted[high])) {
2144 high -= (int)flist->sorted[high]->len32;
2145 } while (!F_IS_ACTIVE(flist->sorted[high]));
2146 flist->sorted[mid]->len32 = mid - high;
2151 diff = f_name_cmp(flist->sorted[mid_up], f);
2153 if (protocol_version < 29
2154 && S_ISDIR(flist->sorted[mid_up]->mode)
2155 != S_ISDIR(f->mode))
2168 * Free up any resources a file_struct has allocated
2169 * and clear the file.
2171 void clear_file(struct file_struct *file)
2173 /* The +1 zeros out the first char of the basename. */
2174 memset(file, 0, FILE_STRUCT_LEN + 1);
2175 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2176 * entry. Likewise for len32 in the opposite direction. We assume
2177 * that we're alone for now since flist_find() will adjust the counts
2178 * it runs into that aren't up-to-date. */
2179 file->len32 = F_DEPTH(file) = 1;
2182 /* Allocate a new file list. */
2183 struct file_list *flist_new(int flags, char *msg)
2185 struct file_list *flist;
2187 flist = new0(struct file_list);
2191 if (flags & FLIST_TEMP) {
2192 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2193 out_of_memory, POOL_INTERN)))
2196 /* This is a doubly linked list with prev looping back to
2197 * the end of the list, but the last next pointer is NULL. */
2199 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2200 out_of_memory, POOL_INTERN);
2201 if (!flist->file_pool)
2204 first_flist = cur_flist = flist->prev = flist;
2206 flist->file_pool = first_flist->file_pool;
2208 flist->ndx_start = first_flist->prev->ndx_end + 2;
2209 if (flist->ndx_start <= high_hlink_ndx)
2210 flist->ndx_start = high_hlink_ndx + 1;
2212 flist->prev = first_flist->prev;
2213 flist->prev->next = first_flist->prev = flist;
2215 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2222 /* Free up all elements in a flist. */
2223 void flist_free(struct file_list *flist)
2226 /* Was FLIST_TEMP dir-list. */
2227 } else if (flist == flist->prev) {
2228 first_flist = cur_flist = NULL;
2232 if (flist == cur_flist)
2233 cur_flist = flist->next;
2234 if (flist == first_flist)
2235 first_flist = first_flist->next;
2237 flist->prev->next = flist->next;
2239 flist->next = first_flist;
2241 flist->next->prev = flist->prev;
2242 file_total -= flist->used;
2246 if (!flist->prev || !flist_cnt)
2247 pool_destroy(flist->file_pool);
2249 pool_free_old(flist->file_pool, flist->pool_boundary);
2251 if (flist->sorted && flist->sorted != flist->files)
2252 free(flist->sorted);
2257 /* This routine ensures we don't have any duplicate names in our file list.
2258 * duplicate names can cause corruption because of the pipelining. */
2259 static void clean_flist(struct file_list *flist, int strip_root)
2261 char fbuf[MAXPATHLEN];
2266 if (flist->used == 0) {
2272 fsort(flist->sorted, flist->used);
2274 if (!am_sender || inc_recurse) {
2275 for (i = prev_i = 0; i < flist->used; i++) {
2276 if (F_IS_ACTIVE(flist->sorted[i])) {
2281 flist->low = prev_i;
2283 i = prev_i = flist->used - 1;
2287 while (++i < flist->used) {
2289 struct file_struct *file = flist->sorted[i];
2291 if (!F_IS_ACTIVE(file))
2293 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2295 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2296 int save_mode = file->mode;
2297 /* Make sure that this directory doesn't duplicate a
2298 * non-directory earlier in the list. */
2299 flist->high = prev_i;
2300 file->mode = S_IFREG;
2301 j = flist_find(flist, file);
2302 file->mode = save_mode;
2307 /* If one is a dir and the other is not, we want to
2308 * keep the dir because it might have contents in the
2309 * list. Otherwise keep the first one. */
2310 if (S_ISDIR(file->mode)) {
2311 struct file_struct *fp = flist->sorted[j];
2312 if (!S_ISDIR(fp->mode) || !(fp->flags & FLAG_XFER_DIR))
2316 file->flags |= FLAG_DUPLICATE;
2325 "removing duplicate name %s from file list (%d)\n",
2326 f_name(file, fbuf), drop + flist->ndx_start);
2328 /* Make sure we don't lose track of a user-specified
2330 flist->sorted[keep]->flags |= flist->sorted[drop]->flags
2331 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2333 clear_file(flist->sorted[drop]);
2337 if (flist->low == drop) {
2339 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2348 flist->high = prev_i;
2351 /* We need to strip off the leading slashes for relative
2352 * paths, but this must be done _after_ the sorting phase. */
2353 for (i = flist->low; i <= flist->high; i++) {
2354 struct file_struct *file = flist->sorted[i];
2358 while (*file->dirname == '/')
2360 if (!*file->dirname)
2361 file->dirname = NULL;
2365 if (prune_empty_dirs && !am_sender) {
2366 int j, prev_depth = 0;
2368 prev_i = 0; /* It's OK that this isn't really true. */
2370 for (i = flist->low; i <= flist->high; i++) {
2371 struct file_struct *fp, *file = flist->sorted[i];
2373 /* This temporarily abuses the F_DEPTH() value for a
2374 * directory that is in a chain that might get pruned.
2375 * We restore the old value if it gets a reprieve. */
2376 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2377 /* Dump empty dirs when coming back down. */
2378 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2379 fp = flist->sorted[prev_i];
2380 if (F_DEPTH(fp) >= 0)
2382 prev_i = -F_DEPTH(fp)-1;
2385 prev_depth = F_DEPTH(file);
2386 if (is_excluded(f_name(file, fbuf), 1,
2388 /* Keep dirs through this dir. */
2389 for (j = prev_depth-1; ; j--) {
2390 fp = flist->sorted[prev_i];
2391 if (F_DEPTH(fp) >= 0)
2393 prev_i = -F_DEPTH(fp)-1;
2397 F_DEPTH(file) = -prev_i-1;
2400 /* Keep dirs through this non-dir. */
2401 for (j = prev_depth; ; j--) {
2402 fp = flist->sorted[prev_i];
2403 if (F_DEPTH(fp) >= 0)
2405 prev_i = -F_DEPTH(fp)-1;
2410 /* Dump all remaining empty dirs. */
2412 struct file_struct *fp = flist->sorted[prev_i];
2413 if (F_DEPTH(fp) >= 0)
2415 prev_i = -F_DEPTH(fp)-1;
2419 for (i = flist->low; i <= flist->high; i++) {
2420 if (F_IS_ACTIVE(flist->sorted[i]))
2424 for (i = flist->high; i >= flist->low; i--) {
2425 if (F_IS_ACTIVE(flist->sorted[i]))
2432 static void output_flist(struct file_list *flist)
2434 char uidbuf[16], gidbuf[16], depthbuf[16];
2435 struct file_struct *file;
2436 const char *root, *dir, *slash, *name, *trail;
2437 const char *who = who_am_i();
2440 rprintf(FINFO, "[%s] flist start=%d, end=%d, used=%d, low=%d, high=%d\n",
2441 who, flist->ndx_start, flist->ndx_end, flist->used, flist->low, flist->high);
2442 for (i = 0; i < flist->used; i++) {
2443 file = flist->sorted[i];
2444 if ((am_root || am_sender) && uid_ndx) {
2445 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2450 static char parens[] = "(\0)\0\0\0";
2451 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2452 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2453 pp, F_GROUP(file), pp + 2);
2457 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2458 if (F_IS_ACTIVE(file)) {
2459 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2460 if ((dir = file->dirname) == NULL)
2464 name = file->basename;
2465 trail = S_ISDIR(file->mode) ? "/" : "";
2467 root = dir = slash = name = trail = "";
2469 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2470 who, i + flist->ndx_start,
2471 root, dir, slash, name, trail,
2472 (int)file->mode, (double)F_LENGTH(file),
2473 uidbuf, gidbuf, file->flags);
2477 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2478 enum fnc_type { t_PATH, t_ITEM };
2480 static int found_prefix;
2482 /* Compare the names of two file_struct entities, similar to how strcmp()
2483 * would do if it were operating on the joined strings.
2485 * Some differences beginning with protocol_version 29: (1) directory names
2486 * are compared with an assumed trailing slash so that they compare in a
2487 * way that would cause them to sort immediately prior to any content they
2488 * may have; (2) a directory of any name compares after a non-directory of
2489 * any name at the same depth; (3) a directory with name "." compares prior
2490 * to anything else. These changes mean that a directory and a non-dir
2491 * with the same name will not compare as equal (protocol_version >= 29).
2493 * The dirname component can be an empty string, but the basename component
2494 * cannot (and never is in the current codebase). The basename component
2495 * may be NULL (for a removed item), in which case it is considered to be
2496 * after any existing item. */
2497 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2500 const uchar *c1, *c2;
2501 enum fnc_state state1, state2;
2502 enum fnc_type type1, type2;
2503 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2505 if (!f1 || !F_IS_ACTIVE(f1)) {
2506 if (!f2 || !F_IS_ACTIVE(f2))
2510 if (!f2 || !F_IS_ACTIVE(f2))
2513 c1 = (uchar*)f1->dirname;
2514 c2 = (uchar*)f2->dirname;
2518 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2519 c1 = (const uchar*)f1->basename;
2520 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2522 state1 = s_TRAILING;
2531 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2532 c2 = (const uchar*)f2->basename;
2533 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2535 state2 = s_TRAILING;
2545 return type1 == t_PATH ? 1 : -1;
2555 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2556 c1 = (const uchar*)f1->basename;
2557 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2559 state1 = s_TRAILING;
2565 state1 = s_TRAILING;
2566 if (type1 == t_PATH) {
2575 if (*c2 && type1 != type2)
2576 return type1 == t_PATH ? 1 : -1;
2585 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2586 c2 = (const uchar*)f2->basename;
2587 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2589 state2 = s_TRAILING;
2595 state2 = s_TRAILING;
2596 if (type2 == t_PATH) {
2609 return type1 == t_PATH ? 1 : -1;
2611 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2616 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2617 * not match if f2's basename is not an exact match of a path element in f1.
2618 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2619 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2623 return found_prefix;
2626 char *f_name_buf(void)
2628 static char names[5][MAXPATHLEN];
2629 static unsigned int n;
2631 n = (n + 1) % (sizeof names / sizeof names[0]);
2636 /* Return a copy of the full filename of a flist entry, using the indicated
2637 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2638 * done because we checked the size when creating the file_struct entry.
2640 char *f_name(const struct file_struct *f, char *fbuf)
2642 if (!f || !F_IS_ACTIVE(f))
2646 fbuf = f_name_buf();
2649 int len = strlen(f->dirname);
2650 memcpy(fbuf, f->dirname, len);
2652 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2654 strlcpy(fbuf, f->basename, MAXPATHLEN);
2659 /* Do a non-recursive scan of the named directory, possibly ignoring all
2660 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2661 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2662 * buffer (the functions we call will append names onto the end, but the old
2663 * dir value will be restored on exit). */
2664 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2666 struct file_list *dirlist;
2667 char dirbuf[MAXPATHLEN];
2668 int save_recurse = recurse;
2669 int save_xfer_dirs = xfer_dirs;
2670 int save_prune_empty_dirs = prune_empty_dirs;
2673 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2674 if (dlen >= MAXPATHLEN)
2679 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2683 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2684 xfer_dirs = save_xfer_dirs;
2685 recurse = save_recurse;
2687 flist_count_offset += dirlist->used;
2689 prune_empty_dirs = 0;
2690 dirlist->sorted = dirlist->files;
2691 clean_flist(dirlist, 0);
2692 prune_empty_dirs = save_prune_empty_dirs;
2695 output_flist(dirlist);