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 int munge_symlinks;
67 extern int need_unsorted_flist;
68 extern int unsort_ndx;
69 extern struct stats stats;
70 extern char *filesfrom_host;
72 extern char curr_dir[MAXPATHLEN];
74 extern struct chmod_mode_struct *chmod_modes;
76 extern struct filter_list_struct filter_list;
77 extern struct filter_list_struct server_filter_list;
80 extern int filesfrom_convert;
81 extern iconv_t ic_send, ic_recv;
84 #define PTR_SIZE (sizeof (struct file_struct *))
88 dev_t filesystem_dev; /* used to implement -x */
90 struct file_list *cur_flist, *first_flist, *dir_flist;
91 int send_dir_ndx = -1, send_dir_depth = -1;
92 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
93 int file_total = 0; /* total of all active items over all file-lists */
94 int flist_eof = 0; /* all the file-lists are now known */
97 #define SLASH_ENDING_NAME 1
100 /* Starting from protocol version 26, we always use 64-bit ino_t and dev_t
101 * internally, even if this platform does not allow files to have 64-bit inums.
102 * The only exception is if we're on a platform with no 64-bit type at all.
104 * Because we use read_longint() to get these off the wire, if you transfer
105 * devices or (for protocols < 30) hardlinks with dev or inum > 2**32 to a
106 * machine with no 64-bit types then you will get an overflow error.
108 * Note that if you transfer devices from a 64-bit-devt machine (say, Solaris)
109 * to a 32-bit-devt machine (say, Linux-2.2/x86) then the device numbers will
110 * be truncated. But it's a kind of silly thing to do anyhow. */
112 /* The tmp_* vars are used as a cache area by make_file() to store data
113 * that the sender doesn't need to remember in its file list. The data
114 * will survive just long enough to be used by send_file_entry(). */
115 static dev_t tmp_rdev;
116 #ifdef SUPPORT_HARD_LINKS
117 static int64 tmp_dev, tmp_ino;
119 static char tmp_sum[MAX_DIGEST_LEN];
121 static char empty_sum[MAX_DIGEST_LEN];
122 static int flist_count_offset; /* for --delete --progress */
123 static int dir_count = 0;
125 static void flist_sort_and_clean(struct file_list *flist, int strip_root);
126 static void output_flist(struct file_list *flist);
128 void init_flist(void)
131 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
132 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
134 checksum_len = protocol_version < 21 ? 2
135 : protocol_version < 30 ? MD4_DIGEST_LEN
139 static int show_filelist_p(void)
141 return verbose && xfer_dirs && !am_server && !inc_recurse;
144 static void start_filelist_progress(char *kind)
146 rprintf(FCLIENT, "%s ... ", kind);
147 if (verbose > 1 || do_progress)
148 rprintf(FCLIENT, "\n");
152 static void emit_filelist_progress(int count)
154 rprintf(FCLIENT, " %d files...\r", count);
157 static void maybe_emit_filelist_progress(int count)
159 if (do_progress && show_filelist_p() && (count % 100) == 0)
160 emit_filelist_progress(count);
163 static void finish_filelist_progress(const struct file_list *flist)
166 /* This overwrites the progress line */
167 rprintf(FINFO, "%d file%sto consider\n",
168 flist->used, flist->used == 1 ? " " : "s ");
170 rprintf(FINFO, "done\n");
173 void show_flist_stats(void)
178 /* Stat either a symlink or its referent, depending on the settings of
179 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
181 * If path is the name of a symlink, then the linkbuf buffer (which must hold
182 * MAXPATHLEN chars) will be set to the symlink's target string.
184 * The stat structure pointed to by stp will contain information about the
185 * link or the referent as appropriate, if they exist. */
186 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
189 if (link_stat(path, stp, copy_dirlinks) < 0)
191 if (S_ISLNK(stp->st_mode)) {
192 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
195 linkbuf[llen] = '\0';
196 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
198 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
201 return x_stat(path, stp, NULL);
203 if (munge_symlinks && am_sender && llen > SYMLINK_PREFIX_LEN
204 && strncmp(linkbuf, SYMLINK_PREFIX, SYMLINK_PREFIX_LEN) == 0) {
205 memmove(linkbuf, linkbuf + SYMLINK_PREFIX_LEN,
206 llen - SYMLINK_PREFIX_LEN + 1);
211 return x_stat(path, stp, NULL);
215 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
219 return x_stat(path, stp, NULL);
220 if (x_lstat(path, stp, NULL) < 0)
222 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
224 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
229 return x_stat(path, stp, NULL);
233 /* This function is used to check if a file should be included/excluded
234 * from the list of files based on its name and type etc. The value of
235 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
236 static int is_excluded(char *fname, int is_dir, int filter_level)
238 #if 0 /* This currently never happens, so avoid a useless compare. */
239 if (filter_level == NO_FILTERS)
243 /* never exclude '.', even if somebody does --exclude '*' */
244 if (fname[0] == '.' && !fname[1])
246 /* Handle the -R version of the '.' dir. */
247 if (fname[0] == '/') {
248 int len = strlen(fname);
249 if (fname[len-1] == '.' && fname[len-2] == '/')
253 if (server_filter_list.head
254 && check_filter(&server_filter_list, fname, is_dir) < 0)
256 if (filter_level != ALL_FILTERS)
259 && check_filter(&filter_list, fname, is_dir) < 0)
264 static void send_directory(int f, struct file_list *flist,
265 char *fbuf, int len, int flags);
267 static const char *pathname, *orig_dir;
268 static int pathname_len;
271 /* Make sure flist can hold at least flist->used + extra entries. */
272 static void flist_expand(struct file_list *flist, int extra)
274 struct file_struct **new_ptr;
276 if (flist->used + extra <= flist->malloced)
279 if (flist->malloced < FLIST_START)
280 flist->malloced = FLIST_START;
281 else if (flist->malloced >= FLIST_LINEAR)
282 flist->malloced += FLIST_LINEAR;
284 flist->malloced *= 2;
286 /* In case count jumped or we are starting the list
287 * with a known size just set it. */
288 if (flist->malloced < flist->used + extra)
289 flist->malloced = flist->used + extra;
291 new_ptr = realloc_array(flist->files, struct file_struct *,
294 if (verbose >= 2 && flist->malloced != FLIST_START) {
295 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
297 (double)sizeof flist->files[0] * flist->malloced,
298 (new_ptr == flist->files) ? " not" : "");
301 flist->files = new_ptr;
304 out_of_memory("flist_expand");
307 static void flist_done_allocating(struct file_list *flist)
309 void *ptr = pool_boundary(flist->file_pool, 8*1024);
310 if (flist->pool_boundary == ptr)
311 flist->pool_boundary = NULL; /* list didn't use any pool memory */
313 flist->pool_boundary = ptr;
316 int push_pathname(const char *dir, int len)
322 orig_dir = strdup(curr_dir);
324 if (pathname && !pop_dir(orig_dir)) {
325 rsyserr(FERROR, errno, "pop_dir %s failed",
326 full_fname(orig_dir));
327 exit_cleanup(RERR_FILESELECT);
330 if (dir && !push_dir(dir, 0)) {
331 io_error |= IOERR_GENERAL;
332 rsyserr(FERROR, errno, "push_dir %s failed in %s",
333 full_fname(dir), curr_dir);
338 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
343 static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
345 static time_t modtime;
347 #ifdef SUPPORT_HARD_LINKS
351 static uint32 rdev_major;
354 static char *user_name, *group_name;
355 static char lastname[MAXPATHLEN];
356 char fname[MAXPATHLEN];
357 int first_hlink_ndx = -1;
362 if (ic_send != (iconv_t)-1) {
365 INIT_CONST_XBUF(outbuf, fname);
368 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
369 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
370 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
373 outbuf.buf[outbuf.len++] = '/';
376 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
377 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
379 io_error |= IOERR_GENERAL;
381 "[%s] cannot convert filename: %s (%s)\n",
382 who_am_i(), f_name(file, fname), strerror(errno));
385 outbuf.buf[outbuf.len] = '\0';
390 /* Initialize starting value of xflags. */
391 if (protocol_version >= 30 && S_ISDIR(file->mode)) {
392 if (file->flags & FLAG_CONTENT_DIR)
393 xflags = file->flags & FLAG_TOP_DIR;
394 else if (file->flags & FLAG_IMPLIED_DIR)
395 xflags = XMIT_TOP_DIR | XMIT_NO_CONTENT_DIR;
397 xflags = XMIT_NO_CONTENT_DIR;
399 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
401 if (file->mode == mode)
402 xflags |= XMIT_SAME_MODE;
406 if ((preserve_devices && IS_DEVICE(mode))
407 || (preserve_specials && IS_SPECIAL(mode))) {
408 if (protocol_version < 28) {
409 if (tmp_rdev == rdev)
410 xflags |= XMIT_SAME_RDEV_pre28;
415 if ((uint32)major(rdev) == rdev_major)
416 xflags |= XMIT_SAME_RDEV_MAJOR;
418 rdev_major = major(rdev);
419 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
420 xflags |= XMIT_RDEV_MINOR_8_pre30;
422 } else if (protocol_version < 28)
423 rdev = MAKEDEV(0, 0);
425 if ((uid_t)F_OWNER(file) == uid && *lastname)
426 xflags |= XMIT_SAME_UID;
429 if (uid_ndx && !numeric_ids) {
430 user_name = add_uid(uid);
431 if (inc_recurse && user_name)
432 xflags |= XMIT_USER_NAME_FOLLOWS;
437 if ((gid_t)F_GROUP(file) == gid && *lastname)
438 xflags |= XMIT_SAME_GID;
441 if (gid_ndx && !numeric_ids) {
442 group_name = add_gid(gid);
443 if (inc_recurse && group_name)
444 xflags |= XMIT_GROUP_NAME_FOLLOWS;
448 if (file->modtime == modtime)
449 xflags |= XMIT_SAME_TIME;
451 modtime = file->modtime;
453 #ifdef SUPPORT_HARD_LINKS
455 if (protocol_version >= 30) {
456 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
457 first_hlink_ndx = (int32)(long)np->data - 1;
458 if (first_hlink_ndx < 0) {
459 np->data = (void*)(long)(first_ndx + ndx + 1);
460 xflags |= XMIT_HLINK_FIRST;
462 xflags |= XMIT_HLINKED;
464 if (tmp_dev == dev) {
465 if (protocol_version >= 28)
466 xflags |= XMIT_SAME_DEV_pre30;
469 xflags |= XMIT_HLINKED;
475 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
477 l2 = strlen(fname+l1);
480 xflags |= XMIT_SAME_NAME;
482 xflags |= XMIT_LONG_NAME;
484 /* We must make sure we don't send a zero flag byte or the
485 * other end will terminate the flist transfer. Note that
486 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
487 * it's harmless way to add a bit to the first flag byte. */
488 if (protocol_version >= 28) {
489 if (!xflags && !S_ISDIR(mode))
490 xflags |= XMIT_TOP_DIR;
491 if ((xflags & 0xFF00) || !xflags) {
492 xflags |= XMIT_EXTENDED_FLAGS;
493 write_shortint(f, xflags);
495 write_byte(f, xflags);
497 if (!(xflags & 0xFF))
498 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
499 write_byte(f, xflags);
501 if (xflags & XMIT_SAME_NAME)
503 if (xflags & XMIT_LONG_NAME)
504 write_varint30(f, l2);
507 write_buf(f, fname + l1, l2);
509 if (first_hlink_ndx >= 0) {
510 write_varint(f, first_hlink_ndx);
511 if (first_hlink_ndx >= first_ndx)
515 write_varlong30(f, F_LENGTH(file), 3);
516 if (!(xflags & XMIT_SAME_TIME)) {
517 if (protocol_version >= 30)
518 write_varlong(f, modtime, 4);
520 write_int(f, modtime);
522 if (!(xflags & XMIT_SAME_MODE))
523 write_int(f, to_wire_mode(mode));
524 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
525 if (protocol_version < 30)
528 write_varint(f, uid);
529 if (xflags & XMIT_USER_NAME_FOLLOWS) {
530 int len = strlen(user_name);
532 write_buf(f, user_name, len);
536 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
537 if (protocol_version < 30)
540 write_varint(f, gid);
541 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
542 int len = strlen(group_name);
544 write_buf(f, group_name, len);
548 if ((preserve_devices && IS_DEVICE(mode))
549 || (preserve_specials && IS_SPECIAL(mode))) {
550 if (protocol_version < 28) {
551 if (!(xflags & XMIT_SAME_RDEV_pre28))
552 write_int(f, (int)rdev);
554 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
555 write_varint30(f, major(rdev));
556 if (protocol_version >= 30)
557 write_varint(f, minor(rdev));
558 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
559 write_byte(f, minor(rdev));
561 write_int(f, minor(rdev));
566 if (preserve_links && S_ISLNK(mode)) {
567 const char *sl = F_SYMLINK(file);
568 int len = strlen(sl);
569 write_varint30(f, len);
570 write_buf(f, sl, len);
574 #ifdef SUPPORT_HARD_LINKS
575 if (tmp_dev != 0 && protocol_version < 30) {
576 if (protocol_version < 26) {
577 /* 32-bit dev_t and ino_t */
578 write_int(f, (int32)dev);
579 write_int(f, (int32)tmp_ino);
581 /* 64-bit dev_t and ino_t */
582 if (!(xflags & XMIT_SAME_DEV_pre30))
583 write_longint(f, dev);
584 write_longint(f, tmp_ino);
589 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
594 /* Prior to 28, we sent a useless set of nulls. */
597 write_buf(f, sum, checksum_len);
601 strlcpy(lastname, fname, MAXPATHLEN);
603 if (S_ISREG(mode) || S_ISLNK(mode))
604 stats.total_size += F_LENGTH(file);
607 static struct file_struct *recv_file_entry(struct file_list *flist,
610 static int64 modtime;
612 #ifdef SUPPORT_HARD_LINKS
616 static uint32 rdev_major;
619 static uint16 gid_flags;
620 static char lastname[MAXPATHLEN], *lastdir;
621 static int lastdir_depth, lastdir_len = -1;
622 static unsigned int del_hier_name_len = 0;
623 static int in_del_hier = 0;
624 char thisname[MAXPATHLEN];
625 unsigned int l1 = 0, l2 = 0;
626 int alloc_len, basename_len, linkname_len;
627 int extra_len = file_extra_cnt * EXTRA_LEN;
628 int first_hlink_ndx = -1;
630 const char *basename;
631 struct file_struct *file;
635 if (xflags & XMIT_SAME_NAME)
638 if (xflags & XMIT_LONG_NAME)
639 l2 = read_varint30(f);
643 if (l2 >= MAXPATHLEN - l1) {
645 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
646 xflags, l1, l2, lastname, who_am_i());
647 overflow_exit("recv_file_entry");
650 strlcpy(thisname, lastname, l1 + 1);
651 read_sbuf(f, &thisname[l1], l2);
652 thisname[l1 + l2] = 0;
654 /* Abuse basename_len for a moment... */
655 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
658 if (ic_recv != (iconv_t)-1) {
661 INIT_CONST_XBUF(outbuf, thisname);
662 INIT_XBUF(inbuf, lastname, basename_len, -1);
664 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
665 io_error |= IOERR_GENERAL;
667 "[%s] cannot convert filename: %s (%s)\n",
668 who_am_i(), lastname, strerror(errno));
671 outbuf.buf[outbuf.len] = '\0';
675 clean_fname(thisname, 0);
678 sanitize_path(thisname, thisname, "", 0);
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 first_hlink_ndx = read_varint(f);
697 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
699 "hard-link reference out of range: %d (%d)\n",
700 first_hlink_ndx, flist->ndx_start + flist->used);
701 exit_cleanup(RERR_PROTOCOL);
703 if (first_hlink_ndx >= flist->ndx_start) {
704 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
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;
727 file_length = read_varlong30(f, 3);
728 if (!(xflags & XMIT_SAME_TIME)) {
729 if (protocol_version >= 30) {
730 modtime = read_varlong(f, 4);
731 #if SIZEOF_TIME_T < SIZEOF_INT64
732 if (!am_generator && (int64)(time_t)modtime != modtime) {
734 "Time value of %s truncated on receiver.\n",
739 modtime = read_int(f);
741 if (!(xflags & XMIT_SAME_MODE))
742 mode = from_wire_mode(read_int(f));
744 if (chmod_modes && !S_ISLNK(mode))
745 mode = tweak_mode(mode, chmod_modes);
747 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
748 if (protocol_version < 30)
749 uid = (uid_t)read_int(f);
751 uid = (uid_t)read_varint(f);
752 if (xflags & XMIT_USER_NAME_FOLLOWS)
753 uid = recv_user_name(f, uid);
754 else if (inc_recurse && am_root && !numeric_ids)
755 uid = match_uid(uid);
758 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
759 if (protocol_version < 30)
760 gid = (gid_t)read_int(f);
762 gid = (gid_t)read_varint(f);
764 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
765 gid = recv_group_name(f, gid, &gid_flags);
766 else if (inc_recurse && (!am_root || !numeric_ids))
767 gid = match_gid(gid, &gid_flags);
771 if ((preserve_devices && IS_DEVICE(mode))
772 || (preserve_specials && IS_SPECIAL(mode))) {
773 if (protocol_version < 28) {
774 if (!(xflags & XMIT_SAME_RDEV_pre28))
775 rdev = (dev_t)read_int(f);
778 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
779 rdev_major = read_varint30(f);
780 if (protocol_version >= 30)
781 rdev_minor = read_varint(f);
782 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
783 rdev_minor = read_byte(f);
785 rdev_minor = read_int(f);
786 rdev = MAKEDEV(rdev_major, rdev_minor);
788 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
790 } else if (protocol_version < 28)
791 rdev = MAKEDEV(0, 0);
794 if (preserve_links && S_ISLNK(mode)) {
795 linkname_len = read_varint30(f) + 1; /* count the '\0' */
796 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
797 rprintf(FERROR, "overflow: linkname_len=%d\n",
799 overflow_exit("recv_file_entry");
802 linkname_len += SYMLINK_PREFIX_LEN;
808 #ifdef SUPPORT_HARD_LINKS
810 if (preserve_hard_links) {
811 if (protocol_version < 28 && S_ISREG(mode))
812 xflags |= XMIT_HLINKED;
813 if (xflags & XMIT_HLINKED)
814 extra_len += (inc_recurse+1) * EXTRA_LEN;
819 /* We need one or two index int32s when we're preserving ACLs. */
821 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
824 if (always_checksum && S_ISREG(mode))
825 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
827 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
828 extra_len += EXTRA_LEN;
830 if (inc_recurse && S_ISDIR(mode)) {
831 if (one_file_system) {
832 /* Room to save the dir's device for -x */
833 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
835 pool = dir_flist->file_pool;
837 pool = flist->file_pool;
839 #if EXTRA_ROUNDING > 0
840 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
841 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
844 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
846 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
848 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
850 file = (struct file_struct *)bp;
851 bp += FILE_STRUCT_LEN;
853 memcpy(bp, basename, basename_len);
854 bp += basename_len + linkname_len; /* skip space for symlink too */
856 #ifdef SUPPORT_HARD_LINKS
857 if (xflags & XMIT_HLINKED)
858 file->flags |= FLAG_HLINKED;
860 file->modtime = (time_t)modtime;
861 file->len32 = (uint32)file_length;
862 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
863 file->flags |= FLAG_LENGTH64;
864 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
871 file->flags |= gid_flags;
874 F_NDX(file) = flist->used + flist->ndx_start;
876 if (basename != thisname) {
877 file->dirname = lastdir;
878 F_DEPTH(file) = lastdir_depth + 1;
883 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
885 if (protocol_version >= 30) {
886 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
887 if (xflags & XMIT_TOP_DIR)
888 file->flags |= FLAG_TOP_DIR;
889 file->flags |= FLAG_CONTENT_DIR;
890 } else if (xflags & XMIT_TOP_DIR)
891 file->flags |= FLAG_IMPLIED_DIR;
892 } else if (xflags & XMIT_TOP_DIR) {
893 in_del_hier = recurse;
894 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
895 if (relative_paths && del_hier_name_len > 2
896 && lastname[del_hier_name_len-1] == '.'
897 && lastname[del_hier_name_len-2] == '/')
898 del_hier_name_len -= 2;
899 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
900 } else if (in_del_hier) {
901 if (!relative_paths || !del_hier_name_len
902 || (l1 >= del_hier_name_len
903 && lastname[del_hier_name_len] == '/'))
904 file->flags |= FLAG_CONTENT_DIR;
910 if ((preserve_devices && IS_DEVICE(mode))
911 || (preserve_specials && IS_SPECIAL(mode))) {
912 uint32 *devp = F_RDEV_P(file);
913 DEV_MAJOR(devp) = major(rdev);
914 DEV_MINOR(devp) = minor(rdev);
919 bp = (char*)file->basename + basename_len;
920 if (first_hlink_ndx >= flist->ndx_start) {
921 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
922 memcpy(bp, F_SYMLINK(first), linkname_len);
923 } else if (munge_symlinks) {
924 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
925 bp += SYMLINK_PREFIX_LEN;
926 linkname_len -= SYMLINK_PREFIX_LEN;
927 read_sbuf(f, bp, linkname_len - 1);
929 read_sbuf(f, bp, linkname_len - 1);
931 sanitize_path(bp, bp, "", lastdir_depth);
936 #ifdef SUPPORT_HARD_LINKS
937 if (preserve_hard_links && xflags & XMIT_HLINKED) {
938 if (protocol_version >= 30) {
939 if (xflags & XMIT_HLINK_FIRST) {
940 F_HL_GNUM(file) = flist->ndx_start + flist->used;
942 F_HL_GNUM(file) = first_hlink_ndx;
944 static int32 cnt = 0;
945 struct ht_int64_node *np;
948 if (protocol_version < 26) {
952 if (!(xflags & XMIT_SAME_DEV_pre30))
953 dev = read_longint(f);
954 ino = read_longint(f);
956 np = idev_find(dev, ino);
957 ndx = (int32)(long)np->data - 1;
960 np->data = (void*)(long)cnt;
962 F_HL_GNUM(file) = ndx;
967 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
971 /* Prior to 28, we get a useless set of nulls. */
974 if (first_hlink_ndx >= flist->ndx_start) {
975 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
976 memcpy(bp, F_SUM(first), checksum_len);
978 read_buf(f, bp, checksum_len);
982 if (preserve_acls && !S_ISLNK(mode))
983 receive_acl(file, f);
985 #ifdef SUPPORT_XATTRS
987 receive_xattr(file, f );
990 if (S_ISREG(mode) || S_ISLNK(mode))
991 stats.total_size += file_length;
996 /* Create a file_struct for a named file by reading its stat() information
997 * and performing extensive checks against global options.
999 * Returns a pointer to the new file struct, or NULL if there was an error
1000 * or this file should be excluded. */
1001 struct file_struct *make_file(const char *fname, struct file_list *flist,
1002 STRUCT_STAT *stp, int flags, int filter_level)
1004 static char *lastdir;
1005 static int lastdir_len = -1;
1006 struct file_struct *file;
1007 char thisname[MAXPATHLEN];
1008 char linkname[MAXPATHLEN];
1009 int alloc_len, basename_len, linkname_len;
1010 int extra_len = file_extra_cnt * EXTRA_LEN;
1011 const char *basename;
1016 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1017 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1020 clean_fname(thisname, 0);
1022 sanitize_path(thisname, thisname, "", 0);
1024 if (stp && S_ISDIR(stp->st_mode)) {
1025 st = *stp; /* Needed for "symlink/." with --relative. */
1026 *linkname = '\0'; /* make IBM code checker happy */
1027 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1028 int save_errno = errno;
1029 /* See if file is excluded before reporting an error. */
1030 if (filter_level != NO_FILTERS
1031 && (is_excluded(thisname, 0, filter_level)
1032 || is_excluded(thisname, 1, filter_level))) {
1033 if (ignore_perishable && save_errno != ENOENT)
1034 non_perishable_cnt++;
1037 if (save_errno == ENOENT) {
1038 #ifdef SUPPORT_LINKS
1039 /* Avoid "vanished" error if symlink points nowhere. */
1040 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1041 && S_ISLNK(st.st_mode)) {
1042 io_error |= IOERR_GENERAL;
1043 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1044 full_fname(thisname));
1048 enum logcode c = am_daemon && protocol_version < 28
1049 ? FERROR : FWARNING;
1050 io_error |= IOERR_VANISHED;
1051 rprintf(c, "file has vanished: %s\n",
1052 full_fname(thisname));
1055 io_error |= IOERR_GENERAL;
1056 rsyserr(FERROR_XFER, save_errno, "readlink %s failed",
1057 full_fname(thisname));
1062 /* backup.c calls us with filter_level set to NO_FILTERS. */
1063 if (filter_level == NO_FILTERS)
1066 if (S_ISDIR(st.st_mode)) {
1068 rprintf(FINFO, "skipping directory %s\n", thisname);
1071 /* -x only affects dirs because we need to avoid recursing
1072 * into a mount-point directory, not to avoid copying a
1073 * symlinked file if -L (or similar) was specified. */
1074 if (one_file_system && st.st_dev != filesystem_dev
1075 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1076 if (one_file_system > 1) {
1079 "[%s] skipping mount-point dir %s\n",
1080 who_am_i(), thisname);
1084 flags |= FLAG_MOUNT_DIR;
1085 flags &= ~FLAG_CONTENT_DIR;
1088 flags &= ~FLAG_CONTENT_DIR;
1090 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1091 if (ignore_perishable)
1092 non_perishable_cnt++;
1096 if (lp_ignore_nonreadable(module_id)) {
1097 #ifdef SUPPORT_LINKS
1098 if (!S_ISLNK(st.st_mode))
1100 if (access(thisname, R_OK) != 0)
1106 /* Only divert a directory in the main transfer. */
1108 if (flist->prev && S_ISDIR(st.st_mode)
1109 && flags & FLAG_DIVERT_DIRS) {
1110 /* Room for parent/sibling/next-child info. */
1111 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1113 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1114 pool = dir_flist->file_pool;
1116 pool = flist->file_pool;
1121 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1122 who_am_i(), thisname, filter_level);
1125 if ((basename = strrchr(thisname, '/')) != NULL) {
1126 int len = basename++ - thisname;
1127 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1128 lastdir = new_array(char, len + 1);
1129 memcpy(lastdir, thisname, len);
1130 lastdir[len] = '\0';
1134 basename = thisname;
1135 basename_len = strlen(basename) + 1; /* count the '\0' */
1137 #ifdef SUPPORT_LINKS
1138 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1143 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1144 extra_len += EXTRA_LEN;
1146 #if EXTRA_ROUNDING > 0
1147 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1148 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1151 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1154 bp = pool_alloc(pool, alloc_len, "make_file");
1156 if (!(bp = new_array(char, alloc_len)))
1157 out_of_memory("make_file");
1160 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1162 file = (struct file_struct *)bp;
1163 bp += FILE_STRUCT_LEN;
1165 memcpy(bp, basename, basename_len);
1166 bp += basename_len + linkname_len; /* skip space for symlink too */
1168 #ifdef SUPPORT_HARD_LINKS
1169 if (preserve_hard_links && flist && flist->prev) {
1170 if (protocol_version >= 28
1171 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1172 : S_ISREG(st.st_mode)) {
1173 tmp_dev = st.st_dev;
1174 tmp_ino = st.st_ino;
1180 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1181 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1182 tmp_rdev = st.st_rdev;
1187 file->flags = flags;
1188 file->modtime = st.st_mtime;
1189 file->len32 = (uint32)st.st_size;
1190 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1191 file->flags |= FLAG_LENGTH64;
1192 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1194 file->mode = st.st_mode;
1196 F_OWNER(file) = st.st_uid;
1198 F_GROUP(file) = st.st_gid;
1200 if (basename != thisname)
1201 file->dirname = lastdir;
1203 #ifdef SUPPORT_LINKS
1205 bp = (char*)file->basename + basename_len;
1206 memcpy(bp, linkname, linkname_len);
1210 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1211 file_checksum(thisname, tmp_sum, st.st_size);
1213 F_PATHNAME(file) = pathname;
1215 /* This code is only used by the receiver when it is building
1216 * a list of files for a delete pass. */
1217 if (keep_dirlinks && linkname_len && flist) {
1219 int save_mode = file->mode;
1220 file->mode = S_IFDIR; /* Find a directory with our name. */
1221 if (flist_find(dir_flist, file) >= 0
1222 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1223 file->modtime = st2.st_mtime;
1225 file->mode = st2.st_mode;
1227 F_OWNER(file) = st2.st_uid;
1229 F_GROUP(file) = st2.st_gid;
1231 file->mode = save_mode;
1234 if (basename_len == 0+1)
1238 F_NDX(file) = dir_count;
1243 /* Only called for temporary file_struct entries created by make_file(). */
1244 void unmake_file(struct file_struct *file)
1246 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1247 #if EXTRA_ROUNDING > 0
1248 if (extra_cnt & EXTRA_ROUNDING)
1249 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1251 free(REQ_EXTRA(file, extra_cnt));
1254 static struct file_struct *send_file_name(int f, struct file_list *flist,
1255 char *fname, STRUCT_STAT *stp,
1256 int flags, int filter_level)
1258 struct file_struct *file;
1259 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1263 file = make_file(fname, flist, stp, flags, filter_level);
1267 if (chmod_modes && !S_ISLNK(file->mode))
1268 file->mode = tweak_mode(file->mode, chmod_modes);
1271 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1272 sx.st.st_mode = file->mode;
1273 sx.acc_acl = sx.def_acl = NULL;
1274 if (get_acl(fname, &sx) < 0)
1278 #ifdef SUPPORT_XATTRS
1279 if (preserve_xattrs && f >= 0) {
1281 if (get_xattr(fname, &sx) < 0)
1286 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1288 flist_expand(flist, 1);
1289 flist->files[flist->used++] = file;
1291 if (S_ISDIR(file->mode))
1293 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1295 if (preserve_acls && !S_ISLNK(file->mode)) {
1300 #ifdef SUPPORT_XATTRS
1301 if (preserve_xattrs) {
1302 F_XATTR(file) = send_xattr(&sx, f);
1310 static void send_if_directory(int f, struct file_list *flist,
1311 struct file_struct *file,
1312 char *fbuf, unsigned int ol,
1315 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1317 if (S_ISDIR(file->mode)
1318 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1320 unsigned int len = strlen(fbuf);
1321 if (len > 1 && fbuf[len-1] == '/')
1323 if (len >= MAXPATHLEN - 1) {
1324 io_error |= IOERR_GENERAL;
1325 rprintf(FERROR_XFER, "skipping long-named directory: %s\n",
1329 save_filters = push_local_filters(fbuf, len);
1330 send_directory(f, flist, fbuf, len, flags);
1331 pop_local_filters(save_filters);
1338 static int file_compare(const void *file1, const void *file2)
1340 return f_name_cmp(*(struct file_struct **)file1,
1341 *(struct file_struct **)file2);
1344 /* The guts of a merge-sort algorithm. This was derived from the glibc
1345 * version, but I (Wayne) changed the merge code to do less copying and
1346 * to require only half the amount of temporary memory. */
1347 static void fsort_tmp(struct file_struct **fp, size_t num,
1348 struct file_struct **tmp)
1350 struct file_struct **f1, **f2, **t;
1359 fsort_tmp(f1, n1, tmp);
1361 fsort_tmp(f2, n2, tmp);
1363 while (f_name_cmp(*f1, *f2) <= 0) {
1370 memcpy(t, f1, n1 * PTR_SIZE);
1372 *f1++ = *f2++, n2--;
1374 while (n1 > 0 && n2 > 0) {
1375 if (f_name_cmp(*t, *f2) <= 0)
1378 *f1++ = *f2++, n2--;
1382 memcpy(f1, t, n1 * PTR_SIZE);
1385 /* This file-struct sorting routine makes sure that any identical names in
1386 * the file list stay in the same order as they were in the original list.
1387 * This is particularly vital in inc_recurse mode where we expect a sort
1388 * on the flist to match the exact order of a sort on the dir_flist. */
1389 static void fsort(struct file_struct **fp, size_t num)
1395 qsort(fp, num, PTR_SIZE, file_compare);
1397 struct file_struct **tmp = new_array(struct file_struct *,
1399 fsort_tmp(fp, num, tmp);
1404 /* We take an entire set of sibling dirs from the sorted flist and link them
1405 * into the tree, setting the appropriate parent/child/sibling pointers. */
1406 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1411 int32 *parent_dp = parent_ndx < 0 ? NULL
1412 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1414 flist_expand(dir_flist, dir_cnt);
1415 dir_flist->sorted = dir_flist->files;
1417 for (i = 0; dir_cnt; i++) {
1418 struct file_struct *file = from_flist->sorted[i];
1420 if (!S_ISDIR(file->mode))
1423 dir_flist->files[dir_flist->used++] = file;
1426 if (file->basename[0] == '.' && file->basename[1] == '\0')
1430 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1432 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1434 send_dir_ndx = dir_flist->used - 1;
1436 dp = F_DIR_NODE_P(file);
1437 DIR_PARENT(dp) = parent_ndx;
1438 DIR_FIRST_CHILD(dp) = -1;
1441 DIR_NEXT_SIBLING(dp) = -1;
1444 /* This function is normally called by the sender, but the receiving side also
1445 * calls it from get_dirlist() with f set to -1 so that we just construct the
1446 * file list in memory without sending it over the wire. Also, get_dirlist()
1447 * might call this with f set to -2, which also indicates that local filter
1448 * rules should be ignored. */
1449 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1456 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1457 int start = flist->used;
1458 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1460 assert(flist != NULL);
1462 if (!(d = opendir(fbuf))) {
1463 io_error |= IOERR_GENERAL;
1464 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1469 if (len != 1 || *fbuf != '/')
1472 remainder = MAXPATHLEN - (p - fbuf);
1474 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1475 char *dname = d_name(di);
1476 if (dname[0] == '.' && (dname[1] == '\0'
1477 || (dname[1] == '.' && dname[2] == '\0')))
1479 if (strlcpy(p, dname, remainder) >= remainder) {
1480 io_error |= IOERR_GENERAL;
1482 "cannot send long-named file %s\n",
1486 if (dname[0] == '\0') {
1487 io_error |= IOERR_GENERAL;
1489 "cannot send file with empty name in %s\n",
1494 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1500 io_error |= IOERR_GENERAL;
1501 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1506 if (f >= 0 && recurse && !divert_dirs) {
1507 int i, end = flist->used - 1;
1508 /* send_if_directory() bumps flist->used, so use "end". */
1509 for (i = start; i <= end; i++)
1510 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1514 static char lastpath[MAXPATHLEN] = "";
1515 static int lastpath_len = 0;
1516 static struct file_struct *lastpath_struct;
1518 static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1519 char *start, char *limit, int flags, char name_type)
1521 struct file_struct *file;
1522 item_list *relname_list;
1523 relnamecache **rnpp;
1525 int len, need_new_dir;
1527 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1530 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1531 && lastpath_len == limit - fname
1532 && strncmp(lastpath, fname, lastpath_len) == 0)
1540 int save_copy_links = copy_links;
1541 int save_xfer_dirs = xfer_dirs;
1543 copy_links = xfer_dirs = 1;
1547 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1549 send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1553 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1555 if (file && !S_ISDIR(file->mode))
1557 lastpath_struct = file;
1560 strlcpy(lastpath, fname, sizeof lastpath);
1561 lastpath_len = limit - fname;
1565 copy_links = save_copy_links;
1566 xfer_dirs = save_xfer_dirs;
1572 if (!lastpath_struct)
1573 return; /* dir must have vanished */
1575 len = strlen(limit+1);
1576 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1577 if (!relname_list) {
1578 if (!(relname_list = new0(item_list)))
1579 out_of_memory("send_implied_dirs");
1580 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1582 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1583 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1584 out_of_memory("send_implied_dirs");
1585 (*rnpp)->name_type = name_type;
1586 strlcpy((*rnpp)->fname, limit+1, len + 1);
1589 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1591 char fbuf[MAXPATHLEN];
1592 item_list *relname_list;
1593 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1597 dlen = strlen(fbuf);
1599 if (F_PATHNAME(file) != pathname) {
1600 if (!push_pathname(F_PATHNAME(file), -1))
1601 exit_cleanup(RERR_FILESELECT);
1604 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1606 if (file->flags & FLAG_CONTENT_DIR) {
1607 if (one_file_system) {
1609 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1610 io_error |= IOERR_GENERAL;
1611 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1615 filesystem_dev = st.st_dev;
1617 send_directory(f, flist, fbuf, dlen, flags);
1620 if (!relative_paths)
1623 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1627 for (j = 0; j < relname_list->count; j++) {
1629 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1630 char name_type = rnp->name_type;
1633 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1635 if (len >= (int)sizeof fbuf)
1636 continue; /* Impossible... */
1638 slash = strchr(fbuf+dlen+1, '/');
1640 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1644 if (name_type != NORMAL_NAME) {
1646 if (link_stat(fbuf, &st, 1) != 0) {
1647 io_error |= IOERR_GENERAL;
1648 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1652 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1654 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1660 void send_extra_file_list(int f, int at_least)
1662 struct file_list *flist;
1665 int old_cnt, save_io_error = io_error;
1670 /* Keep sending data until we have the requested number of
1671 * files in the upcoming file-lists. */
1672 old_cnt = cur_flist->used;
1673 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1674 old_cnt += flist->used;
1675 while (file_total - old_cnt < at_least) {
1676 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1677 int dir_ndx, dstart = dir_count;
1678 const char *pathname = F_PATHNAME(file);
1681 flist = flist_new(0, "send_extra_file_list");
1682 start_write = stats.total_written;
1685 dir_ndx = F_NDX(file);
1687 dir_ndx = send_dir_ndx;
1688 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1689 flist->parent_ndx = dir_ndx;
1691 send1extra(f, file, flist);
1692 prev_flags = file->flags;
1693 dp = F_DIR_NODE_P(file);
1695 /* If there are any duplicate directory names that follow, we
1696 * send all the dirs together in one file-list. The dir_flist
1697 * tree links all the child subdirs onto the last dup dir. */
1698 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1699 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1700 send_dir_ndx = dir_ndx;
1701 file = dir_flist->sorted[dir_ndx];
1702 /* Try to avoid some duplicate scanning of identical dirs. */
1703 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1704 file->flags &= ~FLAG_CONTENT_DIR;
1705 send1extra(f, file, flist);
1706 prev_flags = file->flags;
1707 dp = F_DIR_NODE_P(file);
1712 if (need_unsorted_flist) {
1713 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1714 out_of_memory("send_extra_file_list");
1715 memcpy(flist->sorted, flist->files,
1716 flist->used * sizeof (struct file_struct*));
1718 flist->sorted = flist->files;
1720 flist_sort_and_clean(flist, 0);
1722 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1723 flist_done_allocating(flist);
1725 file_total += flist->used;
1726 stats.flist_size += stats.total_written - start_write;
1727 stats.num_files += flist->used;
1729 output_flist(flist);
1731 if (DIR_FIRST_CHILD(dp) >= 0) {
1732 send_dir_ndx = DIR_FIRST_CHILD(dp);
1735 while (DIR_NEXT_SIBLING(dp) < 0) {
1736 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1737 write_ndx(f, NDX_FLIST_EOF);
1739 change_local_filter_dir(NULL, 0, 0);
1743 file = dir_flist->sorted[send_dir_ndx];
1744 dp = F_DIR_NODE_P(file);
1746 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1751 if (io_error != save_io_error && !ignore_errors)
1752 send_msg_int(MSG_IO_ERROR, io_error);
1755 struct file_list *send_file_list(int f, int argc, char *argv[])
1757 static const char *lastdir;
1758 static int lastdir_len = -1;
1762 struct file_list *flist;
1763 struct timeval start_tv, end_tv;
1766 int disable_buffering;
1767 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1768 int reading_remotely = filesfrom_host != NULL;
1769 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1771 | (filesfrom_convert ? RL_CONVERT : 0)
1773 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1775 rprintf(FLOG, "building file list\n");
1776 if (show_filelist_p())
1777 start_filelist_progress("building file list");
1778 else if (inc_recurse && verbose && !am_server)
1779 rprintf(FCLIENT, "sending incremental file list\n");
1781 start_write = stats.total_written;
1782 gettimeofday(&start_tv, NULL);
1784 if (relative_paths && protocol_version >= 30)
1785 implied_dirs = 1; /* We send flagged implied dirs */
1787 #ifdef SUPPORT_HARD_LINKS
1788 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1792 flist = cur_flist = flist_new(0, "send_file_list");
1794 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1795 flags |= FLAG_DIVERT_DIRS;
1797 dir_flist = cur_flist;
1799 disable_buffering = io_start_buffering_out(f);
1800 if (filesfrom_fd >= 0) {
1801 if (argv[0] && !push_dir(argv[0], 0)) {
1802 rsyserr(FERROR_XFER, errno, "push_dir %s failed in %s",
1803 full_fname(argv[0]), curr_dir);
1804 exit_cleanup(RERR_FILESELECT);
1810 char fbuf[MAXPATHLEN], *fn, name_type;
1813 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
1815 sanitize_path(fbuf, fbuf, "", 0);
1819 strlcpy(fbuf, *argv++, MAXPATHLEN);
1821 sanitize_path(fbuf, fbuf, "", 0);
1825 if (relative_paths) {
1826 /* We clean up fbuf below. */
1827 name_type = NORMAL_NAME;
1828 } else if (!len || fbuf[len - 1] == '/') {
1829 if (len == 2 && fbuf[0] == '.') {
1830 /* Turn "./" into just "." rather than "./." */
1833 if (len + 1 >= MAXPATHLEN)
1834 overflow_exit("send_file_list");
1838 name_type = DOT_NAME;
1839 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1840 && (len == 2 || fbuf[len-3] == '/')) {
1841 if (len + 2 >= MAXPATHLEN)
1842 overflow_exit("send_file_list");
1846 name_type = DOT_NAME;
1847 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
1848 name_type = DOT_NAME;
1850 name_type = NORMAL_NAME;
1854 if (!relative_paths) {
1855 p = strrchr(fbuf, '/');
1862 len -= p - fbuf + 1;
1867 if ((p = strstr(fbuf, "/./")) != NULL) {
1877 *--fn = '\0'; /* ensure room for '.' */
1880 len = clean_fname(fn, CFN_KEEP_LEADING_DOT_DIR
1881 | CFN_KEEP_TRAILING_SLASH
1882 | CFN_DROP_TRAILING_DOT_DIR);
1887 name_type = DOT_NAME;
1888 } else if (fn[0] == '.')
1889 name_type = DOT_NAME;
1890 } else if (fn[len-1] == '/') {
1892 if (len == 1 && *fn == '.')
1893 name_type = DOT_NAME;
1895 name_type = SLASH_ENDING_NAME;
1897 /* Reject a ".." dir in the active part of the path. */
1898 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1899 if ((p[2] == '/' || p[2] == '\0')
1900 && (p == fn || p[-1] == '/')) {
1902 "found \"..\" dir in relative path: %s\n",
1904 exit_cleanup(RERR_SYNTAX);
1912 name_type = DOT_NAME;
1915 dirlen = dir ? strlen(dir) : 0;
1916 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1917 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1920 lastdir_len = pathname_len;
1921 } else if (!push_pathname(lastdir, lastdir_len))
1925 memmove(fbuf, fn, len + 1);
1927 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0) {
1928 io_error |= IOERR_GENERAL;
1929 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1934 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1935 rprintf(FINFO, "skipping directory %s\n", fbuf);
1939 if (inc_recurse && relative_paths && *fbuf) {
1940 if ((p = strchr(fbuf+1, '/')) != NULL) {
1941 if (p - fbuf == 1 && *fbuf == '.') {
1942 if ((fn = strchr(p+1, '/')) != NULL)
1946 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
1950 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1951 /* Send the implied directories at the start of the
1952 * source spec, so we get their permissions right. */
1953 char *lp = lastpath, *slash = fbuf;
1955 /* Skip any initial directories in our path that we
1956 * have in common with lastpath. */
1957 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1962 if (fn != p || (*lp && *lp != '/'))
1963 send_implied_dirs(f, flist, fbuf, slash, p, flags, 0);
1966 if (one_file_system)
1967 filesystem_dev = st.st_dev;
1969 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
1970 struct file_struct *file;
1971 int top_flags = FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags;
1972 file = send_file_name(f, flist, fbuf, &st,
1973 top_flags, ALL_FILTERS);
1975 if (name_type == DOT_NAME) {
1976 if (send_dir_depth < 0) {
1978 change_local_filter_dir(fbuf, len, send_dir_depth);
1980 send_directory(f, flist, fbuf, len, flags);
1983 send_if_directory(f, flist, file, fbuf, len, flags);
1985 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1988 gettimeofday(&end_tv, NULL);
1989 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1990 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1991 if (stats.flist_buildtime == 0)
1992 stats.flist_buildtime = 1;
1995 write_byte(f, 0); /* Indicate end of file list */
1997 #ifdef SUPPORT_HARD_LINKS
1998 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2002 if (show_filelist_p())
2003 finish_filelist_progress(flist);
2005 gettimeofday(&end_tv, NULL);
2006 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2007 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2009 /* When converting names, both sides keep an unsorted file-list array
2010 * because the names will differ on the sending and receiving sides
2011 * (both sides will use the unsorted index number for each item). */
2013 /* Sort the list without removing any duplicates. This allows the
2014 * receiving side to ask for whatever name it kept. For incremental
2015 * recursion mode, the sender marks duplicate dirs so that it can
2016 * send them together in a single file-list. */
2017 if (need_unsorted_flist) {
2018 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2019 out_of_memory("send_file_list");
2020 memcpy(flist->sorted, flist->files,
2021 flist->used * sizeof (struct file_struct*));
2023 flist->sorted = flist->files;
2024 flist_sort_and_clean(flist, 0);
2025 file_total += flist->used;
2027 if (!numeric_ids && !inc_recurse)
2030 /* send the io_error flag */
2031 if (protocol_version < 30)
2032 write_int(f, ignore_errors ? 0 : io_error);
2033 else if (io_error && !ignore_errors)
2034 send_msg_int(MSG_IO_ERROR, io_error);
2036 if (disable_buffering)
2037 io_end_buffering_out();
2039 stats.flist_size = stats.total_written - start_write;
2040 stats.num_files = flist->used;
2043 output_flist(flist);
2046 rprintf(FINFO, "send_file_list done\n");
2050 add_dirs_to_tree(-1, flist, dir_count);
2051 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2052 flist->parent_ndx = -1;
2053 flist_done_allocating(flist);
2054 if (send_dir_ndx < 0) {
2055 write_ndx(f, NDX_FLIST_EOF);
2058 else if (file_total == 1) {
2059 /* If we're creating incremental file-lists and there
2060 * was just 1 item in the first file-list, send 1 more
2061 * file-list to check if this is a 1-file xfer. */
2062 send_extra_file_list(f, 1);
2069 struct file_list *recv_file_list(int f)
2071 struct file_list *flist;
2076 rprintf(FLOG, "receiving file list\n");
2077 if (show_filelist_p())
2078 start_filelist_progress("receiving file list");
2079 else if (inc_recurse && verbose && !am_server && !first_flist)
2080 rprintf(FCLIENT, "receiving incremental file list\n");
2082 start_read = stats.total_read;
2084 #ifdef SUPPORT_HARD_LINKS
2085 if (preserve_hard_links && !first_flist)
2089 flist = flist_new(0, "recv_file_list");
2092 if (flist->ndx_start == 1)
2093 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2094 dstart = dir_flist->used;
2100 while ((flags = read_byte(f)) != 0) {
2101 struct file_struct *file;
2103 flist_expand(flist, 1);
2105 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2106 flags |= read_byte(f) << 8;
2107 file = recv_file_entry(flist, flags, f);
2109 if (inc_recurse && S_ISDIR(file->mode)) {
2110 flist_expand(dir_flist, 1);
2111 dir_flist->files[dir_flist->used++] = file;
2114 flist->files[flist->used++] = file;
2116 maybe_emit_filelist_progress(flist->used);
2119 rprintf(FINFO, "recv_file_name(%s)\n",
2120 f_name(file, NULL));
2123 file_total += flist->used;
2126 rprintf(FINFO, "received %d names\n", flist->used);
2128 if (show_filelist_p())
2129 finish_filelist_progress(flist);
2131 if (need_unsorted_flist) {
2132 /* Create an extra array of index pointers that we can sort for
2133 * the generator's use (for wading through the files in sorted
2134 * order and for calling flist_find()). We keep the "files"
2135 * list unsorted for our exchange of index numbers with the
2136 * other side (since their names may not sort the same). */
2137 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2138 out_of_memory("recv_file_list");
2139 memcpy(flist->sorted, flist->files,
2140 flist->used * sizeof (struct file_struct*));
2141 if (inc_recurse && dir_flist->used > dstart) {
2142 static int dir_flist_malloced = 0;
2143 if (dir_flist_malloced < dir_flist->malloced) {
2144 dir_flist->sorted = realloc_array(dir_flist->sorted,
2145 struct file_struct *,
2146 dir_flist->malloced);
2147 dir_flist_malloced = dir_flist->malloced;
2149 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2150 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2151 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2154 flist->sorted = flist->files;
2155 if (inc_recurse && dir_flist->used > dstart) {
2156 dir_flist->sorted = dir_flist->files;
2157 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2162 flist_done_allocating(flist);
2164 recv_id_list(f, flist);
2166 flist_sort_and_clean(flist, relative_paths);
2168 if (protocol_version < 30) {
2169 /* Recv the io_error flag */
2173 io_error |= read_int(f);
2174 } else if (inc_recurse && flist->ndx_start == 1) {
2175 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2176 flist->parent_ndx = -1;
2180 output_flist(flist);
2183 rprintf(FINFO, "recv_file_list done\n");
2185 stats.flist_size += stats.total_read - start_read;
2186 stats.num_files += flist->used;
2191 /* This is only used once by the receiver if the very first file-list
2192 * has exactly one item in it. */
2193 void recv_additional_file_list(int f)
2195 struct file_list *flist;
2196 int ndx = read_ndx(f);
2197 if (ndx == NDX_FLIST_EOF) {
2199 change_local_filter_dir(NULL, 0, 0);
2201 ndx = NDX_FLIST_OFFSET - ndx;
2202 if (ndx < 0 || ndx >= dir_flist->used) {
2203 ndx = NDX_FLIST_OFFSET - ndx;
2205 "[%s] Invalid dir index: %d (%d - %d)\n",
2206 who_am_i(), ndx, NDX_FLIST_OFFSET,
2207 NDX_FLIST_OFFSET - dir_flist->used + 1);
2208 exit_cleanup(RERR_PROTOCOL);
2211 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2214 flist = recv_file_list(f);
2215 flist->parent_ndx = ndx;
2219 /* Search for an identically-named item in the file list. Note that the
2220 * items must agree in their directory-ness, or no match is returned. */
2221 int flist_find(struct file_list *flist, struct file_struct *f)
2223 int low = flist->low, high = flist->high;
2224 int diff, mid, mid_up;
2226 while (low <= high) {
2227 mid = (low + high) / 2;
2228 if (F_IS_ACTIVE(flist->sorted[mid]))
2231 /* Scan for the next non-empty entry using the cached
2232 * distance values. If the value isn't fully up-to-
2233 * date, update it. */
2234 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2235 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2237 mid_up += F_DEPTH(flist->sorted[mid_up]);
2238 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2239 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2241 if (mid_up > high) {
2242 /* If there's nothing left above us, set high to
2243 * a non-empty entry below us and continue. */
2244 high = mid - (int)flist->sorted[mid]->len32;
2245 if (!F_IS_ACTIVE(flist->sorted[high])) {
2247 high -= (int)flist->sorted[high]->len32;
2248 } while (!F_IS_ACTIVE(flist->sorted[high]));
2249 flist->sorted[mid]->len32 = mid - high;
2254 diff = f_name_cmp(flist->sorted[mid_up], f);
2256 if (protocol_version < 29
2257 && S_ISDIR(flist->sorted[mid_up]->mode)
2258 != S_ISDIR(f->mode))
2271 * Free up any resources a file_struct has allocated
2272 * and clear the file.
2274 void clear_file(struct file_struct *file)
2276 /* The +1 zeros out the first char of the basename. */
2277 memset(file, 0, FILE_STRUCT_LEN + 1);
2278 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2279 * entry. Likewise for len32 in the opposite direction. We assume
2280 * that we're alone for now since flist_find() will adjust the counts
2281 * it runs into that aren't up-to-date. */
2282 file->len32 = F_DEPTH(file) = 1;
2285 /* Allocate a new file list. */
2286 struct file_list *flist_new(int flags, char *msg)
2288 struct file_list *flist;
2290 if (!(flist = new0(struct file_list)))
2293 if (flags & FLIST_TEMP) {
2294 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2295 out_of_memory, POOL_INTERN)))
2298 /* This is a doubly linked list with prev looping back to
2299 * the end of the list, but the last next pointer is NULL. */
2301 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2302 out_of_memory, POOL_INTERN);
2303 if (!flist->file_pool)
2306 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2308 first_flist = cur_flist = flist->prev = flist;
2310 struct file_list *prev = first_flist->prev;
2312 flist->file_pool = first_flist->file_pool;
2314 flist->ndx_start = prev->ndx_start + prev->used + 1;
2315 flist->flist_num = prev->flist_num + 1;
2318 prev->next = first_flist->prev = flist;
2320 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2327 /* Free up all elements in a flist. */
2328 void flist_free(struct file_list *flist)
2331 /* Was FLIST_TEMP dir-list. */
2332 } else if (flist == flist->prev) {
2333 first_flist = cur_flist = NULL;
2337 if (flist == cur_flist)
2338 cur_flist = flist->next;
2339 if (flist == first_flist)
2340 first_flist = first_flist->next;
2342 flist->prev->next = flist->next;
2344 flist->next = first_flist;
2346 flist->next->prev = flist->prev;
2347 file_total -= flist->used;
2351 if (!flist->prev || !flist_cnt)
2352 pool_destroy(flist->file_pool);
2354 pool_free_old(flist->file_pool, flist->pool_boundary);
2356 if (flist->sorted && flist->sorted != flist->files)
2357 free(flist->sorted);
2362 /* This routine ensures we don't have any duplicate names in our file list.
2363 * duplicate names can cause corruption because of the pipelining. */
2364 static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2366 char fbuf[MAXPATHLEN];
2371 if (flist->used == 0) {
2377 fsort(flist->sorted, flist->used);
2379 if (!am_sender || inc_recurse) {
2380 for (i = prev_i = 0; i < flist->used; i++) {
2381 if (F_IS_ACTIVE(flist->sorted[i])) {
2386 flist->low = prev_i;
2388 i = prev_i = flist->used - 1;
2392 while (++i < flist->used) {
2394 struct file_struct *file = flist->sorted[i];
2396 if (!F_IS_ACTIVE(file))
2398 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2400 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2401 int save_mode = file->mode;
2402 /* Make sure that this directory doesn't duplicate a
2403 * non-directory earlier in the list. */
2404 flist->high = prev_i;
2405 file->mode = S_IFREG;
2406 j = flist_find(flist, file);
2407 file->mode = save_mode;
2412 /* If one is a dir and the other is not, we want to
2413 * keep the dir because it might have contents in the
2414 * list. Otherwise keep the first one. */
2415 if (S_ISDIR(file->mode)) {
2416 struct file_struct *fp = flist->sorted[j];
2417 if (!S_ISDIR(fp->mode))
2421 file->flags |= FLAG_DUPLICATE;
2422 else { /* Make sure we merge our vital flags. */
2423 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2424 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2434 "removing duplicate name %s from file list (%d)\n",
2435 f_name(file, fbuf), drop + flist->ndx_start);
2437 clear_file(flist->sorted[drop]);
2441 if (flist->low == drop) {
2443 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2452 flist->high = prev_i;
2455 /* We need to strip off the leading slashes for relative
2456 * paths, but this must be done _after_ the sorting phase. */
2457 for (i = flist->low; i <= flist->high; i++) {
2458 struct file_struct *file = flist->sorted[i];
2462 while (*file->dirname == '/')
2464 if (!*file->dirname)
2465 file->dirname = NULL;
2469 if (prune_empty_dirs && !am_sender) {
2470 int j, prev_depth = 0;
2472 prev_i = 0; /* It's OK that this isn't really true. */
2474 for (i = flist->low; i <= flist->high; i++) {
2475 struct file_struct *fp, *file = flist->sorted[i];
2477 /* This temporarily abuses the F_DEPTH() value for a
2478 * directory that is in a chain that might get pruned.
2479 * We restore the old value if it gets a reprieve. */
2480 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2481 /* Dump empty dirs when coming back down. */
2482 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2483 fp = flist->sorted[prev_i];
2484 if (F_DEPTH(fp) >= 0)
2486 prev_i = -F_DEPTH(fp)-1;
2489 prev_depth = F_DEPTH(file);
2490 if (is_excluded(f_name(file, fbuf), 1,
2492 /* Keep dirs through this dir. */
2493 for (j = prev_depth-1; ; j--) {
2494 fp = flist->sorted[prev_i];
2495 if (F_DEPTH(fp) >= 0)
2497 prev_i = -F_DEPTH(fp)-1;
2501 F_DEPTH(file) = -prev_i-1;
2504 /* Keep dirs through this non-dir. */
2505 for (j = prev_depth; ; j--) {
2506 fp = flist->sorted[prev_i];
2507 if (F_DEPTH(fp) >= 0)
2509 prev_i = -F_DEPTH(fp)-1;
2514 /* Dump all remaining empty dirs. */
2516 struct file_struct *fp = flist->sorted[prev_i];
2517 if (F_DEPTH(fp) >= 0)
2519 prev_i = -F_DEPTH(fp)-1;
2523 for (i = flist->low; i <= flist->high; i++) {
2524 if (F_IS_ACTIVE(flist->sorted[i]))
2528 for (i = flist->high; i >= flist->low; i--) {
2529 if (F_IS_ACTIVE(flist->sorted[i]))
2536 static void output_flist(struct file_list *flist)
2538 char uidbuf[16], gidbuf[16], depthbuf[16];
2539 struct file_struct *file;
2540 const char *root, *dir, *slash, *name, *trail;
2541 const char *who = who_am_i();
2544 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2545 who, flist->ndx_start, flist->used, flist->low, flist->high);
2546 for (i = 0; i < flist->used; i++) {
2547 file = flist->files[i];
2548 if ((am_root || am_sender) && uid_ndx) {
2549 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2554 static char parens[] = "(\0)\0\0\0";
2555 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2556 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2557 pp, F_GROUP(file), pp + 2);
2561 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2562 if (F_IS_ACTIVE(file)) {
2563 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2564 if ((dir = file->dirname) == NULL)
2568 name = file->basename;
2569 trail = S_ISDIR(file->mode) ? "/" : "";
2571 root = dir = slash = name = trail = "";
2573 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2574 who, i + flist->ndx_start,
2575 root, dir, slash, name, trail,
2576 (int)file->mode, (double)F_LENGTH(file),
2577 uidbuf, gidbuf, file->flags);
2581 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2582 enum fnc_type { t_PATH, t_ITEM };
2584 static int found_prefix;
2586 /* Compare the names of two file_struct entities, similar to how strcmp()
2587 * would do if it were operating on the joined strings.
2589 * Some differences beginning with protocol_version 29: (1) directory names
2590 * are compared with an assumed trailing slash so that they compare in a
2591 * way that would cause them to sort immediately prior to any content they
2592 * may have; (2) a directory of any name compares after a non-directory of
2593 * any name at the same depth; (3) a directory with name "." compares prior
2594 * to anything else. These changes mean that a directory and a non-dir
2595 * with the same name will not compare as equal (protocol_version >= 29).
2597 * The dirname component can be an empty string, but the basename component
2598 * cannot (and never is in the current codebase). The basename component
2599 * may be NULL (for a removed item), in which case it is considered to be
2600 * after any existing item. */
2601 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2604 const uchar *c1, *c2;
2605 enum fnc_state state1, state2;
2606 enum fnc_type type1, type2;
2607 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2609 if (!f1 || !F_IS_ACTIVE(f1)) {
2610 if (!f2 || !F_IS_ACTIVE(f2))
2614 if (!f2 || !F_IS_ACTIVE(f2))
2617 c1 = (uchar*)f1->dirname;
2618 c2 = (uchar*)f2->dirname;
2622 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2623 c1 = (const uchar*)f1->basename;
2624 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2626 state1 = s_TRAILING;
2635 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2636 c2 = (const uchar*)f2->basename;
2637 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2639 state2 = s_TRAILING;
2649 return type1 == t_PATH ? 1 : -1;
2659 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2660 c1 = (const uchar*)f1->basename;
2661 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2663 state1 = s_TRAILING;
2669 state1 = s_TRAILING;
2670 if (type1 == t_PATH) {
2679 if (*c2 && type1 != type2)
2680 return type1 == t_PATH ? 1 : -1;
2689 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2690 c2 = (const uchar*)f2->basename;
2691 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2693 state2 = s_TRAILING;
2699 state2 = s_TRAILING;
2700 if (type2 == t_PATH) {
2713 return type1 == t_PATH ? 1 : -1;
2715 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2720 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2721 * not match if f2's basename is not an exact match of a path element in f1.
2722 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2723 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2727 return found_prefix;
2730 char *f_name_buf(void)
2732 static char names[5][MAXPATHLEN];
2733 static unsigned int n;
2735 n = (n + 1) % (sizeof names / sizeof names[0]);
2740 /* Return a copy of the full filename of a flist entry, using the indicated
2741 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2742 * done because we checked the size when creating the file_struct entry.
2744 char *f_name(const struct file_struct *f, char *fbuf)
2746 if (!f || !F_IS_ACTIVE(f))
2750 fbuf = f_name_buf();
2753 int len = strlen(f->dirname);
2754 memcpy(fbuf, f->dirname, len);
2756 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2758 strlcpy(fbuf, f->basename, MAXPATHLEN);
2763 /* Do a non-recursive scan of the named directory, possibly ignoring all
2764 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2765 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2766 * buffer (the functions we call will append names onto the end, but the old
2767 * dir value will be restored on exit). */
2768 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2770 struct file_list *dirlist;
2771 char dirbuf[MAXPATHLEN];
2772 int save_recurse = recurse;
2773 int save_xfer_dirs = xfer_dirs;
2774 int save_prune_empty_dirs = prune_empty_dirs;
2777 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2778 if (dlen >= MAXPATHLEN)
2783 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2787 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2788 xfer_dirs = save_xfer_dirs;
2789 recurse = save_recurse;
2791 flist_count_offset += dirlist->used;
2793 prune_empty_dirs = 0;
2794 dirlist->sorted = dirlist->files;
2795 flist_sort_and_clean(dirlist, 0);
2796 prune_empty_dirs = save_prune_empty_dirs;
2799 output_flist(dirlist);