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