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