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