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