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