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 filesfrom_convert;
79 extern int need_unsorted_flist;
80 extern iconv_t ic_send, ic_recv;
83 #define PTR_SIZE (sizeof (struct file_struct *))
87 dev_t filesystem_dev; /* used to implement -x */
89 struct file_list *cur_flist, *first_flist, *dir_flist;
90 int send_dir_ndx = -1, send_dir_depth = -1;
91 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
92 int file_total = 0; /* total of all active items over all file-lists */
93 int flist_eof = 0; /* all the file-lists are now known */
96 #define SLASH_ENDING_NAME 1
99 /* Starting from protocol version 26, we always use 64-bit ino_t and dev_t
100 * internally, even if this platform does not allow files to have 64-bit inums.
101 * The only exception is if we're on a platform with no 64-bit type at all.
103 * Because we use read_longint() to get these off the wire, if you transfer
104 * devices or (for protocols < 30) hardlinks with dev or inum > 2**32 to a
105 * machine with no 64-bit types then you will get an overflow error.
107 * Note that if you transfer devices from a 64-bit-devt machine (say, Solaris)
108 * to a 32-bit-devt machine (say, Linux-2.2/x86) then the device numbers will
109 * be truncated. But it's a kind of silly thing to do anyhow. */
111 /* The tmp_* vars are used as a cache area by make_file() to store data
112 * that the sender doesn't need to remember in its file list. The data
113 * will survive just long enough to be used by send_file_entry(). */
114 static dev_t tmp_rdev;
115 #ifdef SUPPORT_HARD_LINKS
116 static int64 tmp_dev, tmp_ino;
118 static char tmp_sum[MAX_DIGEST_LEN];
120 static char empty_sum[MAX_DIGEST_LEN];
121 static int flist_count_offset; /* for --delete --progress */
122 static int dir_count = 0;
123 static int high_hlink_ndx;
125 static void clean_flist(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);
206 return x_stat(path, stp, NULL);
210 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
214 return x_stat(path, stp, NULL);
215 if (x_lstat(path, stp, NULL) < 0)
217 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
219 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
224 return x_stat(path, stp, NULL);
228 /* This function is used to check if a file should be included/excluded
229 * from the list of files based on its name and type etc. The value of
230 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
231 static int is_excluded(char *fname, int is_dir, int filter_level)
233 #if 0 /* This currently never happens, so avoid a useless compare. */
234 if (filter_level == NO_FILTERS)
238 /* never exclude '.', even if somebody does --exclude '*' */
239 if (fname[0] == '.' && !fname[1])
241 /* Handle the -R version of the '.' dir. */
242 if (fname[0] == '/') {
243 int len = strlen(fname);
244 if (fname[len-1] == '.' && fname[len-2] == '/')
248 if (server_filter_list.head
249 && check_filter(&server_filter_list, fname, is_dir) < 0)
251 if (filter_level != ALL_FILTERS)
254 && check_filter(&filter_list, fname, is_dir) < 0)
259 static void send_directory(int f, struct file_list *flist,
260 char *fbuf, int len, int flags);
262 static const char *pathname, *orig_dir;
263 static int pathname_len;
266 /* Make sure flist can hold at least flist->used + extra entries. */
267 static void flist_expand(struct file_list *flist, int extra)
269 struct file_struct **new_ptr;
271 if (flist->used + extra <= flist->malloced)
274 if (flist->malloced < FLIST_START)
275 flist->malloced = FLIST_START;
276 else if (flist->malloced >= FLIST_LINEAR)
277 flist->malloced += FLIST_LINEAR;
279 flist->malloced *= 2;
281 /* In case count jumped or we are starting the list
282 * with a known size just set it. */
283 if (flist->malloced < flist->used + extra)
284 flist->malloced = flist->used + extra;
286 new_ptr = realloc_array(flist->files, struct file_struct *,
289 if (verbose >= 2 && flist->malloced != FLIST_START) {
290 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
292 (double)sizeof flist->files[0] * flist->malloced,
293 (new_ptr == flist->files) ? " not" : "");
296 flist->files = new_ptr;
299 out_of_memory("flist_expand");
302 static void flist_done_allocating(struct file_list *flist)
304 void *ptr = pool_boundary(flist->file_pool, 8*1024);
305 if (flist->pool_boundary == ptr)
306 flist->pool_boundary = NULL; /* list didn't use any pool memory */
308 flist->pool_boundary = ptr;
311 int push_pathname(const char *dir, int len)
317 orig_dir = strdup(curr_dir);
319 if (pathname && !pop_dir(orig_dir)) {
320 rsyserr(FERROR, errno, "pop_dir %s failed",
321 full_fname(orig_dir));
322 exit_cleanup(RERR_FILESELECT);
325 if (dir && !push_dir(dir, 0)) {
326 io_error |= IOERR_GENERAL;
327 rsyserr(FERROR, errno, "push_dir %s failed in %s",
328 full_fname(dir), curr_dir);
333 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
338 static void send_file_entry(int f, struct file_struct *file, int ndx, int first_ndx)
340 static time_t modtime;
342 #ifdef SUPPORT_HARD_LINKS
346 static uint32 rdev_major;
349 static char *user_name, *group_name;
350 static char lastname[MAXPATHLEN];
351 char fname[MAXPATHLEN];
352 int first_hlink_ndx = -1;
357 if (ic_send != (iconv_t)-1) {
360 INIT_CONST_XBUF(outbuf, fname);
363 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
364 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
365 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
368 outbuf.buf[outbuf.len++] = '/';
371 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
372 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
374 io_error |= IOERR_GENERAL;
376 "[%s] cannot convert filename: %s (%s)\n",
377 who_am_i(), f_name(file, fname), strerror(errno));
380 outbuf.buf[outbuf.len] = '\0';
385 /* Initialize starting value of xflags. */
386 if (protocol_version >= 30 && S_ISDIR(file->mode)) {
387 if (file->flags & FLAG_CONTENT_DIR)
388 xflags = file->flags & FLAG_TOP_DIR;
389 else if (file->flags & FLAG_IMPLIED_DIR)
390 xflags = XMIT_TOP_DIR | XMIT_NO_CONTENT_DIR;
392 xflags = XMIT_NO_CONTENT_DIR;
394 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
396 if (file->mode == mode)
397 xflags |= XMIT_SAME_MODE;
401 if ((preserve_devices && IS_DEVICE(mode))
402 || (preserve_specials && IS_SPECIAL(mode))) {
403 if (protocol_version < 28) {
404 if (tmp_rdev == rdev)
405 xflags |= XMIT_SAME_RDEV_pre28;
410 if ((uint32)major(rdev) == rdev_major)
411 xflags |= XMIT_SAME_RDEV_MAJOR;
413 rdev_major = major(rdev);
414 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
415 xflags |= XMIT_RDEV_MINOR_8_pre30;
417 } else if (protocol_version < 28)
418 rdev = MAKEDEV(0, 0);
420 if ((uid_t)F_OWNER(file) == uid && *lastname)
421 xflags |= XMIT_SAME_UID;
424 if (uid_ndx && !numeric_ids) {
425 user_name = add_uid(uid);
426 if (inc_recurse && user_name)
427 xflags |= XMIT_USER_NAME_FOLLOWS;
432 if ((gid_t)F_GROUP(file) == gid && *lastname)
433 xflags |= XMIT_SAME_GID;
436 if (gid_ndx && !numeric_ids) {
437 group_name = add_gid(gid);
438 if (inc_recurse && group_name)
439 xflags |= XMIT_GROUP_NAME_FOLLOWS;
443 if (file->modtime == modtime)
444 xflags |= XMIT_SAME_TIME;
446 modtime = file->modtime;
448 #ifdef SUPPORT_HARD_LINKS
450 if (protocol_version >= 30) {
451 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
452 first_hlink_ndx = (int32)(long)np->data - 1;
453 if (first_hlink_ndx < 0) {
454 high_hlink_ndx = ndx + first_ndx;
455 np->data = (void*)(long)(high_hlink_ndx + 1);
456 xflags |= XMIT_HLINK_FIRST;
458 xflags |= XMIT_HLINKED;
460 if (tmp_dev == dev) {
461 if (protocol_version >= 28)
462 xflags |= XMIT_SAME_DEV_pre30;
465 xflags |= XMIT_HLINKED;
471 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
473 l2 = strlen(fname+l1);
476 xflags |= XMIT_SAME_NAME;
478 xflags |= XMIT_LONG_NAME;
480 /* We must make sure we don't send a zero flag byte or the
481 * other end will terminate the flist transfer. Note that
482 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
483 * it's harmless way to add a bit to the first flag byte. */
484 if (protocol_version >= 28) {
485 if (!xflags && !S_ISDIR(mode))
486 xflags |= XMIT_TOP_DIR;
487 if ((xflags & 0xFF00) || !xflags) {
488 xflags |= XMIT_EXTENDED_FLAGS;
489 write_shortint(f, xflags);
491 write_byte(f, xflags);
493 if (!(xflags & 0xFF))
494 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
495 write_byte(f, xflags);
497 if (xflags & XMIT_SAME_NAME)
499 if (xflags & XMIT_LONG_NAME)
500 write_varint30(f, l2);
503 write_buf(f, fname + l1, l2);
505 if (first_hlink_ndx >= 0) {
506 write_varint(f, first_hlink_ndx);
507 if (first_hlink_ndx >= first_ndx)
511 write_varlong30(f, F_LENGTH(file), 3);
512 if (!(xflags & XMIT_SAME_TIME)) {
513 if (protocol_version >= 30)
514 write_varlong(f, modtime, 4);
516 write_int(f, modtime);
518 if (!(xflags & XMIT_SAME_MODE))
519 write_int(f, to_wire_mode(mode));
520 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
521 if (protocol_version < 30)
524 write_varint(f, uid);
525 if (xflags & XMIT_USER_NAME_FOLLOWS) {
526 int len = strlen(user_name);
528 write_buf(f, user_name, len);
532 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
533 if (protocol_version < 30)
536 write_varint(f, gid);
537 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
538 int len = strlen(group_name);
540 write_buf(f, group_name, len);
544 if ((preserve_devices && IS_DEVICE(mode))
545 || (preserve_specials && IS_SPECIAL(mode))) {
546 if (protocol_version < 28) {
547 if (!(xflags & XMIT_SAME_RDEV_pre28))
548 write_int(f, (int)rdev);
550 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
551 write_varint30(f, major(rdev));
552 if (protocol_version >= 30)
553 write_varint(f, minor(rdev));
554 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
555 write_byte(f, minor(rdev));
557 write_int(f, minor(rdev));
562 if (preserve_links && S_ISLNK(mode)) {
563 const char *sl = F_SYMLINK(file);
564 int len = strlen(sl);
565 write_varint30(f, len);
566 write_buf(f, sl, len);
570 #ifdef SUPPORT_HARD_LINKS
571 if (tmp_dev != 0 && protocol_version < 30) {
572 if (protocol_version < 26) {
573 /* 32-bit dev_t and ino_t */
574 write_int(f, (int32)dev);
575 write_int(f, (int32)tmp_ino);
577 /* 64-bit dev_t and ino_t */
578 if (!(xflags & XMIT_SAME_DEV_pre30))
579 write_longint(f, dev);
580 write_longint(f, tmp_ino);
585 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
590 /* Prior to 28, we sent a useless set of nulls. */
593 write_buf(f, sum, checksum_len);
597 strlcpy(lastname, fname, MAXPATHLEN);
599 if (S_ISREG(mode) || S_ISLNK(mode))
600 stats.total_size += F_LENGTH(file);
603 static struct file_struct *recv_file_entry(struct file_list *flist,
606 static int64 modtime;
608 #ifdef SUPPORT_HARD_LINKS
612 static uint32 rdev_major;
615 static uint16 gid_flags;
616 static char lastname[MAXPATHLEN], *lastdir;
617 static int lastdir_depth, lastdir_len = -1;
618 static unsigned int del_hier_name_len = 0;
619 static int in_del_hier = 0;
620 char thisname[MAXPATHLEN];
621 unsigned int l1 = 0, l2 = 0;
622 int alloc_len, basename_len, linkname_len;
623 int extra_len = file_extra_cnt * EXTRA_LEN;
624 int first_hlink_ndx = -1;
626 const char *basename;
627 struct file_struct *file;
631 if (xflags & XMIT_SAME_NAME)
634 if (xflags & XMIT_LONG_NAME)
635 l2 = read_varint30(f);
639 if (l2 >= MAXPATHLEN - l1) {
641 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
642 xflags, l1, l2, lastname, who_am_i());
643 overflow_exit("recv_file_entry");
646 strlcpy(thisname, lastname, l1 + 1);
647 read_sbuf(f, &thisname[l1], l2);
648 thisname[l1 + l2] = 0;
650 /* Abuse basename_len for a moment... */
651 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
654 if (ic_recv != (iconv_t)-1) {
657 INIT_CONST_XBUF(outbuf, thisname);
658 INIT_XBUF(inbuf, lastname, basename_len, -1);
660 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
661 io_error |= IOERR_GENERAL;
663 "[%s] cannot convert filename: %s (%s)\n",
664 who_am_i(), lastname, strerror(errno));
667 outbuf.buf[outbuf.len] = '\0';
671 clean_fname(thisname, 0);
674 sanitize_path(thisname, thisname, "", 0, NULL);
676 if ((basename = strrchr(thisname, '/')) != NULL) {
677 int len = basename++ - thisname;
678 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
679 lastdir = new_array(char, len + 1);
680 memcpy(lastdir, thisname, len);
683 lastdir_depth = count_dir_elements(lastdir);
687 basename_len = strlen(basename) + 1; /* count the '\0' */
689 #ifdef SUPPORT_HARD_LINKS
690 if (protocol_version >= 30
691 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
692 first_hlink_ndx = read_varint(f);
693 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
695 "hard-link reference out of range: %d (%d)\n",
696 first_hlink_ndx, flist->ndx_start + flist->used);
697 exit_cleanup(RERR_PROTOCOL);
699 if (first_hlink_ndx >= flist->ndx_start) {
700 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
701 file_length = F_LENGTH(first);
702 modtime = first->modtime;
705 uid = F_OWNER(first);
707 gid = F_GROUP(first);
708 if ((preserve_devices && IS_DEVICE(mode))
709 || (preserve_specials && IS_SPECIAL(mode))) {
710 uint32 *devp = F_RDEV_P(first);
711 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
712 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
714 if (preserve_links && S_ISLNK(mode))
715 linkname_len = strlen(F_SYMLINK(first)) + 1;
723 file_length = read_varlong30(f, 3);
724 if (!(xflags & XMIT_SAME_TIME)) {
725 if (protocol_version >= 30) {
726 modtime = read_varlong(f, 4);
727 #if SIZEOF_TIME_T < SIZEOF_INT64
728 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
730 "Time value of %s truncated on receiver.\n",
735 modtime = read_int(f);
737 if (!(xflags & XMIT_SAME_MODE))
738 mode = from_wire_mode(read_int(f));
740 if (chmod_modes && !S_ISLNK(mode))
741 mode = tweak_mode(mode, chmod_modes);
743 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
744 if (protocol_version < 30)
745 uid = (uid_t)read_int(f);
747 uid = (uid_t)read_varint(f);
748 if (xflags & XMIT_USER_NAME_FOLLOWS)
749 uid = recv_user_name(f, uid);
750 else if (inc_recurse && am_root && !numeric_ids)
751 uid = match_uid(uid);
754 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
755 if (protocol_version < 30)
756 gid = (gid_t)read_int(f);
758 gid = (gid_t)read_varint(f);
760 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
761 gid = recv_group_name(f, gid, &gid_flags);
762 else if (inc_recurse && (!am_root || !numeric_ids))
763 gid = match_gid(gid, &gid_flags);
767 if ((preserve_devices && IS_DEVICE(mode))
768 || (preserve_specials && IS_SPECIAL(mode))) {
769 if (protocol_version < 28) {
770 if (!(xflags & XMIT_SAME_RDEV_pre28))
771 rdev = (dev_t)read_int(f);
774 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
775 rdev_major = read_varint30(f);
776 if (protocol_version >= 30)
777 rdev_minor = read_varint(f);
778 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
779 rdev_minor = read_byte(f);
781 rdev_minor = read_int(f);
782 rdev = MAKEDEV(rdev_major, rdev_minor);
784 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
786 } else if (protocol_version < 28)
787 rdev = MAKEDEV(0, 0);
790 if (preserve_links && S_ISLNK(mode)) {
791 linkname_len = read_varint30(f) + 1; /* count the '\0' */
792 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
793 rprintf(FERROR, "overflow: linkname_len=%d\n",
795 overflow_exit("recv_file_entry");
802 #ifdef SUPPORT_HARD_LINKS
804 if (preserve_hard_links) {
805 if (protocol_version < 28 && S_ISREG(mode))
806 xflags |= XMIT_HLINKED;
807 if (xflags & XMIT_HLINKED)
808 extra_len += (inc_recurse+1) * EXTRA_LEN;
813 /* We need one or two index int32s when we're preserving ACLs. */
815 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
818 if (always_checksum && S_ISREG(mode))
819 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
821 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
822 extra_len += EXTRA_LEN;
824 #if EXTRA_ROUNDING > 0
825 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
826 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
829 if (inc_recurse && S_ISDIR(mode)) {
830 if (one_file_system) {
831 /* Room to save the dir's device for -x */
832 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
834 pool = dir_flist->file_pool;
836 pool = flist->file_pool;
838 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
840 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
842 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
844 file = (struct file_struct *)bp;
845 bp += FILE_STRUCT_LEN;
847 memcpy(bp, basename, basename_len);
848 bp += basename_len + linkname_len; /* skip space for symlink too */
850 #ifdef SUPPORT_HARD_LINKS
851 if (xflags & XMIT_HLINKED)
852 file->flags |= FLAG_HLINKED;
854 file->modtime = (time_t)modtime;
855 file->len32 = (uint32)file_length;
856 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
857 file->flags |= FLAG_LENGTH64;
858 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
865 file->flags |= gid_flags;
869 F_NDX(file) = flist->used + flist->ndx_start;
872 if (basename != thisname) {
873 file->dirname = lastdir;
874 F_DEPTH(file) = lastdir_depth + 1;
879 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
881 if (protocol_version >= 30) {
882 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
883 if (xflags & XMIT_TOP_DIR)
884 file->flags |= FLAG_TOP_DIR;
885 file->flags |= FLAG_CONTENT_DIR;
886 } else if (xflags & XMIT_TOP_DIR)
887 file->flags |= FLAG_IMPLIED_DIR;
888 } else if (xflags & XMIT_TOP_DIR) {
889 in_del_hier = recurse;
890 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
891 if (relative_paths && del_hier_name_len > 2
892 && lastname[del_hier_name_len-1] == '.'
893 && lastname[del_hier_name_len-2] == '/')
894 del_hier_name_len -= 2;
895 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
896 } else if (in_del_hier) {
897 if (!relative_paths || !del_hier_name_len
898 || (l1 >= del_hier_name_len
899 && lastname[del_hier_name_len] == '/'))
900 file->flags |= FLAG_CONTENT_DIR;
906 if ((preserve_devices && IS_DEVICE(mode))
907 || (preserve_specials && IS_SPECIAL(mode))) {
908 uint32 *devp = F_RDEV_P(file);
909 DEV_MAJOR(devp) = major(rdev);
910 DEV_MINOR(devp) = minor(rdev);
915 bp = (char*)file->basename + basename_len;
916 if (first_hlink_ndx >= flist->ndx_start) {
917 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
918 memcpy(bp, F_SYMLINK(first), linkname_len);
920 read_sbuf(f, bp, linkname_len - 1);
922 sanitize_path(bp, bp, "", lastdir_depth, NULL);
926 #ifdef SUPPORT_HARD_LINKS
927 if (preserve_hard_links && xflags & XMIT_HLINKED) {
928 if (protocol_version >= 30) {
929 if (xflags & XMIT_HLINK_FIRST) {
930 high_hlink_ndx = flist->ndx_start + flist->used;
931 F_HL_GNUM(file) = high_hlink_ndx;
933 F_HL_GNUM(file) = first_hlink_ndx;
935 static int32 cnt = 0;
936 struct ht_int64_node *np;
939 if (protocol_version < 26) {
943 if (!(xflags & XMIT_SAME_DEV_pre30))
944 dev = read_longint(f);
945 ino = read_longint(f);
947 np = idev_find(dev, ino);
948 ndx = (int32)(long)np->data - 1;
951 np->data = (void*)(long)cnt;
953 F_HL_GNUM(file) = ndx;
958 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
962 /* Prior to 28, we get a useless set of nulls. */
965 if (first_hlink_ndx >= flist->ndx_start) {
966 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
967 memcpy(bp, F_SUM(first), checksum_len);
969 read_buf(f, bp, checksum_len);
973 if (preserve_acls && !S_ISLNK(mode))
974 receive_acl(file, f);
976 #ifdef SUPPORT_XATTRS
978 receive_xattr(file, f );
981 if (S_ISREG(mode) || S_ISLNK(mode))
982 stats.total_size += file_length;
987 /* Create a file_struct for a named file by reading its stat() information
988 * and performing extensive checks against global options.
990 * Returns a pointer to the new file struct, or NULL if there was an error
991 * or this file should be excluded. */
992 struct file_struct *make_file(const char *fname, struct file_list *flist,
993 STRUCT_STAT *stp, int flags, int filter_level)
995 static char *lastdir;
996 static int lastdir_len = -1;
997 struct file_struct *file;
998 char thisname[MAXPATHLEN];
999 char linkname[MAXPATHLEN];
1000 int alloc_len, basename_len, linkname_len;
1001 int extra_len = file_extra_cnt * EXTRA_LEN;
1002 const char *basename;
1007 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1008 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1011 clean_fname(thisname, 0);
1013 sanitize_path(thisname, thisname, "", 0, NULL);
1015 if (stp && S_ISDIR(stp->st_mode)) {
1016 st = *stp; /* Needed for "symlink/." with --relative. */
1017 *linkname = '\0'; /* make IBM code checker happy */
1018 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1019 int save_errno = errno;
1020 /* See if file is excluded before reporting an error. */
1021 if (filter_level != NO_FILTERS
1022 && (is_excluded(thisname, 0, filter_level)
1023 || is_excluded(thisname, 1, filter_level))) {
1024 if (ignore_perishable && save_errno != ENOENT)
1025 non_perishable_cnt++;
1028 if (save_errno == ENOENT) {
1029 #ifdef SUPPORT_LINKS
1030 /* Avoid "vanished" error if symlink points nowhere. */
1031 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1032 && S_ISLNK(st.st_mode)) {
1033 io_error |= IOERR_GENERAL;
1034 rprintf(FERROR, "symlink has no referent: %s\n",
1035 full_fname(thisname));
1039 enum logcode c = am_daemon && protocol_version < 28
1041 io_error |= IOERR_VANISHED;
1042 rprintf(c, "file has vanished: %s\n",
1043 full_fname(thisname));
1046 io_error |= IOERR_GENERAL;
1047 rsyserr(FERROR, save_errno, "readlink %s failed",
1048 full_fname(thisname));
1053 /* backup.c calls us with filter_level set to NO_FILTERS. */
1054 if (filter_level == NO_FILTERS)
1057 if (S_ISDIR(st.st_mode)) {
1059 rprintf(FINFO, "skipping directory %s\n", thisname);
1062 /* -x only affects dirs because we need to avoid recursing
1063 * into a mount-point directory, not to avoid copying a
1064 * symlinked file if -L (or similar) was specified. */
1065 if (one_file_system && st.st_dev != filesystem_dev
1066 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1067 if (one_file_system > 1) {
1070 "[%s] skipping mount-point dir %s\n",
1071 who_am_i(), thisname);
1075 flags |= FLAG_MOUNT_DIR;
1076 flags &= ~FLAG_CONTENT_DIR;
1079 flags &= ~FLAG_CONTENT_DIR;
1081 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1082 if (ignore_perishable)
1083 non_perishable_cnt++;
1087 if (lp_ignore_nonreadable(module_id)) {
1088 #ifdef SUPPORT_LINKS
1089 if (!S_ISLNK(st.st_mode))
1091 if (access(thisname, R_OK) != 0)
1097 /* Only divert a directory in the main transfer. */
1099 if (flist->prev && S_ISDIR(st.st_mode)
1100 && flags & FLAG_DIVERT_DIRS) {
1101 /* Room for parent/sibling/next-child info. */
1102 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1104 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1106 pool = dir_flist->file_pool;
1108 pool = flist->file_pool;
1113 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1114 who_am_i(), thisname, filter_level);
1117 if ((basename = strrchr(thisname, '/')) != NULL) {
1118 int len = basename++ - thisname;
1119 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1120 lastdir = new_array(char, len + 1);
1121 memcpy(lastdir, thisname, len);
1122 lastdir[len] = '\0';
1126 basename = thisname;
1127 basename_len = strlen(basename) + 1; /* count the '\0' */
1129 #ifdef SUPPORT_LINKS
1130 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1135 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1136 extra_len += EXTRA_LEN;
1138 #if EXTRA_ROUNDING > 0
1139 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1140 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1143 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1146 bp = pool_alloc(pool, alloc_len, "make_file");
1148 if (!(bp = new_array(char, alloc_len)))
1149 out_of_memory("make_file");
1152 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1154 file = (struct file_struct *)bp;
1155 bp += FILE_STRUCT_LEN;
1157 memcpy(bp, basename, basename_len);
1158 bp += basename_len + linkname_len; /* skip space for symlink too */
1160 #ifdef SUPPORT_HARD_LINKS
1161 if (preserve_hard_links && flist && flist->prev) {
1162 if (protocol_version >= 28
1163 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1164 : S_ISREG(st.st_mode)) {
1165 tmp_dev = st.st_dev;
1166 tmp_ino = st.st_ino;
1172 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1173 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1174 tmp_rdev = st.st_rdev;
1179 file->flags = flags;
1180 file->modtime = st.st_mtime;
1181 file->len32 = (uint32)st.st_size;
1182 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1183 file->flags |= FLAG_LENGTH64;
1184 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1186 file->mode = st.st_mode;
1188 F_OWNER(file) = st.st_uid;
1190 F_GROUP(file) = st.st_gid;
1192 if (basename != thisname)
1193 file->dirname = lastdir;
1195 #ifdef SUPPORT_LINKS
1197 bp = (char*)file->basename + basename_len;
1198 memcpy(bp, linkname, linkname_len);
1202 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1203 file_checksum(thisname, tmp_sum, st.st_size);
1205 F_PATHNAME(file) = pathname;
1207 /* This code is only used by the receiver when it is building
1208 * a list of files for a delete pass. */
1209 if (keep_dirlinks && linkname_len && flist) {
1211 int save_mode = file->mode;
1212 file->mode = S_IFDIR; /* Find a directory with our name. */
1213 if (flist_find(dir_flist, file) >= 0
1214 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1215 file->modtime = st2.st_mtime;
1217 file->mode = st2.st_mode;
1219 F_OWNER(file) = st2.st_uid;
1221 F_GROUP(file) = st2.st_gid;
1223 file->mode = save_mode;
1226 if (basename_len == 0+1)
1231 F_NDX(file) = dir_count - 1;
1237 /* Only called for temporary file_struct entries created by make_file(). */
1238 void unmake_file(struct file_struct *file)
1240 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1241 #if EXTRA_ROUNDING > 0
1242 if (extra_cnt & EXTRA_ROUNDING)
1243 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1245 free(REQ_EXTRA(file, extra_cnt));
1248 static struct file_struct *send_file_name(int f, struct file_list *flist,
1249 char *fname, STRUCT_STAT *stp,
1250 int flags, int filter_level)
1252 struct file_struct *file;
1253 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1257 file = make_file(fname, flist, stp, flags, filter_level);
1261 if (chmod_modes && !S_ISLNK(file->mode))
1262 file->mode = tweak_mode(file->mode, chmod_modes);
1265 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1266 sx.st.st_mode = file->mode;
1267 sx.acc_acl = sx.def_acl = NULL;
1268 if (get_acl(fname, &sx) < 0)
1272 #ifdef SUPPORT_XATTRS
1273 if (preserve_xattrs && f >= 0) {
1275 if (get_xattr(fname, &sx) < 0)
1280 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1282 flist_expand(flist, 1);
1283 flist->files[flist->used++] = file;
1285 send_file_entry(f, file, flist->used - 1, flist->ndx_start);
1287 if (preserve_acls && !S_ISLNK(file->mode)) {
1292 #ifdef SUPPORT_XATTRS
1293 if (preserve_xattrs) {
1294 F_XATTR(file) = send_xattr(&sx, f);
1302 static void send_if_directory(int f, struct file_list *flist,
1303 struct file_struct *file,
1304 char *fbuf, unsigned int ol,
1307 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1309 if (S_ISDIR(file->mode)
1310 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1312 unsigned int len = strlen(fbuf);
1313 if (len > 1 && fbuf[len-1] == '/')
1315 if (len >= MAXPATHLEN - 1) {
1316 io_error |= IOERR_GENERAL;
1317 rprintf(FERROR, "skipping long-named directory: %s\n",
1321 save_filters = push_local_filters(fbuf, len);
1322 send_directory(f, flist, fbuf, len, flags);
1323 pop_local_filters(save_filters);
1330 static int file_compare(const void *file1, const void *file2)
1332 return f_name_cmp(*(struct file_struct **)file1,
1333 *(struct file_struct **)file2);
1336 /* The guts of a merge-sort algorithm. This was derived from the glibc
1337 * version, but I (Wayne) changed the merge code to do less copying and
1338 * to require only half the amount of temporary memory. */
1339 static void fsort_tmp(struct file_struct **fp, size_t num,
1340 struct file_struct **tmp)
1342 struct file_struct **f1, **f2, **t;
1351 fsort_tmp(f1, n1, tmp);
1353 fsort_tmp(f2, n2, tmp);
1355 while (f_name_cmp(*f1, *f2) <= 0) {
1362 memcpy(t, f1, n1 * PTR_SIZE);
1364 *f1++ = *f2++, n2--;
1366 while (n1 > 0 && n2 > 0) {
1367 if (f_name_cmp(*t, *f2) <= 0)
1370 *f1++ = *f2++, n2--;
1374 memcpy(f1, t, n1 * PTR_SIZE);
1377 /* This file-struct sorting routine makes sure that any identical names in
1378 * the file list stay in the same order as they were in the original list.
1379 * This is particularly vital in inc_recurse mode where we expect a sort
1380 * on the flist to match the exact order of a sort on the dir_flist. */
1381 static void fsort(struct file_struct **fp, size_t num)
1387 qsort(fp, num, PTR_SIZE, file_compare);
1389 struct file_struct **tmp = new_array(struct file_struct *,
1391 fsort_tmp(fp, num, tmp);
1396 /* We take an entire set of sibling dirs from the sorted flist and link them
1397 * into the tree, setting the appropriate parent/child/sibling pointers. */
1398 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1403 int32 *parent_dp = parent_ndx < 0 ? NULL
1404 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1406 flist_expand(dir_flist, dir_cnt);
1407 dir_flist->sorted = dir_flist->files;
1409 for (i = 0; dir_cnt; i++) {
1410 struct file_struct *file = from_flist->sorted[i];
1412 if (!S_ISDIR(file->mode))
1415 dir_flist->files[dir_flist->used++] = file;
1418 if (file->basename[0] == '.' && file->basename[1] == '\0')
1422 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1424 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1426 send_dir_ndx = dir_flist->used - 1;
1428 dp = F_DIR_NODE_P(file);
1429 DIR_PARENT(dp) = parent_ndx;
1430 DIR_FIRST_CHILD(dp) = -1;
1433 DIR_NEXT_SIBLING(dp) = -1;
1436 /* This function is normally called by the sender, but the receiving side also
1437 * calls it from get_dirlist() with f set to -1 so that we just construct the
1438 * file list in memory without sending it over the wire. Also, get_dirlist()
1439 * might call this with f set to -2, which also indicates that local filter
1440 * rules should be ignored. */
1441 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1448 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1449 int start = flist->used;
1450 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1452 assert(flist != NULL);
1454 if (!(d = opendir(fbuf))) {
1455 io_error |= IOERR_GENERAL;
1456 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1461 if (len != 1 || *fbuf != '/')
1464 remainder = MAXPATHLEN - (p - fbuf);
1466 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1467 char *dname = d_name(di);
1468 if (dname[0] == '.' && (dname[1] == '\0'
1469 || (dname[1] == '.' && dname[2] == '\0')))
1471 if (strlcpy(p, dname, remainder) >= remainder) {
1472 io_error |= IOERR_GENERAL;
1474 "cannot send long-named file %s\n",
1478 if (dname[0] == '\0') {
1479 io_error |= IOERR_GENERAL;
1481 "cannot send file with empty name in %s\n",
1486 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1492 io_error |= IOERR_GENERAL;
1493 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1498 if (f >= 0 && recurse && !divert_dirs) {
1499 int i, end = flist->used - 1;
1500 /* send_if_directory() bumps flist->used, so use "end". */
1501 for (i = start; i <= end; i++)
1502 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1506 static char lastpath[MAXPATHLEN] = "";
1507 static int lastpath_len = 0;
1508 static struct file_struct *lastpath_struct;
1510 static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1511 char *start, char *limit, int flags, char name_type)
1513 struct file_struct *file;
1514 item_list *relname_list;
1515 relnamecache **rnpp;
1517 int len, need_new_dir;
1519 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1522 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1523 && lastpath_len == limit - fname
1524 && strncmp(lastpath, fname, lastpath_len) == 0)
1532 int save_copy_links = copy_links;
1533 int save_xfer_dirs = xfer_dirs;
1535 copy_links = xfer_dirs = 1;
1539 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1541 send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1545 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1547 if (file && !S_ISDIR(file->mode))
1549 lastpath_struct = file;
1552 strlcpy(lastpath, fname, sizeof lastpath);
1553 lastpath_len = limit - fname;
1557 copy_links = save_copy_links;
1558 xfer_dirs = save_xfer_dirs;
1564 if (!lastpath_struct)
1565 return; /* dir must have vanished */
1567 len = strlen(limit+1);
1568 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1569 if (!relname_list) {
1570 if (!(relname_list = new0(item_list)))
1571 out_of_memory("send_implied_dirs");
1572 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1574 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1575 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1576 out_of_memory("send_implied_dirs");
1577 (*rnpp)->name_type = name_type;
1578 strlcpy((*rnpp)->fname, limit+1, len + 1);
1581 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1583 char fbuf[MAXPATHLEN];
1584 item_list *relname_list;
1585 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1589 dlen = strlen(fbuf);
1591 if (F_PATHNAME(file) != pathname) {
1592 if (!push_pathname(F_PATHNAME(file), -1))
1593 exit_cleanup(RERR_FILESELECT);
1596 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1598 if (file->flags & FLAG_CONTENT_DIR) {
1599 if (one_file_system) {
1601 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1602 io_error |= IOERR_GENERAL;
1603 rsyserr(FERROR, errno, "link_stat %s failed",
1607 filesystem_dev = st.st_dev;
1609 send_directory(f, flist, fbuf, dlen, flags);
1612 if (!relative_paths)
1615 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1619 for (j = 0; j < relname_list->count; j++) {
1621 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1622 char name_type = rnp->name_type;
1625 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1627 if (len >= (int)sizeof fbuf)
1628 continue; /* Impossible... */
1630 slash = strchr(fbuf+dlen+1, '/');
1632 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1636 if (name_type != NORMAL_NAME) {
1638 if (link_stat(fbuf, &st, 1) != 0) {
1639 io_error |= IOERR_GENERAL;
1640 rsyserr(FERROR, errno, "link_stat %s failed",
1644 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1646 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1652 void send_extra_file_list(int f, int at_least)
1654 struct file_list *flist;
1657 int future_cnt, save_io_error = io_error;
1662 /* Keep sending data until we have the requested number of
1663 * files in the upcoming file-lists. */
1664 if (cur_flist->next) {
1665 flist = first_flist->prev; /* the newest flist */
1666 future_cnt = flist->ndx_end - cur_flist->next->ndx_start + 1;
1669 while (future_cnt < at_least) {
1670 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1671 int dir_ndx, dstart = dir_count;
1672 const char *pathname = F_PATHNAME(file);
1675 flist = flist_new(0, "send_extra_file_list");
1676 start_write = stats.total_written;
1680 dir_ndx = F_NDX(file);
1683 dir_ndx = send_dir_ndx;
1684 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1685 flist->parent_ndx = dir_ndx;
1687 send1extra(f, file, flist);
1688 prev_flags = file->flags;
1689 dp = F_DIR_NODE_P(file);
1691 /* If there are any duplicate directory names that follow, we
1692 * send all the dirs together in one file-list. The dir_flist
1693 * tree links all the child subdirs onto the last dup dir. */
1694 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1695 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1696 send_dir_ndx = dir_ndx;
1697 file = dir_flist->sorted[dir_ndx];
1698 /* Try to avoid some duplicate scanning of identical dirs. */
1699 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1700 file->flags &= ~FLAG_CONTENT_DIR;
1701 send1extra(f, file, flist);
1702 prev_flags = file->flags;
1703 dp = F_DIR_NODE_P(file);
1709 if (need_unsorted_flist) {
1710 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1711 out_of_memory("send_extra_file_list");
1712 memcpy(flist->sorted, flist->files,
1713 flist->used * sizeof (struct file_struct*));
1716 flist->sorted = flist->files;
1718 clean_flist(flist, 0);
1720 flist->ndx_end = flist->ndx_start + flist->used - 1
1721 - (dir_count - dstart);
1723 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1724 flist_done_allocating(flist);
1726 file_total += flist->used;
1727 future_cnt += flist->used;
1728 stats.flist_size += stats.total_written - start_write;
1729 stats.num_files += flist->used;
1731 output_flist(flist);
1733 if (DIR_FIRST_CHILD(dp) >= 0) {
1734 send_dir_ndx = DIR_FIRST_CHILD(dp);
1737 while (DIR_NEXT_SIBLING(dp) < 0) {
1738 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1739 write_ndx(f, NDX_FLIST_EOF);
1741 change_local_filter_dir(NULL, 0, 0);
1745 file = dir_flist->sorted[send_dir_ndx];
1746 dp = F_DIR_NODE_P(file);
1748 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1753 if (io_error != save_io_error && !ignore_errors)
1754 send_msg_int(MSG_IO_ERROR, io_error);
1757 struct file_list *send_file_list(int f, int argc, char *argv[])
1759 static const char *lastdir;
1760 static int lastdir_len = -1;
1764 struct file_list *flist;
1765 struct timeval start_tv, end_tv;
1768 int disable_buffering;
1769 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1770 int reading_remotely = filesfrom_host != NULL;
1771 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1773 | (filesfrom_convert ? RL_CONVERT : 0)
1775 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1777 rprintf(FLOG, "building file list\n");
1778 if (show_filelist_p())
1779 start_filelist_progress("building file list");
1780 else if (inc_recurse && verbose && !am_server)
1781 rprintf(FCLIENT, "sending incremental file list\n");
1783 start_write = stats.total_written;
1784 gettimeofday(&start_tv, NULL);
1786 if (relative_paths && protocol_version >= 30)
1787 implied_dirs = 1; /* We send flagged implied dirs */
1789 #ifdef SUPPORT_HARD_LINKS
1790 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1794 flist = cur_flist = flist_new(0, "send_file_list");
1796 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1797 flags |= FLAG_DIVERT_DIRS;
1799 dir_flist = cur_flist;
1801 disable_buffering = io_start_buffering_out(f);
1802 if (filesfrom_fd >= 0) {
1803 if (argv[0] && !push_dir(argv[0], 0)) {
1804 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1805 full_fname(argv[0]), curr_dir);
1806 exit_cleanup(RERR_FILESELECT);
1812 char fbuf[MAXPATHLEN], *fn, name_type;
1815 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
1817 sanitize_path(fbuf, fbuf, "", 0, NULL);
1821 strlcpy(fbuf, *argv++, MAXPATHLEN);
1823 sanitize_path(fbuf, fbuf, "", 0, NULL);
1827 if (relative_paths) {
1828 /* We clean up fbuf below. */
1829 name_type = NORMAL_NAME;
1830 } else if (!len || fbuf[len - 1] == '/') {
1831 if (len == 2 && fbuf[0] == '.') {
1832 /* Turn "./" into just "." rather than "./." */
1835 if (len + 1 >= MAXPATHLEN)
1836 overflow_exit("send_file_list");
1840 name_type = DOT_NAME;
1841 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1842 && (len == 2 || fbuf[len-3] == '/')) {
1843 if (len + 2 >= MAXPATHLEN)
1844 overflow_exit("send_file_list");
1848 name_type = DOT_NAME;
1849 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
1850 name_type = DOT_NAME;
1852 name_type = NORMAL_NAME;
1856 if (!relative_paths) {
1857 p = strrchr(fbuf, '/');
1864 len -= p - fbuf + 1;
1869 if ((p = strstr(fbuf, "/./")) != NULL) {
1879 *--fn = '\0'; /* ensure room for '.' */
1882 len = clean_fname(fn, CFN_KEEP_LEADING_DOT_DIR
1883 | CFN_KEEP_TRAILING_SLASH
1884 | CFN_DROP_TRAILING_DOT_DIR);
1889 name_type = DOT_NAME;
1890 } else if (fn[0] == '.')
1891 name_type = DOT_NAME;
1892 } else if (fn[len-1] == '/') {
1894 if (len == 1 && *fn == '.')
1895 name_type = DOT_NAME;
1897 name_type = SLASH_ENDING_NAME;
1899 /* Reject a ".." dir in the active part of the path. */
1900 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1901 if ((p[2] == '/' || p[2] == '\0')
1902 && (p == fn || p[-1] == '/')) {
1904 "found \"..\" dir in relative path: %s\n",
1906 exit_cleanup(RERR_SYNTAX);
1914 name_type = DOT_NAME;
1917 dirlen = dir ? strlen(dir) : 0;
1918 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1919 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1922 lastdir_len = pathname_len;
1923 } else if (!push_pathname(lastdir, lastdir_len))
1927 memmove(fbuf, fn, len + 1);
1929 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0) {
1930 io_error |= IOERR_GENERAL;
1931 rsyserr(FERROR, errno, "link_stat %s failed",
1936 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1937 rprintf(FINFO, "skipping directory %s\n", fbuf);
1941 if (inc_recurse && relative_paths && *fbuf) {
1942 if ((p = strchr(fbuf+1, '/')) != NULL) {
1943 if (p - fbuf == 1 && *fbuf == '.') {
1944 if ((fn = strchr(p+1, '/')) != NULL)
1948 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
1952 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1953 /* Send the implied directories at the start of the
1954 * source spec, so we get their permissions right. */
1955 char *lp = lastpath, *slash = fbuf;
1957 /* Skip any initial directories in our path that we
1958 * have in common with lastpath. */
1959 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1964 if (fn != p || (*lp && *lp != '/'))
1965 send_implied_dirs(f, flist, fbuf, slash, p, flags, 0);
1968 if (one_file_system)
1969 filesystem_dev = st.st_dev;
1971 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
1972 struct file_struct *file;
1973 int top_flags = FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags;
1974 file = send_file_name(f, flist, fbuf, &st,
1975 top_flags, ALL_FILTERS);
1977 if (name_type == DOT_NAME) {
1978 if (send_dir_depth < 0) {
1980 change_local_filter_dir(fbuf, len, send_dir_depth);
1982 send_directory(f, flist, fbuf, len, flags);
1985 send_if_directory(f, flist, file, fbuf, len, flags);
1987 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1990 gettimeofday(&end_tv, NULL);
1991 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1992 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1993 if (stats.flist_buildtime == 0)
1994 stats.flist_buildtime = 1;
1997 write_byte(f, 0); /* Indicate end of file list */
1999 #ifdef SUPPORT_HARD_LINKS
2000 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2004 if (show_filelist_p())
2005 finish_filelist_progress(flist);
2007 gettimeofday(&end_tv, NULL);
2008 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2009 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2011 /* When converting names, both sides keep an unsorted file-list array
2012 * because the names will differ on the sending and receiving sides
2013 * (both sides will use the unsorted index number for each item). */
2015 /* Sort the list without removing any duplicates. This allows the
2016 * receiving side to ask for whatever name it kept. For incremental
2017 * recursion mode, the sender marks duplicate dirs so that it can
2018 * send them together in a single file-list. */
2020 if (need_unsorted_flist) {
2022 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2023 out_of_memory("send_file_list");
2024 memcpy(flist->sorted, flist->files,
2025 flist->used * sizeof (struct file_struct*));
2026 clean_flist(flist, 0);
2028 flist->sorted = flist->files;
2030 flist->high = flist->used - 1;
2035 flist->sorted = flist->files;
2036 clean_flist(flist, 0);
2038 file_total += flist->used;
2040 /* We don't subtract dir_count for the first send since we
2041 * might have one or more dot dirs which need to get sent. */
2042 flist->ndx_end = flist->ndx_start + flist->used - 1;
2044 if (!numeric_ids && !inc_recurse)
2047 /* send the io_error flag */
2048 if (protocol_version < 30)
2049 write_int(f, ignore_errors ? 0 : io_error);
2050 else if (io_error && !ignore_errors)
2051 send_msg_int(MSG_IO_ERROR, io_error);
2053 if (disable_buffering)
2054 io_end_buffering_out();
2056 stats.flist_size = stats.total_written - start_write;
2057 stats.num_files = flist->used;
2060 output_flist(flist);
2063 rprintf(FINFO, "send_file_list done\n");
2067 add_dirs_to_tree(-1, flist, dir_count);
2068 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2069 flist->parent_ndx = -1;
2070 flist_done_allocating(flist);
2071 if (send_dir_ndx < 0) {
2072 write_ndx(f, NDX_FLIST_EOF);
2075 else if (file_total == 1) {
2076 /* If we're creating incremental file-lists and there
2077 * was just 1 item in the first file-list, send 1 more
2078 * file-list to check if this is a 1-file xfer. */
2079 send_extra_file_list(f, 1);
2086 struct file_list *recv_file_list(int f)
2088 struct file_list *flist;
2093 rprintf(FLOG, "receiving file list\n");
2094 if (show_filelist_p())
2095 start_filelist_progress("receiving file list");
2096 else if (inc_recurse && verbose && !am_server && !first_flist)
2097 rprintf(FCLIENT, "receiving incremental file list\n");
2099 start_read = stats.total_read;
2101 #ifdef SUPPORT_HARD_LINKS
2102 if (preserve_hard_links && !first_flist)
2106 flist = flist_new(0, "recv_file_list");
2109 if (flist->ndx_start == 1)
2110 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2111 dstart = dir_flist->used;
2117 while ((flags = read_byte(f)) != 0) {
2118 struct file_struct *file;
2120 flist_expand(flist, 1);
2122 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2123 flags |= read_byte(f) << 8;
2124 file = recv_file_entry(flist, flags, f);
2126 if (inc_recurse && S_ISDIR(file->mode)) {
2127 flist_expand(dir_flist, 1);
2128 dir_flist->files[dir_flist->used++] = file;
2131 flist->files[flist->used++] = file;
2133 maybe_emit_filelist_progress(flist->used);
2136 rprintf(FINFO, "recv_file_name(%s)\n",
2137 f_name(file, NULL));
2140 file_total += flist->used;
2142 flist->ndx_end = flist->ndx_start + flist->used - 1;
2143 if (inc_recurse && flist->ndx_start > 1)
2144 flist->ndx_end -= dir_flist->used - dstart;
2147 rprintf(FINFO, "received %d names\n", flist->used);
2149 if (show_filelist_p())
2150 finish_filelist_progress(flist);
2153 if (need_unsorted_flist) {
2154 /* Create an extra array of index pointers that we can sort for
2155 * the generator's use (for wading through the files in sorted
2156 * order and for calling flist_find()). We keep the "files"
2157 * list unsorted for our exchange of index numbers with the
2158 * other side (since their names may not sort the same). */
2159 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2160 out_of_memory("recv_file_list");
2161 memcpy(flist->sorted, flist->files,
2162 flist->used * sizeof (struct file_struct*));
2163 if (inc_recurse && dir_flist->used > dstart) {
2164 dir_flist->sorted = realloc_array(dir_flist->sorted,
2165 struct file_struct *,
2167 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2168 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2169 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2174 flist->sorted = flist->files;
2175 if (inc_recurse && dir_flist->used > dstart) {
2176 dir_flist->sorted = dir_flist->files;
2177 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2182 flist_done_allocating(flist);
2184 recv_id_list(f, flist);
2186 clean_flist(flist, relative_paths);
2188 if (protocol_version < 30) {
2189 /* Recv the io_error flag */
2193 io_error |= read_int(f);
2194 } else if (inc_recurse && flist->ndx_start == 1) {
2195 if (!file_total || strcmp(flist->sorted[0]->basename, ".") != 0)
2196 flist->parent_ndx = -1;
2200 output_flist(flist);
2203 rprintf(FINFO, "recv_file_list done\n");
2205 stats.flist_size += stats.total_read - start_read;
2206 stats.num_files += flist->used;
2211 /* This is only used once by the receiver if the very first file-list
2212 * has exactly one item in it. */
2213 void recv_additional_file_list(int f)
2215 struct file_list *flist;
2216 int ndx = read_ndx(f);
2217 if (ndx == NDX_FLIST_EOF) {
2219 change_local_filter_dir(NULL, 0, 0);
2221 ndx = NDX_FLIST_OFFSET - ndx;
2222 if (ndx < 0 || ndx >= dir_flist->used) {
2223 ndx = NDX_FLIST_OFFSET - ndx;
2225 "[%s] Invalid dir index: %d (%d - %d)\n",
2226 who_am_i(), ndx, NDX_FLIST_OFFSET,
2227 NDX_FLIST_OFFSET - dir_flist->used + 1);
2228 exit_cleanup(RERR_PROTOCOL);
2231 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2234 flist = recv_file_list(f);
2235 flist->parent_ndx = ndx;
2239 /* Search for an identically-named item in the file list. Note that the
2240 * items must agree in their directory-ness, or no match is returned. */
2241 int flist_find(struct file_list *flist, struct file_struct *f)
2243 int low = flist->low, high = flist->high;
2244 int diff, mid, mid_up;
2246 while (low <= high) {
2247 mid = (low + high) / 2;
2248 if (F_IS_ACTIVE(flist->sorted[mid]))
2251 /* Scan for the next non-empty entry using the cached
2252 * distance values. If the value isn't fully up-to-
2253 * date, update it. */
2254 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2255 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2257 mid_up += F_DEPTH(flist->sorted[mid_up]);
2258 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2259 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2261 if (mid_up > high) {
2262 /* If there's nothing left above us, set high to
2263 * a non-empty entry below us and continue. */
2264 high = mid - (int)flist->sorted[mid]->len32;
2265 if (!F_IS_ACTIVE(flist->sorted[high])) {
2267 high -= (int)flist->sorted[high]->len32;
2268 } while (!F_IS_ACTIVE(flist->sorted[high]));
2269 flist->sorted[mid]->len32 = mid - high;
2274 diff = f_name_cmp(flist->sorted[mid_up], f);
2276 if (protocol_version < 29
2277 && S_ISDIR(flist->sorted[mid_up]->mode)
2278 != S_ISDIR(f->mode))
2291 * Free up any resources a file_struct has allocated
2292 * and clear the file.
2294 void clear_file(struct file_struct *file)
2296 /* The +1 zeros out the first char of the basename. */
2297 memset(file, 0, FILE_STRUCT_LEN + 1);
2298 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2299 * entry. Likewise for len32 in the opposite direction. We assume
2300 * that we're alone for now since flist_find() will adjust the counts
2301 * it runs into that aren't up-to-date. */
2302 file->len32 = F_DEPTH(file) = 1;
2305 /* Allocate a new file list. */
2306 struct file_list *flist_new(int flags, char *msg)
2308 struct file_list *flist;
2310 if (!(flist = new0(struct file_list)))
2313 if (flags & FLIST_TEMP) {
2314 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2315 out_of_memory, POOL_INTERN)))
2318 /* This is a doubly linked list with prev looping back to
2319 * the end of the list, but the last next pointer is NULL. */
2321 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2322 out_of_memory, POOL_INTERN);
2323 if (!flist->file_pool)
2326 flist->ndx_start = 1;
2328 first_flist = cur_flist = flist->prev = flist;
2330 flist->file_pool = first_flist->file_pool;
2332 flist->ndx_start = first_flist->prev->ndx_end + 2;
2333 if (flist->ndx_start <= high_hlink_ndx)
2334 flist->ndx_start = high_hlink_ndx + 1;
2336 flist->prev = first_flist->prev;
2337 flist->prev->next = first_flist->prev = flist;
2339 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2346 /* Free up all elements in a flist. */
2347 void flist_free(struct file_list *flist)
2350 /* Was FLIST_TEMP dir-list. */
2351 } else if (flist == flist->prev) {
2352 first_flist = cur_flist = NULL;
2356 if (flist == cur_flist)
2357 cur_flist = flist->next;
2358 if (flist == first_flist)
2359 first_flist = first_flist->next;
2361 flist->prev->next = flist->next;
2363 flist->next = first_flist;
2365 flist->next->prev = flist->prev;
2366 file_total -= flist->used;
2370 if (!flist->prev || !flist_cnt)
2371 pool_destroy(flist->file_pool);
2373 pool_free_old(flist->file_pool, flist->pool_boundary);
2375 if (flist->sorted && flist->sorted != flist->files)
2376 free(flist->sorted);
2381 /* This routine ensures we don't have any duplicate names in our file list.
2382 * duplicate names can cause corruption because of the pipelining. */
2383 static void clean_flist(struct file_list *flist, int strip_root)
2385 char fbuf[MAXPATHLEN];
2390 if (flist->used == 0) {
2396 fsort(flist->sorted, flist->used);
2398 if (!am_sender || inc_recurse) {
2399 for (i = prev_i = 0; i < flist->used; i++) {
2400 if (F_IS_ACTIVE(flist->sorted[i])) {
2405 flist->low = prev_i;
2407 i = prev_i = flist->used - 1;
2411 while (++i < flist->used) {
2413 struct file_struct *file = flist->sorted[i];
2415 if (!F_IS_ACTIVE(file))
2417 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2419 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2420 int save_mode = file->mode;
2421 /* Make sure that this directory doesn't duplicate a
2422 * non-directory earlier in the list. */
2423 flist->high = prev_i;
2424 file->mode = S_IFREG;
2425 j = flist_find(flist, file);
2426 file->mode = save_mode;
2431 /* If one is a dir and the other is not, we want to
2432 * keep the dir because it might have contents in the
2433 * list. Otherwise keep the first one. */
2434 if (S_ISDIR(file->mode)) {
2435 struct file_struct *fp = flist->sorted[j];
2436 if (!S_ISDIR(fp->mode))
2440 file->flags |= FLAG_DUPLICATE;
2441 else { /* Make sure we merge our vital flags. */
2442 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2443 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2453 "removing duplicate name %s from file list (%d)\n",
2454 f_name(file, fbuf), drop + flist->ndx_start);
2456 clear_file(flist->sorted[drop]);
2460 if (flist->low == drop) {
2462 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2471 flist->high = prev_i;
2474 /* We need to strip off the leading slashes for relative
2475 * paths, but this must be done _after_ the sorting phase. */
2476 for (i = flist->low; i <= flist->high; i++) {
2477 struct file_struct *file = flist->sorted[i];
2481 while (*file->dirname == '/')
2483 if (!*file->dirname)
2484 file->dirname = NULL;
2488 if (prune_empty_dirs && !am_sender) {
2489 int j, prev_depth = 0;
2491 prev_i = 0; /* It's OK that this isn't really true. */
2493 for (i = flist->low; i <= flist->high; i++) {
2494 struct file_struct *fp, *file = flist->sorted[i];
2496 /* This temporarily abuses the F_DEPTH() value for a
2497 * directory that is in a chain that might get pruned.
2498 * We restore the old value if it gets a reprieve. */
2499 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2500 /* Dump empty dirs when coming back down. */
2501 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2502 fp = flist->sorted[prev_i];
2503 if (F_DEPTH(fp) >= 0)
2505 prev_i = -F_DEPTH(fp)-1;
2508 prev_depth = F_DEPTH(file);
2509 if (is_excluded(f_name(file, fbuf), 1,
2511 /* Keep dirs through this dir. */
2512 for (j = prev_depth-1; ; j--) {
2513 fp = flist->sorted[prev_i];
2514 if (F_DEPTH(fp) >= 0)
2516 prev_i = -F_DEPTH(fp)-1;
2520 F_DEPTH(file) = -prev_i-1;
2523 /* Keep dirs through this non-dir. */
2524 for (j = prev_depth; ; j--) {
2525 fp = flist->sorted[prev_i];
2526 if (F_DEPTH(fp) >= 0)
2528 prev_i = -F_DEPTH(fp)-1;
2533 /* Dump all remaining empty dirs. */
2535 struct file_struct *fp = flist->sorted[prev_i];
2536 if (F_DEPTH(fp) >= 0)
2538 prev_i = -F_DEPTH(fp)-1;
2542 for (i = flist->low; i <= flist->high; i++) {
2543 if (F_IS_ACTIVE(flist->sorted[i]))
2547 for (i = flist->high; i >= flist->low; i--) {
2548 if (F_IS_ACTIVE(flist->sorted[i]))
2555 static void output_flist(struct file_list *flist)
2557 char uidbuf[16], gidbuf[16], depthbuf[16];
2558 struct file_struct *file;
2559 const char *root, *dir, *slash, *name, *trail;
2560 const char *who = who_am_i();
2563 rprintf(FINFO, "[%s] flist start=%d, end=%d, used=%d, low=%d, high=%d\n",
2564 who, flist->ndx_start, flist->ndx_end, flist->used, flist->low, flist->high);
2565 for (i = 0; i < flist->used; i++) {
2566 file = flist->sorted[i];
2567 if ((am_root || am_sender) && uid_ndx) {
2568 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2573 static char parens[] = "(\0)\0\0\0";
2574 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2575 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2576 pp, F_GROUP(file), pp + 2);
2580 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2581 if (F_IS_ACTIVE(file)) {
2582 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2583 if ((dir = file->dirname) == NULL)
2587 name = file->basename;
2588 trail = S_ISDIR(file->mode) ? "/" : "";
2590 root = dir = slash = name = trail = "";
2592 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2593 who, i + flist->ndx_start,
2594 root, dir, slash, name, trail,
2595 (int)file->mode, (double)F_LENGTH(file),
2596 uidbuf, gidbuf, file->flags);
2600 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2601 enum fnc_type { t_PATH, t_ITEM };
2603 static int found_prefix;
2605 /* Compare the names of two file_struct entities, similar to how strcmp()
2606 * would do if it were operating on the joined strings.
2608 * Some differences beginning with protocol_version 29: (1) directory names
2609 * are compared with an assumed trailing slash so that they compare in a
2610 * way that would cause them to sort immediately prior to any content they
2611 * may have; (2) a directory of any name compares after a non-directory of
2612 * any name at the same depth; (3) a directory with name "." compares prior
2613 * to anything else. These changes mean that a directory and a non-dir
2614 * with the same name will not compare as equal (protocol_version >= 29).
2616 * The dirname component can be an empty string, but the basename component
2617 * cannot (and never is in the current codebase). The basename component
2618 * may be NULL (for a removed item), in which case it is considered to be
2619 * after any existing item. */
2620 int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2623 const uchar *c1, *c2;
2624 enum fnc_state state1, state2;
2625 enum fnc_type type1, type2;
2626 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2628 if (!f1 || !F_IS_ACTIVE(f1)) {
2629 if (!f2 || !F_IS_ACTIVE(f2))
2633 if (!f2 || !F_IS_ACTIVE(f2))
2636 c1 = (uchar*)f1->dirname;
2637 c2 = (uchar*)f2->dirname;
2641 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2642 c1 = (const uchar*)f1->basename;
2643 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2645 state1 = s_TRAILING;
2654 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2655 c2 = (const uchar*)f2->basename;
2656 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2658 state2 = s_TRAILING;
2668 return type1 == t_PATH ? 1 : -1;
2678 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2679 c1 = (const uchar*)f1->basename;
2680 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2682 state1 = s_TRAILING;
2688 state1 = s_TRAILING;
2689 if (type1 == t_PATH) {
2698 if (*c2 && type1 != type2)
2699 return type1 == t_PATH ? 1 : -1;
2708 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2709 c2 = (const uchar*)f2->basename;
2710 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2712 state2 = s_TRAILING;
2718 state2 = s_TRAILING;
2719 if (type2 == t_PATH) {
2732 return type1 == t_PATH ? 1 : -1;
2734 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2739 /* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2740 * not match if f2's basename is not an exact match of a path element in f1.
2741 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2742 int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2746 return found_prefix;
2749 char *f_name_buf(void)
2751 static char names[5][MAXPATHLEN];
2752 static unsigned int n;
2754 n = (n + 1) % (sizeof names / sizeof names[0]);
2759 /* Return a copy of the full filename of a flist entry, using the indicated
2760 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2761 * done because we checked the size when creating the file_struct entry.
2763 char *f_name(const struct file_struct *f, char *fbuf)
2765 if (!f || !F_IS_ACTIVE(f))
2769 fbuf = f_name_buf();
2772 int len = strlen(f->dirname);
2773 memcpy(fbuf, f->dirname, len);
2775 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2777 strlcpy(fbuf, f->basename, MAXPATHLEN);
2782 /* Do a non-recursive scan of the named directory, possibly ignoring all
2783 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2784 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2785 * buffer (the functions we call will append names onto the end, but the old
2786 * dir value will be restored on exit). */
2787 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2789 struct file_list *dirlist;
2790 char dirbuf[MAXPATHLEN];
2791 int save_recurse = recurse;
2792 int save_xfer_dirs = xfer_dirs;
2793 int save_prune_empty_dirs = prune_empty_dirs;
2796 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2797 if (dlen >= MAXPATHLEN)
2802 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2806 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2807 xfer_dirs = save_xfer_dirs;
2808 recurse = save_recurse;
2810 flist_count_offset += dirlist->used;
2812 prune_empty_dirs = 0;
2813 dirlist->sorted = dirlist->files;
2814 clean_flist(dirlist, 0);
2815 prune_empty_dirs = save_prune_empty_dirs;
2818 output_flist(dirlist);