Don't let --chmod tweak a 0 mode value (which marks a missing arg).
[rsync/rsync.git] / flist.c
... / ...
CommitLineData
1/*
2 * Generate and receive file lists.
3 *
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-2009 Wayne Davison
8 *
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.
13 *
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.
18 *
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.
21 */
22
23#include "rsync.h"
24#include "ifuncs.h"
25#include "rounding.h"
26#include "io.h"
27
28extern int verbose;
29extern int am_root;
30extern int am_server;
31extern int am_daemon;
32extern int am_sender;
33extern int am_generator;
34extern int inc_recurse;
35extern int do_progress;
36extern int always_checksum;
37extern int module_id;
38extern int ignore_errors;
39extern int numeric_ids;
40extern int recurse;
41extern int use_qsort;
42extern int xfer_dirs;
43extern int filesfrom_fd;
44extern int one_file_system;
45extern int copy_dirlinks;
46extern int keep_dirlinks;
47extern int preserve_uid;
48extern int preserve_gid;
49extern int preserve_acls;
50extern int preserve_xattrs;
51extern int preserve_links;
52extern int preserve_hard_links;
53extern int preserve_devices;
54extern int preserve_specials;
55extern int delete_missing_args;
56extern int uid_ndx;
57extern int gid_ndx;
58extern int eol_nulls;
59extern int relative_paths;
60extern int implied_dirs;
61extern int file_extra_cnt;
62extern int ignore_perishable;
63extern int non_perishable_cnt;
64extern int prune_empty_dirs;
65extern int copy_links;
66extern int copy_unsafe_links;
67extern int protocol_version;
68extern int sanitize_paths;
69extern int munge_symlinks;
70extern int need_unsorted_flist;
71extern int sender_symlink_iconv;
72extern int unsort_ndx;
73extern struct stats stats;
74extern char *filesfrom_host;
75
76extern char curr_dir[MAXPATHLEN];
77
78extern struct chmod_mode_struct *chmod_modes;
79
80extern struct filter_list_struct filter_list;
81extern struct filter_list_struct daemon_filter_list;
82
83#ifdef ICONV_OPTION
84extern int filesfrom_convert;
85extern iconv_t ic_send, ic_recv;
86#endif
87
88#define PTR_SIZE (sizeof (struct file_struct *))
89
90int io_error;
91int checksum_len;
92dev_t filesystem_dev; /* used to implement -x */
93
94struct file_list *cur_flist, *first_flist, *dir_flist;
95int send_dir_ndx = -1, send_dir_depth = -1;
96int flist_cnt = 0; /* how many (non-tmp) file list objects exist */
97int file_total = 0; /* total of all active items over all file-lists */
98int flist_eof = 0; /* all the file-lists are now known */
99
100#define NORMAL_NAME 0
101#define SLASH_ENDING_NAME 1
102#define DOTDIR_NAME 2
103
104/* Starting from protocol version 26, we always use 64-bit ino_t and dev_t
105 * internally, even if this platform does not allow files to have 64-bit inums.
106 * The only exception is if we're on a platform with no 64-bit type at all.
107 *
108 * Because we use read_longint() to get these off the wire, if you transfer
109 * devices or (for protocols < 30) hardlinks with dev or inum > 2**32 to a
110 * machine with no 64-bit types then you will get an overflow error.
111 *
112 * Note that if you transfer devices from a 64-bit-devt machine (say, Solaris)
113 * to a 32-bit-devt machine (say, Linux-2.2/x86) then the device numbers will
114 * be truncated. But it's a kind of silly thing to do anyhow. */
115
116/* The tmp_* vars are used as a cache area by make_file() to store data
117 * that the sender doesn't need to remember in its file list. The data
118 * will survive just long enough to be used by send_file_entry(). */
119static dev_t tmp_rdev;
120#ifdef SUPPORT_HARD_LINKS
121static int64 tmp_dev, tmp_ino;
122#endif
123static char tmp_sum[MAX_DIGEST_LEN];
124
125static char empty_sum[MAX_DIGEST_LEN];
126static int flist_count_offset; /* for --delete --progress */
127static int dir_count = 0;
128
129static void flist_sort_and_clean(struct file_list *flist, int strip_root);
130static void output_flist(struct file_list *flist);
131
132void init_flist(void)
133{
134 if (verbose > 4) {
135 rprintf(FINFO, "FILE_STRUCT_LEN=%d, EXTRA_LEN=%d\n",
136 (int)FILE_STRUCT_LEN, (int)EXTRA_LEN);
137 }
138 checksum_len = protocol_version < 21 ? 2
139 : protocol_version < 30 ? MD4_DIGEST_LEN
140 : MD5_DIGEST_LEN;
141}
142
143static int show_filelist_p(void)
144{
145 return verbose && xfer_dirs && !am_server && !inc_recurse;
146}
147
148static void start_filelist_progress(char *kind)
149{
150 rprintf(FCLIENT, "%s ... ", kind);
151 if (verbose > 1 || do_progress)
152 rprintf(FCLIENT, "\n");
153 rflush(FINFO);
154}
155
156static void emit_filelist_progress(int count)
157{
158 rprintf(FCLIENT, " %d files...\r", count);
159}
160
161static void maybe_emit_filelist_progress(int count)
162{
163 if (do_progress && show_filelist_p() && (count % 100) == 0)
164 emit_filelist_progress(count);
165}
166
167static void finish_filelist_progress(const struct file_list *flist)
168{
169 if (do_progress) {
170 /* This overwrites the progress line */
171 rprintf(FINFO, "%d file%sto consider\n",
172 flist->used, flist->used == 1 ? " " : "s ");
173 } else
174 rprintf(FINFO, "done\n");
175}
176
177void show_flist_stats(void)
178{
179 /* Nothing yet */
180}
181
182/* Stat either a symlink or its referent, depending on the settings of
183 * copy_links, copy_unsafe_links, etc. Returns -1 on error, 0 on success.
184 *
185 * If path is the name of a symlink, then the linkbuf buffer (which must hold
186 * MAXPATHLEN chars) will be set to the symlink's target string.
187 *
188 * The stat structure pointed to by stp will contain information about the
189 * link or the referent as appropriate, if they exist. */
190static int readlink_stat(const char *path, STRUCT_STAT *stp, char *linkbuf)
191{
192#ifdef SUPPORT_LINKS
193 if (link_stat(path, stp, copy_dirlinks) < 0)
194 return -1;
195 if (S_ISLNK(stp->st_mode)) {
196 int llen = readlink(path, linkbuf, MAXPATHLEN - 1);
197 if (llen < 0)
198 return -1;
199 linkbuf[llen] = '\0';
200 if (copy_unsafe_links && unsafe_symlink(linkbuf, path)) {
201 if (verbose > 1) {
202 rprintf(FINFO,"copying unsafe symlink \"%s\" -> \"%s\"\n",
203 path, linkbuf);
204 }
205 return x_stat(path, stp, NULL);
206 }
207 if (munge_symlinks && am_sender && llen > SYMLINK_PREFIX_LEN
208 && strncmp(linkbuf, SYMLINK_PREFIX, SYMLINK_PREFIX_LEN) == 0) {
209 memmove(linkbuf, linkbuf + SYMLINK_PREFIX_LEN,
210 llen - SYMLINK_PREFIX_LEN + 1);
211 }
212 }
213 return 0;
214#else
215 return x_stat(path, stp, NULL);
216#endif
217}
218
219int link_stat(const char *path, STRUCT_STAT *stp, int follow_dirlinks)
220{
221#ifdef SUPPORT_LINKS
222 if (copy_links)
223 return x_stat(path, stp, NULL);
224 if (x_lstat(path, stp, NULL) < 0)
225 return -1;
226 if (follow_dirlinks && S_ISLNK(stp->st_mode)) {
227 STRUCT_STAT st;
228 if (x_stat(path, &st, NULL) == 0 && S_ISDIR(st.st_mode))
229 *stp = st;
230 }
231 return 0;
232#else
233 return x_stat(path, stp, NULL);
234#endif
235}
236
237static inline int is_daemon_excluded(const char *fname, int is_dir)
238{
239 if (daemon_filter_list.head
240 && check_filter(&daemon_filter_list, FLOG, fname, is_dir) < 0) {
241 errno = ENOENT;
242 return 1;
243 }
244 return 0;
245}
246
247static inline int path_is_daemon_excluded(char *path, int ignore_filename)
248{
249 if (daemon_filter_list.head) {
250 char *slash = path;
251
252 while ((slash = strchr(slash+1, '/')) != NULL) {
253 int ret;
254 *slash = '\0';
255 ret = check_filter(&daemon_filter_list, FLOG, path, 1);
256 *slash = '/';
257 if (ret < 0) {
258 errno = ENOENT;
259 return 1;
260 }
261 }
262
263 if (!ignore_filename
264 && check_filter(&daemon_filter_list, FLOG, path, 1) < 0) {
265 errno = ENOENT;
266 return 1;
267 }
268 }
269
270 return 0;
271}
272
273/* This function is used to check if a file should be included/excluded
274 * from the list of files based on its name and type etc. The value of
275 * filter_level is set to either SERVER_FILTERS or ALL_FILTERS. */
276static int is_excluded(const char *fname, int is_dir, int filter_level)
277{
278#if 0 /* This currently never happens, so avoid a useless compare. */
279 if (filter_level == NO_FILTERS)
280 return 0;
281#endif
282 if (is_daemon_excluded(fname, is_dir))
283 return 1;
284 if (filter_level != ALL_FILTERS)
285 return 0;
286 if (filter_list.head
287 && check_filter(&filter_list, FINFO, fname, is_dir) < 0)
288 return 1;
289 return 0;
290}
291
292static void send_directory(int f, struct file_list *flist,
293 char *fbuf, int len, int flags);
294
295static const char *pathname, *orig_dir;
296static int pathname_len;
297
298/* Make sure flist can hold at least flist->used + extra entries. */
299static void flist_expand(struct file_list *flist, int extra)
300{
301 struct file_struct **new_ptr;
302
303 if (flist->used + extra <= flist->malloced)
304 return;
305
306 if (flist->malloced < FLIST_START)
307 flist->malloced = FLIST_START;
308 else if (flist->malloced >= FLIST_LINEAR)
309 flist->malloced += FLIST_LINEAR;
310 else
311 flist->malloced *= 2;
312
313 /* In case count jumped or we are starting the list
314 * with a known size just set it. */
315 if (flist->malloced < flist->used + extra)
316 flist->malloced = flist->used + extra;
317
318 new_ptr = realloc_array(flist->files, struct file_struct *,
319 flist->malloced);
320
321 if (verbose >= 2 && flist->malloced != FLIST_START) {
322 rprintf(FCLIENT, "[%s] expand file_list pointer array to %.0f bytes, did%s move\n",
323 who_am_i(),
324 (double)sizeof flist->files[0] * flist->malloced,
325 (new_ptr == flist->files) ? " not" : "");
326 }
327
328 flist->files = new_ptr;
329
330 if (!flist->files)
331 out_of_memory("flist_expand");
332}
333
334static void flist_done_allocating(struct file_list *flist)
335{
336 void *ptr = pool_boundary(flist->file_pool, 8*1024);
337 if (flist->pool_boundary == ptr)
338 flist->pool_boundary = NULL; /* list didn't use any pool memory */
339 else
340 flist->pool_boundary = ptr;
341}
342
343/* Call this with EITHER (1) "file, NULL, 0" to chdir() to the file's
344 * F_PATHNAME(), or (2) "NULL, dir, dirlen" to chdir() to the supplied dir,
345 * with dir == NULL taken to be the starting directory, and dirlen < 0
346 * indicating that strdup(dir) should be called and then the -dirlen length
347 * value checked to ensure that it is not daemon-excluded. */
348int change_pathname(struct file_struct *file, const char *dir, int dirlen)
349{
350 if (dirlen < 0) {
351 char *cpy = strdup(dir);
352 if (*cpy != '/')
353 change_dir(orig_dir, CD_SKIP_CHDIR);
354 if (path_is_daemon_excluded(cpy, 0))
355 goto chdir_error;
356 dir = cpy;
357 dirlen = -dirlen;
358 } else {
359 if (file) {
360 if (pathname == F_PATHNAME(file))
361 return 1;
362 dir = F_PATHNAME(file);
363 if (dir)
364 dirlen = strlen(dir);
365 } else if (pathname == dir)
366 return 1;
367 if (dir && *dir != '/')
368 change_dir(orig_dir, CD_SKIP_CHDIR);
369 }
370
371 pathname = dir;
372 pathname_len = dirlen;
373
374 if (!dir)
375 dir = orig_dir;
376
377 if (!change_dir(dir, CD_NORMAL)) {
378 chdir_error:
379 io_error |= IOERR_GENERAL;
380 rsyserr(FERROR_XFER, errno, "change_dir %s failed", full_fname(dir));
381 if (dir != orig_dir)
382 change_dir(orig_dir, CD_NORMAL);
383 pathname = NULL;
384 pathname_len = 0;
385 return 0;
386 }
387
388 return 1;
389}
390
391static void send_file_entry(int f, const char *fname, struct file_struct *file,
392#ifdef SUPPORT_LINKS
393 const char *symlink_name, int symlink_len,
394#endif
395 int ndx, int first_ndx)
396{
397 static time_t modtime;
398 static mode_t mode;
399#ifdef SUPPORT_HARD_LINKS
400 static int64 dev;
401#endif
402 static dev_t rdev;
403 static uint32 rdev_major;
404 static uid_t uid;
405 static gid_t gid;
406 static const char *user_name, *group_name;
407 static char lastname[MAXPATHLEN];
408 int first_hlink_ndx = -1;
409 int l1, l2;
410 int xflags;
411
412 /* Initialize starting value of xflags. */
413 if (protocol_version >= 30 && S_ISDIR(file->mode)) {
414 dir_count++;
415 if (file->flags & FLAG_CONTENT_DIR)
416 xflags = file->flags & FLAG_TOP_DIR;
417 else if (file->flags & FLAG_IMPLIED_DIR)
418 xflags = XMIT_TOP_DIR | XMIT_NO_CONTENT_DIR;
419 else
420 xflags = XMIT_NO_CONTENT_DIR;
421 } else
422 xflags = file->flags & FLAG_TOP_DIR; /* FLAG_TOP_DIR == XMIT_TOP_DIR */
423
424 if (file->mode == mode)
425 xflags |= XMIT_SAME_MODE;
426 else
427 mode = file->mode;
428
429 if (preserve_devices && IS_DEVICE(mode)) {
430 if (protocol_version < 28) {
431 if (tmp_rdev == rdev)
432 xflags |= XMIT_SAME_RDEV_pre28;
433 else
434 rdev = tmp_rdev;
435 } else {
436 rdev = tmp_rdev;
437 if ((uint32)major(rdev) == rdev_major)
438 xflags |= XMIT_SAME_RDEV_MAJOR;
439 else
440 rdev_major = major(rdev);
441 if (protocol_version < 30 && (uint32)minor(rdev) <= 0xFFu)
442 xflags |= XMIT_RDEV_MINOR_8_pre30;
443 }
444 } else if (preserve_specials && IS_SPECIAL(mode)) {
445 /* Special files don't need an rdev number, so just make
446 * the historical transmission of the value efficient. */
447 if (protocol_version < 28)
448 xflags |= XMIT_SAME_RDEV_pre28;
449 else {
450 rdev = MAKEDEV(major(rdev), 0);
451 xflags |= XMIT_SAME_RDEV_MAJOR;
452 if (protocol_version < 30)
453 xflags |= XMIT_RDEV_MINOR_8_pre30;
454 }
455 } else if (protocol_version < 28)
456 rdev = MAKEDEV(0, 0);
457 if (!preserve_uid || ((uid_t)F_OWNER(file) == uid && *lastname))
458 xflags |= XMIT_SAME_UID;
459 else {
460 uid = F_OWNER(file);
461 if (!numeric_ids) {
462 user_name = add_uid(uid);
463 if (inc_recurse && user_name)
464 xflags |= XMIT_USER_NAME_FOLLOWS;
465 }
466 }
467 if (!preserve_gid || ((gid_t)F_GROUP(file) == gid && *lastname))
468 xflags |= XMIT_SAME_GID;
469 else {
470 gid = F_GROUP(file);
471 if (!numeric_ids) {
472 group_name = add_gid(gid);
473 if (inc_recurse && group_name)
474 xflags |= XMIT_GROUP_NAME_FOLLOWS;
475 }
476 }
477 if (file->modtime == modtime)
478 xflags |= XMIT_SAME_TIME;
479 else
480 modtime = file->modtime;
481
482#ifdef SUPPORT_HARD_LINKS
483 if (tmp_dev != 0) {
484 if (protocol_version >= 30) {
485 struct ht_int64_node *np = idev_find(tmp_dev, tmp_ino);
486 first_hlink_ndx = (int32)(long)np->data - 1;
487 if (first_hlink_ndx < 0) {
488 np->data = (void*)(long)(first_ndx + ndx + 1);
489 xflags |= XMIT_HLINK_FIRST;
490 }
491 } else {
492 if (tmp_dev == dev) {
493 if (protocol_version >= 28)
494 xflags |= XMIT_SAME_DEV_pre30;
495 } else
496 dev = tmp_dev;
497 }
498 xflags |= XMIT_HLINKED;
499 }
500#endif
501
502 for (l1 = 0;
503 lastname[l1] && (fname[l1] == lastname[l1]) && (l1 < 255);
504 l1++) {}
505 l2 = strlen(fname+l1);
506
507 if (l1 > 0)
508 xflags |= XMIT_SAME_NAME;
509 if (l2 > 255)
510 xflags |= XMIT_LONG_NAME;
511
512 /* We must make sure we don't send a zero flag byte or the
513 * other end will terminate the flist transfer. Note that
514 * the use of XMIT_TOP_DIR on a non-dir has no meaning, so
515 * it's harmless way to add a bit to the first flag byte. */
516 if (protocol_version >= 28) {
517 if (!xflags && !S_ISDIR(mode))
518 xflags |= XMIT_TOP_DIR;
519 if ((xflags & 0xFF00) || !xflags) {
520 xflags |= XMIT_EXTENDED_FLAGS;
521 write_shortint(f, xflags);
522 } else
523 write_byte(f, xflags);
524 } else {
525 if (!(xflags & 0xFF))
526 xflags |= S_ISDIR(mode) ? XMIT_LONG_NAME : XMIT_TOP_DIR;
527 write_byte(f, xflags);
528 }
529 if (xflags & XMIT_SAME_NAME)
530 write_byte(f, l1);
531 if (xflags & XMIT_LONG_NAME)
532 write_varint30(f, l2);
533 else
534 write_byte(f, l2);
535 write_buf(f, fname + l1, l2);
536
537 if (first_hlink_ndx >= 0) {
538 write_varint(f, first_hlink_ndx);
539 if (first_hlink_ndx >= first_ndx)
540 goto the_end;
541 }
542
543 write_varlong30(f, F_LENGTH(file), 3);
544 if (!(xflags & XMIT_SAME_TIME)) {
545 if (protocol_version >= 30)
546 write_varlong(f, modtime, 4);
547 else
548 write_int(f, modtime);
549 }
550 if (!(xflags & XMIT_SAME_MODE))
551 write_int(f, to_wire_mode(mode));
552 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
553 if (protocol_version < 30)
554 write_int(f, uid);
555 else {
556 write_varint(f, uid);
557 if (xflags & XMIT_USER_NAME_FOLLOWS) {
558 int len = strlen(user_name);
559 write_byte(f, len);
560 write_buf(f, user_name, len);
561 }
562 }
563 }
564 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
565 if (protocol_version < 30)
566 write_int(f, gid);
567 else {
568 write_varint(f, gid);
569 if (xflags & XMIT_GROUP_NAME_FOLLOWS) {
570 int len = strlen(group_name);
571 write_byte(f, len);
572 write_buf(f, group_name, len);
573 }
574 }
575 }
576 if ((preserve_devices && IS_DEVICE(mode))
577 || (preserve_specials && IS_SPECIAL(mode))) {
578 if (protocol_version < 28) {
579 if (!(xflags & XMIT_SAME_RDEV_pre28))
580 write_int(f, (int)rdev);
581 } else {
582 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
583 write_varint30(f, major(rdev));
584 if (protocol_version >= 30)
585 write_varint(f, minor(rdev));
586 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
587 write_byte(f, minor(rdev));
588 else
589 write_int(f, minor(rdev));
590 }
591 }
592
593#ifdef SUPPORT_LINKS
594 if (symlink_len) {
595 write_varint30(f, symlink_len);
596 write_buf(f, symlink_name, symlink_len);
597 }
598#endif
599
600#ifdef SUPPORT_HARD_LINKS
601 if (tmp_dev != 0 && protocol_version < 30) {
602 if (protocol_version < 26) {
603 /* 32-bit dev_t and ino_t */
604 write_int(f, (int32)dev);
605 write_int(f, (int32)tmp_ino);
606 } else {
607 /* 64-bit dev_t and ino_t */
608 if (!(xflags & XMIT_SAME_DEV_pre30))
609 write_longint(f, dev);
610 write_longint(f, tmp_ino);
611 }
612 }
613#endif
614
615 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
616 const char *sum;
617 if (S_ISREG(mode))
618 sum = tmp_sum;
619 else {
620 /* Prior to 28, we sent a useless set of nulls. */
621 sum = empty_sum;
622 }
623 write_buf(f, sum, checksum_len);
624 }
625
626 the_end:
627 strlcpy(lastname, fname, MAXPATHLEN);
628
629 if (S_ISREG(mode) || S_ISLNK(mode))
630 stats.total_size += F_LENGTH(file);
631}
632
633static struct file_struct *recv_file_entry(struct file_list *flist,
634 int xflags, int f)
635{
636 static int64 modtime;
637 static mode_t mode;
638#ifdef SUPPORT_HARD_LINKS
639 static int64 dev;
640#endif
641 static dev_t rdev;
642 static uint32 rdev_major;
643 static uid_t uid;
644 static gid_t gid;
645 static uint16 gid_flags;
646 static char lastname[MAXPATHLEN], *lastdir;
647 static int lastdir_depth, lastdir_len = -1;
648 static unsigned int del_hier_name_len = 0;
649 static int in_del_hier = 0;
650 char thisname[MAXPATHLEN];
651 unsigned int l1 = 0, l2 = 0;
652 int alloc_len, basename_len, linkname_len;
653 int extra_len = file_extra_cnt * EXTRA_LEN;
654 int first_hlink_ndx = -1;
655 int64 file_length;
656 const char *basename;
657 struct file_struct *file;
658 alloc_pool_t *pool;
659 char *bp;
660
661 if (xflags & XMIT_SAME_NAME)
662 l1 = read_byte(f);
663
664 if (xflags & XMIT_LONG_NAME)
665 l2 = read_varint30(f);
666 else
667 l2 = read_byte(f);
668
669 if (l2 >= MAXPATHLEN - l1) {
670 rprintf(FERROR,
671 "overflow: xflags=0x%x l1=%d l2=%d lastname=%s [%s]\n",
672 xflags, l1, l2, lastname, who_am_i());
673 overflow_exit("recv_file_entry");
674 }
675
676 strlcpy(thisname, lastname, l1 + 1);
677 read_sbuf(f, &thisname[l1], l2);
678 thisname[l1 + l2] = 0;
679
680 /* Abuse basename_len for a moment... */
681 basename_len = strlcpy(lastname, thisname, MAXPATHLEN);
682
683#ifdef ICONV_OPTION
684 if (ic_recv != (iconv_t)-1) {
685 xbuf outbuf, inbuf;
686
687 INIT_CONST_XBUF(outbuf, thisname);
688 INIT_XBUF(inbuf, lastname, basename_len, -1);
689
690 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
691 io_error |= IOERR_GENERAL;
692 rprintf(FERROR_UTF8,
693 "[%s] cannot convert filename: %s (%s)\n",
694 who_am_i(), lastname, strerror(errno));
695 outbuf.len = 0;
696 }
697 thisname[outbuf.len] = '\0';
698 }
699#endif
700
701 if (*thisname)
702 clean_fname(thisname, 0);
703
704 if (sanitize_paths)
705 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
706
707 if ((basename = strrchr(thisname, '/')) != NULL) {
708 int len = basename++ - thisname;
709 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
710 lastdir = new_array(char, len + 1);
711 memcpy(lastdir, thisname, len);
712 lastdir[len] = '\0';
713 lastdir_len = len;
714 lastdir_depth = count_dir_elements(lastdir);
715 }
716 } else
717 basename = thisname;
718 basename_len = strlen(basename) + 1; /* count the '\0' */
719
720#ifdef SUPPORT_HARD_LINKS
721 if (protocol_version >= 30
722 && BITS_SETnUNSET(xflags, XMIT_HLINKED, XMIT_HLINK_FIRST)) {
723 first_hlink_ndx = read_varint(f);
724 if (first_hlink_ndx < 0 || first_hlink_ndx >= flist->ndx_start + flist->used) {
725 rprintf(FERROR,
726 "hard-link reference out of range: %d (%d)\n",
727 first_hlink_ndx, flist->ndx_start + flist->used);
728 exit_cleanup(RERR_PROTOCOL);
729 }
730 if (first_hlink_ndx >= flist->ndx_start) {
731 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
732 file_length = F_LENGTH(first);
733 modtime = first->modtime;
734 mode = first->mode;
735 if (preserve_uid)
736 uid = F_OWNER(first);
737 if (preserve_gid)
738 gid = F_GROUP(first);
739 if (preserve_devices && IS_DEVICE(mode)) {
740 uint32 *devp = F_RDEV_P(first);
741 rdev = MAKEDEV(DEV_MAJOR(devp), DEV_MINOR(devp));
742 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
743 }
744 if (preserve_links && S_ISLNK(mode))
745 linkname_len = strlen(F_SYMLINK(first)) + 1;
746 else
747 linkname_len = 0;
748 goto create_object;
749 }
750 }
751#endif
752
753 file_length = read_varlong30(f, 3);
754 if (!(xflags & XMIT_SAME_TIME)) {
755 if (protocol_version >= 30) {
756 modtime = read_varlong(f, 4);
757#if SIZEOF_TIME_T < SIZEOF_INT64
758 if (!am_generator && (int64)(time_t)modtime != modtime) {
759 rprintf(FERROR_XFER,
760 "Time value of %s truncated on receiver.\n",
761 lastname);
762 }
763#endif
764 } else
765 modtime = read_int(f);
766 }
767 if (!(xflags & XMIT_SAME_MODE))
768 mode = from_wire_mode(read_int(f));
769
770 if (chmod_modes && !S_ISLNK(mode) && mode)
771 mode = tweak_mode(mode, chmod_modes);
772
773 if (preserve_uid && !(xflags & XMIT_SAME_UID)) {
774 if (protocol_version < 30)
775 uid = (uid_t)read_int(f);
776 else {
777 uid = (uid_t)read_varint(f);
778 if (xflags & XMIT_USER_NAME_FOLLOWS)
779 uid = recv_user_name(f, uid);
780 else if (inc_recurse && am_root && !numeric_ids)
781 uid = match_uid(uid);
782 }
783 }
784 if (preserve_gid && !(xflags & XMIT_SAME_GID)) {
785 if (protocol_version < 30)
786 gid = (gid_t)read_int(f);
787 else {
788 gid = (gid_t)read_varint(f);
789 gid_flags = 0;
790 if (xflags & XMIT_GROUP_NAME_FOLLOWS)
791 gid = recv_group_name(f, gid, &gid_flags);
792 else if (inc_recurse && (!am_root || !numeric_ids))
793 gid = match_gid(gid, &gid_flags);
794 }
795 }
796
797 if ((preserve_devices && IS_DEVICE(mode))
798 || (preserve_specials && IS_SPECIAL(mode))) {
799 if (protocol_version < 28) {
800 if (!(xflags & XMIT_SAME_RDEV_pre28))
801 rdev = (dev_t)read_int(f);
802 } else {
803 uint32 rdev_minor;
804 if (!(xflags & XMIT_SAME_RDEV_MAJOR))
805 rdev_major = read_varint30(f);
806 if (protocol_version >= 30)
807 rdev_minor = read_varint(f);
808 else if (xflags & XMIT_RDEV_MINOR_8_pre30)
809 rdev_minor = read_byte(f);
810 else
811 rdev_minor = read_int(f);
812 rdev = MAKEDEV(rdev_major, rdev_minor);
813 }
814 if (IS_DEVICE(mode))
815 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
816 file_length = 0;
817 } else if (protocol_version < 28)
818 rdev = MAKEDEV(0, 0);
819
820#ifdef SUPPORT_LINKS
821 if (preserve_links && S_ISLNK(mode)) {
822 linkname_len = read_varint30(f) + 1; /* count the '\0' */
823 if (linkname_len <= 0 || linkname_len > MAXPATHLEN) {
824 rprintf(FERROR, "overflow: linkname_len=%d\n",
825 linkname_len - 1);
826 overflow_exit("recv_file_entry");
827 }
828#ifdef ICONV_OPTION
829 /* We don't know how much extra room we need to convert
830 * the as-yet-unread symlink data, so let's hope that a
831 * double-size buffer is plenty. */
832 if (sender_symlink_iconv)
833 linkname_len *= 2;
834#endif
835 if (munge_symlinks)
836 linkname_len += SYMLINK_PREFIX_LEN;
837 }
838 else
839#endif
840 linkname_len = 0;
841
842#ifdef SUPPORT_HARD_LINKS
843 create_object:
844 if (preserve_hard_links) {
845 if (protocol_version < 28 && S_ISREG(mode))
846 xflags |= XMIT_HLINKED;
847 if (xflags & XMIT_HLINKED)
848 extra_len += (inc_recurse+1) * EXTRA_LEN;
849 }
850#endif
851
852#ifdef SUPPORT_ACLS
853 /* Directories need an extra int32 for the default ACL. */
854 if (preserve_acls && S_ISDIR(mode))
855 extra_len += EXTRA_LEN;
856#endif
857
858 if (always_checksum && S_ISREG(mode))
859 extra_len += SUM_EXTRA_CNT * EXTRA_LEN;
860
861#if SIZEOF_INT64 >= 8
862 if (file_length > 0xFFFFFFFFu && S_ISREG(mode))
863 extra_len += EXTRA_LEN;
864#endif
865 if (file_length < 0) {
866 rprintf(FERROR, "Offset underflow: file-length is negative\n");
867 exit_cleanup(RERR_UNSUPPORTED);
868 }
869
870 if (inc_recurse && S_ISDIR(mode)) {
871 if (one_file_system) {
872 /* Room to save the dir's device for -x */
873 extra_len += DEV_EXTRA_CNT * EXTRA_LEN;
874 }
875 pool = dir_flist->file_pool;
876 } else
877 pool = flist->file_pool;
878
879#if EXTRA_ROUNDING > 0
880 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
881 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
882#endif
883
884 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
885 + linkname_len;
886 bp = pool_alloc(pool, alloc_len, "recv_file_entry");
887
888 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
889 bp += extra_len;
890 file = (struct file_struct *)bp;
891 bp += FILE_STRUCT_LEN;
892
893 memcpy(bp, basename, basename_len);
894
895#ifdef SUPPORT_HARD_LINKS
896 if (xflags & XMIT_HLINKED)
897 file->flags |= FLAG_HLINKED;
898#endif
899 file->modtime = (time_t)modtime;
900 file->len32 = (uint32)file_length;
901#if SIZEOF_INT64 >= 8
902 if (file_length > 0xFFFFFFFFu && S_ISREG(mode)) {
903#if SIZEOF_CAPITAL_OFF_T < 8
904 rprintf(FERROR, "Offset overflow: attempted 64-bit file-length\n");
905 exit_cleanup(RERR_UNSUPPORTED);
906#else
907 file->flags |= FLAG_LENGTH64;
908 OPT_EXTRA(file, 0)->unum = (uint32)(file_length >> 32);
909#endif
910 }
911#endif
912 file->mode = mode;
913 if (preserve_uid)
914 F_OWNER(file) = uid;
915 if (preserve_gid) {
916 F_GROUP(file) = gid;
917 file->flags |= gid_flags;
918 }
919 if (unsort_ndx)
920 F_NDX(file) = flist->used + flist->ndx_start;
921
922 if (basename != thisname) {
923 file->dirname = lastdir;
924 F_DEPTH(file) = lastdir_depth + 1;
925 } else
926 F_DEPTH(file) = 1;
927
928 if (S_ISDIR(mode)) {
929 if (basename_len == 1+1 && *basename == '.') /* +1 for '\0' */
930 F_DEPTH(file)--;
931 if (protocol_version >= 30) {
932 if (!(xflags & XMIT_NO_CONTENT_DIR)) {
933 if (xflags & XMIT_TOP_DIR)
934 file->flags |= FLAG_TOP_DIR;
935 file->flags |= FLAG_CONTENT_DIR;
936 } else if (xflags & XMIT_TOP_DIR)
937 file->flags |= FLAG_IMPLIED_DIR;
938 } else if (xflags & XMIT_TOP_DIR) {
939 in_del_hier = recurse;
940 del_hier_name_len = F_DEPTH(file) == 0 ? 0 : l1 + l2;
941 if (relative_paths && del_hier_name_len > 2
942 && lastname[del_hier_name_len-1] == '.'
943 && lastname[del_hier_name_len-2] == '/')
944 del_hier_name_len -= 2;
945 file->flags |= FLAG_TOP_DIR | FLAG_CONTENT_DIR;
946 } else if (in_del_hier) {
947 if (!relative_paths || !del_hier_name_len
948 || (l1 >= del_hier_name_len
949 && lastname[del_hier_name_len] == '/'))
950 file->flags |= FLAG_CONTENT_DIR;
951 else
952 in_del_hier = 0;
953 }
954 }
955
956 if (preserve_devices && IS_DEVICE(mode)) {
957 uint32 *devp = F_RDEV_P(file);
958 DEV_MAJOR(devp) = major(rdev);
959 DEV_MINOR(devp) = minor(rdev);
960 }
961
962#ifdef SUPPORT_LINKS
963 if (linkname_len) {
964 bp += basename_len;
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_SYMLINK(first), linkname_len);
968 } else {
969 if (munge_symlinks) {
970 strlcpy(bp, SYMLINK_PREFIX, linkname_len);
971 bp += SYMLINK_PREFIX_LEN;
972 linkname_len -= SYMLINK_PREFIX_LEN;
973 }
974#ifdef ICONV_OPTION
975 if (sender_symlink_iconv) {
976 xbuf outbuf, inbuf;
977
978 alloc_len = linkname_len;
979 linkname_len /= 2;
980
981 /* Read the symlink data into the end of our double-sized
982 * buffer and then convert it into the right spot. */
983 INIT_XBUF(inbuf, bp + alloc_len - linkname_len,
984 linkname_len - 1, (size_t)-1);
985 read_sbuf(f, inbuf.buf, inbuf.len);
986 INIT_XBUF(outbuf, bp, 0, alloc_len);
987
988 if (iconvbufs(ic_recv, &inbuf, &outbuf, 0) < 0) {
989 io_error |= IOERR_GENERAL;
990 rprintf(FERROR_XFER,
991 "[%s] cannot convert symlink data for: %s (%s)\n",
992 who_am_i(), full_fname(thisname), strerror(errno));
993 bp = (char*)file->basename;
994 *bp++ = '\0';
995 outbuf.len = 0;
996 }
997 bp[outbuf.len] = '\0';
998 } else
999#endif
1000 read_sbuf(f, bp, linkname_len - 1);
1001 if (sanitize_paths && !munge_symlinks && *bp)
1002 sanitize_path(bp, bp, "", lastdir_depth, SP_DEFAULT);
1003 }
1004 }
1005#endif
1006
1007#ifdef SUPPORT_HARD_LINKS
1008 if (preserve_hard_links && xflags & XMIT_HLINKED) {
1009 if (protocol_version >= 30) {
1010 if (xflags & XMIT_HLINK_FIRST) {
1011 F_HL_GNUM(file) = flist->ndx_start + flist->used;
1012 } else
1013 F_HL_GNUM(file) = first_hlink_ndx;
1014 } else {
1015 static int32 cnt = 0;
1016 struct ht_int64_node *np;
1017 int64 ino;
1018 int32 ndx;
1019 if (protocol_version < 26) {
1020 dev = read_int(f);
1021 ino = read_int(f);
1022 } else {
1023 if (!(xflags & XMIT_SAME_DEV_pre30))
1024 dev = read_longint(f);
1025 ino = read_longint(f);
1026 }
1027 np = idev_find(dev, ino);
1028 ndx = (int32)(long)np->data - 1;
1029 if (ndx < 0) {
1030 ndx = cnt++;
1031 np->data = (void*)(long)cnt;
1032 }
1033 F_HL_GNUM(file) = ndx;
1034 }
1035 }
1036#endif
1037
1038 if (always_checksum && (S_ISREG(mode) || protocol_version < 28)) {
1039 if (S_ISREG(mode))
1040 bp = F_SUM(file);
1041 else {
1042 /* Prior to 28, we get a useless set of nulls. */
1043 bp = tmp_sum;
1044 }
1045 if (first_hlink_ndx >= flist->ndx_start) {
1046 struct file_struct *first = flist->files[first_hlink_ndx - flist->ndx_start];
1047 memcpy(bp, F_SUM(first), checksum_len);
1048 } else
1049 read_buf(f, bp, checksum_len);
1050 }
1051
1052#ifdef SUPPORT_ACLS
1053 if (preserve_acls && !S_ISLNK(mode))
1054 receive_acl(file, f);
1055#endif
1056#ifdef SUPPORT_XATTRS
1057 if (preserve_xattrs)
1058 receive_xattr(file, f );
1059#endif
1060
1061 if (S_ISREG(mode) || S_ISLNK(mode))
1062 stats.total_size += file_length;
1063
1064 return file;
1065}
1066
1067/* Create a file_struct for a named file by reading its stat() information
1068 * and performing extensive checks against global options.
1069 *
1070 * Returns a pointer to the new file struct, or NULL if there was an error
1071 * or this file should be excluded.
1072 *
1073 * Note: Any error (here or in send_file_name) that results in the omission of
1074 * an existent source file from the file list should set
1075 * "io_error |= IOERR_GENERAL" to avoid deletion of the file from the
1076 * destination if --delete is on. */
1077struct file_struct *make_file(const char *fname, struct file_list *flist,
1078 STRUCT_STAT *stp, int flags, int filter_level)
1079{
1080 static char *lastdir;
1081 static int lastdir_len = -1;
1082 struct file_struct *file;
1083 char thisname[MAXPATHLEN];
1084 char linkname[MAXPATHLEN];
1085 int alloc_len, basename_len, linkname_len;
1086 int extra_len = file_extra_cnt * EXTRA_LEN;
1087 const char *basename;
1088 alloc_pool_t *pool;
1089 STRUCT_STAT st;
1090 char *bp;
1091
1092 if (strlcpy(thisname, fname, sizeof thisname) >= sizeof thisname) {
1093 io_error |= IOERR_GENERAL;
1094 rprintf(FERROR_XFER, "skipping overly long name: %s\n", fname);
1095 return NULL;
1096 }
1097 clean_fname(thisname, 0);
1098 if (sanitize_paths)
1099 sanitize_path(thisname, thisname, "", 0, SP_DEFAULT);
1100
1101 if (stp && (S_ISDIR(stp->st_mode) || stp->st_mode == 0)) {
1102 /* This is needed to handle a "symlink/." with a --relative
1103 * dir, or a request to delete a specific file. */
1104 st = *stp;
1105 *linkname = '\0'; /* make IBM code checker happy */
1106 } else if (readlink_stat(thisname, &st, linkname) != 0) {
1107 int save_errno = errno;
1108 /* See if file is excluded before reporting an error. */
1109 if (filter_level != NO_FILTERS
1110 && (is_excluded(thisname, 0, filter_level)
1111 || is_excluded(thisname, 1, filter_level))) {
1112 if (ignore_perishable && save_errno != ENOENT)
1113 non_perishable_cnt++;
1114 return NULL;
1115 }
1116 if (save_errno == ENOENT) {
1117#ifdef SUPPORT_LINKS
1118 /* When our options tell us to follow a symlink that
1119 * points nowhere, tell the user about the symlink
1120 * instead of giving a "vanished" message. We only
1121 * dereference a symlink if one of the --copy*links
1122 * options was specified, so there's no need for the
1123 * extra lstat() if one of these options isn't on. */
1124 if ((copy_links || copy_unsafe_links || copy_dirlinks)
1125 && x_lstat(thisname, &st, NULL) == 0
1126 && S_ISLNK(st.st_mode)) {
1127 io_error |= IOERR_GENERAL;
1128 rprintf(FERROR_XFER, "symlink has no referent: %s\n",
1129 full_fname(thisname));
1130 } else
1131#endif
1132 {
1133 enum logcode c = am_daemon && protocol_version < 28
1134 ? FERROR : FWARNING;
1135 io_error |= IOERR_VANISHED;
1136 rprintf(c, "file has vanished: %s\n",
1137 full_fname(thisname));
1138 }
1139 } else {
1140 io_error |= IOERR_GENERAL;
1141 rsyserr(FERROR_XFER, save_errno, "readlink_stat(%s) failed",
1142 full_fname(thisname));
1143 }
1144 return NULL;
1145 } else if (st.st_mode == 0) {
1146 io_error |= IOERR_GENERAL;
1147 rprintf(FINFO, "skipping file with bogus (zero) st_mode: %s\n",
1148 full_fname(thisname));
1149 return NULL;
1150 }
1151
1152 if (filter_level == NO_FILTERS)
1153 goto skip_filters;
1154
1155 if (S_ISDIR(st.st_mode)) {
1156 if (!xfer_dirs) {
1157 rprintf(FINFO, "skipping directory %s\n", thisname);
1158 return NULL;
1159 }
1160 /* -x only affects dirs because we need to avoid recursing
1161 * into a mount-point directory, not to avoid copying a
1162 * symlinked file if -L (or similar) was specified. */
1163 if (one_file_system && st.st_dev != filesystem_dev
1164 && BITS_SETnUNSET(flags, FLAG_CONTENT_DIR, FLAG_TOP_DIR)) {
1165 if (one_file_system > 1) {
1166 if (verbose > 1) {
1167 rprintf(FINFO,
1168 "[%s] skipping mount-point dir %s\n",
1169 who_am_i(), thisname);
1170 }
1171 return NULL;
1172 }
1173 flags |= FLAG_MOUNT_DIR;
1174 flags &= ~FLAG_CONTENT_DIR;
1175 }
1176 } else
1177 flags &= ~FLAG_CONTENT_DIR;
1178
1179 if (is_excluded(thisname, S_ISDIR(st.st_mode) != 0, filter_level)) {
1180 if (ignore_perishable)
1181 non_perishable_cnt++;
1182 return NULL;
1183 }
1184
1185 if (lp_ignore_nonreadable(module_id)) {
1186#ifdef SUPPORT_LINKS
1187 if (!S_ISLNK(st.st_mode))
1188#endif
1189 if (access(thisname, R_OK) != 0)
1190 return NULL;
1191 }
1192
1193 skip_filters:
1194
1195 /* Only divert a directory in the main transfer. */
1196 if (flist) {
1197 if (flist->prev && S_ISDIR(st.st_mode)
1198 && flags & FLAG_DIVERT_DIRS) {
1199 /* Room for parent/sibling/next-child info. */
1200 extra_len += DIRNODE_EXTRA_CNT * EXTRA_LEN;
1201 if (relative_paths)
1202 extra_len += PTR_EXTRA_CNT * EXTRA_LEN;
1203 pool = dir_flist->file_pool;
1204 } else
1205 pool = flist->file_pool;
1206 } else {
1207#ifdef SUPPORT_ACLS
1208 /* Directories need an extra int32 for the default ACL. */
1209 if (preserve_acls && S_ISDIR(st.st_mode))
1210 extra_len += EXTRA_LEN;
1211#endif
1212 pool = NULL;
1213 }
1214
1215 if (verbose > 2) {
1216 rprintf(FINFO, "[%s] make_file(%s,*,%d)\n",
1217 who_am_i(), thisname, filter_level);
1218 }
1219
1220 if ((basename = strrchr(thisname, '/')) != NULL) {
1221 int len = basename++ - thisname;
1222 if (len != lastdir_len || memcmp(thisname, lastdir, len) != 0) {
1223 lastdir = new_array(char, len + 1);
1224 memcpy(lastdir, thisname, len);
1225 lastdir[len] = '\0';
1226 lastdir_len = len;
1227 }
1228 } else
1229 basename = thisname;
1230 basename_len = strlen(basename) + 1; /* count the '\0' */
1231
1232#ifdef SUPPORT_LINKS
1233 linkname_len = S_ISLNK(st.st_mode) ? strlen(linkname) + 1 : 0;
1234#else
1235 linkname_len = 0;
1236#endif
1237
1238#if SIZEOF_CAPITAL_OFF_T >= 8
1239 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode))
1240 extra_len += EXTRA_LEN;
1241#endif
1242
1243#if EXTRA_ROUNDING > 0
1244 if (extra_len & (EXTRA_ROUNDING * EXTRA_LEN))
1245 extra_len = (extra_len | (EXTRA_ROUNDING * EXTRA_LEN)) + EXTRA_LEN;
1246#endif
1247
1248 alloc_len = FILE_STRUCT_LEN + extra_len + basename_len
1249 + linkname_len;
1250 if (pool)
1251 bp = pool_alloc(pool, alloc_len, "make_file");
1252 else {
1253 if (!(bp = new_array(char, alloc_len)))
1254 out_of_memory("make_file");
1255 }
1256
1257 memset(bp, 0, extra_len + FILE_STRUCT_LEN);
1258 bp += extra_len;
1259 file = (struct file_struct *)bp;
1260 bp += FILE_STRUCT_LEN;
1261
1262 memcpy(bp, basename, basename_len);
1263
1264#ifdef SUPPORT_HARD_LINKS
1265 if (preserve_hard_links && flist && flist->prev) {
1266 if (protocol_version >= 28
1267 ? (!S_ISDIR(st.st_mode) && st.st_nlink > 1)
1268 : S_ISREG(st.st_mode)) {
1269 tmp_dev = (int64)st.st_dev + 1;
1270 tmp_ino = (int64)st.st_ino;
1271 } else
1272 tmp_dev = 0;
1273 }
1274#endif
1275
1276#ifdef HAVE_STRUCT_STAT_ST_RDEV
1277 if (IS_DEVICE(st.st_mode)) {
1278 tmp_rdev = st.st_rdev;
1279 st.st_size = 0;
1280 } else if (IS_SPECIAL(st.st_mode))
1281 st.st_size = 0;
1282#endif
1283
1284 file->flags = flags;
1285 file->modtime = st.st_mtime;
1286 file->len32 = (uint32)st.st_size;
1287#if SIZEOF_CAPITAL_OFF_T >= 8
1288 if (st.st_size > 0xFFFFFFFFu && S_ISREG(st.st_mode)) {
1289 file->flags |= FLAG_LENGTH64;
1290 OPT_EXTRA(file, 0)->unum = (uint32)(st.st_size >> 32);
1291 }
1292#endif
1293 file->mode = st.st_mode;
1294 if (uid_ndx) /* Check uid_ndx instead of preserve_uid for del support */
1295 F_OWNER(file) = st.st_uid;
1296 if (gid_ndx) /* Check gid_ndx instead of preserve_gid for del support */
1297 F_GROUP(file) = st.st_gid;
1298
1299 if (basename != thisname)
1300 file->dirname = lastdir;
1301
1302#ifdef SUPPORT_LINKS
1303 if (linkname_len)
1304 memcpy(bp + basename_len, linkname, linkname_len);
1305#endif
1306
1307 if (always_checksum && am_sender && S_ISREG(st.st_mode))
1308 file_checksum(thisname, tmp_sum, st.st_size);
1309
1310 if (am_sender)
1311 F_PATHNAME(file) = pathname;
1312 else if (!pool)
1313 F_DEPTH(file) = extra_len / EXTRA_LEN;
1314
1315 if (basename_len == 0+1) {
1316 if (!pool)
1317 unmake_file(file);
1318 return NULL;
1319 }
1320
1321 if (unsort_ndx)
1322 F_NDX(file) = dir_count;
1323
1324 return file;
1325}
1326
1327/* Only called for temporary file_struct entries created by make_file(). */
1328void unmake_file(struct file_struct *file)
1329{
1330 free(REQ_EXTRA(file, F_DEPTH(file)));
1331}
1332
1333static struct file_struct *send_file_name(int f, struct file_list *flist,
1334 const char *fname, STRUCT_STAT *stp,
1335 int flags, int filter_level)
1336{
1337 struct file_struct *file;
1338
1339 file = make_file(fname, flist, stp, flags, filter_level);
1340 if (!file)
1341 return NULL;
1342
1343 if (chmod_modes && !S_ISLNK(file->mode) && file->mode)
1344 file->mode = tweak_mode(file->mode, chmod_modes);
1345
1346 if (f >= 0) {
1347 char fbuf[MAXPATHLEN];
1348#ifdef SUPPORT_LINKS
1349 const char *symlink_name;
1350 int symlink_len;
1351#ifdef ICONV_OPTION
1352 char symlink_buf[MAXPATHLEN];
1353#endif
1354#endif
1355#if defined SUPPORT_ACLS || defined SUPPORT_XATTRS
1356 stat_x sx;
1357#endif
1358
1359#ifdef SUPPORT_LINKS
1360 if (preserve_links && S_ISLNK(file->mode)) {
1361 symlink_name = F_SYMLINK(file);
1362 symlink_len = strlen(symlink_name);
1363 if (symlink_len == 0) {
1364 io_error |= IOERR_GENERAL;
1365 f_name(file, fbuf);
1366 rprintf(FERROR_XFER,
1367 "skipping symlink with 0-length value: %s\n",
1368 full_fname(fbuf));
1369 return NULL;
1370 }
1371 } else {
1372 symlink_name = NULL;
1373 symlink_len = 0;
1374 }
1375#endif
1376
1377#ifdef ICONV_OPTION
1378 if (ic_send != (iconv_t)-1) {
1379 xbuf outbuf, inbuf;
1380
1381 INIT_CONST_XBUF(outbuf, fbuf);
1382
1383 if (file->dirname) {
1384 INIT_XBUF_STRLEN(inbuf, (char*)file->dirname);
1385 outbuf.size -= 2; /* Reserve room for '/' & 1 more char. */
1386 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0)
1387 goto convert_error;
1388 outbuf.size += 2;
1389 fbuf[outbuf.len++] = '/';
1390 }
1391
1392 INIT_XBUF_STRLEN(inbuf, (char*)file->basename);
1393 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
1394 convert_error:
1395 io_error |= IOERR_GENERAL;
1396 rprintf(FERROR_XFER,
1397 "[%s] cannot convert filename: %s (%s)\n",
1398 who_am_i(), f_name(file, fbuf), strerror(errno));
1399 return NULL;
1400 }
1401 fbuf[outbuf.len] = '\0';
1402
1403#ifdef SUPPORT_LINKS
1404 if (symlink_len && sender_symlink_iconv) {
1405 INIT_XBUF(inbuf, (char*)symlink_name, symlink_len, (size_t)-1);
1406 INIT_CONST_XBUF(outbuf, symlink_buf);
1407 if (iconvbufs(ic_send, &inbuf, &outbuf, 0) < 0) {
1408 io_error |= IOERR_GENERAL;
1409 f_name(file, fbuf);
1410 rprintf(FERROR_XFER,
1411 "[%s] cannot convert symlink data for: %s (%s)\n",
1412 who_am_i(), full_fname(fbuf), strerror(errno));
1413 return NULL;
1414 }
1415 symlink_buf[outbuf.len] = '\0';
1416
1417 symlink_name = symlink_buf;
1418 symlink_len = outbuf.len;
1419 }
1420#endif
1421 } else
1422#endif
1423 f_name(file, fbuf);
1424
1425#ifdef SUPPORT_ACLS
1426 if (preserve_acls && !S_ISLNK(file->mode)) {
1427 sx.st.st_mode = file->mode;
1428 sx.acc_acl = sx.def_acl = NULL;
1429 if (get_acl(fname, &sx) < 0) {
1430 io_error |= IOERR_GENERAL;
1431 return NULL;
1432 }
1433 }
1434#endif
1435#ifdef SUPPORT_XATTRS
1436 if (preserve_xattrs) {
1437 sx.xattr = NULL;
1438 if (get_xattr(fname, &sx) < 0) {
1439 io_error |= IOERR_GENERAL;
1440 return NULL;
1441 }
1442 }
1443#endif
1444
1445 send_file_entry(f, fbuf, file,
1446#ifdef SUPPORT_LINKS
1447 symlink_name, symlink_len,
1448#endif
1449 flist->used, flist->ndx_start);
1450
1451#ifdef SUPPORT_ACLS
1452 if (preserve_acls && !S_ISLNK(file->mode)) {
1453 send_acl(&sx, f);
1454 free_acl(&sx);
1455 }
1456#endif
1457#ifdef SUPPORT_XATTRS
1458 if (preserve_xattrs) {
1459 F_XATTR(file) = send_xattr(&sx, f);
1460 free_xattr(&sx);
1461 }
1462#endif
1463 }
1464
1465 maybe_emit_filelist_progress(flist->used + flist_count_offset);
1466
1467 flist_expand(flist, 1);
1468 flist->files[flist->used++] = file;
1469
1470 return file;
1471}
1472
1473static void send_if_directory(int f, struct file_list *flist,
1474 struct file_struct *file,
1475 char *fbuf, unsigned int ol,
1476 int flags)
1477{
1478 char is_dot_dir = fbuf[ol-1] == '.' && (ol == 1 || fbuf[ol-2] == '/');
1479
1480 if (S_ISDIR(file->mode)
1481 && !(file->flags & FLAG_MOUNT_DIR) && f_name(file, fbuf)) {
1482 void *save_filters;
1483 unsigned int len = strlen(fbuf);
1484 if (len > 1 && fbuf[len-1] == '/')
1485 fbuf[--len] = '\0';
1486 if (len >= MAXPATHLEN - 1) {
1487 io_error |= IOERR_GENERAL;
1488 rprintf(FERROR_XFER, "skipping long-named directory: %s\n",
1489 full_fname(fbuf));
1490 return;
1491 }
1492 save_filters = push_local_filters(fbuf, len);
1493 send_directory(f, flist, fbuf, len, flags);
1494 pop_local_filters(save_filters);
1495 fbuf[ol] = '\0';
1496 if (is_dot_dir)
1497 fbuf[ol-1] = '.';
1498 }
1499}
1500
1501static int file_compare(const void *file1, const void *file2)
1502{
1503 return f_name_cmp(*(struct file_struct **)file1,
1504 *(struct file_struct **)file2);
1505}
1506
1507/* The guts of a merge-sort algorithm. This was derived from the glibc
1508 * version, but I (Wayne) changed the merge code to do less copying and
1509 * to require only half the amount of temporary memory. */
1510static void fsort_tmp(struct file_struct **fp, size_t num,
1511 struct file_struct **tmp)
1512{
1513 struct file_struct **f1, **f2, **t;
1514 size_t n1, n2;
1515
1516 n1 = num / 2;
1517 n2 = num - n1;
1518 f1 = fp;
1519 f2 = fp + n1;
1520
1521 if (n1 > 1)
1522 fsort_tmp(f1, n1, tmp);
1523 if (n2 > 1)
1524 fsort_tmp(f2, n2, tmp);
1525
1526 while (f_name_cmp(*f1, *f2) <= 0) {
1527 if (!--n1)
1528 return;
1529 f1++;
1530 }
1531
1532 t = tmp;
1533 memcpy(t, f1, n1 * PTR_SIZE);
1534
1535 *f1++ = *f2++, n2--;
1536
1537 while (n1 > 0 && n2 > 0) {
1538 if (f_name_cmp(*t, *f2) <= 0)
1539 *f1++ = *t++, n1--;
1540 else
1541 *f1++ = *f2++, n2--;
1542 }
1543
1544 if (n1 > 0)
1545 memcpy(f1, t, n1 * PTR_SIZE);
1546}
1547
1548/* This file-struct sorting routine makes sure that any identical names in
1549 * the file list stay in the same order as they were in the original list.
1550 * This is particularly vital in inc_recurse mode where we expect a sort
1551 * on the flist to match the exact order of a sort on the dir_flist. */
1552static void fsort(struct file_struct **fp, size_t num)
1553{
1554 if (num <= 1)
1555 return;
1556
1557 if (use_qsort)
1558 qsort(fp, num, PTR_SIZE, file_compare);
1559 else {
1560 struct file_struct **tmp = new_array(struct file_struct *,
1561 (num+1) / 2);
1562 fsort_tmp(fp, num, tmp);
1563 free(tmp);
1564 }
1565}
1566
1567/* We take an entire set of sibling dirs from the sorted flist and link them
1568 * into the tree, setting the appropriate parent/child/sibling pointers. */
1569static void add_dirs_to_tree(int parent_ndx, struct file_list *from_flist,
1570 int dir_cnt)
1571{
1572 int i;
1573 int32 *dp = NULL;
1574 int32 *parent_dp = parent_ndx < 0 ? NULL
1575 : F_DIR_NODE_P(dir_flist->sorted[parent_ndx]);
1576
1577 flist_expand(dir_flist, dir_cnt);
1578 dir_flist->sorted = dir_flist->files;
1579
1580 for (i = 0; dir_cnt; i++) {
1581 struct file_struct *file = from_flist->sorted[i];
1582
1583 if (!S_ISDIR(file->mode))
1584 continue;
1585
1586 dir_flist->files[dir_flist->used++] = file;
1587 dir_cnt--;
1588
1589 if (file->basename[0] == '.' && file->basename[1] == '\0')
1590 continue;
1591
1592 if (dp)
1593 DIR_NEXT_SIBLING(dp) = dir_flist->used - 1;
1594 else if (parent_dp)
1595 DIR_FIRST_CHILD(parent_dp) = dir_flist->used - 1;
1596 else
1597 send_dir_ndx = dir_flist->used - 1;
1598
1599 dp = F_DIR_NODE_P(file);
1600 DIR_PARENT(dp) = parent_ndx;
1601 DIR_FIRST_CHILD(dp) = -1;
1602 }
1603 if (dp)
1604 DIR_NEXT_SIBLING(dp) = -1;
1605}
1606
1607static void interpret_stat_error(const char *fname, int is_dir)
1608{
1609 if (errno == ENOENT) {
1610 io_error |= IOERR_VANISHED;
1611 rprintf(FWARNING, "%s has vanished: %s\n",
1612 is_dir ? "directory" : "file", full_fname(fname));
1613 } else {
1614 io_error |= IOERR_GENERAL;
1615 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
1616 full_fname(fname));
1617 }
1618}
1619
1620/* This function is normally called by the sender, but the receiving side also
1621 * calls it from get_dirlist() with f set to -1 so that we just construct the
1622 * file list in memory without sending it over the wire. Also, get_dirlist()
1623 * might call this with f set to -2, which also indicates that local filter
1624 * rules should be ignored. */
1625static void send_directory(int f, struct file_list *flist, char *fbuf, int len,
1626 int flags)
1627{
1628 struct dirent *di;
1629 unsigned remainder;
1630 char *p;
1631 DIR *d;
1632 int divert_dirs = (flags & FLAG_DIVERT_DIRS) != 0;
1633 int start = flist->used;
1634 int filter_level = f == -2 ? SERVER_FILTERS : ALL_FILTERS;
1635
1636 assert(flist != NULL);
1637
1638 if (!(d = opendir(fbuf))) {
1639 if (errno == ENOENT) {
1640 if (am_sender) /* Can abuse this for vanished error w/ENOENT: */
1641 interpret_stat_error(fbuf, True);
1642 return;
1643 }
1644 io_error |= IOERR_GENERAL;
1645 rsyserr(FERROR_XFER, errno, "opendir %s failed", full_fname(fbuf));
1646 return;
1647 }
1648
1649 p = fbuf + len;
1650 if (len != 1 || *fbuf != '/')
1651 *p++ = '/';
1652 *p = '\0';
1653 remainder = MAXPATHLEN - (p - fbuf);
1654
1655 for (errno = 0, di = readdir(d); di; errno = 0, di = readdir(d)) {
1656 char *dname = d_name(di);
1657 if (dname[0] == '.' && (dname[1] == '\0'
1658 || (dname[1] == '.' && dname[2] == '\0')))
1659 continue;
1660 if (strlcpy(p, dname, remainder) >= remainder) {
1661 io_error |= IOERR_GENERAL;
1662 rprintf(FERROR_XFER,
1663 "cannot send long-named file %s\n",
1664 full_fname(fbuf));
1665 continue;
1666 }
1667 if (dname[0] == '\0') {
1668 io_error |= IOERR_GENERAL;
1669 rprintf(FERROR_XFER,
1670 "cannot send file with empty name in %s\n",
1671 full_fname(fbuf));
1672 continue;
1673 }
1674
1675 send_file_name(f, flist, fbuf, NULL, flags, filter_level);
1676 }
1677
1678 fbuf[len] = '\0';
1679
1680 if (errno) {
1681 io_error |= IOERR_GENERAL;
1682 rsyserr(FERROR_XFER, errno, "readdir(%s)", full_fname(fbuf));
1683 }
1684
1685 closedir(d);
1686
1687 if (f >= 0 && recurse && !divert_dirs) {
1688 int i, end = flist->used - 1;
1689 /* send_if_directory() bumps flist->used, so use "end". */
1690 for (i = start; i <= end; i++)
1691 send_if_directory(f, flist, flist->files[i], fbuf, len, flags);
1692 }
1693}
1694
1695static void send_implied_dirs(int f, struct file_list *flist, char *fname,
1696 char *start, char *limit, int flags, char name_type)
1697{
1698 static char lastpath[MAXPATHLEN] = "";
1699 static int lastpath_len = 0;
1700 static struct file_struct *lastpath_struct = NULL;
1701 struct file_struct *file;
1702 item_list *relname_list;
1703 relnamecache **rnpp;
1704 int len, need_new_dir, depth = 0;
1705 struct filter_list_struct save_filter_list = filter_list;
1706
1707 flags = (flags | FLAG_IMPLIED_DIR) & ~(FLAG_TOP_DIR | FLAG_CONTENT_DIR);
1708 filter_list.head = filter_list.tail = NULL; /* Don't filter implied dirs. */
1709
1710 if (inc_recurse) {
1711 if (lastpath_struct && F_PATHNAME(lastpath_struct) == pathname
1712 && lastpath_len == limit - fname
1713 && strncmp(lastpath, fname, lastpath_len) == 0)
1714 need_new_dir = 0;
1715 else
1716 need_new_dir = 1;
1717 } else {
1718 char *tp = fname, *lp = lastpath;
1719 /* Skip any initial directories in our path that we
1720 * have in common with lastpath. */
1721 assert(start == fname);
1722 for ( ; ; tp++, lp++) {
1723 if (tp == limit) {
1724 if (*lp == '/' || *lp == '\0')
1725 goto done;
1726 break;
1727 }
1728 if (*lp != *tp)
1729 break;
1730 if (*tp == '/') {
1731 start = tp;
1732 depth++;
1733 }
1734 }
1735 need_new_dir = 1;
1736 }
1737
1738 if (need_new_dir) {
1739 int save_copy_links = copy_links;
1740 int save_xfer_dirs = xfer_dirs;
1741 char *slash;
1742
1743 copy_links = xfer_dirs = 1;
1744
1745 *limit = '\0';
1746
1747 for (slash = start; (slash = strchr(slash+1, '/')) != NULL; ) {
1748 *slash = '\0';
1749 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1750 depth++;
1751 if (!inc_recurse && file && S_ISDIR(file->mode))
1752 change_local_filter_dir(fname, strlen(fname), depth);
1753 *slash = '/';
1754 }
1755
1756 file = send_file_name(f, flist, fname, NULL, flags, ALL_FILTERS);
1757 if (inc_recurse) {
1758 if (file && !S_ISDIR(file->mode))
1759 file = NULL;
1760 lastpath_struct = file;
1761 } else if (file && S_ISDIR(file->mode))
1762 change_local_filter_dir(fname, strlen(fname), ++depth);
1763
1764 strlcpy(lastpath, fname, sizeof lastpath);
1765 lastpath_len = limit - fname;
1766
1767 *limit = '/';
1768
1769 copy_links = save_copy_links;
1770 xfer_dirs = save_xfer_dirs;
1771
1772 if (!inc_recurse)
1773 goto done;
1774 }
1775
1776 if (!lastpath_struct)
1777 goto done; /* dir must have vanished */
1778
1779 len = strlen(limit+1);
1780 memcpy(&relname_list, F_DIR_RELNAMES_P(lastpath_struct), sizeof relname_list);
1781 if (!relname_list) {
1782 if (!(relname_list = new0(item_list)))
1783 out_of_memory("send_implied_dirs");
1784 memcpy(F_DIR_RELNAMES_P(lastpath_struct), &relname_list, sizeof relname_list);
1785 }
1786 rnpp = EXPAND_ITEM_LIST(relname_list, relnamecache *, 32);
1787 if (!(*rnpp = (relnamecache*)new_array(char, sizeof (relnamecache) + len)))
1788 out_of_memory("send_implied_dirs");
1789 (*rnpp)->name_type = name_type;
1790 strlcpy((*rnpp)->fname, limit+1, len + 1);
1791
1792done:
1793 filter_list = save_filter_list;
1794}
1795
1796static void send1extra(int f, struct file_struct *file, struct file_list *flist)
1797{
1798 char fbuf[MAXPATHLEN];
1799 item_list *relname_list;
1800 int len, dlen, flags = FLAG_DIVERT_DIRS | FLAG_CONTENT_DIR;
1801 size_t j;
1802
1803 f_name(file, fbuf);
1804 dlen = strlen(fbuf);
1805
1806 if (!change_pathname(file, NULL, 0))
1807 exit_cleanup(RERR_FILESELECT);
1808
1809 change_local_filter_dir(fbuf, dlen, send_dir_depth);
1810
1811 if (file->flags & FLAG_CONTENT_DIR) {
1812 if (one_file_system) {
1813 STRUCT_STAT st;
1814 if (link_stat(fbuf, &st, copy_dirlinks) != 0) {
1815 interpret_stat_error(fbuf, True);
1816 return;
1817 }
1818 filesystem_dev = st.st_dev;
1819 }
1820 send_directory(f, flist, fbuf, dlen, flags);
1821 }
1822
1823 if (!relative_paths)
1824 return;
1825
1826 memcpy(&relname_list, F_DIR_RELNAMES_P(file), sizeof relname_list);
1827 if (!relname_list)
1828 return;
1829
1830 for (j = 0; j < relname_list->count; j++) {
1831 char *slash;
1832 relnamecache *rnp = ((relnamecache**)relname_list->items)[j];
1833 char name_type = rnp->name_type;
1834
1835 fbuf[dlen] = '/';
1836 len = strlcpy(fbuf + dlen + 1, rnp->fname, sizeof fbuf - dlen - 1);
1837 free(rnp);
1838 if (len >= (int)sizeof fbuf)
1839 continue; /* Impossible... */
1840
1841 slash = strchr(fbuf+dlen+1, '/');
1842 if (slash) {
1843 send_implied_dirs(f, flist, fbuf, fbuf+dlen+1, slash, flags, name_type);
1844 continue;
1845 }
1846
1847 if (name_type != NORMAL_NAME) {
1848 STRUCT_STAT st;
1849 if (link_stat(fbuf, &st, 1) != 0) {
1850 interpret_stat_error(fbuf, True);
1851 continue;
1852 }
1853 send_file_name(f, flist, fbuf, &st, FLAG_TOP_DIR | flags, ALL_FILTERS);
1854 } else
1855 send_file_name(f, flist, fbuf, NULL, FLAG_TOP_DIR | flags, ALL_FILTERS);
1856 }
1857
1858 free(relname_list);
1859}
1860
1861void send_extra_file_list(int f, int at_least)
1862{
1863 struct file_list *flist;
1864 int64 start_write;
1865 uint16 prev_flags;
1866 int old_cnt, save_io_error = io_error;
1867
1868 if (flist_eof)
1869 return;
1870
1871 /* Keep sending data until we have the requested number of
1872 * files in the upcoming file-lists. */
1873 old_cnt = cur_flist->used;
1874 for (flist = first_flist; flist != cur_flist; flist = flist->next)
1875 old_cnt += flist->used;
1876 while (file_total - old_cnt < at_least) {
1877 struct file_struct *file = dir_flist->sorted[send_dir_ndx];
1878 int dir_ndx, dstart = dir_count;
1879 const char *pathname = F_PATHNAME(file);
1880 int32 *dp;
1881
1882 flist = flist_new(0, "send_extra_file_list");
1883 start_write = stats.total_written;
1884
1885 if (unsort_ndx)
1886 dir_ndx = F_NDX(file);
1887 else
1888 dir_ndx = send_dir_ndx;
1889 write_ndx(f, NDX_FLIST_OFFSET - dir_ndx);
1890 flist->parent_ndx = dir_ndx;
1891
1892 send1extra(f, file, flist);
1893 prev_flags = file->flags;
1894 dp = F_DIR_NODE_P(file);
1895
1896 /* If there are any duplicate directory names that follow, we
1897 * send all the dirs together in one file-list. The dir_flist
1898 * tree links all the child subdirs onto the last dup dir. */
1899 while ((dir_ndx = DIR_NEXT_SIBLING(dp)) >= 0
1900 && dir_flist->sorted[dir_ndx]->flags & FLAG_DUPLICATE) {
1901 send_dir_ndx = dir_ndx;
1902 file = dir_flist->sorted[dir_ndx];
1903 /* Try to avoid some duplicate scanning of identical dirs. */
1904 if (F_PATHNAME(file) == pathname && prev_flags & FLAG_CONTENT_DIR)
1905 file->flags &= ~FLAG_CONTENT_DIR;
1906 send1extra(f, file, flist);
1907 prev_flags = file->flags;
1908 dp = F_DIR_NODE_P(file);
1909 }
1910
1911 write_byte(f, 0);
1912
1913 if (need_unsorted_flist) {
1914 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
1915 out_of_memory("send_extra_file_list");
1916 memcpy(flist->sorted, flist->files,
1917 flist->used * sizeof (struct file_struct*));
1918 } else
1919 flist->sorted = flist->files;
1920
1921 flist_sort_and_clean(flist, 0);
1922
1923 add_dirs_to_tree(send_dir_ndx, flist, dir_count - dstart);
1924 flist_done_allocating(flist);
1925
1926 file_total += flist->used;
1927 stats.flist_size += stats.total_written - start_write;
1928 stats.num_files += flist->used;
1929 if (verbose > 3)
1930 output_flist(flist);
1931
1932 if (DIR_FIRST_CHILD(dp) >= 0) {
1933 send_dir_ndx = DIR_FIRST_CHILD(dp);
1934 send_dir_depth++;
1935 } else {
1936 while (DIR_NEXT_SIBLING(dp) < 0) {
1937 if ((send_dir_ndx = DIR_PARENT(dp)) < 0) {
1938 write_ndx(f, NDX_FLIST_EOF);
1939 flist_eof = 1;
1940 change_local_filter_dir(NULL, 0, 0);
1941 goto finish;
1942 }
1943 send_dir_depth--;
1944 file = dir_flist->sorted[send_dir_ndx];
1945 dp = F_DIR_NODE_P(file);
1946 }
1947 send_dir_ndx = DIR_NEXT_SIBLING(dp);
1948 }
1949 }
1950
1951 finish:
1952 if (io_error != save_io_error && !ignore_errors)
1953 send_msg_int(MSG_IO_ERROR, io_error);
1954}
1955
1956struct file_list *send_file_list(int f, int argc, char *argv[])
1957{
1958 static const char *lastdir;
1959 static int lastdir_len = -1;
1960 int len, dirlen;
1961 STRUCT_STAT st;
1962 char *p, *dir;
1963 struct file_list *flist;
1964 struct timeval start_tv, end_tv;
1965 int64 start_write;
1966 int use_ff_fd = 0;
1967 int disable_buffering;
1968 int flags = recurse ? FLAG_CONTENT_DIR : 0;
1969 int reading_remotely = filesfrom_host != NULL;
1970 int rl_flags = (reading_remotely ? 0 : RL_DUMP_COMMENTS)
1971#ifdef ICONV_OPTION
1972 | (filesfrom_convert ? RL_CONVERT : 0)
1973#endif
1974 | (eol_nulls || reading_remotely ? RL_EOL_NULLS : 0);
1975 int implied_dot_dir = 0;
1976
1977 rprintf(FLOG, "building file list\n");
1978 if (show_filelist_p())
1979 start_filelist_progress("building file list");
1980 else if (inc_recurse && verbose && !am_server)
1981 rprintf(FCLIENT, "sending incremental file list\n");
1982
1983 start_write = stats.total_written;
1984 gettimeofday(&start_tv, NULL);
1985
1986 if (relative_paths && protocol_version >= 30)
1987 implied_dirs = 1; /* We send flagged implied dirs */
1988
1989#ifdef SUPPORT_HARD_LINKS
1990 if (preserve_hard_links && protocol_version >= 30 && !cur_flist)
1991 init_hard_links();
1992#endif
1993
1994 flist = cur_flist = flist_new(0, "send_file_list");
1995 if (inc_recurse) {
1996 dir_flist = flist_new(FLIST_TEMP, "send_file_list");
1997 flags |= FLAG_DIVERT_DIRS;
1998 } else
1999 dir_flist = cur_flist;
2000
2001 disable_buffering = io_start_buffering_out(f);
2002 if (filesfrom_fd >= 0) {
2003 if (argv[0] && !change_dir(argv[0], CD_NORMAL)) {
2004 rsyserr(FERROR_XFER, errno, "change_dir %s failed",
2005 full_fname(argv[0]));
2006 exit_cleanup(RERR_FILESELECT);
2007 }
2008 use_ff_fd = 1;
2009 }
2010
2011 if (!orig_dir)
2012 orig_dir = strdup(curr_dir);
2013
2014 while (1) {
2015 char fbuf[MAXPATHLEN], *fn, name_type;
2016
2017 if (use_ff_fd) {
2018 if (read_line(filesfrom_fd, fbuf, sizeof fbuf, rl_flags) == 0)
2019 break;
2020 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
2021 } else {
2022 if (argc-- == 0)
2023 break;
2024 strlcpy(fbuf, *argv++, MAXPATHLEN);
2025 if (sanitize_paths)
2026 sanitize_path(fbuf, fbuf, "", 0, SP_KEEP_DOT_DIRS);
2027 }
2028
2029 len = strlen(fbuf);
2030 if (relative_paths) {
2031 /* We clean up fbuf below. */
2032 name_type = NORMAL_NAME;
2033 } else if (!len || fbuf[len - 1] == '/') {
2034 if (len == 2 && fbuf[0] == '.') {
2035 /* Turn "./" into just "." rather than "./." */
2036 fbuf[--len] = '\0';
2037 } else {
2038 if (len + 1 >= MAXPATHLEN)
2039 overflow_exit("send_file_list");
2040 fbuf[len++] = '.';
2041 fbuf[len] = '\0';
2042 }
2043 name_type = DOTDIR_NAME;
2044 } else if (len > 1 && fbuf[len-1] == '.' && fbuf[len-2] == '.'
2045 && (len == 2 || fbuf[len-3] == '/')) {
2046 if (len + 2 >= MAXPATHLEN)
2047 overflow_exit("send_file_list");
2048 fbuf[len++] = '/';
2049 fbuf[len++] = '.';
2050 fbuf[len] = '\0';
2051 name_type = DOTDIR_NAME;
2052 } else if (fbuf[len-1] == '.' && (len == 1 || fbuf[len-2] == '/'))
2053 name_type = DOTDIR_NAME;
2054 else
2055 name_type = NORMAL_NAME;
2056
2057 dir = NULL;
2058
2059 if (!relative_paths) {
2060 p = strrchr(fbuf, '/');
2061 if (p) {
2062 *p = '\0';
2063 if (p == fbuf)
2064 dir = "/";
2065 else
2066 dir = fbuf;
2067 len -= p - fbuf + 1;
2068 fn = p + 1;
2069 } else
2070 fn = fbuf;
2071 } else {
2072 if ((p = strstr(fbuf, "/./")) != NULL) {
2073 *p = '\0';
2074 if (p == fbuf)
2075 dir = "/";
2076 else {
2077 dir = fbuf;
2078 clean_fname(dir, 0);
2079 }
2080 fn = p + 3;
2081 while (*fn == '/')
2082 fn++;
2083 if (!*fn)
2084 *--fn = '\0'; /* ensure room for '.' */
2085 } else
2086 fn = fbuf;
2087 /* A leading ./ can be used in relative mode to affect
2088 * the dest dir without its name being in the path. */
2089 if (*fn == '.' && fn[1] == '/' && !implied_dot_dir) {
2090 send_file_name(f, flist, ".", NULL,
2091 (flags | FLAG_IMPLIED_DIR) & ~FLAG_CONTENT_DIR,
2092 ALL_FILTERS);
2093 implied_dot_dir = 1;
2094 }
2095 len = clean_fname(fn, CFN_KEEP_TRAILING_SLASH
2096 | CFN_DROP_TRAILING_DOT_DIR);
2097 if (len == 1) {
2098 if (fn[0] == '/') {
2099 fn = "/.";
2100 len = 2;
2101 name_type = DOTDIR_NAME;
2102 } else if (fn[0] == '.')
2103 name_type = DOTDIR_NAME;
2104 } else if (fn[len-1] == '/') {
2105 fn[--len] = '\0';
2106 if (len == 1 && *fn == '.')
2107 name_type = DOTDIR_NAME;
2108 else
2109 name_type = SLASH_ENDING_NAME;
2110 }
2111 /* Reject a ".." dir in the active part of the path. */
2112 for (p = fn; (p = strstr(p, "..")) != NULL; p += 2) {
2113 if ((p[2] == '/' || p[2] == '\0')
2114 && (p == fn || p[-1] == '/')) {
2115 rprintf(FERROR,
2116 "found \"..\" dir in relative path: %s\n",
2117 fn);
2118 exit_cleanup(RERR_SYNTAX);
2119 }
2120 }
2121 }
2122
2123 if (!*fn) {
2124 len = 1;
2125 fn = ".";
2126 name_type = DOTDIR_NAME;
2127 }
2128
2129 dirlen = dir ? strlen(dir) : 0;
2130 if (dirlen != lastdir_len || memcmp(lastdir, dir, dirlen) != 0) {
2131 if (!change_pathname(NULL, dir, -dirlen))
2132 continue;
2133 lastdir = pathname;
2134 lastdir_len = pathname_len;
2135 } else if (!change_pathname(NULL, lastdir, lastdir_len))
2136 continue;
2137
2138 if (fn != fbuf)
2139 memmove(fbuf, fn, len + 1);
2140
2141 if (link_stat(fbuf, &st, copy_dirlinks || name_type != NORMAL_NAME) != 0
2142 || (name_type != DOTDIR_NAME && is_daemon_excluded(fbuf, S_ISDIR(st.st_mode)))
2143 || (relative_paths && path_is_daemon_excluded(fbuf, 1))) {
2144 if (errno == ENOENT && delete_missing_args) {
2145 /* Rsync will treat a mode of 0 as deleted. */
2146 memset(&st, 0, sizeof st);
2147 } else {
2148 io_error |= IOERR_GENERAL;
2149 rsyserr(FERROR_XFER, errno, "link_stat %s failed",
2150 full_fname(fbuf));
2151 continue;
2152 }
2153 }
2154
2155 /* A dot-dir should not be excluded! */
2156 if (name_type != DOTDIR_NAME
2157 && is_excluded(fbuf, S_ISDIR(st.st_mode) != 0, ALL_FILTERS))
2158 continue;
2159
2160 if (S_ISDIR(st.st_mode) && !xfer_dirs) {
2161 rprintf(FINFO, "skipping directory %s\n", fbuf);
2162 continue;
2163 }
2164
2165 if (inc_recurse && relative_paths && *fbuf) {
2166 if ((p = strchr(fbuf+1, '/')) != NULL) {
2167 if (p - fbuf == 1 && *fbuf == '.') {
2168 if ((fn = strchr(p+1, '/')) != NULL)
2169 p = fn;
2170 } else
2171 fn = p;
2172 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, name_type);
2173 if (fn == p)
2174 continue;
2175 }
2176 } else if (implied_dirs && (p=strrchr(fbuf,'/')) && p != fbuf) {
2177 /* Send the implied directories at the start of the
2178 * source spec, so we get their permissions right. */
2179 send_implied_dirs(f, flist, fbuf, fbuf, p, flags, 0);
2180 }
2181
2182 if (one_file_system)
2183 filesystem_dev = st.st_dev;
2184
2185 if (recurse || (xfer_dirs && name_type != NORMAL_NAME)) {
2186 struct file_struct *file;
2187 file = send_file_name(f, flist, fbuf, &st,
2188 FLAG_TOP_DIR | FLAG_CONTENT_DIR | flags,
2189 NO_FILTERS);
2190 if (!file)
2191 continue;
2192 if (inc_recurse) {
2193 if (name_type == DOTDIR_NAME) {
2194 if (send_dir_depth < 0) {
2195 send_dir_depth = 0;
2196 change_local_filter_dir(fbuf, len, send_dir_depth);
2197 }
2198 send_directory(f, flist, fbuf, len, flags);
2199 }
2200 } else
2201 send_if_directory(f, flist, file, fbuf, len, flags);
2202 } else
2203 send_file_name(f, flist, fbuf, &st, flags, NO_FILTERS);
2204 }
2205
2206 gettimeofday(&end_tv, NULL);
2207 stats.flist_buildtime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2208 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2209 if (stats.flist_buildtime == 0)
2210 stats.flist_buildtime = 1;
2211 start_tv = end_tv;
2212
2213 write_byte(f, 0); /* Indicate end of file list */
2214
2215#ifdef SUPPORT_HARD_LINKS
2216 if (preserve_hard_links && protocol_version >= 30 && !inc_recurse)
2217 idev_destroy();
2218#endif
2219
2220 if (show_filelist_p())
2221 finish_filelist_progress(flist);
2222
2223 gettimeofday(&end_tv, NULL);
2224 stats.flist_xfertime = (int64)(end_tv.tv_sec - start_tv.tv_sec) * 1000
2225 + (end_tv.tv_usec - start_tv.tv_usec) / 1000;
2226
2227 /* When converting names, both sides keep an unsorted file-list array
2228 * because the names will differ on the sending and receiving sides
2229 * (both sides will use the unsorted index number for each item). */
2230
2231 /* Sort the list without removing any duplicates. This allows the
2232 * receiving side to ask for whatever name it kept. For incremental
2233 * recursion mode, the sender marks duplicate dirs so that it can
2234 * send them together in a single file-list. */
2235 if (need_unsorted_flist) {
2236 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2237 out_of_memory("send_file_list");
2238 memcpy(flist->sorted, flist->files,
2239 flist->used * sizeof (struct file_struct*));
2240 } else
2241 flist->sorted = flist->files;
2242 flist_sort_and_clean(flist, 0);
2243 file_total += flist->used;
2244
2245 if (numeric_ids <= 0 && !inc_recurse)
2246 send_id_list(f);
2247
2248 set_msg_fd_in(-1);
2249
2250 /* send the io_error flag */
2251 if (protocol_version < 30)
2252 write_int(f, ignore_errors ? 0 : io_error);
2253 else if (io_error && !ignore_errors)
2254 send_msg_int(MSG_IO_ERROR, io_error);
2255
2256 if (disable_buffering)
2257 io_end_buffering_out();
2258
2259 stats.flist_size = stats.total_written - start_write;
2260 stats.num_files = flist->used;
2261
2262 if (verbose > 3)
2263 output_flist(flist);
2264
2265 if (verbose > 2)
2266 rprintf(FINFO, "send_file_list done\n");
2267
2268 if (inc_recurse) {
2269 send_dir_depth = 1;
2270 add_dirs_to_tree(-1, flist, dir_count);
2271 if (!file_total || strcmp(flist->sorted[flist->low]->basename, ".") != 0)
2272 flist->parent_ndx = -1;
2273 flist_done_allocating(flist);
2274 if (send_dir_ndx < 0) {
2275 write_ndx(f, NDX_FLIST_EOF);
2276 flist_eof = 1;
2277 }
2278 else if (file_total == 1) {
2279 /* If we're creating incremental file-lists and there
2280 * was just 1 item in the first file-list, send 1 more
2281 * file-list to check if this is a 1-file xfer. */
2282 send_extra_file_list(f, 1);
2283 }
2284 }
2285
2286 return flist;
2287}
2288
2289struct file_list *recv_file_list(int f)
2290{
2291 struct file_list *flist;
2292 int dstart, flags;
2293 int64 start_read;
2294 int save_verbose = verbose;
2295
2296 if (!first_flist)
2297 rprintf(FLOG, "receiving file list\n");
2298 if (show_filelist_p())
2299 start_filelist_progress("receiving file list");
2300 else if (inc_recurse && verbose && !am_server && !first_flist)
2301 rprintf(FCLIENT, "receiving incremental file list\n");
2302
2303 start_read = stats.total_read;
2304
2305#ifdef SUPPORT_HARD_LINKS
2306 if (preserve_hard_links && !first_flist)
2307 init_hard_links();
2308#endif
2309
2310 flist = flist_new(0, "recv_file_list");
2311
2312 if (inc_recurse) {
2313 if (flist->ndx_start == 1)
2314 dir_flist = flist_new(FLIST_TEMP, "recv_file_list");
2315 dstart = dir_flist->used;
2316 } else {
2317 dir_flist = flist;
2318 dstart = 0;
2319 }
2320
2321 if (am_server && verbose > 2)
2322 verbose = 2;
2323 while ((flags = read_byte(f)) != 0) {
2324 struct file_struct *file;
2325
2326 flist_expand(flist, 1);
2327
2328 if (protocol_version >= 28 && (flags & XMIT_EXTENDED_FLAGS))
2329 flags |= read_byte(f) << 8;
2330 file = recv_file_entry(flist, flags, f);
2331
2332 if (inc_recurse && S_ISDIR(file->mode)) {
2333 flist_expand(dir_flist, 1);
2334 dir_flist->files[dir_flist->used++] = file;
2335 }
2336
2337 flist->files[flist->used++] = file;
2338
2339 maybe_emit_filelist_progress(flist->used);
2340
2341 if (verbose > 2) {
2342 char *name = f_name(file, NULL);
2343 rprintf(FINFO, "recv_file_name(%s)\n", NS(name));
2344 }
2345 }
2346 file_total += flist->used;
2347 verbose = save_verbose;
2348
2349 if (verbose > 2)
2350 rprintf(FINFO, "received %d names\n", flist->used);
2351
2352 if (show_filelist_p())
2353 finish_filelist_progress(flist);
2354
2355 if (need_unsorted_flist) {
2356 /* Create an extra array of index pointers that we can sort for
2357 * the generator's use (for wading through the files in sorted
2358 * order and for calling flist_find()). We keep the "files"
2359 * list unsorted for our exchange of index numbers with the
2360 * other side (since their names may not sort the same). */
2361 if (!(flist->sorted = new_array(struct file_struct *, flist->used)))
2362 out_of_memory("recv_file_list");
2363 memcpy(flist->sorted, flist->files,
2364 flist->used * sizeof (struct file_struct*));
2365 if (inc_recurse && dir_flist->used > dstart) {
2366 static int dir_flist_malloced = 0;
2367 if (dir_flist_malloced < dir_flist->malloced) {
2368 dir_flist->sorted = realloc_array(dir_flist->sorted,
2369 struct file_struct *,
2370 dir_flist->malloced);
2371 dir_flist_malloced = dir_flist->malloced;
2372 }
2373 memcpy(dir_flist->sorted + dstart, dir_flist->files + dstart,
2374 (dir_flist->used - dstart) * sizeof (struct file_struct*));
2375 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2376 }
2377 } else {
2378 flist->sorted = flist->files;
2379 if (inc_recurse && dir_flist->used > dstart) {
2380 dir_flist->sorted = dir_flist->files;
2381 fsort(dir_flist->sorted + dstart, dir_flist->used - dstart);
2382 }
2383 }
2384
2385 if (inc_recurse)
2386 flist_done_allocating(flist);
2387 else if (f >= 0)
2388 recv_id_list(f, flist);
2389
2390 flist_sort_and_clean(flist, relative_paths);
2391
2392 if (protocol_version < 30) {
2393 /* Recv the io_error flag */
2394 if (ignore_errors)
2395 read_int(f);
2396 else
2397 io_error |= read_int(f);
2398 } else if (inc_recurse && flist->ndx_start == 1) {
2399 if (!file_total || strcmp(flist->sorted[flist->low]->basename, ".") != 0)
2400 flist->parent_ndx = -1;
2401 }
2402
2403 if (verbose > 3)
2404 output_flist(flist);
2405
2406 if (verbose > 2)
2407 rprintf(FINFO, "recv_file_list done\n");
2408
2409 stats.flist_size += stats.total_read - start_read;
2410 stats.num_files += flist->used;
2411
2412 return flist;
2413}
2414
2415/* This is only used once by the receiver if the very first file-list
2416 * has exactly one item in it. */
2417void recv_additional_file_list(int f)
2418{
2419 struct file_list *flist;
2420 int ndx = read_ndx(f);
2421 if (ndx == NDX_FLIST_EOF) {
2422 flist_eof = 1;
2423 change_local_filter_dir(NULL, 0, 0);
2424 } else {
2425 ndx = NDX_FLIST_OFFSET - ndx;
2426 if (ndx < 0 || ndx >= dir_flist->used) {
2427 ndx = NDX_FLIST_OFFSET - ndx;
2428 rprintf(FERROR,
2429 "[%s] Invalid dir index: %d (%d - %d)\n",
2430 who_am_i(), ndx, NDX_FLIST_OFFSET,
2431 NDX_FLIST_OFFSET - dir_flist->used + 1);
2432 exit_cleanup(RERR_PROTOCOL);
2433 }
2434 if (verbose > 3) {
2435 rprintf(FINFO, "[%s] receiving flist for dir %d\n",
2436 who_am_i(), ndx);
2437 }
2438 flist = recv_file_list(f);
2439 flist->parent_ndx = ndx;
2440 }
2441}
2442
2443/* Search for an identically-named item in the file list. Note that the
2444 * items must agree in their directory-ness, or no match is returned. */
2445int flist_find(struct file_list *flist, struct file_struct *f)
2446{
2447 int low = flist->low, high = flist->high;
2448 int diff, mid, mid_up;
2449
2450 while (low <= high) {
2451 mid = (low + high) / 2;
2452 if (F_IS_ACTIVE(flist->sorted[mid]))
2453 mid_up = mid;
2454 else {
2455 /* Scan for the next non-empty entry using the cached
2456 * distance values. If the value isn't fully up-to-
2457 * date, update it. */
2458 mid_up = mid + F_DEPTH(flist->sorted[mid]);
2459 if (!F_IS_ACTIVE(flist->sorted[mid_up])) {
2460 do {
2461 mid_up += F_DEPTH(flist->sorted[mid_up]);
2462 } while (!F_IS_ACTIVE(flist->sorted[mid_up]));
2463 F_DEPTH(flist->sorted[mid]) = mid_up - mid;
2464 }
2465 if (mid_up > high) {
2466 /* If there's nothing left above us, set high to
2467 * a non-empty entry below us and continue. */
2468 high = mid - (int)flist->sorted[mid]->len32;
2469 if (!F_IS_ACTIVE(flist->sorted[high])) {
2470 do {
2471 high -= (int)flist->sorted[high]->len32;
2472 } while (!F_IS_ACTIVE(flist->sorted[high]));
2473 flist->sorted[mid]->len32 = mid - high;
2474 }
2475 continue;
2476 }
2477 }
2478 diff = f_name_cmp(flist->sorted[mid_up], f);
2479 if (diff == 0) {
2480 if (protocol_version < 29
2481 && S_ISDIR(flist->sorted[mid_up]->mode)
2482 != S_ISDIR(f->mode))
2483 return -1;
2484 return mid_up;
2485 }
2486 if (diff < 0)
2487 low = mid_up + 1;
2488 else
2489 high = mid - 1;
2490 }
2491 return -1;
2492}
2493
2494/* Search for an identically-named item in the file list. Differs from
2495 * flist_find in that an item that agrees with "f" in directory-ness is
2496 * preferred but one that does not is still found. */
2497int flist_find_ignore_dirness(struct file_list *flist, struct file_struct *f)
2498{
2499 mode_t save_mode;
2500 int ndx;
2501
2502 /* First look for an item that agrees in directory-ness. */
2503 ndx = flist_find(flist, f);
2504 if (ndx >= 0)
2505 return ndx;
2506
2507 /* Temporarily flip f->mode to look for an item of opposite
2508 * directory-ness. */
2509 save_mode = f->mode;
2510 f->mode = S_ISDIR(f->mode) ? S_IFREG : S_IFDIR;
2511 ndx = flist_find(flist, f);
2512 f->mode = save_mode;
2513 return ndx;
2514}
2515
2516/*
2517 * Free up any resources a file_struct has allocated
2518 * and clear the file.
2519 */
2520void clear_file(struct file_struct *file)
2521{
2522 /* The +1 zeros out the first char of the basename. */
2523 memset(file, 0, FILE_STRUCT_LEN + 1);
2524 /* In an empty entry, F_DEPTH() is an offset to the next non-empty
2525 * entry. Likewise for len32 in the opposite direction. We assume
2526 * that we're alone for now since flist_find() will adjust the counts
2527 * it runs into that aren't up-to-date. */
2528 file->len32 = F_DEPTH(file) = 1;
2529}
2530
2531/* Allocate a new file list. */
2532struct file_list *flist_new(int flags, char *msg)
2533{
2534 struct file_list *flist;
2535
2536 if (!(flist = new0(struct file_list)))
2537 out_of_memory(msg);
2538
2539 if (flags & FLIST_TEMP) {
2540 if (!(flist->file_pool = pool_create(SMALL_EXTENT, 0,
2541 out_of_memory, POOL_INTERN)))
2542 out_of_memory(msg);
2543 } else {
2544 /* This is a doubly linked list with prev looping back to
2545 * the end of the list, but the last next pointer is NULL. */
2546 if (!first_flist) {
2547 flist->file_pool = pool_create(NORMAL_EXTENT, 0,
2548 out_of_memory, POOL_INTERN);
2549 if (!flist->file_pool)
2550 out_of_memory(msg);
2551
2552 flist->ndx_start = flist->flist_num = inc_recurse ? 1 : 0;
2553
2554 first_flist = cur_flist = flist->prev = flist;
2555 } else {
2556 struct file_list *prev = first_flist->prev;
2557
2558 flist->file_pool = first_flist->file_pool;
2559
2560 flist->ndx_start = prev->ndx_start + prev->used + 1;
2561 flist->flist_num = prev->flist_num + 1;
2562
2563 flist->prev = prev;
2564 prev->next = first_flist->prev = flist;
2565 }
2566 flist->pool_boundary = pool_boundary(flist->file_pool, 0);
2567 flist_cnt++;
2568 }
2569
2570 return flist;
2571}
2572
2573/* Free up all elements in a flist. */
2574void flist_free(struct file_list *flist)
2575{
2576 if (!flist->prev) {
2577 /* Was FLIST_TEMP dir-list. */
2578 } else if (flist == flist->prev) {
2579 first_flist = cur_flist = NULL;
2580 file_total = 0;
2581 flist_cnt = 0;
2582 } else {
2583 if (flist == cur_flist)
2584 cur_flist = flist->next;
2585 if (flist == first_flist)
2586 first_flist = first_flist->next;
2587 else {
2588 flist->prev->next = flist->next;
2589 if (!flist->next)
2590 flist->next = first_flist;
2591 }
2592 flist->next->prev = flist->prev;
2593 file_total -= flist->used;
2594 flist_cnt--;
2595 }
2596
2597 if (!flist->prev || !flist_cnt)
2598 pool_destroy(flist->file_pool);
2599 else
2600 pool_free_old(flist->file_pool, flist->pool_boundary);
2601
2602 if (flist->sorted && flist->sorted != flist->files)
2603 free(flist->sorted);
2604 free(flist->files);
2605 free(flist);
2606}
2607
2608/* This routine ensures we don't have any duplicate names in our file list.
2609 * duplicate names can cause corruption because of the pipelining. */
2610static void flist_sort_and_clean(struct file_list *flist, int strip_root)
2611{
2612 char fbuf[MAXPATHLEN];
2613 int i, prev_i;
2614
2615 if (!flist)
2616 return;
2617 if (flist->used == 0) {
2618 flist->high = -1;
2619 flist->low = 0;
2620 return;
2621 }
2622
2623 fsort(flist->sorted, flist->used);
2624
2625 if (!am_sender || inc_recurse) {
2626 for (i = prev_i = 0; i < flist->used; i++) {
2627 if (F_IS_ACTIVE(flist->sorted[i])) {
2628 prev_i = i;
2629 break;
2630 }
2631 }
2632 flist->low = prev_i;
2633 } else {
2634 i = prev_i = flist->used - 1;
2635 flist->low = 0;
2636 }
2637
2638 while (++i < flist->used) {
2639 int j;
2640 struct file_struct *file = flist->sorted[i];
2641
2642 if (!F_IS_ACTIVE(file))
2643 continue;
2644 if (f_name_cmp(file, flist->sorted[prev_i]) == 0)
2645 j = prev_i;
2646 else if (protocol_version >= 29 && S_ISDIR(file->mode)) {
2647 int save_mode = file->mode;
2648 /* Make sure that this directory doesn't duplicate a
2649 * non-directory earlier in the list. */
2650 flist->high = prev_i;
2651 file->mode = S_IFREG;
2652 j = flist_find(flist, file);
2653 file->mode = save_mode;
2654 } else
2655 j = -1;
2656 if (j >= 0) {
2657 int keep, drop;
2658 /* If one is a dir and the other is not, we want to
2659 * keep the dir because it might have contents in the
2660 * list. Otherwise keep the first one. */
2661 if (S_ISDIR(file->mode)) {
2662 struct file_struct *fp = flist->sorted[j];
2663 if (!S_ISDIR(fp->mode))
2664 keep = i, drop = j;
2665 else {
2666 if (am_sender)
2667 file->flags |= FLAG_DUPLICATE;
2668 else { /* Make sure we merge our vital flags. */
2669 fp->flags |= file->flags & (FLAG_TOP_DIR|FLAG_CONTENT_DIR);
2670 fp->flags &= file->flags | ~FLAG_IMPLIED_DIR;
2671 }
2672 keep = j, drop = i;
2673 }
2674 } else
2675 keep = j, drop = i;
2676
2677 if (!am_sender) {
2678 if (verbose > 1) {
2679 rprintf(FINFO,
2680 "removing duplicate name %s from file list (%d)\n",
2681 f_name(file, fbuf), drop + flist->ndx_start);
2682 }
2683 clear_file(flist->sorted[drop]);
2684 }
2685
2686 if (keep == i) {
2687 if (flist->low == drop) {
2688 for (j = drop + 1;
2689 j < i && !F_IS_ACTIVE(flist->sorted[j]);
2690 j++) {}
2691 flist->low = j;
2692 }
2693 prev_i = i;
2694 }
2695 } else
2696 prev_i = i;
2697 }
2698 flist->high = prev_i;
2699
2700 if (strip_root) {
2701 /* We need to strip off the leading slashes for relative
2702 * paths, but this must be done _after_ the sorting phase. */
2703 for (i = flist->low; i <= flist->high; i++) {
2704 struct file_struct *file = flist->sorted[i];
2705
2706 if (!file->dirname)
2707 continue;
2708 while (*file->dirname == '/')
2709 file->dirname++;
2710 if (!*file->dirname)
2711 file->dirname = NULL;
2712 }
2713 }
2714
2715 if (prune_empty_dirs && !am_sender) {
2716 int j, prev_depth = 0;
2717
2718 prev_i = 0; /* It's OK that this isn't really true. */
2719
2720 for (i = flist->low; i <= flist->high; i++) {
2721 struct file_struct *fp, *file = flist->sorted[i];
2722
2723 /* This temporarily abuses the F_DEPTH() value for a
2724 * directory that is in a chain that might get pruned.
2725 * We restore the old value if it gets a reprieve. */
2726 if (S_ISDIR(file->mode) && F_DEPTH(file)) {
2727 /* Dump empty dirs when coming back down. */
2728 for (j = prev_depth; j >= F_DEPTH(file); j--) {
2729 fp = flist->sorted[prev_i];
2730 if (F_DEPTH(fp) >= 0)
2731 break;
2732 prev_i = -F_DEPTH(fp)-1;
2733 clear_file(fp);
2734 }
2735 prev_depth = F_DEPTH(file);
2736 if (is_excluded(f_name(file, fbuf), 1,
2737 ALL_FILTERS)) {
2738 /* Keep dirs through this dir. */
2739 for (j = prev_depth-1; ; j--) {
2740 fp = flist->sorted[prev_i];
2741 if (F_DEPTH(fp) >= 0)
2742 break;
2743 prev_i = -F_DEPTH(fp)-1;
2744 F_DEPTH(fp) = j;
2745 }
2746 } else
2747 F_DEPTH(file) = -prev_i-1;
2748 prev_i = i;
2749 } else {
2750 /* Keep dirs through this non-dir. */
2751 for (j = prev_depth; ; j--) {
2752 fp = flist->sorted[prev_i];
2753 if (F_DEPTH(fp) >= 0)
2754 break;
2755 prev_i = -F_DEPTH(fp)-1;
2756 F_DEPTH(fp) = j;
2757 }
2758 }
2759 }
2760 /* Dump all remaining empty dirs. */
2761 while (1) {
2762 struct file_struct *fp = flist->sorted[prev_i];
2763 if (F_DEPTH(fp) >= 0)
2764 break;
2765 prev_i = -F_DEPTH(fp)-1;
2766 clear_file(fp);
2767 }
2768
2769 for (i = flist->low; i <= flist->high; i++) {
2770 if (F_IS_ACTIVE(flist->sorted[i]))
2771 break;
2772 }
2773 flist->low = i;
2774 for (i = flist->high; i >= flist->low; i--) {
2775 if (F_IS_ACTIVE(flist->sorted[i]))
2776 break;
2777 }
2778 flist->high = i;
2779 }
2780}
2781
2782static void output_flist(struct file_list *flist)
2783{
2784 char uidbuf[16], gidbuf[16], depthbuf[16];
2785 struct file_struct *file;
2786 const char *root, *dir, *slash, *name, *trail;
2787 const char *who = who_am_i();
2788 int i;
2789
2790 rprintf(FINFO, "[%s] flist start=%d, used=%d, low=%d, high=%d\n",
2791 who, flist->ndx_start, flist->used, flist->low, flist->high);
2792 for (i = 0; i < flist->used; i++) {
2793 file = flist->files[i];
2794 if ((am_root || am_sender) && uid_ndx) {
2795 snprintf(uidbuf, sizeof uidbuf, " uid=%u",
2796 F_OWNER(file));
2797 } else
2798 *uidbuf = '\0';
2799 if (gid_ndx) {
2800 static char parens[] = "(\0)\0\0\0";
2801 char *pp = parens + (file->flags & FLAG_SKIP_GROUP ? 0 : 3);
2802 snprintf(gidbuf, sizeof gidbuf, " gid=%s%u%s",
2803 pp, F_GROUP(file), pp + 2);
2804 } else
2805 *gidbuf = '\0';
2806 if (!am_sender)
2807 snprintf(depthbuf, sizeof depthbuf, "%d", F_DEPTH(file));
2808 if (F_IS_ACTIVE(file)) {
2809 root = am_sender ? NS(F_PATHNAME(file)) : depthbuf;
2810 if ((dir = file->dirname) == NULL)
2811 dir = slash = "";
2812 else
2813 slash = "/";
2814 name = file->basename;
2815 trail = S_ISDIR(file->mode) ? "/" : "";
2816 } else
2817 root = dir = slash = name = trail = "";
2818 rprintf(FINFO,
2819 "[%s] i=%d %s %s%s%s%s mode=0%o len=%.0f%s%s flags=%x\n",
2820 who, i + flist->ndx_start,
2821 root, dir, slash, name, trail,
2822 (int)file->mode, (double)F_LENGTH(file),
2823 uidbuf, gidbuf, file->flags);
2824 }
2825}
2826
2827enum fnc_state { s_DIR, s_SLASH, s_BASE, s_TRAILING };
2828enum fnc_type { t_PATH, t_ITEM };
2829
2830static int found_prefix;
2831
2832/* Compare the names of two file_struct entities, similar to how strcmp()
2833 * would do if it were operating on the joined strings.
2834 *
2835 * Some differences beginning with protocol_version 29: (1) directory names
2836 * are compared with an assumed trailing slash so that they compare in a
2837 * way that would cause them to sort immediately prior to any content they
2838 * may have; (2) a directory of any name compares after a non-directory of
2839 * any name at the same depth; (3) a directory with name "." compares prior
2840 * to anything else. These changes mean that a directory and a non-dir
2841 * with the same name will not compare as equal (protocol_version >= 29).
2842 *
2843 * The dirname component can be an empty string, but the basename component
2844 * cannot (and never is in the current codebase). The basename component
2845 * may be NULL (for a removed item), in which case it is considered to be
2846 * after any existing item. */
2847int f_name_cmp(const struct file_struct *f1, const struct file_struct *f2)
2848{
2849 int dif;
2850 const uchar *c1, *c2;
2851 enum fnc_state state1, state2;
2852 enum fnc_type type1, type2;
2853 enum fnc_type t_path = protocol_version >= 29 ? t_PATH : t_ITEM;
2854
2855 if (!f1 || !F_IS_ACTIVE(f1)) {
2856 if (!f2 || !F_IS_ACTIVE(f2))
2857 return 0;
2858 return -1;
2859 }
2860 if (!f2 || !F_IS_ACTIVE(f2))
2861 return 1;
2862
2863 c1 = (uchar*)f1->dirname;
2864 c2 = (uchar*)f2->dirname;
2865 if (c1 == c2)
2866 c1 = c2 = NULL;
2867 if (!c1) {
2868 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2869 c1 = (const uchar*)f1->basename;
2870 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2871 type1 = t_ITEM;
2872 state1 = s_TRAILING;
2873 c1 = (uchar*)"";
2874 } else
2875 state1 = s_BASE;
2876 } else {
2877 type1 = t_path;
2878 state1 = s_DIR;
2879 }
2880 if (!c2) {
2881 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2882 c2 = (const uchar*)f2->basename;
2883 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2884 type2 = t_ITEM;
2885 state2 = s_TRAILING;
2886 c2 = (uchar*)"";
2887 } else
2888 state2 = s_BASE;
2889 } else {
2890 type2 = t_path;
2891 state2 = s_DIR;
2892 }
2893
2894 if (type1 != type2)
2895 return type1 == t_PATH ? 1 : -1;
2896
2897 do {
2898 if (!*c1) {
2899 switch (state1) {
2900 case s_DIR:
2901 state1 = s_SLASH;
2902 c1 = (uchar*)"/";
2903 break;
2904 case s_SLASH:
2905 type1 = S_ISDIR(f1->mode) ? t_path : t_ITEM;
2906 c1 = (const uchar*)f1->basename;
2907 if (type1 == t_PATH && *c1 == '.' && !c1[1]) {
2908 type1 = t_ITEM;
2909 state1 = s_TRAILING;
2910 c1 = (uchar*)"";
2911 } else
2912 state1 = s_BASE;
2913 break;
2914 case s_BASE:
2915 state1 = s_TRAILING;
2916 if (type1 == t_PATH) {
2917 c1 = (uchar*)"/";
2918 break;
2919 }
2920 /* FALL THROUGH */
2921 case s_TRAILING:
2922 type1 = t_ITEM;
2923 break;
2924 }
2925 if (*c2 && type1 != type2)
2926 return type1 == t_PATH ? 1 : -1;
2927 }
2928 if (!*c2) {
2929 switch (state2) {
2930 case s_DIR:
2931 state2 = s_SLASH;
2932 c2 = (uchar*)"/";
2933 break;
2934 case s_SLASH:
2935 type2 = S_ISDIR(f2->mode) ? t_path : t_ITEM;
2936 c2 = (const uchar*)f2->basename;
2937 if (type2 == t_PATH && *c2 == '.' && !c2[1]) {
2938 type2 = t_ITEM;
2939 state2 = s_TRAILING;
2940 c2 = (uchar*)"";
2941 } else
2942 state2 = s_BASE;
2943 break;
2944 case s_BASE:
2945 state2 = s_TRAILING;
2946 if (type2 == t_PATH) {
2947 c2 = (uchar*)"/";
2948 break;
2949 }
2950 /* FALL THROUGH */
2951 case s_TRAILING:
2952 found_prefix = 1;
2953 if (!*c1)
2954 return 0;
2955 type2 = t_ITEM;
2956 break;
2957 }
2958 if (type1 != type2)
2959 return type1 == t_PATH ? 1 : -1;
2960 }
2961 } while ((dif = (int)*c1++ - (int)*c2++) == 0);
2962
2963 return dif;
2964}
2965
2966/* Returns 1 if f1's filename has all of f2's filename as a prefix. This does
2967 * not match if f2's basename is not an exact match of a path element in f1.
2968 * E.g. /path/foo is not a prefix of /path/foobar/baz, but /path/foobar is. */
2969int f_name_has_prefix(const struct file_struct *f1, const struct file_struct *f2)
2970{
2971 found_prefix = 0;
2972 f_name_cmp(f1, f2);
2973 return found_prefix;
2974}
2975
2976char *f_name_buf(void)
2977{
2978 static char names[5][MAXPATHLEN];
2979 static unsigned int n;
2980
2981 n = (n + 1) % (sizeof names / sizeof names[0]);
2982
2983 return names[n];
2984}
2985
2986/* Return a copy of the full filename of a flist entry, using the indicated
2987 * buffer or one of 5 static buffers if fbuf is NULL. No size-checking is
2988 * done because we checked the size when creating the file_struct entry.
2989 */
2990char *f_name(const struct file_struct *f, char *fbuf)
2991{
2992 if (!f || !F_IS_ACTIVE(f))
2993 return NULL;
2994
2995 if (!fbuf)
2996 fbuf = f_name_buf();
2997
2998 if (f->dirname) {
2999 int len = strlen(f->dirname);
3000 memcpy(fbuf, f->dirname, len);
3001 fbuf[len] = '/';
3002 strlcpy(fbuf + len + 1, f->basename, MAXPATHLEN - (len + 1));
3003 } else
3004 strlcpy(fbuf, f->basename, MAXPATHLEN);
3005
3006 return fbuf;
3007}
3008
3009/* Do a non-recursive scan of the named directory, possibly ignoring all
3010 * exclude rules except for the daemon's. If "dlen" is >=0, it is the length
3011 * of the dirname string, and also indicates that "dirname" is a MAXPATHLEN
3012 * buffer (the functions we call will append names onto the end, but the old
3013 * dir value will be restored on exit). */
3014struct file_list *get_dirlist(char *dirname, int dlen, int ignore_filter_rules)
3015{
3016 struct file_list *dirlist;
3017 char dirbuf[MAXPATHLEN];
3018 int save_recurse = recurse;
3019 int save_xfer_dirs = xfer_dirs;
3020 int save_prune_empty_dirs = prune_empty_dirs;
3021
3022 if (dlen < 0) {
3023 dlen = strlcpy(dirbuf, dirname, MAXPATHLEN);
3024 if (dlen >= MAXPATHLEN)
3025 return NULL;
3026 dirname = dirbuf;
3027 }
3028
3029 dirlist = flist_new(FLIST_TEMP, "get_dirlist");
3030
3031 recurse = 0;
3032 xfer_dirs = 1;
3033 send_directory(ignore_filter_rules ? -2 : -1, dirlist, dirname, dlen, FLAG_CONTENT_DIR);
3034 xfer_dirs = save_xfer_dirs;
3035 recurse = save_recurse;
3036 if (do_progress)
3037 flist_count_offset += dirlist->used;
3038
3039 prune_empty_dirs = 0;
3040 dirlist->sorted = dirlist->files;
3041 flist_sort_and_clean(dirlist, 0);
3042 prune_empty_dirs = save_prune_empty_dirs;
3043
3044 if (verbose > 3)
3045 output_flist(dirlist);
3046
3047 return dirlist;
3048}