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