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