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