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