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 version 3 as
11 * published by the Free Software Foundation.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License along
19 * with this program; if not, visit the http://fsf.org website.
32 extern int am_generator;
33 extern int inc_recurse;
34 extern int do_progress;
35 extern int always_checksum;
37 extern int ignore_errors;
38 extern int numeric_ids;
42 extern int filesfrom_fd;
43 extern int one_file_system;
44 extern int copy_dirlinks;
45 extern int keep_dirlinks;
46 extern int preserve_acls;
47 extern int preserve_xattrs;
48 extern int preserve_links;
49 extern int preserve_hard_links;
50 extern int preserve_devices;
51 extern int preserve_specials;
54 extern int relative_paths;
55 extern int implied_dirs;
56 extern int file_extra_cnt;
57 extern int ignore_perishable;
58 extern int non_perishable_cnt;
59 extern int prune_empty_dirs;
60 extern int copy_links;
61 extern int copy_unsafe_links;
62 extern int protocol_version;
63 extern int sanitize_paths;
64 extern struct stats stats;
66 extern char curr_dir[MAXPATHLEN];
68 extern struct chmod_mode_struct *chmod_modes;
70 extern struct filter_list_struct filter_list;
71 extern struct filter_list_struct server_filter_list;
75 extern int need_unsorted_flist;
76 extern iconv_t ic_send, ic_recv;
79 #define PTR_SIZE (sizeof (struct file_struct *))
83 dev_t filesystem_dev; /* used to implement -x */
85 struct file_list *cur_flist, *first_flist, *dir_flist;
86 int send_dir_ndx = -1, send_dir_depth = 0;
87 int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
88 int file_total = 0; /* total of all active items over all file-lists */
89 int flist_eof = 0; /* all the file-lists are now known */
91 /* The tmp_* vars are used as a cache area by make_file() to store data
92 * that the sender doesn't need to remember in its file list. The data
93 * will survive just long enough to be used by send_file_entry(). */
94 static dev_t tmp_rdev;
95 #ifdef SUPPORT_HARD_LINKS
96 static int64 tmp_dev, tmp_ino;
98 static char tmp_sum[MAX_DIGEST_LEN];
100 static char empty_sum[MAX_DIGEST_LEN];
101 static int flist_count_offset; /* for --delete --progress */
102 static int dir_count = 0;
104 static void clean_flist(struct file_list *flist, int strip_root);
105 static void output_flist(struct file_list *flist);
107 void init_flist(void)
110 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
111 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
113 checksum_len = protocol_version < 21 ? 2
114 : protocol_version < 30 ? MD4_DIGEST_LEN
118 static int show_filelist_p(void)
120 return verbose && xfer_dirs && !am_server && !inc_recurse;
123 static void start_filelist_progress(char *kind)
125 rprintf(FCLIENT, "%s ... ", kind);
126 if (verbose > 1 || do_progress)
127 rprintf(FCLIENT, "\n");
131 static void emit_filelist_progress(int count)
133 rprintf(FCLIENT, " %d files...\r", count);
136 static void maybe_emit_filelist_progress(int count)
138 if (do_progress && show_filelist_p() && (count % 100) == 0)
139 emit_filelist_progress(count);
142 static void finish_filelist_progress(const struct file_list *flist)
145 /* This overwrites the progress line */
146 rprintf(FINFO, "%d file%sto consider\n",
147 flist->count, flist->count == 1 ? " " : "s ");
149 rprintf(FINFO, "done\n");
152 void show_flist_stats(void)
157 static void list_file_entry(struct file_struct *f)
159 char permbuf[PERMSTRING_SIZE];
162 if (!F_IS_ACTIVE(f)) {
163 /* this can happen if duplicate names were removed */
167 permstring(permbuf, f->mode);
170 /* TODO: indicate '+' if the entry has an ACL. */
173 if (preserve_links && S_ISLNK(f->mode)) {
174 rprintf(FINFO, "%s %11.0f %s %s -> %s\n",
175 permbuf, len, timestring(f->modtime),
176 f_name(f, NULL), F_SYMLINK(f));
180 rprintf(FINFO, "%s %11.0f %s %s\n",
181 permbuf, len, timestring(f->modtime),
186 /* Stat either a symlink or its referent, depending on the settings of
187 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
189 * If path is the name of a symlink, then the linkbuf buffer (which must hold
190 * MAXPATHLEN chars) will be set to the symlink's target string.
192 * The stat structure pointed to by stp will contain information about the
193 * link or the referent as appropriate, if they exist. */
194 static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
197 if (link_stat(path, stp, copy_dirlinks) < 0)
199 if (S_ISLNK(stp->st_mode)) {
200 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
203 linkbuf[llen] = '\0';
204 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
206 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
209 return x_stat(path, stp, NULL);
214 return x_stat(path, stp, NULL);
218 int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
222 return x_stat(path, stp, NULL);
223 if (x_lstat(path, stp, NULL) < 0)
225 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
227 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
232 return x_stat(path, stp, NULL);
236 /* This function is used to check if a file should be included/excluded
237 * from the list of files based on its name and type etc. The value of
238 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
239 static int is_excluded(char *fname, int is_dir, int filter_level)
241 #if 0 /* This currently never happens, so avoid a useless compare. */
242 if (filter_level == NO_FILTERS)
246 /* never exclude '.', even if somebody does --exclude '*' */
247 if (fname[0] == '.' && !fname[1])
249 /* Handle the -R version of the '.' dir. */
250 if (fname[0] == '/') {
251 int len = strlen(fname);
252 if (fname[len-1] == '.' && fname[len-2] == '/')
256 if (server_filter_list.head
257 && check_filter(&server_filter_list, fname, is_dir) < 0)
259 if (filter_level != ALL_FILTERS)
262 && check_filter(&filter_list, fname, is_dir) < 0)
267 static void send_directory(int f, struct file_list *flist,
268 char *fbuf, int len, int flags);
270 static const char *pathname, *orig_dir;
271 static int pathname_len;
274 /* Make sure flist can hold at least flist->count + extra entries. */
275 static void flist_expand(struct file_list *flist, int extra)
277 struct file_struct **new_ptr;
279 if (flist->count + extra <= flist->malloced)
282 if (flist->malloced < FLIST_START)
283 flist->malloced = FLIST_START;
284 else if (flist->malloced >= FLIST_LINEAR)
285 flist->malloced += FLIST_LINEAR;
287 flist->malloced *= 2;
289 /* In case count jumped or we are starting the list
290 * with a known size just set it. */
291 if (flist->malloced < flist->count + extra)
292 flist->malloced = flist->count + extra;
294 new_ptr = realloc_array(flist->files, struct file_struct *,
297 if (verbose >= 2 && flist->malloced != FLIST_START) {
298 rprintf(FCLIENT, "[%s] expand file_list to %.0f bytes, did%s move\n",
300 (double)sizeof flist->files[0] * flist->malloced,
301 (new_ptr == flist->files) ? " not" : "");
304 flist->files = new_ptr;
307 out_of_memory("flist_expand");
310 static void flist_done_allocating(struct file_list *flist)
312 void *ptr = pool_boundary(flist->file_pool, 8*1024);
313 if (flist->pool_boundary == ptr)
314 flist->pool_boundary = NULL; /* list didn't use any pool memory */
316 flist->pool_boundary = ptr;
319 int push_pathname(const char *dir, int len)
325 orig_dir = strdup(curr_dir);
327 if (pathname && !pop_dir(orig_dir)) {
328 rsyserr(FERROR, errno, "pop_dir %s failed",
329 full_fname(orig_dir));
330 exit_cleanup(RERR_FILESELECT);
333 if (dir && !push_dir(dir, 0)) {
334 io_error |= IOERR_GENERAL;
335 rsyserr(FERROR, errno, "push_dir %s failed in %s",
336 full_fname(dir), curr_dir);
341 pathname_len = len >= 0 ? len : dir ? (int)strlen(dir) : 0;
346 static void send_file_entry(int f, struct file_struct *file, int ndx)
348 static time_t modtime;
352 static uint32 rdev_major;
355 static char *user_name, *group_name;
356 static char lastname[MAXPATHLEN];
357 char fname[MAXPATHLEN];
358 int first_hlink_ndx = -1;
363 if (ic_send != (iconv_t)-1) {
364 ICONV_CONST char *ibuf;
366 size_t ocnt = MAXPATHLEN, icnt;
368 iconv(ic_send, NULL,0, NULL,0);
369 if ((ibuf = (ICONV_CONST char *)file->dirname) != NULL) {
371 ocnt--; /* pre-subtract the space for the '/' */
372 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1)
377 ibuf = (ICONV_CONST char *)file->basename;
379 if (iconv(ic_send, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
381 io_error |= IOERR_GENERAL;
383 "[%s] cannot convert filename: %s (%s)\n",
384 who_am_i(), f_name(file, fname), strerror(errno));
392 flags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
394 if (file->mode == mode)
395 flags |= XMIT_SAME_MODE;
398 if ((preserve_devices && IS_DEVICE(mode))
399 || (preserve_specials && IS_SPECIAL(mode))) {
400 if (protocol_version < 28) {
401 if (tmp_rdev == rdev)
402 flags |= XMIT_SAME_RDEV_pre28;
407 if ((uint32)major(rdev) == rdev_major)
408 flags |= XMIT_SAME_RDEV_MAJOR;
410 rdev_major = major(rdev);
411 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
412 flags |= XMIT_RDEV_MINOR_8_pre30;
414 } else if (protocol_version < 28)
415 rdev = MAKEDEV(0, 0);
417 if ((uid_t)F_OWNER(file) == uid && *lastname)
418 flags |= XMIT_SAME_UID;
421 if (uid_ndx && !numeric_ids) {
422 user_name = add_uid(uid);
423 if (inc_recurse && user_name)
424 flags |= XMIT_USER_NAME_FOLLOWS;
429 if ((gid_t)F_GROUP(file) == gid && *lastname)
430 flags |= XMIT_SAME_GID;
433 if (gid_ndx && !numeric_ids) {
434 group_name = add_gid(gid);
435 if (inc_recurse && group_name)
436 flags |= XMIT_GROUP_NAME_FOLLOWS;
440 if (file->modtime == modtime)
441 flags |= XMIT_SAME_TIME;
443 modtime = file->modtime;
445 #ifdef SUPPORT_HARD_LINKS
447 if (protocol_version >= 30) {
448 struct idev_node *np = idev_node(tmp_dev, tmp_ino);
449 first_hlink_ndx = (int32)(long)np->data - 1;
450 if (first_hlink_ndx < 0) {
451 np->data = (void*)(long)(ndx + 1);
452 flags |= XMIT_HLINK_FIRST;
454 flags |= XMIT_HLINKED;
456 if (tmp_dev == dev) {
457 if (protocol_version >= 28)
458 flags |= XMIT_SAME_DEV_pre30;
461 flags |= XMIT_HLINKED;
467 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
469 l2 = strlen(fname+l1);
472 flags |= XMIT_SAME_NAME;
474 flags |= XMIT_LONG_NAME;
476 /* We must make sure we don't send a zero flag byte or the
477 * other end will terminate the flist transfer. Note that
478 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
479 * it's harmless way to add a bit to the first flag byte. */
480 if (protocol_version >= 28) {
481 if (!flags && !S_ISDIR(mode))
482 flags |= XMIT_TOP_DIR;
483 if ((flags & 0xFF00) || !flags) {
484 flags |= XMIT_EXTENDED_FLAGS;
485 write_shortint(f, flags);
487 write_byte(f, flags);
490 flags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
491 write_byte(f, flags);
493 if (flags & XMIT_SAME_NAME)
495 if (flags & XMIT_LONG_NAME)
496 write_varint30(f, l2);
499 write_buf(f, fname + l1, l2);
501 if (first_hlink_ndx >= 0) {
502 write_varint30(f, first_hlink_ndx);
506 write_varlong30(f, F_LENGTH(file), 3);
507 if (!(flags & XMIT_SAME_TIME)) {
508 if (protocol_version >= 30)
509 write_varlong(f, modtime, 4);
511 write_int(f, modtime);
513 if (!(flags & XMIT_SAME_MODE))
514 write_int(f, to_wire_mode(mode));
515 if (uid_ndx && !(flags & XMIT_SAME_UID)) {
516 if (protocol_version < 30)
519 write_varint(f, uid);
520 if (flags & XMIT_USER_NAME_FOLLOWS) {
521 int len = strlen(user_name);
523 write_buf(f, user_name, len);
527 if (gid_ndx && !(flags & XMIT_SAME_GID)) {
528 if (protocol_version < 30)
531 write_varint(f, gid);
532 if (flags & XMIT_GROUP_NAME_FOLLOWS) {
533 int len = strlen(group_name);
535 write_buf(f, group_name, len);
539 if ((preserve_devices && IS_DEVICE(mode))
540 || (preserve_specials && IS_SPECIAL(mode))) {
541 if (protocol_version < 28) {
542 if (!(flags & XMIT_SAME_RDEV_pre28))
543 write_int(f, (int)rdev);
545 if (!(flags & XMIT_SAME_RDEV_MAJOR))
546 write_varint30(f, major(rdev));
547 if (protocol_version >= 30)
548 write_varint(f, minor(rdev));
549 else if (flags & XMIT_RDEV_MINOR_8_pre30)
550 write_byte(f, minor(rdev));
552 write_int(f, minor(rdev));
557 if (preserve_links && S_ISLNK(mode)) {
558 const char *sl = F_SYMLINK(file);
559 int len = strlen(sl);
560 write_varint30(f, len);
561 write_buf(f, sl, len);
565 #ifdef SUPPORT_HARD_LINKS
566 if (tmp_dev != 0 && protocol_version < 30) {
567 if (protocol_version < 26) {
568 /* 32-bit dev_t and ino_t */
569 write_int(f, (int32)dev);
570 write_int(f, (int32)tmp_ino);
572 /* 64-bit dev_t and ino_t */
573 if (!(flags & XMIT_SAME_DEV_pre30))
574 write_longint(f, dev);
575 write_longint(f, tmp_ino);
580 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
585 /* Prior to 28, we sent a useless set of nulls. */
588 write_buf(f, sum, checksum_len);
592 strlcpy(lastname, fname, MAXPATHLEN);
594 if (S_ISREG(mode) || S_ISLNK(mode))
595 stats.total_size += F_LENGTH(file);
598 static struct file_struct *recv_file_entry(struct file_list *flist,
601 static int64 modtime;
605 static uint32 rdev_major;
608 static uint16 gid_flags;
609 static char lastname[MAXPATHLEN], *lastdir;
610 static int lastdir_depth, lastdir_len = -1;
611 static unsigned int del_hier_name_len = 0;
612 static int in_del_hier = 0;
613 char thisname[MAXPATHLEN];
614 unsigned int l1 = 0, l2 = 0;
615 int alloc_len, basename_len, linkname_len;
616 int extra_len = file_extra_cnt * EXTRA_LEN;
617 int first_hlink_ndx = -1;
619 const char *basename;
620 struct file_struct *file;
624 if (xflags & XMIT_SAME_NAME)
627 if (xflags & XMIT_LONG_NAME)
628 l2 = read_varint30(f);
632 if (l2 >= MAXPATHLEN - l1) {
634 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
635 xflags, l1, l2, lastname, who_am_i());
636 overflow_exit("recv_file_entry");
639 strlcpy(thisname, lastname, l1 + 1);
640 read_sbuf(f, &thisname[l1], l2);
641 thisname[l1 + l2] = 0;
643 /* Abuse basename_len for a moment... */
644 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
647 if (ic_recv != (iconv_t)-1) {
648 char *obuf = thisname;
649 ICONV_CONST char *ibuf = (ICONV_CONST char *)lastname;
650 size_t ocnt = MAXPATHLEN, icnt = basename_len;
652 if (icnt >= MAXPATHLEN) {
657 iconv(ic_recv, NULL,0, NULL,0);
658 if (iconv(ic_recv, &ibuf,&icnt, &obuf,&ocnt) == (size_t)-1) {
660 io_error |= IOERR_GENERAL;
662 "[%s] cannot convert filename: %s (%s)\n",
663 who_am_i(), lastname, strerror(errno));
670 clean_fname(thisname, 0);
673 sanitize_path(thisname, thisname, "", 0, NULL);
675 if ((basename = strrchr(thisname, '/')) != NULL) {
676 int len = basename++ - thisname;
677 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
678 lastdir = new_array(char, len + 1);
679 memcpy(lastdir, thisname, len);
682 lastdir_depth = count_dir_elements(lastdir);
686 basename_len = strlen(basename) + 1; /* count the '\0' */
688 #ifdef SUPPORT_HARD_LINKS
689 if (protocol_version >= 30
690 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
691 struct file_struct *first;
692 first_hlink_ndx = read_varint30(f);
693 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->count) {
695 "hard-link reference out of range: %d (%d)\n",
696 first_hlink_ndx, flist->count);
697 exit_cleanup(RERR_PROTOCOL);
699 first = flist->files[first_hlink_ndx];
700 file_length = F_LENGTH(first);
701 modtime = first->modtime;
704 uid = F_OWNER(first);
706 gid = F_GROUP(first);
707 if ((preserve_devices && IS_DEVICE(mode))
708 || (preserve_specials && IS_SPECIAL(mode))) {
709 uint32 *devp = F_RDEV_P(first);
710 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
711 extra_len += 2 * EXTRA_LEN;
713 if (preserve_links && S_ISLNK(mode))
714 linkname_len = strlen(F_SYMLINK(first)) + 1;
721 file_length = read_varlong30(f, 3);
722 if (!(xflags & XMIT_SAME_TIME)) {
723 if (protocol_version >= 30) {
724 modtime = read_varlong(f, 4);
725 #if SIZEOF_TIME_T < SIZEOF_INT64
726 if ((modtime > INT_MAX || modtime < INT_MIN) && !am_generator) {
728 "Time value of %s truncated on receiver.\n",
733 modtime = read_int(f);
735 if (!(xflags & XMIT_SAME_MODE))
736 mode = from_wire_mode(read_int(f));
738 if (chmod_modes && !S_ISLNK(mode))
739 mode = tweak_mode(mode, chmod_modes);
741 if (uid_ndx && !(xflags & XMIT_SAME_UID)) {
742 if (protocol_version < 30)
743 uid = (uid_t)read_int(f);
745 uid = (uid_t)read_varint(f);
746 if (xflags & XMIT_USER_NAME_FOLLOWS)
747 uid = recv_user_name(f, uid);
748 else if (inc_recurse && am_root && !numeric_ids)
749 uid = match_uid(uid);
752 if (gid_ndx && !(xflags & XMIT_SAME_GID)) {
753 if (protocol_version < 30)
754 gid = (gid_t)read_int(f);
756 gid = (gid_t)read_varint(f);
758 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
759 gid = recv_group_name(f, gid, &gid_flags);
760 else if (inc_recurse && (!am_root || !numeric_ids))
761 gid = match_gid(gid, &gid_flags);
765 if ((preserve_devices && IS_DEVICE(mode))
766 || (preserve_specials && IS_SPECIAL(mode))) {
767 if (protocol_version < 28) {
768 if (!(xflags & XMIT_SAME_RDEV_pre28))
769 rdev = (dev_t)read_int(f);
772 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
773 rdev_major = read_varint30(f);
774 if (protocol_version >= 30)
775 rdev_minor = read_varint(f);
776 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
777 rdev_minor = read_byte(f);
779 rdev_minor = read_int(f);
780 rdev = MAKEDEV(rdev_major, rdev_minor);
782 extra_len += 2 * EXTRA_LEN;
784 } else if (protocol_version < 28)
785 rdev = MAKEDEV(0, 0);
788 if (preserve_links && S_ISLNK(mode)) {
789 linkname_len = read_varint30(f) + 1; /* count the '\0' */
790 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
791 rprintf(FERROR, "overflow: linkname_len=%d\n",
793 overflow_exit("recv_file_entry");
800 #ifdef SUPPORT_HARD_LINKS
802 if (preserve_hard_links) {
803 if (protocol_version < 28 && S_ISREG(mode))
804 xflags |= XMIT_HLINKED;
805 if (xflags & XMIT_HLINKED)
806 extra_len += EXTRA_LEN;
811 /* We need one or two index int32s when we're preserving ACLs. */
813 extra_len += (S_ISDIR(mode) ? 2 : 1) * EXTRA_LEN;
816 if (always_checksum && S_ISREG(mode))
817 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
819 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
820 extra_len += EXTRA_LEN;
822 #if EXTRA_ROUNDING > 0
823 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
824 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
827 if (inc_recurse && S_ISDIR(mode)) {
828 if (one_file_system) {
829 /* Room to save the dir's device for -x */
830 extra_len += 2 * EXTRA_LEN;
832 pool = dir_flist->file_pool;
834 pool = flist->file_pool;
836 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
838 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
840 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
842 file = (struct file_struct *)bp;
843 bp += FILE_STRUCT_LEN;
845 memcpy(bp, basename, basename_len);
846 bp += basename_len + linkname_len; /* skip space for symlink too */
848 #ifdef SUPPORT_HARD_LINKS
849 if (xflags & XMIT_HLINKED)
850 file->flags |= FLAG_HLINKED;
852 file->modtime = (time_t)modtime;
853 file->len32 = (uint32)file_length;
854 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
855 file->flags |= FLAG_LENGTH64;
856 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
863 file->flags |= gid_flags;
867 F_NDX(file) = flist->count + flist->ndx_start;
870 if (basename != thisname) {
871 file->dirname = lastdir;
872 F_DEPTH(file) = lastdir_depth + 1;
877 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
879 if (xflags & XMIT_TOP_DIR) {
880 in_del_hier = recurse;
881 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
882 if (relative_paths && del_hier_name_len > 2
883 && lastname[del_hier_name_len-1] == '.'
884 && lastname[del_hier_name_len-2] == '/')
885 del_hier_name_len -= 2;
886 file->flags |= FLAG_TOP_DIR | FLAG_XFER_DIR;
887 } else if (in_del_hier) {
888 if (!relative_paths || !del_hier_name_len
889 || (l1 >= del_hier_name_len
890 && lastname[del_hier_name_len] == '/'))
891 file->flags |= FLAG_XFER_DIR;
897 if ((preserve_devices && IS_DEVICE(mode))
898 || (preserve_specials && IS_SPECIAL(mode))) {
899 uint32 *devp = F_RDEV_P(file);
900 DEV_MAJOR(devp) = major(rdev);
901 DEV_MINOR(devp) = minor(rdev);
906 bp = (char*)file->basename + basename_len;
907 if (first_hlink_ndx >= 0) {
908 struct file_struct *first = flist->files[first_hlink_ndx];
909 memcpy(bp, F_SYMLINK(first), linkname_len);
911 read_sbuf(f, bp, linkname_len - 1);
913 sanitize_path(bp, bp, "", lastdir_depth, NULL);
917 #ifdef SUPPORT_HARD_LINKS
918 if (preserve_hard_links && xflags & XMIT_HLINKED) {
919 if (protocol_version >= 30) {
920 F_HL_GNUM(file) = xflags & XMIT_HLINK_FIRST
921 ? flist->count : first_hlink_ndx;
923 static int32 cnt = 0;
924 struct idev_node *np;
927 if (protocol_version < 26) {
931 if (!(xflags & XMIT_SAME_DEV_pre30))
932 dev = read_longint(f);
933 ino = read_longint(f);
935 np = idev_node(dev, ino);
936 ndx = (int32)(long)np->data - 1;
939 np->data = (void*)(long)cnt;
941 F_HL_GNUM(file) = ndx;
946 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
948 bp = (char*)F_SUM(file);
950 /* Prior to 28, we get a useless set of nulls. */
953 if (first_hlink_ndx >= 0) {
954 struct file_struct *first = flist->files[first_hlink_ndx];
955 memcpy(bp, F_SUM(first), checksum_len);
957 read_buf(f, bp, checksum_len);
961 if (preserve_acls && !S_ISLNK(mode))
962 receive_acl(file, f);
964 #ifdef SUPPORT_XATTRS
966 receive_xattr(file, f );
969 if (S_ISREG(mode) || S_ISLNK(mode))
970 stats.total_size += file_length;
976 * Create a file_struct for a named file by reading its stat()
977 * information and performing extensive checks against global
980 * @return the new file, or NULL if there was an error or this file
981 * should be excluded.
983 * @todo There is a small optimization opportunity here to avoid
984 * stat()ing the file in some circumstances, which has a certain cost.
985 * We are called immediately after doing readdir(), and so we may
986 * already know the d_type of the file. We could for example avoid
987 * statting directories if we're not recursing, but this is not a very
988 * important case. Some systems may not have d_type.
990 struct file_struct *make_file(const char *fname, struct file_list *flist,
991 STRUCT_STAT *stp, int flags, int filter_level)
993 static char *lastdir;
994 static int lastdir_len = -1;
995 struct file_struct *file;
997 char thisname[MAXPATHLEN];
998 char linkname[MAXPATHLEN];
999 int alloc_len, basename_len, linkname_len;
1000 int extra_len = file_extra_cnt * EXTRA_LEN;
1001 const char *basename;
1005 if (strlcpy(thisname, fname, sizeof thisname)
1006 >= sizeof thisname - pathname_len) {
1007 rprintf(FINFO, "skipping overly long name: %s\n", fname);
1010 clean_fname(thisname, 0);
1012 sanitize_path(thisname, thisname, "", 0, NULL);
1014 if (stp && S_ISDIR(stp->st_mode)) {
1015 st = *stp; /* Needed for "symlink/." with --relative. */
1016 *linkname = '\0'; /* make IBM code checker happy */
1017 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1018 int save_errno = errno;
1019 /* See if file is excluded before reporting an error. */
1020 if (filter_level != NO_FILTERS
1021 && (is_excluded(thisname, 0, filter_level)
1022 || is_excluded(thisname, 1, filter_level))) {
1023 if (ignore_perishable && save_errno != ENOENT)
1024 non_perishable_cnt++;
1027 if (save_errno == ENOENT) {
1028 #ifdef SUPPORT_LINKS
1029 /* Avoid "vanished" error if symlink points nowhere. */
1030 if (copy_links && x_lstat(thisname, &st, NULL) == 0
1031 && S_ISLNK(st.st_mode)) {
1032 io_error |= IOERR_GENERAL;
1033 rprintf(FERROR, "symlink has no referent: %s\n",
1034 full_fname(thisname));
1038 enum logcode c = am_daemon && protocol_version < 28
1040 io_error |= IOERR_VANISHED;
1041 rprintf(c, "file has vanished: %s\n",
1042 full_fname(thisname));
1045 io_error |= IOERR_GENERAL;
1046 rsyserr(FERROR, save_errno, "readlink %s failed",
1047 full_fname(thisname));
1052 /* backup.c calls us with filter_level set to NO_FILTERS. */
1053 if (filter_level == NO_FILTERS)
1056 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1057 rprintf(FINFO, "skipping directory %s\n", thisname);
1061 /* -x only affects directories because we need to avoid recursing
1062 * into a mount-point directory, not to avoid copying a symlinked
1063 * file if -L (or similar) was specified. */
1064 if (one_file_system && st.st_dev != filesystem_dev
1065 && S_ISDIR(st.st_mode)) {
1066 if (one_file_system > 1) {
1068 rprintf(FINFO, "skipping mount-point dir %s\n",
1073 flags |= FLAG_MOUNT_DIR;
1076 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1077 if (ignore_perishable)
1078 non_perishable_cnt++;
1082 if (lp_ignore_nonreadable(module_id)) {
1083 #ifdef SUPPORT_LINKS
1084 if (!S_ISLNK(st.st_mode))
1086 if (access(thisname, R_OK) != 0)
1092 /* Only divert a directory in the main transfer. */
1094 if (flist->prev && S_ISDIR(st.st_mode)
1095 && flags & FLAG_DIVERT_DIRS) {
1096 /* Room for parent/sibling/next-child info. */
1097 extra_len += 3 * EXTRA_LEN;
1099 pool = dir_flist->file_pool;
1101 pool = flist->file_pool;
1106 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1107 who_am_i(), thisname, filter_level);
1110 if ((basename = strrchr(thisname, '/')) != NULL) {
1111 int len = basename++ - thisname;
1112 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1113 lastdir = new_array(char, len + 1);
1114 memcpy(lastdir, thisname, len);
1115 lastdir[len] = '\0';
1119 basename = thisname;
1120 basename_len = strlen(basename) + 1; /* count the '\0' */
1122 #ifdef SUPPORT_LINKS
1123 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1128 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1129 extra_len += EXTRA_LEN;
1131 #if EXTRA_ROUNDING > 0
1132 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1133 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1136 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1139 bp = pool_alloc(pool, alloc_len, "make_file");
1141 if (!(bp = new_array(char, alloc_len)))
1142 out_of_memory("make_file");
1145 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1147 file = (struct file_struct *)bp;
1148 bp += FILE_STRUCT_LEN;
1150 memcpy(bp, basename, basename_len);
1151 bp += basename_len + linkname_len; /* skip space for symlink too */
1153 #ifdef SUPPORT_HARD_LINKS
1154 if (preserve_hard_links && flist && flist->prev) {
1155 if (protocol_version >= 28
1156 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1157 : S_ISREG(st.st_mode)) {
1158 tmp_dev = st.st_dev;
1159 tmp_ino = st.st_ino;
1165 #ifdef HAVE_STRUCT_STAT_ST_RDEV
1166 if (IS_DEVICE(st.st_mode) || IS_SPECIAL(st.st_mode)) {
1167 tmp_rdev = st.st_rdev;
1172 file->flags = flags;
1173 file->modtime = st.st_mtime;
1174 file->len32 = (uint32)st.st_size;
1175 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1176 file->flags |= FLAG_LENGTH64;
1177 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1179 file->mode = st.st_mode;
1181 F_OWNER(file) = st.st_uid;
1183 F_GROUP(file) = st.st_gid;
1185 if (basename != thisname)
1186 file->dirname = lastdir;
1188 #ifdef SUPPORT_LINKS
1190 bp = (char*)file->basename + basename_len;
1191 memcpy(bp, linkname, linkname_len);
1195 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1196 file_checksum(thisname, tmp_sum, st.st_size);
1198 F_PATHNAME(file) = pathname;
1200 /* This code is only used by the receiver when it is building
1201 * a list of files for a delete pass. */
1202 if (keep_dirlinks && linkname_len && flist) {
1204 int save_mode = file->mode;
1205 file->mode = S_IFDIR; /* Find a directory with our name. */
1206 if (flist_find(dir_flist, file) >= 0
1207 && x_stat(thisname, &st2, NULL) == 0 && S_ISDIR(st2.st_mode)) {
1208 file->modtime = st2.st_mtime;
1210 file->mode = st2.st_mode;
1212 F_OWNER(file) = st2.st_uid;
1214 F_GROUP(file) = st2.st_gid;
1216 file->mode = save_mode;
1219 if (basename_len == 0+1)
1224 F_NDX(file) = dir_count - 1;
1230 /* Only called for temporary file_struct entries created by make_file(). */
1231 void unmake_file(struct file_struct *file)
1233 int extra_cnt = file_extra_cnt + LEN64_BUMP(file);
1234 #if EXTRA_ROUNDING > 0
1235 if (extra_cnt & EXTRA_ROUNDING)
1236 extra_cnt = (extra_cnt | EXTRA_ROUNDING) + 1;
1238 free(REQ_EXTRA(file, extra_cnt));
1241 static struct file_struct *send_file_name(int f, struct file_list *flist,
1242 char *fname, STRUCT_STAT *stp,
1243 int flags, int filter_flags)
1245 struct file_struct *file;
1246 #if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1250 file = make_file(fname, flist, stp, flags, filter_flags);
1254 if (chmod_modes && !S_ISLNK(file->mode))
1255 file->mode = tweak_mode(file->mode, chmod_modes);
1258 if (preserve_acls && !S_ISLNK(file->mode) && f >= 0) {
1259 sx.st.st_mode = file->mode;
1260 sx.acc_acl = sx.def_acl = NULL;
1261 if (get_acl(fname, &sx) < 0)
1265 #ifdef SUPPORT_XATTRS
1266 if (preserve_xattrs && f >= 0) {
1268 if (get_xattr(fname, &sx) < 0)
1273 maybe_emit_filelist_progress(flist->count + flist_count_offset);
1275 flist_expand(flist, 1);
1276 flist->files[flist->count++] = file;
1278 send_file_entry(f, file, flist->count - 1);
1280 if (preserve_acls && !S_ISLNK(file->mode)) {
1285 #ifdef SUPPORT_XATTRS
1286 if (preserve_xattrs) {
1287 F_XATTR(file) = send_xattr(&sx, f);
1295 static void send_if_directory(int f, struct file_list *flist,
1296 struct file_struct *file,
1297 char *fbuf, unsigned int ol,
1300 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1302 if (S_ISDIR(file->mode)
1303 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1305 unsigned int len = strlen(fbuf);
1306 if (len > 1 && fbuf[len-1] == '/')
1308 if (len >= MAXPATHLEN - 1) {
1309 io_error |= IOERR_GENERAL;
1310 rprintf(FERROR, "skipping long-named directory: %s\n",
1314 save_filters = push_local_filters(fbuf, len);
1315 send_directory(f, flist, fbuf, len, flags);
1316 pop_local_filters(save_filters);
1323 static int file_compare(const void *file1, const void *file2)
1325 return f_name_cmp(*(struct file_struct **)file1,
1326 *(struct file_struct **)file2);
1329 /* The guts of a merge-sort algorithm. This was derived from the glibc
1330 * version, but I (Wayne) changed the merge code to do less copying and
1331 * to require only half the amount of temporary memory. */
1332 static void fsort_tmp(struct file_struct **fp, size_t num,
1333 struct file_struct **tmp)
1335 struct file_struct **f1, **f2, **t;
1344 fsort_tmp(f1, n1, tmp);
1346 fsort_tmp(f2, n2, tmp);
1348 while (f_name_cmp(*f1, *f2) <= 0) {
1355 memcpy(t, f1, n1 * PTR_SIZE);
1357 *f1++ = *f2++, n2--;
1359 while (n1 > 0 && n2 > 0) {
1360 if (f_name_cmp(*t, *f2) <= 0)
1363 *f1++ = *f2++, n2--;
1367 memcpy(f1, t, n1 * PTR_SIZE);
1370 /* This file-struct sorting routine makes sure that any identical names in
1371 * the file list stay in the same order as they were in the original list.
1372 * This is particularly vital in inc_recurse mode where we expect a sort
1373 * on the flist to match the exact order of a sort on the dir_flist. */
1374 static void fsort(struct file_struct **fp, size_t num)
1380 qsort(fp, num, PTR_SIZE, file_compare);
1382 struct file_struct **tmp = new_array(struct file_struct *,
1384 fsort_tmp(fp, num, tmp);
1389 /* We take an entire set of sibling dirs from the sorted flist and link them
1390 * into the tree, setting the appropriate parent/child/sibling pointers. */
1391 static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1396 int32 *parent_dp = parent_ndx < 0 ? NULL
1397 : F_DIRNODE_P(dir_flist->sorted[parent_ndx]);
1399 flist_expand(dir_flist, dir_cnt);
1400 dir_flist->sorted = dir_flist->files;
1402 for (i = 0; dir_cnt; i++) {
1403 struct file_struct *file = from_flist->sorted[i];
1405 if (!S_ISDIR(file->mode))
1408 dir_flist->files[dir_flist->count++] = file;
1411 if (!(file->flags & FLAG_XFER_DIR)
1412 || file->flags & FLAG_MOUNT_DIR)
1416 DIR_NEXT_SIBLING(dp) = dir_flist->count - 1;
1418 DIR_FIRST_CHILD(parent_dp) = dir_flist->count - 1;
1420 send_dir_ndx = dir_flist->count - 1;
1422 dp = F_DIRNODE_P(file);
1423 DIR_PARENT(dp) = parent_ndx;
1424 DIR_FIRST_CHILD(dp) = -1;
1427 DIR_NEXT_SIBLING(dp) = -1;
1430 /* This function is normally called by the sender, but the receiving side also
1431 * calls it from get_dirlist() with f set to -1 so that we just construct the
1432 * file list in memory without sending it over the wire. Also, get_dirlist()
1433 * might call this with f set to -2, which also indicates that local filter
1434 * rules should be ignored. */
1435 static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1442 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1443 int start = flist->count;
1444 int filter_flags = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1446 assert(flist != NULL);
1448 if (!(d = opendir(fbuf))) {
1449 io_error |= IOERR_GENERAL;
1450 rsyserr(FERROR, errno, "opendir %s failed", full_fname(fbuf));
1455 if (len != 1 || *fbuf != '/')
1458 remainder = MAXPATHLEN - (p - fbuf);
1460 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1461 char *dname = d_name(di);
1462 if (dname[0] == '.' && (dname[1] == '\0'
1463 || (dname[1] == '.' && dname[2] == '\0')))
1465 if (strlcpy(p, dname, remainder) >= remainder) {
1466 io_error |= IOERR_GENERAL;
1468 "cannot send long-named file %s\n",
1473 send_file_name(f, flist, fbuf, NULL, flags, filter_flags);
1479 io_error |= IOERR_GENERAL;
1480 rsyserr(FERROR, errno, "readdir(%s)", full_fname(fbuf));
1485 if (f >= 0 && recurse && !divert_dirs) {
1486 int i, end = flist->count - 1;
1487 /* send_if_directory() bumps flist->count, so use "end". */
1488 for (i = start; i <= end; i++)
1489 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1493 static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1495 char fbuf[MAXPATHLEN];
1499 dlen = strlen(fbuf);
1501 if (F_PATHNAME(file) != pathname) {
1502 if (!push_pathname(F_PATHNAME(file), -1))
1503 exit_cleanup(RERR_FILESELECT);
1506 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1508 send_directory(f, flist, fbuf, dlen, FLAG_DIVERT_DIRS | FLAG_XFER_DIR);
1511 void send_extra_file_list(int f, int at_least)
1513 struct file_list *flist;
1515 int future_cnt, save_io_error = io_error;
1520 /* Keep sending data until we have the requested number of
1521 * files in the upcoming file-lists. */
1522 if (cur_flist->next) {
1523 flist = first_flist->prev; /* the newest flist */
1524 future_cnt = flist->count + flist->ndx_start
1525 - cur_flist->next->ndx_start;
1528 while (future_cnt < at_least) {
1529 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1530 int dir_ndx, dstart = dir_count;
1533 flist = flist_new(0, "send_extra_file_list");
1534 start_write = stats.total_written;
1538 dir_ndx = F_NDX(file);
1541 dir_ndx = send_dir_ndx;
1542 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1544 send1extra(f, file, flist);
1545 dp = F_DIRNODE_P(file);
1547 /* If there are any duplicate directory names that follow, we
1548 * send all the dirs together in one file-list. The dir_flist
1549 * tree links all the child subdirs onto the last dup dir. */
1550 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1551 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1552 send_dir_ndx = dir_ndx;
1553 file = dir_flist->sorted[dir_ndx];
1554 send1extra(f, file, flist);
1555 dp = F_DIRNODE_P(file);
1561 if (need_unsorted_flist) {
1562 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1563 out_of_memory("send_extra_file_list");
1564 memcpy(flist->sorted, flist->files,
1565 flist->count * sizeof (struct file_struct*));
1568 flist->sorted = flist->files;
1570 clean_flist(flist, 0);
1572 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1573 flist_done_allocating(flist);
1575 file_total += flist->count;
1576 future_cnt += flist->count;
1577 stats.flist_size += stats.total_written - start_write;
1578 stats.num_files += flist->count;
1580 output_flist(flist);
1582 if (DIR_FIRST_CHILD(dp) >= 0) {
1583 send_dir_ndx = DIR_FIRST_CHILD(dp);
1586 while (DIR_NEXT_SIBLING(dp) < 0) {
1587 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1588 write_ndx(f, NDX_FLIST_EOF);
1590 change_local_filter_dir(NULL, 0, 0);
1594 file = dir_flist->sorted[send_dir_ndx];
1595 dp = F_DIRNODE_P(file);
1597 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1602 if (io_error != save_io_error && !ignore_errors)
1603 send_msg_int(MSG_IO_ERROR, io_error);
1606 struct file_list *send_file_list(int f, int argc, char *argv[])
1608 static const char *lastdir;
1609 static int lastdir_len = -1;
1613 char lastpath[MAXPATHLEN] = "";
1614 struct file_list *flist;
1615 struct timeval start_tv, end_tv;
1618 int flags, disable_buffering;
1620 rprintf(FLOG, "building file list\n");
1621 if (show_filelist_p())
1622 start_filelist_progress("building file list");
1623 else if (inc_recurse && verbose && !am_server)
1624 rprintf(FCLIENT, "sending incremental file list\n");
1626 start_write = stats.total_written;
1627 gettimeofday(&start_tv, NULL);
1629 #ifdef SUPPORT_HARD_LINKS
1630 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1634 flist = cur_flist = flist_new(0, "send_file_list");
1636 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1637 flags = FLAG_DIVERT_DIRS;
1639 dir_flist = cur_flist;
1643 disable_buffering = io_start_buffering_out(f);
1644 if (filesfrom_fd >= 0) {
1645 if (argv[0] && !push_dir(argv[0], 0)) {
1646 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1647 full_fname(argv[0]), curr_dir);
1648 exit_cleanup(RERR_FILESELECT);
1654 char fbuf[MAXPATHLEN];
1659 if (read_filesfrom_line(filesfrom_fd, fbuf) == 0)
1661 sanitize_path(fbuf, fbuf, "", 0, NULL);
1665 strlcpy(fbuf, *argv++, MAXPATHLEN);
1667 sanitize_path(fbuf, fbuf, "", 0, NULL);
1671 if (relative_paths) {
1672 /* We clean up fbuf below. */
1674 } else if (!len || fbuf[len - 1] == '/') {
1675 if (len == 2 && fbuf[0] == '.') {
1676 /* Turn "./" into just "." rather than "./." */
1679 if (len + 1 >= MAXPATHLEN)
1680 overflow_exit("send_file_list");
1685 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
1686 && (len == 2 || fbuf[len-3] == '/')) {
1687 if (len + 2 >= MAXPATHLEN)
1688 overflow_exit("send_file_list");
1694 is_dot_dir = fbuf[len-1] == '.'
1695 && (len == 1 || fbuf[len-2] == '/');
1700 if (!relative_paths) {
1701 p = strrchr(fbuf, '/');
1708 len -= p - fbuf + 1;
1713 if ((p = strstr(fbuf, "/./")) != NULL) {
1719 len -= p - fbuf + 3;
1723 /* Get rid of trailing "/" and "/.". */
1725 if (fn[len - 1] == '/') {
1727 if (!--len && !dir) {
1732 else if (len >= 2 && fn[len - 1] == '.'
1733 && fn[len - 2] == '/') {
1735 if (!(len -= 2) && !dir) {
1742 if (len == 1 && fn[0] == '/')
1745 /* Reject a ".." dir in the active part of the path. */
1746 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
1747 if ((p[2] == '/' || p[2] == '\0')
1748 && (p == fn || p[-1] == '/')) {
1750 "found \"..\" dir in relative path: %s\n",
1752 exit_cleanup(RERR_SYNTAX);
1762 dirlen = dir ? strlen(dir) : 0;
1763 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
1764 if (!push_pathname(dir ? strdup(dir) : NULL, dirlen))
1767 lastdir_len = pathname_len;
1768 } else if (!push_pathname(lastdir, lastdir_len)) {
1770 io_error |= IOERR_GENERAL;
1771 rsyserr(FERROR, errno, "push_dir %s failed in %s",
1772 full_fname(dir), curr_dir);
1777 memmove(fbuf, fn, len + 1);
1779 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1780 io_error |= IOERR_GENERAL;
1781 rsyserr(FERROR, errno, "link_stat %s failed",
1786 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
1787 rprintf(FINFO, "skipping directory %s\n", fbuf);
1791 if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
1792 /* Send the implied directories at the start of the
1793 * source spec, so we get their permissions right. */
1794 char *lp = lastpath, *slash = fbuf;
1796 /* Skip any initial directories in our path that we
1797 * have in common with lastpath. */
1798 for (fn = fbuf; *fn && *lp == *fn; lp++, fn++) {
1803 if (fn != p || (*lp && *lp != '/')) {
1804 int save_copy_links = copy_links;
1805 int save_xfer_dirs = xfer_dirs;
1806 int dir_flags = inc_recurse ? FLAG_DIVERT_DIRS : 0;
1807 copy_links |= copy_unsafe_links;
1809 while ((slash = strchr(slash+1, '/')) != 0) {
1811 send_file_name(f, flist, fbuf, NULL,
1812 dir_flags, ALL_FILTERS);
1815 copy_links = save_copy_links;
1816 xfer_dirs = save_xfer_dirs;
1818 strlcpy(lastpath, fbuf, sizeof lastpath);
1823 if (one_file_system)
1824 filesystem_dev = st.st_dev;
1826 if (recurse || (xfer_dirs && is_dot_dir)) {
1827 struct file_struct *file;
1828 int top_flags = FLAG_TOP_DIR | FLAG_XFER_DIR | flags;
1829 file = send_file_name(f, flist, fbuf, &st,
1830 top_flags, ALL_FILTERS);
1831 if (file && !inc_recurse)
1832 send_if_directory(f, flist, file, fbuf, len, flags);
1834 send_file_name(f, flist, fbuf, &st, flags, ALL_FILTERS);
1837 gettimeofday(&end_tv, NULL);
1838 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1839 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1840 if (stats.flist_buildtime == 0)
1841 stats.flist_buildtime = 1;
1844 write_byte(f, 0); /* Indicate end of file list */
1846 #ifdef SUPPORT_HARD_LINKS
1847 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
1851 if (show_filelist_p())
1852 finish_filelist_progress(flist);
1854 gettimeofday(&end_tv, NULL);
1855 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
1856 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
1858 /* When converting names, both sides keep an unsorted file-list array
1859 * because the names will differ on the sending and receiving sides
1860 * (both sides will use the unsorted index number for each item). */
1862 /* Sort the list without removing any duplicates. This allows the
1863 * receiving side to ask for whatever name it kept. For incremental
1864 * recursion mode, the sender marks duplicate dirs so that it can
1865 * send them together in a single file-list. */
1867 if (need_unsorted_flist) {
1869 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1870 out_of_memory("send_file_list");
1871 memcpy(flist->sorted, flist->files,
1872 flist->count * sizeof (struct file_struct*));
1873 clean_flist(flist, 0);
1875 flist->sorted = flist->files;
1879 flist->sorted = flist->files;
1880 clean_flist(flist, 0);
1882 file_total += flist->count;
1884 if (!numeric_ids && !inc_recurse)
1887 /* send the io_error flag */
1888 if (protocol_version < 30)
1889 write_int(f, ignore_errors ? 0 : io_error);
1890 else if (io_error && !ignore_errors)
1891 send_msg_int(MSG_IO_ERROR, io_error);
1893 if (disable_buffering)
1894 io_end_buffering_out();
1896 stats.flist_size = stats.total_written - start_write;
1897 stats.num_files = flist->count;
1900 output_flist(flist);
1903 rprintf(FINFO, "send_file_list done\n");
1906 add_dirs_to_tree(-1, flist, dir_count);
1907 flist_done_allocating(flist);
1908 if (send_dir_ndx < 0) {
1909 write_ndx(f, NDX_FLIST_EOF);
1912 else if (file_total == 1) {
1913 /* If we're creating incremental file-lists and there
1914 * was just 1 item in the first file-list, send 1 more
1915 * file-list to check if this is a 1-file xfer. */
1916 send_extra_file_list(f, 1);
1923 struct file_list *recv_file_list(int f)
1925 struct file_list *flist;
1930 rprintf(FLOG, "receiving file list\n");
1931 if (show_filelist_p())
1932 start_filelist_progress("receiving file list");
1933 else if (inc_recurse && verbose && !am_server && !first_flist)
1934 rprintf(FCLIENT, "receiving incremental file list\n");
1936 start_read = stats.total_read;
1938 flist = flist_new(0, "recv_file_list");
1940 #ifdef SUPPORT_HARD_LINKS
1941 if (preserve_hard_links && protocol_version < 30)
1946 if (flist->ndx_start == 0)
1947 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
1948 dstart = dir_flist->count;
1954 while ((flags = read_byte(f)) != 0) {
1955 struct file_struct *file;
1957 flist_expand(flist, 1);
1959 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
1960 flags |= read_byte(f) << 8;
1961 file = recv_file_entry(flist, flags, f);
1963 if (inc_recurse && S_ISDIR(file->mode)) {
1964 flist_expand(dir_flist, 1);
1965 dir_flist->files[dir_flist->count++] = file;
1968 flist->files[flist->count++] = file;
1970 maybe_emit_filelist_progress(flist->count);
1973 rprintf(FINFO, "recv_file_name(%s)\n",
1974 f_name(file, NULL));
1977 file_total += flist->count;
1980 rprintf(FINFO, "received %d names\n", flist->count);
1982 if (show_filelist_p())
1983 finish_filelist_progress(flist);
1986 if (need_unsorted_flist) {
1987 /* Create an extra array of index pointers that we can sort for
1988 * the generator's use (for wading through the files in sorted
1989 * order and for calling flist_find()). We keep the "files"
1990 * list unsorted for our exchange of index numbers with the
1991 * other side (since their names may not sort the same). */
1992 if (!(flist->sorted = new_array(struct file_struct *, flist->count)))
1993 out_of_memory("recv_file_list");
1994 memcpy(flist->sorted, flist->files,
1995 flist->count * sizeof (struct file_struct*));
1996 if (inc_recurse && dir_flist->count > dstart) {
1997 dir_flist->sorted = realloc_array(dir_flist->sorted,
1998 struct file_struct *,
2000 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2001 (dir_flist->count - dstart) * sizeof (struct file_struct*));
2002 fsort(dir_flist->sorted + dstart, dir_flist->count - dstart);
2007 flist->sorted = flist->files;
2008 if (inc_recurse && dir_flist->count > dstart) {
2009 dir_flist->sorted = dir_flist->files;
2010 fsort(dir_flist->sorted + dstart, dir_flist->count - dstart);
2015 flist_done_allocating(flist);
2017 recv_id_list(f, flist);
2019 clean_flist(flist, relative_paths);
2021 if (protocol_version < 30) {
2022 /* Recv the io_error flag */
2026 io_error |= read_int(f);
2030 output_flist(flist);
2034 for (i = 0; i < flist->count; i++)
2035 list_file_entry(flist->files[i]);
2039 rprintf(FINFO, "recv_file_list done\n");
2041 stats.flist_size += stats.total_read - start_read;
2042 stats.num_files += flist->count;
2047 /* This is only used once by the receiver if the very first file-list
2048 * has exactly one item in it. */
2049 void recv_additional_file_list(int f)
2051 struct file_list *flist;
2052 int ndx = read_ndx(f);
2053 if (ndx == NDX_FLIST_EOF) {
2055 change_local_filter_dir(NULL, 0, 0);
2057 ndx = NDX_FLIST_OFFSET - ndx;
2058 if (ndx < 0 || ndx >= dir_flist->count) {
2059 ndx = NDX_FLIST_OFFSET - ndx;
2061 "[%s] Invalid dir index: %d (%d - %d)\n",
2062 who_am_i(), ndx, NDX_FLIST_OFFSET,
2063 NDX_FLIST_OFFSET - dir_flist->count + 1);
2064 exit_cleanup(RERR_PROTOCOL);
2067 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2070 flist = recv_file_list(f);
2071 flist->parent_ndx = ndx;
2075 /* Search for an identically-named item in the file list. Note that the
2076 * items must agree in their directory-ness, or no match is returned. */
2077 int flist_find(struct file_list *flist, struct file_struct *f)
2079 int low = flist->low, high = flist->high;
2080 int diff, mid, mid_up;
2082 while (low <= high) {
2083 mid = (low + high) / 2;
2084 if (F_IS_ACTIVE(flist->sorted[mid]))
2087 /* Scan for the next non-empty entry using the cached
2088 * distance values. If the value isn't fully up-to-
2089 * date, update it. */
2090 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2091 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2093 mid_up += F_DEPTH(flist->sorted[mid_up]);
2094 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2095 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2097 if (mid_up > high) {
2098 /* If there's nothing left above us, set high to
2099 * a non-empty entry below us and continue. */
2100 high = mid - (int)flist->sorted[mid]->len32;
2101 if (!F_IS_ACTIVE(flist->sorted[high])) {
2103 high -= (int)flist->sorted[high]->len32;
2104 } while (!F_IS_ACTIVE(flist->sorted[high]));
2105 flist->sorted[mid]->len32 = mid - high;
2110 diff = f_name_cmp(flist->sorted[mid_up], f);
2112 if (protocol_version < 29
2113 && S_ISDIR(flist->sorted[mid_up]->mode)
2114 != S_ISDIR(f->mode))
2127 * Free up any resources a file_struct has allocated
2128 * and clear the file.
2130 void clear_file(struct file_struct *file)
2132 /* The +1 zeros out the first char of the basename. */
2133 memset(file, 0, FILE_STRUCT_LEN + 1);
2134 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2135 * entry. Likewise for len32 in the opposite direction. We assume
2136 * that we're alone for now since flist_find() will adjust the counts
2137 * it runs into that aren't up-to-date. */
2138 file->len32 = F_DEPTH(file) = 1;
2141 /* Allocate a new file list. */
2142 struct file_list *flist_new(int flags, char *msg)
2144 struct file_list *flist;
2146 flist = new(struct file_list);
2150 memset(flist, 0, sizeof flist[0]);
2152 if (flags & FLIST_TEMP) {
2153 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2154 out_of_memory, POOL_INTERN)))
2157 /* This is a doubly linked list with prev looping back to
2158 * the end of the list, but the last next pointer is NULL. */
2160 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2161 out_of_memory, POOL_INTERN);
2162 if (!flist->file_pool)
2165 first_flist = cur_flist = flist->prev = flist;
2167 flist->file_pool = first_flist->file_pool;
2169 flist->ndx_start = first_flist->prev->ndx_start
2170 + first_flist->prev->count;
2172 flist->prev = first_flist->prev;
2173 flist->prev->next = first_flist->prev = flist;
2175 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2182 /* Free up all elements in a flist. */
2183 void flist_free(struct file_list *flist)
2186 /* Was FLIST_TEMP dir-list. */
2187 } else if (flist == flist->prev) {
2188 first_flist = cur_flist = NULL;
2192 if (flist == cur_flist)
2193 cur_flist = flist->next;
2194 if (flist == first_flist)
2195 first_flist = first_flist->next;
2197 flist->prev->next = flist->next;
2199 flist->next = first_flist;
2201 flist->next->prev = flist->prev;
2202 file_total -= flist->count;
2206 if (!flist->prev || !flist_cnt)
2207 pool_destroy(flist->file_pool);
2209 pool_free_old(flist->file_pool, flist->pool_boundary);
2211 if (flist->sorted && flist->sorted != flist->files)
2212 free(flist->sorted);
2217 /* This routine ensures we don't have any duplicate names in our file list.
2218 * duplicate names can cause corruption because of the pipelining. */
2219 static void clean_flist(struct file_list *flist, int strip_root)
2221 char fbuf[MAXPATHLEN];
2226 if (flist->count == 0) {
2231 fsort(flist->sorted, flist->count);
2233 if (!am_sender || inc_recurse) {
2234 for (i = prev_i = 0; i < flist->count; i++) {
2235 if (F_IS_ACTIVE(flist->sorted[i])) {
2240 flist->low = prev_i;
2242 i = prev_i = flist->count - 1;
2246 while (++i < flist->count) {
2248 struct file_struct *file = flist->sorted[i];
2250 if (!F_IS_ACTIVE(file))
2252 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2254 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2255 int save_mode = file->mode;
2256 /* Make sure that this directory doesn't duplicate a
2257 * non-directory earlier in the list. */
2258 flist->high = prev_i;
2259 file->mode = S_IFREG;
2260 j = flist_find(flist, file);
2261 file->mode = save_mode;
2266 /* If one is a dir and the other is not, we want to
2267 * keep the dir because it might have contents in the
2269 if (S_ISDIR(file->mode)) {
2270 struct file_struct *fp = flist->sorted[j];
2271 if (!S_ISDIR(fp->mode))
2279 flist->sorted[drop]->flags |= FLAG_DUPLICATE;
2283 "removing duplicate name %s from file list (%d)\n",
2284 f_name(file, fbuf), drop + flist->ndx_start);
2286 /* Make sure we don't lose track of a user-specified
2288 flist->sorted[keep]->flags |= flist->sorted[drop]->flags
2289 & (FLAG_TOP_DIR|FLAG_XFER_DIR);
2291 clear_file(flist->sorted[drop]);
2295 if (flist->low == drop) {
2297 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2306 flist->high = prev_i;
2309 /* We need to strip off the leading slashes for relative
2310 * paths, but this must be done _after_ the sorting phase. */
2311 for (i = flist->low; i <= flist->high; i++) {
2312 struct file_struct *file = flist->sorted[i];
2316 while (*file->dirname == '/')
2318 if (!*file->dirname)
2319 file->dirname = NULL;
2323 if (prune_empty_dirs && !am_sender) {
2324 int j, prev_depth = 0;
2326 prev_i = 0; /* It's OK that this isn't really true. */
2328 for (i = flist->low; i <= flist->high; i++) {
2329 struct file_struct *fp, *file = flist->sorted[i];
2331 /* This temporarily abuses the F_DEPTH() value for a
2332 * directory that is in a chain that might get pruned.
2333 * We restore the old value if it gets a reprieve. */
2334 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2335 /* Dump empty dirs when coming back down. */
2336 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2337 fp = flist->sorted[prev_i];
2338 if (F_DEPTH(fp) >= 0)
2340 prev_i = -F_DEPTH(fp)-1;
2343 prev_depth = F_DEPTH(file);
2344 if (is_excluded(f_name(file, fbuf), 1,
2346 /* Keep dirs through this dir. */
2347 for (j = prev_depth-1; ; j--) {
2348 fp = flist->sorted[prev_i];
2349 if (F_DEPTH(fp) >= 0)
2351 prev_i = -F_DEPTH(fp)-1;
2355 F_DEPTH(file) = -prev_i-1;
2358 /* Keep dirs through this non-dir. */
2359 for (j = prev_depth; ; j--) {
2360 fp = flist->sorted[prev_i];
2361 if (F_DEPTH(fp) >= 0)
2363 prev_i = -F_DEPTH(fp)-1;
2368 /* Dump all remaining empty dirs. */
2370 struct file_struct *fp = flist->sorted[prev_i];
2371 if (F_DEPTH(fp) >= 0)
2373 prev_i = -F_DEPTH(fp)-1;
2377 for (i = flist->low; i <= flist->high; i++) {
2378 if (F_IS_ACTIVE(flist->sorted[i]))
2382 for (i = flist->high; i >= flist->low; i--) {
2383 if (F_IS_ACTIVE(flist->sorted[i]))
2390 static void output_flist(struct file_list *flist)
2392 char uidbuf[16], gidbuf[16], depthbuf[16];
2393 struct file_struct *file;
2394 const char *root, *dir, *slash, *name, *trail;
2395 const char *who = who_am_i();
2398 rprintf(FINFO, "[%s] flist start=%d, count=%d, low=%d, high=%d\n",
2399 who, flist->ndx_start, flist->count, flist->low, flist->high);
2400 for (i = 0; i < flist->count; i++) {
2401 file = flist->sorted[i];
2402 if ((am_root || am_sender) && uid_ndx) {
2403 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2408 static char parens[] = "(\0)\0\0\0";
2409 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2410 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2411 pp, F_GROUP(file), pp + 2);
2415 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2416 if (F_IS_ACTIVE(file)) {
2417 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2418 if ((dir = file->dirname) == NULL)
2422 name = file->basename;
2423 trail = S_ISDIR(file->mode) ? "/" : "";
2425 root = dir = slash = name = trail = "";
2427 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2428 who, i + flist->ndx_start,
2429 root, dir, slash, name, trail,
2430 (int)file->mode, (double)F_LENGTH(file),
2431 uidbuf, gidbuf, file->flags);
2435 enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2436 enum fnc_type { t_PATH, t_ITEM };
2438 /* Compare the names of two file_struct entities, similar to how strcmp()
2439 * would do if it were operating on the joined strings.
2441 * Some differences beginning with protocol_version 29: (1) directory names
2442 * are compared with an assumed trailing slash so that they compare in a
2443 * way that would cause them to sort immediately prior to any content they
2444 * may have; (2) a directory of any name compares after a non-directory of
2445 * any name at the same depth; (3) a directory with name "." compares prior
2446 * to anything else. These changes mean that a directory and a non-dir
2447 * with the same name will not compare as equal (protocol_version >= 29).
2449 * The dirname component can be an empty string, but the basename component
2450 * cannot (and never is in the current codebase). The basename component
2451 * may be NULL (for a removed item), in which case it is considered to be
2452 * after any existing item. */
2453 int f_name_cmp(struct file_struct *f1, struct file_struct *f2)
2456 const uchar *c1, *c2;
2457 enum fnc_state state1, state2;
2458 enum fnc_type type1, type2;
2459 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2461 if (!f1 || !F_IS_ACTIVE(f1)) {
2462 if (!f2 || !F_IS_ACTIVE(f2))
2466 if (!f2 || !F_IS_ACTIVE(f2))
2469 c1 = (uchar*)f1->dirname;
2470 c2 = (uchar*)f2->dirname;
2474 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2475 c1 = (const uchar*)f1->basename;
2476 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2478 state1 = s_TRAILING;
2487 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2488 c2 = (const uchar*)f2->basename;
2489 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2491 state2 = s_TRAILING;
2501 return type1 == t_PATH ? 1 : -1;
2511 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2512 c1 = (const uchar*)f1->basename;
2513 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2515 state1 = s_TRAILING;
2521 state1 = s_TRAILING;
2522 if (type1 == t_PATH) {
2531 if (*c2 && type1 != type2)
2532 return type1 == t_PATH ? 1 : -1;
2541 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2542 c2 = (const uchar*)f2->basename;
2543 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2545 state2 = s_TRAILING;
2551 state2 = s_TRAILING;
2552 if (type2 == t_PATH) {
2564 return type1 == t_PATH ? 1 : -1;
2566 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2571 char *f_name_buf(void)
2573 static char names[5][MAXPATHLEN];
2574 static unsigned int n;
2576 n = (n + 1) % (sizeof names / sizeof names[0]);
2581 /* Return a copy of the full filename of a flist entry, using the indicated
2582 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2583 * done because we checked the size when creating the file_struct entry.
2585 char *f_name(struct file_struct *f, char *fbuf)
2587 if (!f || !F_IS_ACTIVE(f))
2591 fbuf = f_name_buf();
2594 int len = strlen(f->dirname);
2595 memcpy(fbuf, f->dirname, len);
2597 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
2599 strlcpy(fbuf, f->basename, MAXPATHLEN);
2604 /* Do a non-recursive scan of the named directory, possibly ignoring all
2605 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
2606 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
2607 * buffer (the functions we call will append names onto the end, but the old
2608 * dir value will be restored on exit). */
2609 struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
2611 struct file_list *dirlist;
2612 char dirbuf[MAXPATHLEN];
2613 int save_recurse = recurse;
2614 int save_xfer_dirs = xfer_dirs;
2617 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
2618 if (dlen >= MAXPATHLEN)
2623 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
2627 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, 0);
2628 xfer_dirs = save_xfer_dirs;
2629 recurse = save_recurse;
2631 flist_count_offset += dirlist->count;
2633 dirlist->sorted = dirlist->files;
2634 clean_flist(dirlist, 0);
2637 output_flist(dirlist);