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