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